### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 411-429 |

Number of pages | 19 |

Journal | Quantum Information and Computation |

Volume | 8 |

Issue number | 5 |

Publication status | Published - May 1 2008 |

### Fingerprint

### Keywords

- Commutator
- Quantum computing
- Symmetrized gate

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics
- Physics and Astronomy(all)
- Statistical and Nonlinear Physics
- Mathematical Physics
- Nuclear and High Energy Physics

### Cite this

*Quantum Information and Computation*,

*8*(5), 411-429.

**Constructions for quantum computing with symmetrized gates.** / Ivanyos, Gábor; Nagy, Attila B.; Rónyai, L.

Research output: Contribution to journal › Article

*Quantum Information and Computation*, vol. 8, no. 5, pp. 411-429.

}

TY - JOUR

T1 - Constructions for quantum computing with symmetrized gates

AU - Ivanyos, Gábor

AU - Nagy, Attila B.

AU - Rónyai, L.

PY - 2008/5/1

Y1 - 2008/5/1

N2 - 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.

AB - 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.

KW - Commutator

KW - Quantum computing

KW - Symmetrized gate

UR - http://www.scopus.com/inward/record.url?scp=65549083069&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=65549083069&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:65549083069

VL - 8

SP - 411

EP - 429

JO - Quantum Information and Computation

JF - Quantum Information and Computation

SN - 1533-7146

IS - 5

ER -