Showing papers on "Quantum error correction published in 2009"

Photonic quantum technologies

Abstract: The first quantum technology that harnesses quantum mechanical effects for its core operation has arrived in the form of commercially available quantum key distribution systems. This technology achieves enhanced security by encoding information in photons such that an eavesdropper in the system can be detected. Anticipated future quantum technologies include large-scale secure networks, enhanced measurement and lithography, and quantum information processors, which promise exponentially greater computational power for particular tasks. Photonics is destined to have a central role in such technologies owing to the high-speed transmission and outstanding low-noise properties of photons. These technologies may use single photons, quantum states of bright laser beams or both, and will undoubtedly apply and drive state-of-the-art developments in photonics.

Quantum computation and quantum-state engineering driven by dissipation

Abstract: In quantum information science, dissipation is commonly viewed as an adverse effect that destroys information through decoherence. But theoretical work shows that dissipation can be used to drive quantum systems to a desired state, and therefore might serve as a resource in quantum computations. The strongest adversary in quantum information science is decoherence, which arises owing to the coupling of a system with its environment1. The induced dissipation tends to destroy and wash out the interesting quantum effects that give rise to the power of quantum computation2, cryptography2 and simulation3. Whereas such a statement is true for many forms of dissipation, we show here that dissipation can also have exactly the opposite effect: it can be a fully fledged resource for universal quantum computation without any coherent dynamics needed to complement it. The coupling to the environment drives the system to a steady state where the outcome of the computation is encoded. In a similar vein, we show that dissipation can be used to engineer a large variety of strongly correlated states in steady state, including all stabilizer codes, matrix product states4, and their generalization to higher dimensions5.

Optical quantum memory

Abstract: Quantum memory is essential for the development of many devices in quantum information processing, including a synchronization tool that matches various processes within a quantum computer, an identity quantum gate that leaves any state unchanged, and a mechanism to convert heralded photons to on-demand photons. In addition to quantum computing, quantum memory will be instrumental for implementing long-distance quantum communication using quantum repeaters. The importance of this basic quantum gate is exemplified by the multitude of optical quantum memory mechanisms being studied, such as optical delay lines, cavities and electromagnetically induced transparency, as well as schemes that rely on photon echoes and the off-resonant Faraday interaction. Here, we report on state-of-the-art developments in the field of optical quantum memory, establish criteria for successful quantum memory and detail current performance levels.

Quantum estimation for quantum technology

Abstract: Several quantities of interest in quantum information, including entanglement and purity, are nonlinear functions of the density matrix and cannot, even in principle, correspond to proper quantum o...

Demonstration of two-qubit algorithms with a superconducting quantum processor

Abstract: By exploiting two key aspects of quantum mechanics — the superposition and entanglement of physical states — quantum computers may eventually outperform their classical equivalents. A team based at Yale has achieved an important step towards that goal — the demonstration of the first solid-state quantum processor, which was used to execute two quantum algorithms. Quantum processors based on a few quantum bits have been demonstrated before using nuclear magnetic resonance, cold ion traps and optical systems, all of which bear little resemblance to conventional computers. This new processor is based on superconducting quantum circuits fabricated using conventional nanofabrication technology. There is still a long way to go before quantum computers can challenge the classical type. The processor is very basic, containing just two quantum bits, and operates at a fraction of a degree above absolute zero. But the chip contains all the essential features of a miniature working quantum computer and may prove scalable to more quantum bits and more complex algorithms. Quantum computers, which harness the superposition and entanglement of physical states, hold great promise for the future. Here, the demonstration of a two-qubit superconducting processor and the implementation of quantum algorithms, represents an important step in quantum computing. Quantum computers, which harness the superposition and entanglement of physical states, could outperform their classical counterparts in solving problems with technological impact—such as factoring large numbers and searching databases1,2. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized register of qubits, which coherently evolves into a final state containing the result of the computation. Building a quantum processor is challenging because of the need to meet simultaneously requirements that are in conflict: state preparation, long coherence times, universal gate operations and qubit readout. Processors based on a few qubits have been demonstrated using nuclear magnetic resonance3,4,5, cold ion trap6,7 and optical8 systems, but a solid-state realization has remained an outstanding challenge. Here we demonstrate a two-qubit superconducting processor and the implementation of the Grover search and Deutsch–Jozsa quantum algorithms1,2. We use a two-qubit interaction, tunable in strength by two orders of magnitude on nanosecond timescales, which is mediated by a cavity bus in a circuit quantum electrodynamics architecture9,10. This interaction allows the generation of highly entangled states with concurrence up to 94 per cent. Although this processor constitutes an important step in quantum computing with integrated circuits, continuing efforts to increase qubit coherence times, gate performance and register size will be required to fulfil the promise of a scalable technology.

Universal Computation by Quantum Walk

Abstract: In some of the earliest work on quantum computing, Feynman showed how to implement universal quantum computation with a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any quantum computation encoded in some graph. The main idea is to implement quantum gates by scattering processes.

Synthesizing arbitrary quantum states in a superconducting resonator

Abstract: The superposition principle is a fundamental tenet of quantum mechanics, allowing a quantum system to be 'in two places at the same time'. The preparation and use of superposed states forms the basis of quantum computation and simulation. Max Hofheinz and colleagues now demonstrate the technically challenging preparation and measurement of arbitrary quantum states in an electromagnetic resonator. States with different numbers of photons are superposed in a completely controlled and deterministic manner. The superposition principle is a fundamental tenet of quantum mechanics, allowing a quantum system to be 'in two places at the same time'. Here, the preparation and measurement of arbitrary quantum states in an electromagnetic resonator is demonstrated; states with different numbers of photons are superposed in a completely controlled and deterministic manner. The superposition principle is a fundamental tenet of quantum mechanics. It allows a quantum system to be ‘in two places at the same time’, because the quantum state of a physical system can simultaneously include measurably different physical states. The preparation and use of such superposed states forms the basis of quantum computation and simulation1. The creation of complex superpositions in harmonic systems (such as the motional state of trapped ions2, microwave resonators3,4,5 or optical cavities6) has presented a significant challenge because it cannot be achieved with classical control signals. Here we demonstrate the preparation and measurement of arbitrary quantum states in an electromagnetic resonator, superposing states with different numbers of photons in a completely controlled and deterministic manner. We synthesize the states using a superconducting phase qubit to phase-coherently pump photons into the resonator, making use of an algorithm7 that generalizes a previously demonstrated method of generating photon number (Fock) states in a resonator8. We completely characterize the resonator quantum state using Wigner tomography, which is equivalent to measuring the resonator’s full density matrix.

Measurement-based quantum computation

Abstract: Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics are harnessed and exploited. A number of models of quantum computation exist. These models have been shown to be formally equivalent, but their underlying elementary concepts and the requirements for their practical realization can differ significantly. A particularly exciting paradigm is that of measurement-based quantum computation, where the processing of quantum information takes place by rounds of simple measurements on qubits prepared in a highly entangled state. We review recent developments in measurement-based quantum computation with a view to both fundamental and practical issues, in particular the power of quantum computation, the protection against noise (fault tolerance) and steps towards experimental realization. Finally, we highlight a number of connections between this field and other branches of physics and mathematics. So-called one-way schemes have emerged as a powerful model to describe and implement quantum computation. This article reviews recent progress, highlights connections to other areas of physics and discusses future directions.

Simplifying quantum logic using higher-dimensional Hilbert spaces

Abstract: Quantum computation promises to solve fundamental, yet otherwise intractable, problems across a range of active fields of research. Recently, universal quantum logic-gate sets—the elemental building blocks for a quantum computer—have been demonstrated in several physical architectures. A serious obstacle to a full-scale implementation is the large number of these gates required to build even small quantum circuits. Here, we present and demonstrate a general technique that harnesses multi-level information carriers to significantly reduce this number, enabling the construction of key quantum circuits with existing technology. We present implementations of two key quantum circuits: the three-qubit Toffoli gate and the general two-qubit controlled-unitary gate. Although our experiment is carried out in a photonic architecture, the technique is independent of the particular physical encoding of quantum information, and has the potential for wider application.

Simple pulses for elimination of leakage in weakly nonlinear qubits.

Abstract: In realizations of quantum computing, a two-level system (qubit) is often singled out from the many levels of an anharmonic oscillator. In these cases, simple qubit control fails on short time scales because of coupling to leakage levels. We provide an easy to implement analytic formula that inhibits this leakage from any single-control analog or pixelated pulse. It is based on adding a second control that is proportional to the time derivative of the first. For realistic parameters of superconducting qubits, this strategy reduces the error by an order of magnitude relative to the state of the art, all based on smooth and feasible pulse shapes. These results show that even weak anharmonicity is sufficient and in general not a limiting factor for implementing quantum gates.

Robustness of quantum discord to sudden death

Abstract: We calculate the dissipative dynamics of two-qubit quantum discord under Markovian environments. We analyze various dissipative channels such as dephasing, depolarizing, and generalized amplitude damping, assuming independent perturbation, in which each qubit is coupled to its own channel. Choosing initial conditions that manifest the so-called sudden death of entanglement, we compare the dynamics of entanglement with that of quantum discord. We show that in all cases where entanglement suddenly disappears, quantum discord vanishes only in the asymptotic limit, behaving similarly to individual decoherence of the qubits, even at finite temperatures. Hence, quantum discord is more robust than the entanglement against decoherence so that quantum algorithms based only on quantum discord correlations may be more robust than those based on entanglement.

Optimized dynamical decoupling in a model quantum memory

Abstract: Any quantum system, such as those used in quantum information or magnetic resonance, is subject to random phase errors that can dramatically affect the fidelity of a desired quantum operation or measurement. In the context of quantum information, quantum error correction techniques have been developed to correct these errors, but resource requirements are extraordinary. The realization of a physically tractable quantum information system will therefore be facilitated if qubit (quantum bit) error rates are far below the so-called fault-tolerance error threshold, predicted to be of the order of 10(-3)-10(-6). The need to realize such low error rates motivates a search for alternative strategies to suppress dephasing in quantum systems. Here we experimentally demonstrate massive suppression of qubit error rates by the application of optimized dynamical decoupling pulse sequences, using a model quantum system capable of simulating a variety of qubit technologies. We demonstrate an analytically derived pulse sequence, UDD, and find novel sequences through active, real-time experimental feedback. The latter sequences are tailored to maximize error suppression without the need for a priori knowledge of the ambient noise environment, and are capable of suppressing errors by orders of magnitude compared to other existing sequences (including the benchmark multi-pulse spin echo). Our work includes the extension of a treatment to predict qubit decoherence under realistic conditions, yielding strong agreement between experimental data and theory for arbitrary pulse sequences incorporating nonidealized control pulses. These results demonstrate the robustness of qubit memory error suppression through dynamical decoupling techniques across a variety of qubit technologies.

Theoretical framework for quantum networks

Abstract: We present a framework to treat quantum networks and all possible transformations thereof, including as special cases all possible manipulations of quantum states, measurements, and channels, such as, e.g., cloning, discrimination, estimation, and tomography. Our framework is based on the concepts of quantum comb---which describes all transformations achievable by a given quantum network---and link product---the operation of connecting two quantum networks. Quantum networks are treated both from a constructive point of view---based on connections of elementary circuits---and from an axiomatic one---based on a hierarchy of admissible quantum maps. In the axiomatic context a fundamental property is shown, which we call universality of quantum memory channels: any admissible transformation of quantum networks can be realized by a suitable sequence of memory channels. The open problem whether this property fails for some nonquantum theory, e.g., for no-signaling boxes, is posed.

An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation

Abstract: Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences from the theory of classical error-correcting codes. Many quantum codes can be described in terms of the stabilizer of the codewords. The stabilizer is a finite Abelian group, and allows a straightforward characterization of the error-correcting properties of the code. The stabilizer formalism for quantum codes also illustrates the relationships to classical coding theory, particularly classical codes over GF(4), the finite field with four elements. To build a quantum computer which behaves correctly in the presence of errors, we also need a theory of fault-tolerant quantum computation, instructing us how to perform quantum gates on qubits which are encoded in a quantum error-correcting code. The threshold theorem states that it is possible to create a quantum computer to perform an arbitrary quantum computation provided the error rate per physical gate or time step is below some constant threshold value.

Classical and quantum correlations under decoherence

Abstract: Recently some authors have pointed out that there exist nonclassical correlations which are more general, and possibly more fundamental, than entanglement. For these general quantum correlations and their classical counterparts, under the action of decoherence, we identify three general types of dynamics that include a peculiar sudden change in their decay rates. We show that, under suitable conditions, the classical correlation is unaffected by decoherence. Such dynamic behavior suggests an operational measure of both classical and quantum correlations that can be computed without any extremization procedure.

High-threshold universal quantum computation on the surface code

Abstract: We present a comprehensive and self-contained simplified review of the quantum computing scheme of Raussendorf et al. [Phys. Rev. Lett. 98, 190504 (2007); N. J. Phys. 9, 199 (2007)], which features a two-dimensional nearest-neighbor coupled lattice of qubits, a threshold error rate approaching 1%, natural asymmetric and adjustable strength error correction, and low overhead arbitrarily long-range logical gates. These features make it one of the best and most practical quantum computing schemes devised to date. We restrict the discussion to direct manipulation of the surface code using the stabilizer formalism, both of which we also briefly review, to make the scheme accessible to a broad audience.

Quantum walk of a trapped ion in phase space.

Abstract: We implement the proof of principle for the quantum walk of one ion in a linear ion trap. With a single-step fidelity exceeding 0.99, we perform three steps of an asymmetric walk on the line. We clearly reveal the differences to its classical counterpart if we allow the walker or ion to take all classical paths simultaneously. Quantum interferences enforce asymmetric, nonclassical distributions in the highly entangled degrees of freedom (of coin and position states). We theoretically study and experimentally observe the limitation in the number of steps of our approach that is imposed by motional squeezing. We propose an altered protocol based on methods of impulsive steps to overcome these restrictions, allowing to scale the quantum walk to many, in principal to several hundreds of steps.

Repetitive Readout of a Single Electronic Spin via Quantum Logic with Nuclear Spin Ancillae

Abstract: Robust measurement of single quantum bits plays a key role in the realization of quantum computation and communication as well as in quantum metrology and sensing. We have implemented a method for the improved readout of single electronic spin qubits in solid-state systems. The method makes use of quantum logic operations on a system consisting of a single electronic spin and several proximal nuclear spin ancillae in order to repetitively readout the state of the electronic spin. Using coherent manipulation of a single nitrogen vacancy center in room-temperature diamond, full quantum control of an electronic-nuclear system consisting of up to three spins was achieved. We took advantage of a single nuclear-spin memory in order to obtain a 10-fold enhancement in the signal amplitude of the electronic spin readout. We also present a two-level, concatenated procedure to improve the readout by use of a pair of nuclear spin ancillae, an important step toward the realization of robust quantum information processors using electronic- and nuclear-spin qubits. Our technique can be used to improve the sensitivity and speed of spin-based nanoscale diamond magnetometers.

Universal quantum control of two-electron spin quantum bits using dynamic nuclear polarization

Abstract: One fundamental requirement for quantum computation is to carry out universal manipulations of quantum bits at rates much faster than the qubit’s rate of decoherence. Recently, fast gate operations have been demonstrated in logical spin qubits composed of two electron spins where the rapid exchange of the two electrons permits electrically controllable rotations around one axis of the qubit. However, universal control of the qubit requires arbitrary rotations around at least two axes. Here, we show that by subjecting each electron spin to a magnetic field of different magnitude, we achieve full quantum control of the two-electron logical spin qubit with nanosecond operation times. Using a single device, a magnetic-field gradient of several hundred millitesla is generated and sustained using dynamic nuclear polarization of the underlying Ga and As nuclei. Universal control of the two-electron qubit is then demonstrated using quantum state tomography. The presented technique provides the basis for single- and potentially multiple-qubit operations with gate times that approach the threshold required for quantum error correction. The spin state of two electrons in a double well is a promising qubit. Now, such qubits can be arbitrarily rotated around two different axes by applying a magnetic field of different magnitude to each electron. This can be done in nanoseconds, before the stored information is lost.

Restrictions on Transversal Encoded Quantum Gate Sets

Abstract: Transversal gates play an important role in the theory of fault-tolerant quantum computation due to their simplicity and robustness to noise. By definition, transversal operators do not couple physical subsystems within the same code block. Consequently, such operators do not spread errors within code blocks and are, therefore, fault tolerant. Nonetheless, other methods of ensuring fault tolerance are required, as it is invariably the case that some encoded gates cannot be implemented transversally. This observation has led to a long-standing conjecture that transversal encoded gate sets cannot be universal. Here we show that the ability of a quantum code to detect an arbitrary error on any single physical subsystem is incompatible with the existence of a universal, transversal encoded gate set for the code.

Realization of the quantum Toffoli gate with trapped ions

Abstract: Gates acting on more than two qubits are appealing as they can substitute complex sequences of two-qubit gates, thus promising faster execution and higher fidelity. One important multiqubit operation is the quantum Toffoli gate that performs a controlled NOT operation on a target qubit depending on the state of two control qubits. Here we present the first experimental realization of the quantum Toffoli gate in an ion trap quantum computer, achieving a mean gate fidelity of 71(3)%. Our implementation is particularly efficient as the relevant logic information is directly encoded in the motion of the ion string.

Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation

Abstract: We present a continuous-variable quantum key distribution protocol combining a discrete modulation and reverse reconciliation. This protocol is proven unconditionally secure and allows the distribution of secret keys over long distances, thanks to a reverse reconciliation scheme efficient at very low signal-to-noise ratio.

Quantum repeater with encoding

Abstract: We propose an approach to implement quantum repeaters for long-distance quantum communication. Our protocol generates a backbone of encoded Bell pairs and uses the procedure of classical error correction during simultaneous entanglement connection. We illustrate that the repeater protocol with simple Calderbank-Shor-Steane encoding can significantly extend the communication distance, while still maintaining a fast key generation rate.

The mother of all protocols: restructuring quantum information’s family tree

Abstract: We give a simple, direct proof of the ‘mother’ protocol of quantum information theory. In this new formulation, it is easy to see that the mother, or rather her generalization to the fully quantum Slepian–Wolf protocol, simultaneously accomplishes two goals: quantum communication-assisted entanglement distillation and state transfer from the sender to the receiver. As a result, in addition to her other ‘children’, the mother protocol generates the state-merging primitive of Horodecki, Oppenheim and Winter, a fully quantum reverse Shannon theorem, and a new class of distributed compression protocols for correlated quantum sources which are optimal for sources described by separable density operators. Moreover, the mother protocol described here is easily transformed into the so-called ‘father’ protocol whose children provide the quantum capacity and the entanglement-assisted capacity of a quantum channel, demonstrating that the division of single-sender/single-receiver protocols into two families was unnecessary: all protocols in the family are children of the mother.

Dispersive regime of circuit QED : Photon-dependent qubit dephasing and relaxation rates

Abstract: Superconducting electrical circuits can be used to study the physics of cavity quantum electrodynamics (QED) in new regimes, therefore realizing circuit QED. For quantum-information processing and quantum optics, an interesting regime of circuit QED is the dispersive regime, where the detuning between the qubit transition frequency and the resonator frequency is much larger than the interaction strength. In this paper, we investigate how nonlinear corrections to the dispersive regime affect the measurement process. We find that in the presence of pure qubit dephasing, photon population of the resonator used for the measurement of the qubit act as an effective heat bath, inducing incoherent relaxation and excitation of the qubit. Measurement thus induces both dephasing and mixing of the qubit, something that can reduce the quantum nondemolition aspect of the readout. Using quantum trajectory theory, we show that this heat bath can induce quantum jumps in the qubit state. Nonlinear effects can also reduce the achievable signal-to-noise ratio of a homodyne measurement of the voltage.

Emulation of a quantum spin with a superconducting phase qudit.

Abstract: At the heart of a quantum computer is the device on which information is to be encoded. This is typically done with a qubit, a two-level quantum system analogous to the two-level bit that encodes 0 and 1 in classical computers. However, there need not be just two quantum energy levels. There could be three (a qutrit), or more generally, d -levels (a qudit) in the device. Neeley et al. (p. [722][1]; see the Perspective by [Nori][2] ) demonstrate a five-level quantum device and show that their qudit can be used to emulate the processes involved in manipulating quantum spin. The use of multilevel qudits may also have potential in quantum information processing by simplifying certain computational tasks and simplifying the circuitry required to realize the quantum computer itself. [1]: /lookup/volpage/325/722 [2]: /lookup/doi/10.1126/science.1178828

No-go theorem for gaussian quantum error correction.

Abstract: We prove that Gaussian operations are of no use for protecting Gaussian states against Gaussian errors in quantum communication protocols. Specifically, we introduce a new quantity characterizing any single-mode Gaussian channel, called entanglement degradation, and show that it cannot decrease via Gaussian encoding and decoding operations only. The strength of this no-go theorem is illustrated with some examples of Gaussian channels.

Quantum Computational Complexity

Abstract: This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of quantum complexity classes based on these notions, such as BQP, QMA, and QIP, are presented. Other topics in quantum complexity, including quantum advice, space-bounded quantum computation, and bounded-depth quantum circuits, are also discussed.

Quantum phase estimation with lossy interferometers

Abstract: We give a detailed discussion of optimal quantum states for optical two-mode interferometry in the presence of photon losses. We derive analytical formulae for the precision of phase estimation obtainable using quantum states of light with a definite photon number and prove that maximization of the precision is a convex optimization problem. The corresponding optimal precision, i.e., the lowest possible uncertainty, is shown to beat the standard quantum limit thus outperforming classical interferometry. Furthermore, we discuss more general inputs: states with indefinite photon number and states with photons distributed between distinguishable time bins. We prove that neither of these is helpful in improving phase estimation precision.

Quantum Error Correction for Beginners

Abstract: Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspect of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. This development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed examples, which are more relevant to experimentalists today and in the near future.