Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
members:shchakra [2020/04/30 20:59] shchakra [Publications and pre-prints] |
members:shchakra [2020/08/26 20:12] shchakra [Publications and pre-prints] |
||
|---|---|---|---|
| Line 22: | Line 22: | ||
| | | ||
| ==== Publications and pre-prints ==== | ==== Publications and pre-prints ==== | ||
| + | - S. Chakraborty, L. Novo, J. Roland, //Finding a marked node on any graph via continuous-time quantum walk//, [[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, L. Novo, J. Roland, //On the optimality of spatial search by continuous-time quantum walk//, [[http://arxiv.org/abs/2004.12686|arXiv:2004.12686]] (2020). | -S. Chakraborty, L. Novo, J. Roland, //On the optimality of spatial search by continuous-time quantum walk//, [[http://arxiv.org/abs/2004.12686|arXiv:2004.12686]] (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]] | ||
| - | - 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). | ||
| - 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]] | - 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, 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]] | - 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]] | ||