arXiv subjects
Publications and source records attributed to Raymond Laflamme.
We report here the experimental realization of multi-step cooling of a quantum system via heat-bath algorithmic cooling. The experiment was carried out using nuclear magnetic resonance (NMR) of a solid-state ensemble three-qubit system.
A three-qubit 13C solid-state nuclear magnetic resonance (NMR) system for quantum information processing, based on the malonic acid molecule, is used to demonstrate high-fidelity universal quantum control via strongly-modulating radio-frequency pulses. This control is achieved in the strong-coupling regime, in which the timescales of selective qubit addressing and of two-qubit interactions are comparable.
We present a unified approach to quantum error correction, called operator quantum error correction. This scheme relies on a generalized notion of noiseless subsystems that is not restricted to the commutant of the interaction algebra. We arrive at the unified approach, which incorporates the known techniques -- i.e. the standard error correction model, the method of decoherence-free subspaces, and the noiseless subsystem method -- as special cases, by combining active error correction with this generalized noiseless subsystem method. Moreover, we demonstrate that the quantum error correction condition from the standard model is a necessary condition for all known methods of quantum error correction.
Quantum information processing using photons has recently been stimulated by the suggestion to use linear optics, single photon sources and detectors. The recent work by Knill has also shown that errors in photon detectors leads to a high error rate threshold (around 29%). An important missing element are good single photon sources. In this paper we show how to make a single photon source using squeezed states, linear optics and conditional measurement. We use degenerate squeezed vacuum states, in contrast to the normal non-degenerate squeezed vacuum states used for single photon production. We show that we can get a photon with certainty when detectors click appropriately, the last event happening up to around 25% of the time. We also show the robustness of this method with respect to a variety of potential imperfections.
Triggered single-photon sources produce the vacuum state with non-negligible probability, but produce a much smaller multiphoton component. It is therefore reasonable to approximate the output of these photon sources as a mixture of the vacuum and single-photon states. We show that it is impossible to increase the probability for a single photon using linear optics and photodetection on fewer than four modes. This impossibility is due to the incoherence of the inputs; if the inputs were pure-state superpositions, it would be possible to obtain a perfect single-photon output. In the more general case, a chain of beam splitters can be used to increase the probability for a single photon, but at the expense of adding an additional multiphoton component. This improvement is robust against detector inefficiencies, but is degraded by dark counts or multiphoton components in the input.
We present an efficient quantum algorithm to measure the average fidelity decay of a quantum map under perturbation using a single bit of quantum information. Our algorithm scales only as the complexity of the map under investigation, so for those maps admitting an efficient gate decomposition, it provides an exponential speed up over known classical procedures. Fidelity decay is important in the study of complex dynamical systems, where it is conjectured to be a signature of quantum chaos. Our result also illustrates the role of chaos in the process of decoherence.
We show that deterministic quantum computing with a single bit (DQC1) can determine whether the classical limit of a quantum system is chaotic or integrable using O(N) physical resources, where $N$ is the dimension of the Hilbert space of the system under study. This is a square root improvement over all known classical procedures. Our study relies strictly on the random matrix conjecture. We also present numerical results for the nonlinear kicked top.
Noiseless subsystems offer a general and efficient method for protecting quantum information in the presence of noise that has symmetry properties. A paradigmatic class of error models displaying non-trivial symmetries emerges under collective noise behavior, which implies a permutationally-invariant interaction between the system and the environment. We describe experiments demonstrating the preservation of a bit of quantum information encoded in a three qubit noiseless subsystem for general collective noise. A complete set of input states is used to determine the super-operator for the implemented one-qubit process and to confirm that the fidelity of entanglement is improved for a large, non-commutative set of engineered errors. To date, this is the largest set of error operators that has been successfully corrected for by any quantum code.
In this essay we discuss the issue of quantum information and recent nuclear magnetic resonance (NMR) experiments. We explain why these experiments should be regarded as quantum information processing (QIP) despite the fact that, in present liquid state NMR experiments, no entanglement is found. We comment on how these experiments contribute to the future of QIP and include a brief discussion on the origin of the power of quantum computers.
Determining the state of a system and measuring properties of its evolution are two of the most important tasks a physicist faces. For the first purpose one can use tomography, a method that after subjecting the system to a number of experiments determines all independent elements of the density matrix. For the second task, one can resort to spectroscopy, a set of techniques used to determine the spectrum of eigenvalues of the evolution operator. In this letter, we show that tomography and spectroscopy can be naturally interpreted as dual forms of quantum computation. We show how to adapt the simplest case of the well-known phase estimation quantum algorithm to perform both tasks, giving it a natural interpretation as a simulated scattering experiment. We show how this algorithm can be used to implement an interesting form of tomography by performing a direct measurement of the Wigner function of a quantum system. We present results of such measurements performed on a system of three qubits using liquid state NMR quantum computation techniques in a sample of trichloroethylene. Remarkable analogies with other experiments are discussed.
The notion of a qubit is ubiquitous in quantum information processing. In spite of the simple abstract definition of qubits as two-state quantum systems, identifying qubits in physical systems is often unexpectedly difficult. There are an astonishing variety of ways in which qubits can emerge from devices. What essential features are required for an implementation to properly instantiate a qubit? We give three typical examples and propose an operational characterization of qubits based on quantum observables and subsystems.
Quantum error correcting codes enable the information contained in a quantum state to be protected from decoherence due to external perturbations. Applied to NMR, quantum coding does not alter normal relaxation, but rather converts the state of a ``data'' spin into multiple quantum coherences involving additional ancilla spins. These multiple quantum coherences relax at differing rates, thus permitting the original state of the data to be approximately reconstructed by mixing them together in an appropriate fashion. This paper describes the operation of a simple, three-bit quantum code in the product operator formalism, and uses geometric algebra methods to obtain the error-corrected decay curve in the presence of arbitrary correlations in the external random fields. These predictions are confirmed in both the totally correlated and uncorrelated cases by liquid-state NMR experiments on 13C-labeled alanine, using gradient-diffusion methods to implement these idealized decoherence models. Quantum error correction in weakly polarized systems requires that the ancilla spins be prepared in a pseudo-pure state relative to the data spin, which entails a loss of signal that exceeds any potential gain through error correction. Nevertheless, this study shows that quantum coding can be used to validate theoretical decoherence mechanisms, and to provide detailed information on correlations in the underlying NMR relaxation dynamics.
Quantum error correction protects quantum information against environmental noise. When using qubits, a measure of quality of a code is the maximum number of errors that it is able to correct. We show that a suitable notion of ``number of errors'' e makes sense for any system in the presence of arbitrary environmental interactions. In fact, the notion is directly related to the lowest order in time with which uncorrectable errors are introduced, and this in turn is derived from a grading of the algebra generated by the interaction operators. As a result, e-error-correcting codes are effective at protecting quantum information without requiring the usual assumptions of independence and lack of correlation. We prove the existence of large codes for both quantum and classical information. By viewing error-correcting codes as subsystems, we relate codes to irreducible representations of certain operator algebras and show that noiseless subsystems are infinite-distance error-correcting codes. An explicit example involving collective interactions is discussed.
In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.
We derive a relationship between two different notions of fidelity (entanglement fidelity and average fidelity) for a completely depolarizing quantum channel. This relationship gives rise to a quantum analog of the MacWilliams identities in classical coding theory. These identities relate the weight enumerator of a code to the one of its dual and, with linear programming techniques, provided a powerful tool to investigate the possible existence of codes. The same techniques can be adapted to the quantum case. We give examples of their power.
One of the main problems for the future of practical quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in the applied operations. Existing proposals for quantum memories and quantum channels require gates with asymptotically zero error to store or transmit an input quantum state for arbitrarily long times or distances with fixed error. In this report a method is given which has the property that to store or transmit a qubit with maximum error $ε$ requires gates with error at most $cε$ and storage or channel elements with error at most $ε$, independent of how long we wish to store the state or how far we wish to transmit it. The method relies on using concatenated quantum codes with hierarchically implemented recovery operations. The overhead of the method is polynomial in the time of storage or the distance of the transmission. Rigorous and heuristic lower bounds for the constant $c$ are given.
We show how to carry out quantum logical operations (controlled-not and Toffoli gates) on encoded qubits for several encodings which protect against various 1-bit errors. This improves the reliability of these operations by allowing one to correct for one bit errors which either preexisted or occurred in course of operation. The logical operations we consider allow one to cary out the vast majority of the steps in the quantum factoring algorithm. Thus, our results help bring quantum factoring and other quantum computations closer to reality