Showing papers on "Quantum error correction published in 2001"

A scheme for efficient quantum computation with linear optics.

Abstract: Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

Long-distance quantum communication with atomic ensembles and linear optics

Abstract: Quantum communication holds promise for absolutely secure transmission of secret messages and the faithful transfer of unknown quantum states. Photonic channels appear to be very attractive for the physical implementation of quantum communication. However, owing to losses and decoherence in the channel, the communication fidelity decreases exponentially with the channel length. Here we describe a scheme that allows the implementation of robust quantum communication over long lossy channels. The scheme involves laser manipulation of atomic ensembles, beam splitters, and single-photon detectors with moderate efficiencies, and is therefore compatible with current experimental technology. We show that the communication efficiency scales polynomially with the channel length, and hence the scheme should be operable over very long distances.

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

Abstract: A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We tested one such algorithm by applying it to randomly generated hard instances of an NP-complete problem. For the small examples that we could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.

Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance

Abstract: The number of steps any classical computer requires in order to find the prime factors of an l-digit integer N increases exponentially with l, at least using algorithms known at present. Factoring large integers is therefore conjectured to be intractable classically, an observation underlying the security of widely used cryptographic codes. Quantum computers, however, could factor integers in only polynomial time, using Shor's quantum factoring algorithm. Although important for the study of quantum computers, experimental demonstration of this algorithm has proved elusive. Here we report an implementation of the simplest instance of Shor's algorithm: factorization of N = 15 (whose prime factors are 3 and 5). We use seven spin-1/2 nuclei in a molecule as quantum bits, which can be manipulated with room temperature liquid-state nuclear magnetic resonance techniques. This method of using nuclei to store quantum information is in principle scalable to systems containing many quantum bits, but such scalability is not implied by the present work. The significance of our work lies in the demonstration of experimental and theoretical techniques for precise control and modelling of complex quantum computers. In particular, we present a simple, parameter-free but predictive model of decoherence effects in our system.

Encoding a qubit in an oscillator

Abstract: Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of phase space to protect against errors that shift the values of the canonical variables q and p. In the setting of quantum optics, fault-tolerant universal quantum computation can be executed on the protected code subspace using linear optical operations, squeezing, homodyne detection, and photon counting; however, nonlinear mode coupling is required for the preparation of the encoded states. Finite-dimensional versions of these codes can be constructed that protect encoded quantum information against shifts in the amplitude or phase of a d-state system. Continuous-variable codes can be invoked to establish lower bounds on the quantum capacity of Gaussian quantum channels.

Topological quantum memory

Abstract: We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and encoded quantum operations are associated with nontrivial homology cycles of the surface. We formulate protocols for error recovery, and study the efficacy of these protocols. An order-disorder phase transition occurs in this system at a nonzero critical value of the error rate; if the error rate is below the critical value (the accuracy threshold), encoded information can be protected arbitrarily well in the limit of a large code block. This phase transition can be accurately modeled by a three-dimensional Z_2 lattice gauge theory with quenched disorder. We estimate the accuracy threshold, assuming that all quantum gates are local, that qubits can be measured rapidly, and that polynomial-size classical computations can be executed instantaneously. We also devise a robust recovery procedure that does not require measurement or fast classical processing; however for this procedure the quantum gates are local only if the qubits are arranged in four or more spatial dimensions. We discuss procedures for encoding, measurement, and performing fault-tolerant universal quantum computation with surface codes, and argue that these codes provide a promising framework for quantum computing architectures.

Universal state inversion and concurrence in arbitrary dimensions

Abstract: Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of formation of two qubits in terms of what he calls the concurrence of the joint density operator. Wootters's concurrence is defined with the help of the superoperator that flips the spin of a qubit. We generalize the spin-flip superoperator to a universal inverter, which acts on quantum systems of arbitrary dimension, and we introduce the corresponding generalized concurrence for joint pure states of D-1 X D-2 bipartite quantum systems. We call this generalized concurrence the I concurrence to emphasize its relation to the universal inverter. The universal inverter, which is a positive, but not completely positive superoperator, is closely related to the completely positive universal-NOT superoperator, the quantum analogue of a classical NOT gate. We present a physical realization of the universal-NOT Superoperator.

Entanglement purification for quantum communication

Abstract: The distribution of entangled states between distant locations will be essential for the future large-scale realization of quantum communication schemes such as quantum cryptography1,2 and quantum teleportation3. Because of unavoidable noise in the quantum communication channel, the entanglement between two particles is more and more degraded the further they propagate. Entanglement purification4,5,6,7 is thus essential to distil highly entangled states from less entangled ones. Existing general purification protocols4,5,6 are based on the quantum controlled-NOT (CNOT) or similar quantum logic operations, which are very difficult to implement experimentally. Present realizations of CNOT gates are much too imperfect to be useful for long-distance quantum communication8. Here we present a scheme for the entanglement purification of general mixed entangled states, which achieves 50 per cent of the success probability of schemes based on the CNOT operation, but requires only simple linear optical elements. Because the perfection of such elements is very high, the local operations necessary for purification can be performed with the required precision. Our procedure is within the reach of current technology, and should significantly simplify the implementation of long-distance quantum communication.

Introduction to Quantum Computation and Information

Abstract: From the Publisher: This book aims to provide a pedagogical introduction to the subjects of quantum information and computation. Topics include non-locality of quantum mechanics, quantum computation, quantum cryptography, quantum error correction, fault-tolerant quantum computation as well as some experimental aspects of quantum computation and quantum cryptography. Only knowledge of basic quantum mechanics is assumed. Whenever more advanced concepts and techniques are used, they are introduced carefully. This book is meant to be a self-contained overview. While basic concepts are discussed in detail, unnecessary technical details are excluded. It is well-suited for a wide audience ranging from physics graduate students to advanced researchers.

Robustness of adiabatic quantum computation

Abstract: We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.

Theory of decoherence-free fault-tolerant universal quantum computation

Abstract: Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.

Quantum distribution of Gaussian keys using squeezed states

Abstract: A continuous key-distribution scheme is proposed that relies on a pair of conjugate quantum variables. It allows two remote parties to share a secret Gaussian key by encoding it into one of the two quadrature components of a single-mode electromagnetic field. The resulting quantum cryptographic information versus disturbance trade-off is investigated for an individual attack based on the optimal continuous cloning machine. It is shown that the information gained by the eavesdropper then simply equals the information lost by the receiver.

Quantum algorithms for fermionic simulations

Abstract: We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to be of exponential complexity into one of polynomial complexity. The key to our demonstration is the spin-particle connection (or generalized Jordan-Wigner transformation) that allows exact algebraic invertible mappings of operators with different statistical properties. We give an explicit implementation of a simple problem using a quantum computer based on standard qubits.

Probabilistic quantum logic operations using polarizing beam splitters

Abstract: It has previously been shown that probabilistic quantum logic operations may be performed using linear optical elements, additional photons (ancilla), and post-selection based on the output of single-photon detectors. Here we describe the operation of several quantum logic operations of an elementary nature, including a quantum parity check and a quantum encoder, and we show how they may be combined to implement a controlled-NOT (CNOT) gate. All of these gates may be constructed using polarizing beam splitters that completely transmit one state of polarization and totally reflect the orthogonal state of polarization, which allows a simple explanation of each operation. We also describe a polarizing beam splitter implementation of a CNOT gate that is closely analogous to the quantum teleportation technique previously suggested by Gottesman and Chuang [Nature 402, 390 (1999)]. Finally, our approach has the interesting feature that it makes practical use of a quantum-eraser technique.

Secure quantum key distribution using squeezed states

Abstract: We prove the security of a quantum key distribution scheme based on transmission of squeezed quantum states of a harmonic oscillator. Our proof employs quantum error-correcting codes that encode a finite-dimensional quantum system in the infinite-dimensional Hilbert space of an oscillator, and protect against errors that shift the canonical variables p and q. If the noise in the quantum channel is weak, squeezing signal states by 2.51 dB (a squeeze factor e r = 1.34) is sufficient in principle to ensure the security of a protocol that is suitably enhanced by classical error correction and privacy amplification. Secure key distribution can be achieved over distances comparable to the attenuation length of the quantum channel.

Optimal control of two-level quantum systems

Abstract: We study the manipulation of two-level quantum systems. This research is motivated by the design of quantum mechanical logic gates which perform prescribed logic operations on a two-level quantum system, a quantum bit. We consider the problem of driving the evolution operator to a desired state, while minimizing an energy-type cost. Mathematically, this problem translates into an optimal control problem for systems varying on the Lie group of special unitary matrices of dimension two, with cost that is quadratic in the control. We develop a comprehensive theory of optimal control for two-level quantum systems. This includes, in particular, a classification of normal and abnormal extremals and a proof of regularity of the optimal control functions. The impact of the results of the paper on nuclear magnetic resonance experiments and quantum computation is discussed.

Quantum key distribution using multilevel encoding

Abstract: We extend the original Bennett and Brassard for quantum key distribution protocol by using M mutually complementary bases and N orthogonalvectors in each base.

How powerful is adiabatic quantum computation

Abstract: The authors analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'. Adiabatic quantum computation is a novel paradigm for the design of quantum algorithms; it is truly quantum in the sense that it can be used to speed up searching by a quadratic factor over any classical algorithm. On the question of whether this new paradigm may be used to efficiently solve NP-complete problems on a quantum computer, we show that the usual query complexity arguments cannot be used to rule out a polynomial time solution. On the other hand, we argue that the adiabatic approach may be thought of as a kind of 'quantum local search'. We design a family of minimization problems that is hard for such local search heuristics, and establish an exponential lower bound for the adiabatic algorithm for these problems. This provides insights into the limitations of this approach. It remains an open question whether adiabatic quantum computation can establish an exponential speed-up over traditional computing or if there exists a classical algorithm that can simulate the quantum adiabatic process efficiently.

Maximum efficiency of a linear-optical Bell-state analyzer

Abstract: In a photonic realization of qubits the implementation of quantum logic is rather difficult due to the extremely weak interaction on the few photon level. On the other hand, in these systems interference is available to process the quantum states. We formalize the use of interference by the definition of a simple class of operations which include linear-optical elements, auxiliary states and conditional operations. We investigate an important subclass of these tools, namely linear-optical elements and auxiliary modes in the vacuum state. For these tools, we are able to extend a previous qualitative result, a no-go theorem for perfect Bell-state analyzer on two qubits in polarization entanglement, by a quantitative statement. We show that within this subclass it is not possible to discriminate unambiguously four equiprobable Bell states with a probability higher than 50%.

Selective quantum evolution of a qubit state due to continuous measurement

Abstract: We consider a two-level quantum system (qubit) that is continuously measured by a detector. The information provided by the detector is taken into account to describe the evolution during a particular realization of the measurement process. We discuss the Bayesian formalism for such ``selective'' evolution of an individual qubit and apply it to several solid-state setups. In particular, we show how to suppress qubit decoherence using continuous measurement and a feedback loop.

Implementation of the Quantum Fourier Transform

Abstract: A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure of its efficiency measured through state tomography. Experimentally realizing the QFT is a clear demonstration of the ability of NMR to control quantum systems.

Experimental Realization of Noiseless Subsystems for Quantum Information Processing

Abstract: We demonstrate the protection of one bit of quantum information against all collective noise in three nuclear spins. Because no subspace of states offers this protection, the quantum bit was encoded in a proper noiseless subsystem. We therefore realize a general and efficient method for protecting quantum information. Robustness was verified for a full set of noise operators that do not distinguish the spins. Verification relied on the most complete exploration of engineered decoherence to date. The achieved fidelities show improved information storage for a large, noncommutative set of errors.

Realization of quantum process tomography in NMR

Abstract: Quantum process tomography is a procedure by which the unknown dynamical evolution of an open quantum system can be fully experimentally characterized. We demonstrate explicitly how this procedure can be implemented with a nuclear magnetic resonance quantum computer. This allows us to measure the fidelity of a controlled-NOT logic gate and to experimentally investigate the error model for our computer. Based on the latter analysis, we test an important assumption underlying many models of quantum error correction, the independence of errors on different qubits.

Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state

Abstract: What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model involving only projective measurements, quantum memory, and the ability to prepare the |0> state is also universal for quantum computation. In particular, no coherent unitary dynamics are involved in the computation.

Engineering quantum dynamics

Abstract: The ability to perform measurements on a quantum system, combined with the ability to feed back the measurement results via coherent control, allows one to control the system to follow any desired coherent or incoherent quantum dynamics. Such universal dynamical control can be achieved, in principle, through the repeated application of only two coherent control operations and a simple ``Yes-No'' measurement. As a consequence, a quantum computer can simulate an arbitrary open-system dynamics using just one qubit more than required to simulate closed-system dynamics.

Continuous weak measurement of quantum coherent oscillations

Abstract: We consider the problem of continuous quantum measurement of coherent oscillations between two quantum states of an individual two-state system. It is shown that the interplay between the information acquisition and the backaction dephasing of the oscillations by the detector imposes a fundamental limit, equal to four, on the signal-to-noise ratio of the measurement. The limit is universal, e.g., independent of the coupling strength between the detector and system, and results from the tendency of quantum measurement to localize the system in one of the measured eigenstates.

Double-occupancy errors, adiabaticity, and entanglement of spin qubits in quantum dots

Abstract: Quantum gates that temporarily increase singlet-triplet splitting in order to swap electronic spins in coupled quantum dots lead inevitably to a finite double-occupancy probability for both dots. By solving the time-dependent Schr\"odinger equation for a coupled dot model, we demonstrate that this does not necessarily lead to quantum computation errors. Instead, the coupled dot ground state evolves quasiadiabatically for typical system parameters so that the double-occupancy probability at the completion of swapping is negligibly small. We introduce a measure of entanglement that explicitly takes into account the possibilty of double occupancies and provides a necessary and sufficient criterion for entangled states.

Benchmarking quantum computers: the five-qubit error correcting code.

Abstract: The smallest quantum code that can correct all one-qubit errors is based on five qubits. We experimentally implemented the encoding, decoding, and error-correction quantum networks using nuclear magnetic resonance on a five spin subsystem of labeled crotonic acid. The ability to correct each error was verified by tomography of the process. The use of error correction for benchmarking quantum networks is discussed, and we infer that the fidelity achieved in our experiment is sufficient for preserving entanglement.

Projective Plane and Planar Quantum Codes

Abstract: Cellulations of the projective plane RP ^2 define single qubit topological quantum error correcting codes since there is a unique essential cycle in H 1 (RP 2 ;Z 2 ) . We construct three of the smallest such codes, show they are inequivalent, and identify one of them as Shor's original 9 qubit repetition code. We observe that Shor's code can be constructed in a planar domain and generalize to planar constructions of higher-genus codes for multiple qubits.

Environment-Induced Decoherence and the Transition from Quantum to Classical

Abstract: We study dynamics of quantum open systems, paying special attention to those aspects of their evolution which are relevant to the transition from quantum to classical. We begin with a discussion of the conditional dynamics of simple systems. The resulting models are straightforward but suffice to illustrate basic physical ideas behind quantum measurements and decoherence. To discuss decoherence and environment-induced superselection einselection in a more general setting, we sketch perturbative as well as exact derivations of several master equations valid for various systems. Using these equations we study einselection employing the general strategy of the predictability sieve. Assumptions that are usually made in the discussion of decoherence are critically reexamined along with the ``standard lore'' to which they lead. Restoration of quantum-classical correspondence in systems that are classically chaotic is discussed. The dynamical second law -it is shown- can be traced to the same phenomena that allow for the restoration of the correspondence principle in decohering chaotic systems (where it is otherwise lost on a very short time-scale). Quantum error correction is discussed as an example of an anti-decoherence strategy. Implications of decoherence and einselection for the interpretation of quantum theory are briefly pointed out.