Quantum Walks, Quantum Gates and Quantum Computers
arXiv:quant-ph/0701088 · doi:10.1103/PhysRevA.75.062321
Abstract
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a single- and multi-excitation coding, and for more general mappings. Specific examples of spin chains, as well as static and dynamic systems of qubits, are mapped to quantum walks, and walks on hyperlattices and hypercubes are mapped to various gate systems. We also show how to map a quantum circuit performing the quantum Fourier transform, the key element of Shor's algorithm, to a quantum walk system doing the same. The results herein are an essential preliminary to a Hamiltonian formulation of quantum walks in which coupling to a dynamic quantum environment is included.
17 pages, 10 figures
References in corpus (17)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Spatial search by quantum walk
- Quantum Computation as Geometry
- Theory of the spin bath
- An example of the difference between quantum and classical random walks
- Implementing the quantum random walk
- A practical scheme for quantum computation with any two-qubit entangling gate
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- Quantum random walks in optical lattices
- Quantum quincunx in cavity quantum electrodynamics
- Spatial search and the Dirac equation
- Universal simulation of Hamiltonian dynamics for qudits
- Quantum walks on general graphs
- One- and two-dimensional quantum walks in arrays of optical traps
- Decoherence and Quantum Walks: anomalous diffusion and ballistic tails
Cited by in corpus (27)
- Quantum walks: a comprehensive review
- Spin-Based Quantum Computers made by Chemistry: Hows and Whys
- Simulating quantum statistics with entangled photons: a continuous transition from bosons to fermions
- Hitting time for the continuous quantum walk
- Models of quantum computation and quantum programming languages
- Lattice quantum magnetometry
- Continuous-time quantum walks on dynamical percolation graphs
- Scattering quantum random-walk search with errors
- Electric circuits for universal quantum gates and quantum Fourier transformation
- Asymptotically perfect efficient quantum state transfer across uniform chains with two impurities
- Quantum walks on embedded hypercubes
- Feedback-assisted quantum search by continuous-time quantum walks
- Decoherence in quantum walks and quantum computers
- Scalable uniform construction of highly-conditional quantum gates
- Green function approach for scattering quantum walks
- Dirac formulation for universal quantum gates and Shor's integer factorization in high-frequency electric circuits
- The walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks
- Pure Phase Decoherence in a Ring Geometry
- How to Compile Some NAND Formula Evaluators
- Perfect quantum state transfer of hard-core bosons on weighted path graphs
- From Stochastic Hamiltonian to Quantum Simulation: Exploring Memory Effects in Exciton Dynamics
- Correlation effects in a discrete quantum random walk
- Scalable Structure For Chiral Quantum Routing
- Quantum transfer through small networks coupled to phonons: effects of topology vs phonons
- Quantum walks assisted by particle number fluctuations
- The simplest 2D quantum walk detects chaoticity
- Robustness and classical proxy of entanglement in variants of quantum walk