Quantum Computing with Global One-and Two-Qubit Gates
arXiv:quant-ph/0608241
Abstract
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
Substantially revised version. 18 pages
References in corpus (9)
- Two-Bit Gates are Universal for Quantum Computation
- Quantum Computing with an 'Always On' Heisenberg Interaction
- Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
- Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices
- Pulse Sequences for NMR Quantum Computers: How to Manipulate Nuclear Spins While Freezing the Motion of Coupled Neighbours
- Reversible universal quantum computation within translation invariant systems
- Quantum simulations under translational symmetry
- Quantum error correction in globally controlled arrays
- Quantum Computing on Lattices using Global Two-Qubit Gate