Optimal computation with non-unitary quantum walks

DOI10.1016/j.tcs.2007.12.011zbMath1136.68026arXivquant-ph/0610240WikidataQ57950022 ScholiaQ57950022MaRDI QIDQ2482461

Viv Kendon, Olivier Maloyer

Publication date: 16 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0610240

zbMATH Keywords

quantum algorithms; quantum computing; quantum walks

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

81P68: Quantum computation

Related Items

ASYMPTOTIC ENTANGLEMENT IN 1D QUANTUM WALKS WITH A TIME-DEPENDENT COINED, Quantum Walks, Maximal entanglement from quantum random walks, Quantum walks: a comprehensive review, Optimal computation with non-unitary quantum walks, One-dimensional quantum walks subject to next-nearest-neighbour hopping decoherence

Cites Work

• One-dimensional quantum walks with absorbing boundaries
• Optimal computation with non-unitary quantum walks
• Complementarity and quantum walks
• Exponential algorithmic speedup by a quantum walk
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum walks in higher dimensions
• Separability Criterion for Density Matrices
• Mixed-State Entanglement and Distillation: Is there a “Bound” Entanglement in Nature?
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Quantum walks on graphs
• A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
• Decoherence in quantum walks – a review
• Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps