Differences

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

--- members:shchakra [2019/07/19 22:58]
shchakra [Publications and pre-prints]
+++ members:shchakra [2021/09/27 16:36]
shchakra [Publications and pre-prints]
@@ Line 3: / Line 3: @@
 {| class="portrait"
 |-
-| style="width:159px;" rowspan="4" | <box w=102px border left>{{:members:nophoto100.jpg?100nolink&150}}</box>
+| style="width:159px;" rowspan="4" | <box w=102px border left>{{:members:shan-photo.jpg?100nolink&150}}</box>
 ! style="width:50px;"| Email:
 | style="width:541px;"| shchakra (at) ulb.ac.be
@@ Line 19: / Line 19: @@
 ==== Short biography ====
-Shantanav Chakraborty has been a postdoctoral researcher at [[http://quic.ulb.ac.be/|QuIC]] since January 2018 working on quantum algorithms with [[http://quic.ulb.ac.be/members/jroland|Jérémie Roland]]. He received his PhD in December 2017 from the [[https://www.ulisboa.pt/|University of Lisbon]], where he was affiliated to the [[http://www.phys-info.org/|Physics of Information and Quantum Technologies Group]], supervised by [[http://www.phys-info.org/yasser-omar.html|Yasser Omar]]. During his PhD, he was a visiting researcher at [[http://www.qusoft.org/|QuSoft]], [[https://www.cwi.nl/|CWI Amsterdam]] from Jun 2017 - Nov 2017, hosted by [[https://homepages.cwi.nl/~jeffery/|Stacey Jeffery]].
+[[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 ====
-  - S. Chakraborty, K. Luh, J. Roland, //On analog quantum algorithms for the mixing of Markov chains//, [[https://arxiv.org/abs/1904.11895|arXiv:1904.11895]] (2019).
-  - S. Chakraborty, A. Gilyén, S. Jeffery, //The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation//, In Proceedings of the  46th International Colloquium of Automata, Languages and Programming (ICALP 2019) (2019). [[https://arxiv.org/abs/1804.01973|arXiv]]
+[[https://scholar.google.pt/citations?user=NXOEEbcAAAAJ&hl=en|Google scholar]] profile.
+  -S. Chakraborty, L. Novo, J. Roland, //Optimality of spatial search via continuous-time quantum walks//, [[https://journals.aps.org/pra/abstract/10.1103/PhysRevA.102.032214|Physical Review A 102, 032214]] (2020). [[https://arxiv.org/abs/2004.12686|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, //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]]
   - L. Novo, S. Chakraborty, M. Mohseni, Y. Omar, //Environment-assisted analog quantum search//, [[https://journals.aps.org/pra/abstract/10.1103/PhysRevA.98.022316|Physical Review A 98, 022316]] (2018). [[https://arxiv.org/abs/1710.02111|arXiv]]
-  - S. Chakraborty, L. Novo, J. Roland, //Finding a marked node on any graph by continuous-time quantum walk//, [[https://arxiv.org/abs/1807.05957|arXiv:1807.05957]] (2018).
   - S. Chakraborty, L. Novo, S. D. Giorgio, Y. Omar, //Optimal quantum spatial search on random temporal networks//, [[https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.119.220503|Physical Review Letters 119, 220503]] (2017).  [[https://arxiv.org/abs/1701.04392|arXiv]]
   - S. Chakraborty, L. Novo, A. Ambainis, Y. Omar, //Spatial search by quantum walk is optimal for almost all graphs//, [[https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.116.100501|Physical Review Letters 116, 100501]] (2016). Highlighted as Editors’ suggestion. [[https://arxiv.org/abs/1508.01327|arXiv]]
-  - L. Novo, S. Chakraborty, M. Mohseni, Y. Omar, //Systematic dimensionality reduction for quantum walks: Optimal Spatial search and Transport on Non-Regular Graphs//, [[http://nature.com/articles/srep13304|Scientific Reports 5, 13304]] (2015). [[https://arxiv.org/abs/1412.7209|arXiv]]
+  - L. Novo, S. Chakraborty, M. Mohseni, H. Neven, Y. Omar, //Systematic dimensionality reduction for quantum walks: Optimal Spatial search and Transport on Non-Regular Graphs//, [[http://nature.com/articles/srep13304|Scientific Reports 5, 13304]] (2015). [[https://arxiv.org/abs/1412.7209|arXiv]]
   - S. Adhikari, S. Roy, S. Chakraborty, V. Jagdish, M. K. Haris, A. Kumar, //Controlled Secret Sharing Protocol using a Quantum Cloning Circuit//, [[https://link.springer.com/article/10.1007/s11128-014-0791-1|Quantum Information Processing 13, 2071]] (2014). [[https://arxiv.org/abs/1402.3031|arXiv]]
   - S. Chakraborty, S. Banerjee, S. Adhikari, A. Kumar, //Entanglement in the Grover’s Search Algorithm//, [[https://arxiv.org/abs/1305.4454|arXiv:1305.4454]] (2013).