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

J. 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)
Pages (from-to)6
Number of pages1
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume65
Issue number5
DOIs
StatePublished - 2002

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Fingerprint Dive into the research topics of 'Exact gate sequences for universal quantum computation using the [Formula Presented] interaction alone'. Together they form a unique fingerprint.

  • Cite this