iweb visitor

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
members:shchakra [2021/09/27 11:38]
shchakra [Short biography]
members:shchakra [2021/09/27 11:45]
shchakra [Short biography]
Line 19: Line 19:
  
 ==== Short biography ==== ==== Short biography ====
-[[https://​sites.google.com/​view/​shchakra|Shantanav Chakraborty]] was an FNRS postdoctoral researcher ​(October 2019 - May 2021) at [[http://​quic.ulb.ac.be/​|QuIC]],​ hosted by [[http://​quic.ulb.ac.be/​members/​jroland|Jérémie Roland]]. He is currently an Assistant Professor at the [[https://​www.iiit.ac.in/​|International Institute of Information Technology, Hyderabad]] where he is affiliated with the [[https://​cqst.iiit.ac.in/​|Centre for Quantum Science and Technology (CQST)]]. His main areas of research interest are quantum computation,​ quantum algorithms and quantum walks.+[[https://​sites.google.com/​view/​shchakra|Shantanav Chakraborty]] was an FNRS postdoctoral researcher at [[http://​quic.ulb.ac.be/​|QuIC]],​ hosted by [[http://​quic.ulb.ac.be/​members/​jroland|Jérémie Roland]]. He is currently an Assistant Professor at the [[https://​www.iiit.ac.in/​|International Institute of Information Technology, Hyderabad]] where he is affiliated with the [[https://​cqst.iiit.ac.in/​|Centre for Quantum Science and Technology (CQST)]]. His main areas of research interest are quantum computation,​ quantum algorithms and quantum walks.
 ==== Publications and pre-prints ====  ==== Publications and pre-prints ==== 
  
Line 27: Line 27:
   - S. Chakraborty,​ L. Novo, J. Roland, //Finding a marked node on any graph via continuous-time quantum walks//, [[https://​journals.aps.org/​pra/​abstract/​10.1103/​PhysRevA.102.022227|Physical Review A 102, 022227]] (2020). [[https://​arxiv.org/​abs/​1807.05957|arXiv]]   - S. Chakraborty,​ L. Novo, J. Roland, //Finding a marked node on any graph via continuous-time quantum walks//, [[https://​journals.aps.org/​pra/​abstract/​10.1103/​PhysRevA.102.022227|Physical Review A 102, 022227]] (2020). [[https://​arxiv.org/​abs/​1807.05957|arXiv]]
   - S. Chakraborty,​ K. Luh, J. Roland, //Analog quantum algorithms for the mixing of Markov chains//, [[https://​journals.aps.org/​pra/​abstract/​10.1103/​PhysRevA.102.022423|Physical Review A 102, 022423]] (2020). [[https://​arxiv.org/​abs/​1904.11895|arXiv]]   - S. Chakraborty,​ K. Luh, J. Roland, //Analog quantum algorithms for the mixing of Markov chains//, [[https://​journals.aps.org/​pra/​abstract/​10.1103/​PhysRevA.102.022423|Physical Review A 102, 022423]] (2020). [[https://​arxiv.org/​abs/​1904.11895|arXiv]]
-  - Y. Atia, S. Chakraborty,​ //Improved Upper bounds for the hitting times of quantum walks//, [[http://​arxiv.org/​abs/​2005.04062|arXiv:​2005.04062]] (2020). 
   - S. Chakraborty,​ K. Luh, J. Roland, //How fast do quantum walks mix?//, [[https://​journals.aps.org/​prl/​abstract/​10.1103/​PhysRevLett.124.050501|Physical Review Letters 124, 050501]] (2020). [[https://​arxiv.org/​abs/​2001.06305|arXiv]].   - S. Chakraborty,​ K. Luh, J. Roland, //How fast do quantum walks mix?//, [[https://​journals.aps.org/​prl/​abstract/​10.1103/​PhysRevLett.124.050501|Physical Review Letters 124, 050501]] (2020). [[https://​arxiv.org/​abs/​2001.06305|arXiv]].
   - S. Chakraborty,​ A. Gilyén, S. Jeffery, //The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation//,​ [[http://​drops.dagstuhl.de/​opus/​frontdoor.php?​source_opus=10609|Proceedings of the  46th International Colloquium of Automata, Languages and Programming (ICALP 2019)]] (2019). [[https://​arxiv.org/​abs/​1804.01973|arXiv]] ​   - S. Chakraborty,​ A. Gilyén, S. Jeffery, //The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation//,​ [[http://​drops.dagstuhl.de/​opus/​frontdoor.php?​source_opus=10609|Proceedings of the  46th International Colloquium of Automata, Languages and Programming (ICALP 2019)]] (2019). [[https://​arxiv.org/​abs/​1804.01973|arXiv]] ​