corner
corner
APS » Journals » Phys. Rev. A » Volume 72 » Issue 3
< Previous Article | Next Article >

Phys. Rev. A 72, 032315 (2005) [5 pages]

Compiling gate networks on an Ising quantum computer

Download: PDF (72 kB) Buy this article Export: BibTeX or EndNote (RIS)

M. D. Bowdrey* and J. A. Jones†
Centre for Quantum Computation, Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, United Kingdom

E. Knill‡
Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Boulder Colorado 80305, USA

R. Laflamme§
Institute for Quantum Computing, University of Waterloo, Ontario, Canada, N2L 3G1; Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo, Ontario, Canada, N2L 2Y5

Received 1 June 2005; published 13 September 2005

Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead, the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR, the algorithm is applicable to any design of quantum computer based on Ising couplings.

© 2005 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevA.72.032315
DOI:
10.1103/PhysRevA.72.032315
PACS:
03.67.Lx

*Electronic address: mark.bowdrey@physics.org

†Electronic address: jonathan.jones@qubit.org

‡Electronic address: knill@boulder.nist.gov

§Electronic address: laflamme@iqc.ca

 
< Previous Article | Next Article >