Universal quantum computation by discontinuous quantum walk
arXiv:1008.3578 · doi:10.1103/PhysRevA.82.042304
Abstract
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the Hamiltonian furnished by the adjacency matrix of the graph. We present a hybrid scheme for universal quantum computation in which a quantum walker takes discrete steps of continuous evolution. This `discontinuous' quantum walk employs perfect quantum state transfer between two nodes of specific subgraphs chosen to implement a universal gate set, thereby ensuring unitary evolution without requiring the introduction of an ancillary coin space. The run time is linear in the number of simulated qubits and gates. The scheme allows multiple runs of the algorithm to be executed almost simultaneously by starting walkers one timestep apart.
arXiv comment7 pages, revtex
References in corpus (14)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Perfect state transfer in quantum spin networks
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Universal quantum computation using the discrete time quantum walk
- Quantum Communication through Spin Chain Dynamics: an Introductory Overview
- An example of the difference between quantum and classical random walks
- A Review of Perfect State Transfer and its Application as a Constructive Tool
- Quantum Networks on Cubelike Graphs
- Control by quantum dynamics on graphs
- Perfect quantum state transfer with spinor bosons on weighted graphs
- Discrete-query quantum algorithm for NAND trees
Cited by in corpus (27)
- Quantum walks: a comprehensive review
- Review on Quantum Walk Computing: Theory, Implementation, and Application
- Complex Quantum Networks: a Topical Review
- Experimental demonstration of quantum walks with initial superposition states
- Quantum state revivals in quantum walks on cycles
- Electric circuits for universal quantum gates and quantum Fourier transformation
- Continuous-Time Quantum Walks on Dynamic Graphs
- Bose-Hubbard model for universal quantum walk-based computation
- Quantum walks on embedded hypercubes
- An efficient protocol of quantum walk in circuit QED
- The quantum walk search algorithm: Factors affecting efficiency
- Long-lived quantum speedup based on plasmonic hot spot systems
- Simplifying Continuous-Time Quantum Walks on Dynamic Graphs
- Dirac formulation for universal quantum gates and Shor's integer factorization in high-frequency electric circuits
- Single-qubit unitary gates by graph scattering
- Two-level Quantum Walkers on Directed Graphs I: Universal Quantum Computing
- An Infinite Family of Circulant Graphs with Perfect State Transfer in Discrete Quantum Walks
- Demonstration of Discrete-Time Quantum Walks and Observation of Topological Edge States in a Superconducting Qutrit Chain
- Quantum Walk on Orbit Spaces
- Quantum Walks on Embeddings
- Analytical expression for variance of homogeneous-position quantum walk with decoherent position
- Disorder-free localisation in continuous-time quantum walks : Role of symmetries
- Entangled state generation via quantum walks with multiple coins
- Perfect state transfer on quotient graphs
- Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks
- The role of coherence on two-particle quantum walks
- Perfect State Transfer on Signed Graphs