Coherence as resource in scattering quantum walk search on complete graph
arXiv:1704.04974 · doi:10.1038/s41598-018-29342-5
Abstract
We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is greatly larger than the marked number of vertices we are searching, . We find that the consumption of coherence represents the increase of the success probability for the searching,also the consumption of coherence is related to the efficiency of the algorithm represented by oracle queries.If no coherence is consumed, the efficiency of the algorithm will be the same as the classical blind search, implying that coherence is responsible for the speed up in this quantum algorithm over its classical counterpart. In case the initial state is incoherent, still is assumed,the probability of success for searching will not change with time, indicating that this quantum search algorithm loses its power.We then conclude that the coherence plays an essential role and is responsible for the speed up in this quantum algorithm.
References in corpus (37)
- Quantum entanglement
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Mechanics helps in searching for a needle in a haystack
- Introducing Quantum Discord
- Review article: Linear optical quantum computing
- Quantifying Coherence
- Scaling of Entanglement close to a Quantum Phase Transitions
- Entanglement in a simple quantum phase transition
- Quantum Amplitude Amplification and Estimation
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- A Quantum Random Walk Search Algorithm
- Quantum walks of correlated particles
- Operational Resource Theory of Coherence
- Dephasing assisted transport: Quantum networks and biomolecules
- Exponential algorithmic speedup by quantum walk
- Environment-Assisted Quantum Transport
- Experimental Boson Sampling
- Realization of a quantum walk with one and two trapped ions
- Quantum walk of a trapped ion in phase space
- Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation
- Laser written waveguide photonic quantum circuits
- Assisted distillation of quantum coherence
- Einselection and Decoherence from an Information Theory Perspective
- The quantum to classical transition for random walks
- Coherence depletion in the Grover quantum search algorithm
- Quantum discord as a resource for quantum cryptography
- Quantum cost for sending entanglement
- Spatial search and the Dirac equation
- Quantum stochastic walks: A generalization of classical random walks and quantum walks
- Experimental quantum-walk revival with a time-dependent coin
- Realization of single-qubit positive operator-valued measurement via a one-dimensional photonic quantum walk
- Quantum walk on a line for a trapped ion
- Quantum walks based on an interferometric analogy
- Quantum searches on highly symmetric graphs
- Trapping photons on the line: controllable dynamics of a quantum walk
- Equivalence between discrete quantum walk models in arbitrary topologies
- Scattering quantum random-walk search with errors