Hamiltonian quantum computer in one dimension
arXiv:1512.06775 · doi:10.1103/PhysRevA.92.062334
Abstract
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach is called the Hamiltonian quantum computation and it includes, for example, the continuous-time quantum cellular automata and the universal quantum walk. We consider one spatial dimension and study the compromise between the locality and the local Hilbert space dimension . For geometrically 2-local (i.e., ), it is known that is already sufficient for universal quantum computation but the Hamiltonian is not translationally invariant. As the locality increases, it is expected that the minimum required should decrease. We provide a construction of Hamiltonian quantum computer for with . One implication is that simulating 1D chains of spin-2 particles is BQP-complete. Imposing translation invariance will increase the required . For this we also construct another 3-local () Hamiltonian that is invariant under translation of a unit cell of two sites but that requires to be 8.
arXiv comment13 pages, 6 figures, accepted version
References in corpus (12)
- Fault-tolerant quantum computation by anyons
- Non-Abelian Anyons and Topological Quantum Computation
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Measurement-based quantum computation
- Universal computation by quantum walk
- Adiabatic quantum computation with Cooper pairs
- The power of quantum systems on a line
- Hamiltonian Quantum Cellular Automata in 1D
- Quantum simulators, continuous-time automata, and translationally invariant systems
- A quantum cellular automaton for universal quantum computation
- A universally programmable Quantum Cellular Automaton
- The Computational Power of Symmetric Hamiltonians