Exact gate sequences for universal quantum computation using the [Formula Presented] interaction alone

Julia Kempe, K. B. Whaley

Research output: Contribution to journalArticle

Abstract

In a previous publication [J. Kempe et al., Quantum Computation and Information (Rinton Press, Princeton, NJ, 2001), Vol. 1, special issue, p. 33] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is nonconstructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single-qubit operations and encoded two-qubit gates. Here we explicitly give the gate sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.

Original languageEnglish (US)
Number of pages1
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume65
Issue number5
DOIs
StatePublished - Jan 1 2002

Fingerprint

quantum computation
Hilbert space
layouts
coding
interactions

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Exact gate sequences for universal quantum computation using the [Formula Presented] interaction alone. / Kempe, Julia; Whaley, K. B.

In: Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 65, No. 5, 01.01.2002.

Research output: Contribution to journalArticle

@article{d94640e896e14ec49f5d7744a8b116b3,
title = "Exact gate sequences for universal quantum computation using the [Formula Presented] interaction alone",
abstract = "In a previous publication [J. Kempe et al., Quantum Computation and Information (Rinton Press, Princeton, NJ, 2001), Vol. 1, special issue, p. 33] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is nonconstructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single-qubit operations and encoded two-qubit gates. Here we explicitly give the gate sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.",
author = "Julia Kempe and Whaley, {K. B.}",
year = "2002",
month = "1",
day = "1",
doi = "10.1103/PhysRevA.65.052330",
language = "English (US)",
volume = "65",
journal = "Physical Review A",
issn = "2469-9926",
publisher = "American Physical Society",
number = "5",

}

TY - JOUR

T1 - Exact gate sequences for universal quantum computation using the [Formula Presented] interaction alone

AU - Kempe, Julia

AU - Whaley, K. B.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - In a previous publication [J. Kempe et al., Quantum Computation and Information (Rinton Press, Princeton, NJ, 2001), Vol. 1, special issue, p. 33] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is nonconstructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single-qubit operations and encoded two-qubit gates. Here we explicitly give the gate sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.

AB - In a previous publication [J. Kempe et al., Quantum Computation and Information (Rinton Press, Princeton, NJ, 2001), Vol. 1, special issue, p. 33] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. To achieve this we used encodings of the states of the computation into a larger Hilbert space. This proof is nonconstructive, however, and did not explicitly give the trade-offs in time that are required to implement encoded single-qubit operations and encoded two-qubit gates. Here we explicitly give the gate sequences needed to simulate these operations on encoded qubits and qutrits (three-level systems) and analyze the trade-offs involved. We also propose a possible layout for the qubits in a triangular arrangement.

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

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

U2 - 10.1103/PhysRevA.65.052330

DO - 10.1103/PhysRevA.65.052330

M3 - Article

AN - SCOPUS:85037178680

VL - 65

JO - Physical Review A

JF - Physical Review A

SN - 2469-9926

IS - 5

ER -