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
Next revision Both sides next revision
members:shchakra [2018/08/31 20:12]
shchakra [Publications and pre-prints]
members:shchakra [2018/08/31 20:21]
shchakra
Line 1: Line 1:
 ====== Shantanav Chakraborty ====== ====== Shantanav Chakraborty ======
- 
 {| class="​portrait"​ {| class="​portrait"​
 |- |-
Line 18: Line 17:
  
 <​html>​ <​html>​
-<!-- +
-* From May 20 to 22, 2015, Stefano Pironio and I organize the 10th Conference on the Theory of Quantum Computation,​ Communication and Cryptography (TQC 2015) in Brussels. More information [[http://​tqc2015.ulb.ac.be|here]]. +
-  * -->+
 </​html>​ </​html>​
  
Line 30: Line 27:
   - 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,​ 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]] 
-  - 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, 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, 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).
 ==== Some older publications ​ ==== ==== Some older publications ​ ====
 As an undergraduate working in Computational Genomics: As an undergraduate working in Computational Genomics:
-  - S. S. Hassan, P. P. Choudhury, B. S. Dayasagar, S. Chakraborty,​ R. Guha, A. Goswami, ​Quantitative description of genomic evolution of olfactory receptors, Asian-European Journal of Mathematics,​ 8, 03 (2015). +  - S. S. Hassan, P. P. Choudhury, B. S. Dayasagar, S. Chakraborty,​ R. Guha, A. Goswami, ​//Quantitative description of genomic evolution of olfactory receptors//[[https://​www.worldscientific.com/​doi/​abs/​10.1142/​S1793557115500436|Asian-European Journal of Mathematics,​ 8, 03]] (2015). 
-  - S. S. Hassan, P. P. Choudhury, R. Guha, S. Chakraborty, ​DNA sequence evolution through Integral Value Transformations, Interdisciplinary Sciences: Computational Life Sciences, 4, 02 (2012). ​+  - S. S. Hassan, P. P. Choudhury, R. Guha, S. Chakraborty, ​//DNA sequence evolution through Integral Value Transformations//[[https://​link.springer.com/​article/​10.1007/​s12539-012-0103-3|Interdisciplinary Sciences: Computational Life Sciences, 4, 02]] (2012). ​