Constructions for quantum computing with symmetrized gates

  • Authors:

  • Gábor Ivanyos;Attila B. Nagy;Lajos Rónyai

  • Affiliations:

  • Computer and Automation Research Institute of the Hungarian Academy of Sciences, Budapest, Hungary;Department of Algebra, Budapest University of Technology and Economics, Budapest, Hungary;Computer and Automation Research Institute of the Hungarian Academy of Sciences and Department of Algebra, Budapest University of Technology and Economics, Budapest, Hungary

  • Venue:
  • Quantum Information & Computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.