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/02/04 18:58] shchakra [Publications and pre-prints] |
members:shchakra [2020/02/10 21:17] shchakra [Publications and pre-prints] |
||
---|---|---|---|
Line 22: | Line 22: | ||
| | ||
==== Publications and pre-prints ==== | ==== Publications and pre-prints ==== | ||
- | - 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, 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, 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//, [[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]] | ||
Line 29: | Line 29: | ||
- 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]] | ||
- | - 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. 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). | - 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). |