Parametric quantum search algorithm as quantum walk: a quantum simulation
From MaRDI portal
Publication:1690109
DOI10.1016/S0034-4877(16)30008-8zbMath1380.81086OpenAlexW2284495127MaRDI QIDQ1690109
Christos Konstandakis, Demosthenes Elllinas
Publication date: 18 January 2018
Published in: Reports on Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0034-4877(16)30008-8
Searching and sorting (68P10) Sums of independent random variables; random walks (60G50) Quantum computation (81P68) Operator spaces and completely bounded maps (46L07)
Cites Work
- States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
- Quantum dynamical semigroups and applications. (Based on Lectures given at the 20th Symposium on Theoretical Chemistry held 1984 in Emmetten, Switzerland)
- Completely positive linear maps on complex matrices
- Discrete randomness in discrete time quantum walk: study via stochastic averaging
- Parametric quantum search algorithm by CP maps: algebraic, geometric and complexity aspects
- Universal Quantum Simulators
- Impossibility of a Quantum Speed-Up with a Faulty Oracle
- Quantum Walks
- Noise effects in the quantum search algorithm from the viewpoint of computational complexity
- Grover’s Algorithm with Errors
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- Positive Functions on C ∗ -Algebras
- Inequalities: theory of majorization and its applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
