Constructions for quantum computing with symmetrized gates

We investigate constructions for simulating quantum computers with a polynomial slowdown on ensembles composed of qubits on which symmetrized versions of one- and two-qubit gates can be performed. The simulation is based on taking Lie commutators of symmetrized Hamiltonians to extract Hamiltonians at desired local positions. During the simulation, only a part of the qubits can be used for storing information, the others are left unchanged by the commutators. We propose constructions for various symmetry groups where a pretty large fraction of the qubits can be used. As a few of the other qubits need to be set to one, our construction requires individual initialization of some of the qubits.

[1]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[2]  Mika Hirvensalo,et al.  Introduction to Evolutionary Computing , 2002, Natural Computing Series.

[3]  D. Janzing.  Spin- 1 ∕ 2 particles moving on a two-dimensional lattice with nearest-neighbor interactions can realize an autonomous quantum computer , 2005, quant-ph/0506270.

[4]  J. I. Cirac,et al.  Reversible universal quantum computation within translation-invariant systems , 2006 .

[5]  S. Massar,et al.  Quantum computing on lattices using global two-qubit gates , 2005 .

[6]  J. Cirac,et al.  Quantum simulators, continuous-time automata, and translationally invariant systems. , 2007, Physical review letters.

[7]  R Freeman,et al.  Pulse sequences for NMR quantum computers: how to manipulate nuclear spins while freezing the motion of coupled neighbours , 1999 .

[8]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[9]  S. C. Benjamin,et al.  Quantum Computing in Arrays Coupled by 'Always On' Interactions , 2004, quant-ph/0401071.

[10]  Simon C Benjamin,et al.  Quantum computing with an always-on Heisenberg interaction. , 2002, Physical review letters.

[11]  Robert Raussendorf.  Quantum computation via translation-invariant operations on a chain of qubits , 2005 .

[12]  Debbie W. Leung,et al.  Efficient implementation of selective recoupling in heteronuclear spin systems using hadamard matrices , 2000 .

[13]  Debbie W. Leung,et al.  Efficient implementation of coupled logic gates for quantum computation , 2000 .

[14]  Pawel Wocjan,et al.  Ergodic Quantum Computing , 2005, Quantum Inf. Process..

[15]  Mireille Boutin,et al.  On reconstructing n-point configurations from the distribution of distances or areas , 2003, Adv. Appl. Math..

[16]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[17]  Michael M. Wolf,et al.  Quantum simulations under translational symmetry , 2007 .

[18]  M. Nielsen,et al.  Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries , 2001, quant-ph/0106064.

[19]  Simon C. Benjamin.  Multi-qubit gates in arrays coupled by 'always-on' interactions , 2004 .

[20]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[21]  Simon C. Benjamin,et al.  Quantum error correction in globally controlled arrays , 2003 .