Decoherence in Discrete Quantum Walks

作者: Viv Kendon , Ben Tregenna

DOI: 10.1007/978-3-540-40968-7_18

关键词: Quantum technologyQuantum mechanicsOpen quantum systemQuantum error correctionQuantum algorithmQuantum dissipationQuantum operationQuantum networkQuantum walkMathematics

摘要: We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as alternative Fourier transforms for underpinning algorithms computation. then describe our results effects of decoherence these a line, cycle and hypercube. find high sensitivity decoherence, increasing with number steps walk, particle is becoming more delocalised each step. However, effect small amount can be enhance properties walk that are desirable development algorithms, such fast mixing times uniform distributions.

参考文章(24)
Ben Tregenna, Viv Kendon, Decoherence is useful in quantum walks ,(2002)
W. Dür, R. Raussendorf, V. M. Kendon, H.-J. Briegel, Quantum walks in optical lattices Physical Review A. ,vol. 66, pp. 052319- ,(2002) , 10.1103/PHYSREVA.66.052319
Julia Kempe, Quantum Random Walks Hit Exponentially Faster arXiv: Quantum Physics. ,(2002)
Peter W. Shor, INTRODUCTION TO QUANTUM ALGORITHMS arXiv: Quantum Physics. ,(2000)
David A. Meyer, UNITARITY IN ONE DIMENSIONAL NONLINEAR QUANTUM CELLULAR AUTOMATA arXiv: Quantum Physics. ,(1996)
Isaac L. Chuang, Michael A. Nielsen, Quantum Computation and Quantum Information ,(2000)
Ben Tregenna, Viv Kendon, Decoherence in a quantum walk on the line arXiv: Quantum Physics. ,(2002)
Nayak Ashwin, Vishwanath Ashvin, Quantum Walk on the Line arXiv: Quantum Physics. ,(2000)
Cristopher Moore, Alexander Russell, Quantum Walks on the Hypercube randomization and approximation techniques in computer science. pp. 164- 178 ,(2002) , 10.1007/3-540-45726-7_14
John Watrous, Quantum simulations of classical random walks and undirected graph connectivity conference on computational complexity. ,vol. 62, pp. 180- 187 ,(1999) , 10.1006/JCSS.2000.1732