Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
members:shchakra [2019/04/09 12:24] shchakra [Short biography] |
members:shchakra [2019/04/24 16:53] shchakra [Publications and pre-prints] |
||
|---|---|---|---|
| Line 22: | Line 22: | ||
| | | ||
| ==== Publications and pre-prints ==== | ==== Publications and pre-prints ==== | ||
| + | - S. Chakraborty, A. Gilyén, S. Jeffery, //The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation//, [[To appear in Proceedings of the 46th International Colloquium of Automata, Languages and Programming (ICALP)]](2019).[[https://arxiv.org/abs/1804.01973|arXiv:1804.01973]] | ||
| - 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, 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, A. Gilyén, S. Jeffery, //The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation//, [[https://arxiv.org/abs/1804.01973|arXiv:1804.01973]] (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]] | ||