Constructions for quantum computing with symmetrized gates

Gábor Ivanyos, Attila B. Nagy, L. Rónyai

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)411-429
Number of pages19
JournalQuantum Information and Computation
Volume8
Issue number5
Publication statusPublished - May 1 2008

Fingerprint

Quantum Computing
quantum computation
Qubit
Electric commutators
Hamiltonians
commutators
Quantum computers
quantum computers
Commutator
polynomials
simulation
Polynomials
symmetry
Quantum Computer
Symmetry Group
Initialization
Simulation
Ensemble
Polynomial

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

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

In: Quantum Information and Computation, Vol. 8, No. 5, 01.05.2008, p. 411-429.

Research output: Contribution to journalArticle

Ivanyos, Gábor ; Nagy, Attila B. ; Rónyai, L. / Constructions for quantum computing with symmetrized gates. In: Quantum Information and Computation. 2008 ; Vol. 8, No. 5. pp. 411-429.
@article{0066ad92d7c641b0b8f4823646ae9534,
title = "Constructions for quantum computing with symmetrized gates",
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.",
keywords = "Commutator, Quantum computing, Symmetrized gate",
author = "G{\'a}bor Ivanyos and Nagy, {Attila B.} and L. R{\'o}nyai",
year = "2008",
month = "5",
day = "1",
language = "English",
volume = "8",
pages = "411--429",
journal = "Quantum Information and Computation",
issn = "1533-7146",
publisher = "Rinton Press Inc.",
number = "5",

}

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 -