Universal computation by multiparticle quantum walk
From MaRDI portal
Publication:2961970
DOI10.1126/SCIENCE.1229957zbMATH Open1355.68101arXiv1205.3782OpenAlexW2161027938WikidataQ34327981 ScholiaQ34327981MaRDI QIDQ2961970FDOQ2961970
Authors: Andrew M. Childs, David Gosset, Zak Webb 
Publication date: 15 February 2017
Published in: Science (Search for Journal in Brave)
Abstract: A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we consider a generalization of quantum walk to systems with more than one walker. A continuous-time multi-particle quantum walk is generated by a time-independent Hamiltonian with a term corresponding to a single-particle quantum walk for each particle, along with an interaction term. Multi-particle quantum walk includes a broad class of interacting many-body systems such as the Bose-Hubbard model and systems of fermions or distinguishable particles with nearest-neighbor interactions. We show that multi-particle quantum walk is capable of universal quantum computation. Since it is also possible to efficiently simulate a multi-particle quantum walk of the type we consider using a universal quantum computer, this model exactly captures the power of quantum computation. In principle our construction could be used as an architecture for building a scalable quantum computer with no need for time-dependent control.
Full work available at URL: https://arxiv.org/abs/1205.3782
Recommendations
Cited In (63)
- Search algorithm on strongly regular graph by lackadaisical quantum walk
- A prototype of quantum von Neumann architecture
- Spatial entanglement between two quantum walkers with exchange symmetric coins
- Lackadaisical discrete-time quantum walk on Johnson graph
- Influence of generic quantum coins on the spreading and entanglement in binary aperiodic quantum walks
- Necessity of orthogonal basis vectors for the two-anyon problem in a one-dimensional lattice
- Universal resources for quantum computing
- Adjustable-depth quantum circuit for position-dependent coin operators of discrete-time quantum walks
- Arbitrated quantum signature scheme with quantum walk-based teleportation
- The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
- Generalized quantum teleportation of shared quantum secret: a coined quantum-walk approach
- A new kind of flexible quantum teleportation of an arbitrary multi-qubit state by multi-walker quantum walks
- Quantum key distribution with quantum walks
- Quantum walk and its application domains: a systematic review
- Arbitrated quantum signature scheme with quantum teleportation by using two three-qubit GHZ states
- GPU-accelerated algorithms for many-particle continuous-time quantum walks
- Exponentially decaying velocity bounds of quantum walks in periodic fields
- Localization in quantum walks with periodically arranged coin matrices
- General condition of quantum teleportation by one-dimensional quantum walks
- Perfect state transfer on bi-Cayley graphs over abelian groups
- Periodicity of lively quantum walks on cycles with generalized Grover coin
- Quantum circuits for discrete-time quantum walks with position-dependent coin operator
- Solovay-Kitaev approximations of special orthogonal matrices
- Quantum walk with quadratic position-dependent phase defects
- On the equivalence between quantum and random walks on finite graphs
- Quantum computation using action variables
- Simulation methods for quantum walks on graphs applied to formal language recognition
- Complementarity in quantum walks
- Title not available (Why is that?)
- Universal quantum computation by scattering in the Fermi–Hubbard model
- History dependent quantum random walks as quantum lattice gas automata
- Pair state transfer
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Localization of two-particle quantum walk on glued-tree and its application in generating Bell states
- Equivalence of Szegedy's and coined quantum walks
- Computing the lowest eigenstate of tight-binding Hamiltonians using quantum walks
- Renormalization of the unitary evolution equation for coined quantum walks
- Discrete-time quantum walk algorithm for ranking nodes on a network
- One-dimensional quantum walks with a position-dependent coin
- Quantum Walks on Quantum Cellular Automata Lattices: Towards a New Model for Quantum Computation
- Title not available (Why is that?)
- The expressive power of quantum walks in terms of language acceptance
- Quantum stochastic walk models for quantum state discrimination
- Universal computation with quantum fields
- Creating photonic GHZ and W states via quantum walk
- Thermalization in many-particle quantum walks
- Time independent universal computing with spin chains: quantum plinko machine
- How to realize one-dimensional discrete-time quantum walk by Dirac particle
- Classical random walk with memory versus quantum walk on a one-dimensional infinite chain
- Generalized teleportation by quantum walks
- Symmetries of the Dirac quantum walk and emergence of the De Sitter group
- Quantum walks via quantum cellular automata
- Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
- Scattering of few photons by a ladder-type quantum system
- Landau levels for discrete-time quantum walks in artificial magnetic fields
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- Discrete-time quantum walk search on Johnson graphs
- Experimental observations of 1D quantum walks in a limited region
- Multi-Walker discrete time quantum walks on arbitrary graphs, their properties and their photonic implementation
- Limitations of discrete-time quantum walk on a one-dimensional infinite chain
- Green's function approach for quantum graphs: an overview
- Universally optimal noisy quantum walks on complex networks
- Transport and localization in quantum walks on a random hierarchy of barriers
This page was built for publication: Universal computation by multiparticle quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961970)
