Reversible universal quantum computation within translation invariant systems
arXiv:quant-ph/0502143 · doi:10.1103/PhysRevA.73.012324
Abstract
We show how to perform reversible universal quantum computation on a translationally invariant pure state, using only global operations based on next-neighbor interactions. We do not need not to break the translational symmetry of the state at any time during the computation. Since the proposed scheme fulfills the locality condition of a quantum cellular automata, we present a reversible quantum cellular automaton capable of universal quantum computation.
References in corpus (3)
Cited by in corpus (20)
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Entropy scaling and simulability by Matrix Product States
- A review of Quantum Cellular Automata
- On entropy growth and the hardness of simulating time evolution
- Unitary and non-unitary quantum cellular automata with Rydberg arrays
- Quantum simulators, continuous-time automata, and translationally invariant systems
- Local Unitary Quantum Cellular Automata
- What is a quantum computer, and how do we build one?
- A QMA-Complete Translationally Invariant Hamiltonian Problem and the Complexity of Finding Ground State Energies in Physical Systems
- Local Operations in qubit arrays via global but periodic Manipulation
- Quantum Computing on Lattices using Global Two-Qubit Gate
- A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
- Bounds on the Speedup in Quantum signalling
- Intrinsically universal n-dimensional quantum cellular automata
- Photonic cellular automaton simulation of relativistic quantum fields: observation of Zitterbewegung
- An overview of Quantum Cellular Automata
- Reversibility in one-dimensional quantum cellular automata in the presence of noise
- Quantum Coherence in Noisy Cellular Automata
- Quantum Algorithm of Evolutionary Analysis of 1D Cellular Automata
- Quantum Computing with Global One-and Two-Qubit Gates