A quantum cellular automaton for universal quantum computation
arXiv:quant-ph/0412048 · doi:10.1103/PhysRevA.72.022301
Abstract
I describe a quantum cellular automaton capable of performing universal quantum computation. The automaton has an elementary transition function that acts on Margolus cells of qubits, and both the ``quantum input'' and the program are encoded in the initial state of the system.
4 pages, 3 figures
References in corpus (7)
- Cold bosonic atoms in optical lattices
- Universal quantum computation with spin-1/2 pairs and Heisenberg exchange
- Programmable quantum gate arrays
- Atom Optics with Microfabricated Optical Elements
- Quantum Computing with Globally Controlled Exchange-type Interactions
- Entanglement Dynamics in 1D Quantum Cellular Automata
- Simple Pulses for Universal Quantum Computation with a Heisenberg ABAB Chain
Cited by in corpus (31)
- Quantum Circuit Learning
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Quantum Computing with NMR
- A review of Quantum Cellular Automata
- Architectures for quantum simulation showing a quantum speedup
- Unitary and non-unitary quantum cellular automata with Rydberg arrays
- Hamiltonian Quantum Cellular Automata in 1D
- Quantum state transfer and time-dependent disorder in Quantum Chains
- A universally programmable Quantum Cellular Automaton
- Local Unitary Quantum Cellular Automata
- Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer
- Ternary unitary quantum lattice models and circuits in dimensions
- Entanglement Generation of Clifford Quantum Cellular Automata
- A quantum algorithm for additive approximation of Ising partition functions
- A comparative study of universal quantum computing models: towards a physical unification
- Local Hamiltonians in Quantum Computation
- Scalability of quantum computation with addressable optical lattices
- A quasi-Hermitian pseudopotential for higher partial wave scattering
- Quantum Complexity: restrictions on algorithms and architectures
- Hamiltonian quantum computer in one dimension
- A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
- Programmable Quantum Networks with Pure States
- Intrinsically universal n-dimensional quantum cellular automata
- Symmetries of the Dirac quantum walk and emergence of the de Sitter group
- A massless interacting Fermionic Cellular Automaton exhibiting bound states
- Photonic cellular automaton simulation of relativistic quantum fields: observation of Zitterbewegung
- Intrinsically universal one-dimensional quantum cellular automata in two flavours
- An overview of Quantum Cellular Automata
- Quantum Coherence in Noisy Cellular Automata
- Partitioned quantum cellular automata are intrinsically universal
- Reversibility in one-dimensional quantum cellular automata in the presence of noise