Parametric quantum search algorithm as quantum walk: a quantum simulation
DOI10.1016/S0034-4877(16)30008-8zbMATH Open1380.81086OpenAlexW2284495127MaRDI QIDQ1690109FDOQ1690109
Authors: Christos Konstandakis, Demosthenes Ellinas 
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
Recommendations
Sums of independent random variables; random walks (60G50) Searching and sorting (68P10) Quantum computation (81P68) Operator spaces and completely bounded maps (46L07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Universal Quantum Simulators
- Title not available (Why is that?)
- Inequalities: theory of majorization and its applications
- 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
- Coins make quantum walks faster
- Title not available (Why is that?)
- Quantum Walks
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- Positive Functions on C ∗ -Algebras
- 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
- Title not available (Why is that?)
- Discrete randomness in discrete time quantum walk: study via stochastic averaging
- Parametric quantum search algorithm by CP maps: algebraic, geometric and complexity aspects
- Impossibility of a Quantum Speed-Up with a Faulty Oracle
- Noise effects in the quantum search algorithm from the viewpoint of computational complexity
- Grover's algorithm with errors
Cited In (6)
- Parametric quantum search algorithm by CP maps: algebraic, geometric and complexity aspects
- Quantum walks and search algorithms
- Gate imperfection in the quantum random-walk search algorithm
- Three-party quantum dialogue based on Grover's algorithm with identity dual authentication
- Optimizing the walk coin in the quantum random walk search algorithm
- Quantum Walk Based Search Algorithms
This page was built for publication: Parametric quantum search algorithm as quantum walk: a quantum simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690109)
