A pseudo-unitary quasiperiodic quantum walk model exhibits a novel mobility edge sharply dividing metallic and insulating phases plus a second transition unique to discrete time, with PT-symmetry breaking quantified by spectral winding number.
A Quantum Random Walk Search Algorithm
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architecture that provides such a speed-up. It will be shown that this algorithm performs an oracle search on a database of $N$ items with $O(\sqrt{N})$ calls to the oracle, yielding a speed-up similar to other quantum search algorithms. It appears that the quantum random walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.
verdicts
UNVERDICTED 2representative citing papers
Quantum mechanics supplies the physical basis for teleological evolutions in both quantum algorithms and living systems through future attractors.
citing papers explorer
-
Mobility edges in pseudo-unitary quasiperiodic quantum walks
A pseudo-unitary quasiperiodic quantum walk model exhibits a novel mobility edge sharply dividing metallic and insulating phases plus a second transition unique to discrete time, with PT-symmetry breaking quantified by spectral winding number.
-
Quantum mechanics provides the physical basis of teleological evolutions
Quantum mechanics supplies the physical basis for teleological evolutions in both quantum algorithms and living systems through future attractors.