skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Effective Fault-Tolerant Quantum Computation with Slow Measurements

Abstract

How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1000 gate times or more have a very minimal effect on the quantum accuracy threshold. This shows that slow measurement, which appears to be unavoidable in many implementations of quantum computing, poses no essential obstacle to scalability.

Authors:
 [1];  [2]
  1. IBM Research Division, T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York 10598 (United States)
  2. Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125 (United States)
Publication Date:
OSTI Identifier:
20861589
Resource Type:
Journal Article
Resource Relation:
Journal Name: Physical Review Letters; Journal Volume: 98; Journal Issue: 2; Other Information: DOI: 10.1103/PhysRevLett.98.020501; (c) 2007 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ACCURACY; FAULT TOLERANT COMPUTERS; IMPLEMENTATION; QUANTUM COMPUTERS; QUANTUM MECHANICS

Citation Formats

DiVincenzo, David P., and Aliferis, Panos. Effective Fault-Tolerant Quantum Computation with Slow Measurements. United States: N. p., 2007. Web. doi:10.1103/PHYSREVLETT.98.020501.
DiVincenzo, David P., & Aliferis, Panos. Effective Fault-Tolerant Quantum Computation with Slow Measurements. United States. doi:10.1103/PHYSREVLETT.98.020501.
DiVincenzo, David P., and Aliferis, Panos. Fri . "Effective Fault-Tolerant Quantum Computation with Slow Measurements". United States. doi:10.1103/PHYSREVLETT.98.020501.
@article{osti_20861589,
title = {Effective Fault-Tolerant Quantum Computation with Slow Measurements},
author = {DiVincenzo, David P. and Aliferis, Panos},
abstractNote = {How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1000 gate times or more have a very minimal effect on the quantum accuracy threshold. This shows that slow measurement, which appears to be unavoidable in many implementations of quantum computing, poses no essential obstacle to scalability.},
doi = {10.1103/PHYSREVLETT.98.020501},
journal = {Physical Review Letters},
number = 2,
volume = 98,
place = {United States},
year = {Fri Jan 12 00:00:00 EST 2007},
month = {Fri Jan 12 00:00:00 EST 2007}
}
  • A scheme for linear optical implementation of fault-tolerant quantum computation is proposed, which is based on an error-detecting code. Each computational step is mediated by transfer of quantum information into an ancilla system embedding error-detection capability. Photons are assumed to be subjected to both photon loss and depolarization, and the threshold region of their strengths for scalable quantum computation is obtained, together with the amount of physical resources consumed. Compared to currently known results, the present scheme reduces the resource requirement, while yielding a comparable threshold region.
  • In order to use quantum error-correcting codes to improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a theory of fault-tolerant operations on stabilizer codes based on symmetries of the code stabilizer. This allows a straightforward determination of which operations can be performed fault-tolerantly on a given code. I demonstrate that fault-tolerant universal computation is possible for any stabilizer code. I discuss a number of examples in more detail, including the five-quantum-bit code. {copyright} {ital 1998} {ital The American Physical Society}
  • We derive a threshold result for fault-tolerant quantum computation for local non-Markovian noise models. The role of error amplitude in our analysis is played by the product of the elementary gate time t{sub 0} and the spectral width of the interaction Hamiltonian between system and bath. We discuss extensions of our model and the applicability of our analysis.
  • The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which showmore » that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.« less
  • We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which characterizes the scale-up in the size of the circuit due to encoding. We carry out a detailed seminumerical threshold analysis for concatenated coding using the seven-qubit CSS code in the local and the 'nonlocal' setting. First, we find that the threshold in the local model for the [7,1,3] code has a 1/r dependence, which is in correspondence with our analytical estimate. Second, the threshold, beyond the 1/r dependence, does not dependmore » too strongly on the noise levels for transporting qubits. Beyond these results, we find that it is important to look at more than one level of concatenation in order to estimate the threshold and that it may be beneficial in certain places, like in the transportation of qubits, to do error correction only infrequently.« less