Biomedical subjects

E Knill

Publications and source records attributed to E Knill.

At least 19 recordsLinked to original sources

PubMed2006

Experimental purification of two-atom entanglement.

Entanglement is a necessary resource for quantum applications--entanglement established between quantum systems at different locations enables private communication and quantum teleportation, and facilitates quantum information processing. Distributed entanglement is established by preparing an entangled pair of quantum particles in one location, and transporting one member of the pair to another location. However, decoherence during transport reduces the quality (fidelity) of the entanglement. A protocol to achieve entanglement 'purification' has been proposed to improve the fidelity after transport. This protocol uses separate quantum operations at each location and classical communication to distil high-fidelity entangled pairs from lower-fidelity pairs. Proof-of-principle experiments distilling entangled photon pairs have been carried out. However, these experiments obtained distilled pairs with a low probability of success and required destruction of the entangled pairs, rendering them unavailable for further processing. Here we report efficient and non-destructive entanglement purification with atomic quantum bits. Two noisy entangled pairs were created and distilled into one higher-fidelity pair available for further use. Success probabilities were above 35 per cent. The many applications of entanglement purification make it one of the most important techniques in quantum information processing.

Journal Article↗

PubMed2005

Creation of a six-atom 'Schrödinger cat' state.

Among the classes of highly entangled states of multiple quantum systems, the so-called 'Schrödinger cat' states are particularly useful. Cat states are equal superpositions of two maximally different quantum states. They are a fundamental resource in fault-tolerant quantum computing and quantum communication, where they can enable protocols such as open-destination teleportation and secret sharing. They play a role in fundamental tests of quantum mechanics and enable improved signal-to-noise ratios in interferometry. Cat states are very sensitive to decoherence, and as a result their preparation is challenging and can serve as a demonstration of good quantum control. Here we report the creation of cat states of up to six atomic qubits. Each qubit's state space is defined by two hyperfine ground states of a beryllium ion; the cat state corresponds to an entangled equal superposition of all the atoms in one hyperfine state and all atoms in the other hyperfine state. In our experiments, the cat states are prepared in a three-step process, irrespective of the number of entangled atoms. Together with entangled states of a different class created in Innsbruck, this work represents the current state-of-the-art for large entangled states in any qubit system.

Journal Article↗

PubMed2005

Implementation of the semiclassical quantum Fourier transform in a scalable system.

We report the implementation of the semiclassical quantum Fourier transform in a system of three beryllium ion qubits (two-level quantum systems) confined in a segmented multizone trap. The quantum Fourier transform is the crucial final step in Shor's algorithm, and it acts on a register of qubits to determine the periodicity of the quantum state's amplitudes. Because only probability amplitudes are required for this task, a more efficient semiclassical version can be used, for which only single-qubit operations conditioned on measurement outcomes are required. We apply the transform to several input states of different periodicities; the results enable the location of peaks corresponding to the original periods. This demonstration incorporates the key elements of a scalable ion-trap architecture, suggesting the future capability of applying the quantum Fourier transform to a large number of qubits as required for a useful quantum factoring algorithm.

Journal Article↗

PubMed2005

Quantum computing with realistically noisy devices.

In theory, quantum computers offer a means of solving problems that would be intractable on conventional computers. Assuming that a quantum computer could be constructed, it would in practice be required to function with noisy devices called 'gates'. These gates cause decoherence of the fragile quantum states that are central to the computer's operation. The goal of so-called 'fault-tolerant quantum computing' is therefore to compute accurately even when the error probability per gate (EPG) is high. Here we report a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent. Such EPGs have been experimentally demonstrated, but to avoid excessive resource overheads required by the necessary architecture, lower EPGs are needed. Assuming the availability of quantum resources comparable to the digital resources available in today's computers, we show that non-trivial quantum computations at EPGs of as high as one per cent could be implemented.

Journal Article↗

PubMed2005

Enhanced quantum state detection efficiency through quantum information processing.

We investigate theoretically and experimentally how quantum state-detection efficiency is improved by the use of quantum information processing (QIP). Experimentally, we encode the state of one 9Be(+) ion qubit with one additional ancilla qubit. By measuring both qubits, we reduce the state-detection error in the presence of noise. The deviation from the theoretically allowed reduction is due to infidelities of the QIP operations. Applying this general scheme to more ancilla qubits suggests that error in the individual qubit measurements need not be a limit to scalable quantum computation.

Journal Article↗

PubMed2004

Realization of quantum error correction.

Scalable quantum computation and communication require error control to protect quantum information against unavoidable noise. Quantum error correction protects information stored in two-level quantum systems (qubits) by rectifying errors with operations conditioned on the measurement outcomes. Error-correction protocols have been implemented in nuclear magnetic resonance experiments, but the inherent limitations of this technique prevent its application to quantum information processing. Here we experimentally demonstrate quantum error correction using three beryllium atomic-ion qubits confined to a linear, multi-zone trap. An encoded one-qubit state is protected against spin-flip errors by means of a three-qubit quantum error-correcting code. A primary ion qubit is prepared in an initial state, which is then encoded into an entangled state of three physical qubits (the primary and two ancilla qubits). Errors are induced simultaneously in all qubits at various rates. The encoded state is decoded back to the primary ion one-qubit state, making error information available on the ancilla ions, which are separated from the primary ion and measured. Finally, the primary qubit state is corrected on the basis of the ancillae measurement outcome. We verify error correction by comparing the corrected final state to the uncorrected state and to the initial state. In principle, the approach enables a quantum state to be maintained by means of repeated error correction, an important step towards scalable fault-tolerant quantum computation using trapped ions.

Journal Article↗

PubMed2004

Deterministic quantum teleportation of atomic qubits.

Quantum teleportation provides a means to transport quantum information efficiently from one location to another, without the physical transfer of the associated quantum-information carrier. This is achieved by using the non-local correlations of previously distributed, entangled quantum bits (qubits). Teleportation is expected to play an integral role in quantum communication and quantum computation. Previous experimental demonstrations have been implemented with optical systems that used both discrete and continuous variables, and with liquid-state nuclear magnetic resonance. Here we report unconditional teleportation of massive particle qubits using atomic (9Be+) ions confined in a segmented ion trap, which aids individual qubit addressing. We achieve an average fidelity of 78 per cent, which exceeds the fidelity of any protocol that does not use entanglement. This demonstration is also important because it incorporates most of the techniques necessary for scalable quantum information processing in an ion-trap system.

Journal Article↗

PubMed2003

Optical pumping of quantum-dot nuclear spins.

Hyperfine interactions with randomly oriented nuclear spins present a fundamental decoherence mechanism for electron spin in a quantum dot, that can be suppressed by polarizing the nuclear spins. Here, we analyze an all-optical scheme that uses hyperfine interactions to implement laser cooling of quantum-dot nuclear spins. The limitation imposed on spin cooling by the dark states for collective spin relaxation can be overcome by modulating the electron wave function.

Journal Article↗

PubMed2001

Experimental realization of noiseless subsystems for quantum information processing.

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.

Journal Article↗

PubMed2001

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

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.

Journal Article↗

PubMed2001

A scheme for efficient quantum computation with linear optics.

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.

Journal Article↗

PubMed2000

Dynamical generation of noiseless quantum subsystems

We combine dynamical decoupling and universal control methods for open quantum systems with coding procedures. By exploiting a general algebraic approach, we show how appropriate encodings of quantum states result in obtaining universal control over dynamically generated noise-protected subsystems with limited control resources. In particular, we provide a constructive scheme based on two-body Hamiltonians for performing universal quantum computation over large noiseless spaces which can be engineered in the presence of arbitrary linear quantum noise.

Journal Article↗

PubMed2000

An algorithmic benchmark for quantum information processing

Quantum information processing offers potentially great advantages over classical information processing, both for efficient algorithms and for secure communication. Therefore, it is important to establish that scalable control of a large number of quantum bits (qubits) can be achieved in practice. There are a rapidly growing number of proposed device technologies for quantum information processing. Of these technologies, those exploiting nuclear magnetic resonance (NMR) have been the first to demonstrate non-trivial quantum algorithms with small numbers of qubits. To compare different physical realizations of quantum information processors, it is necessary to establish benchmark experiments that are independent of the underlying physical system, and that demonstrate reliable and coherent control of a reasonable number of qubits. Here we report an experimental realization of an algorithmic benchmark using an NMR technique that involves coherent manipulation of seven qubits. Moreover, our experimental procedure can be used as a reliable and efficient method for creating a standard pseudopure state, the first step for implementing traditional quantum algorithms in liquid state NMR systems. The benchmark and the techniques can be adapted for use with other proposed quantum devices.

Journal Article↗

PubMed2000

Theory of quantum error correction for general noise

A measure of quality of an error-correcting 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 quantum or classical system in the presence of arbitrary interactions. Thus, e-error-correcting codes protect information without requiring the usual assumptions of independence. 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 operator algebras and show that noiseless subsystems are infinite-distance error-correcting codes.

Journal Article↗

PubMed2000

Effect of transferring 1-aminocyclopropane-1-carboxylic acid (ACC) deaminase genes into Pseudomonas fluorescens strain CHA0 and its gacA derivative CHA96 on their growth-promoting and disease-suppressive capacities.

Pseudomonas fluorescens strain CHA0, a root colonizing bacterium, has a broad spectrum of biocontrol activity against plant diseases. However, strain CHA0 is unable to utilize 1-aminocyclopropane-1-carboxylic acid (ACC), the immediate precursor of plant ethylene, as a sole source of nitrogen. This suggests that CHA0 does not contain the enzyme ACC deaminase, which cleaves ACC to ammonia and alpha-ketobutyrate, and was previously shown to promote root elongation of plant seedlings treated with bacteria containing this enzyme. An ACC deaminase gene, together with its regulatory region, was transferred into P. fluorescens strains CHA0 and CHA96, a global regulatory gacA mutant of CHA0. ACC deaminase activity was expressed in both CHA0 and CHA96. Transformed strains with ACC deaminase activity increased root length of canola plants under gnotobiotic conditions, whereas strains without this activity had no effect. Introduction of ACC deaminase genes into strain CHA0 improved its ability to protect cucumber against Pythium damping-off, and potato tubers against Erwinia soft rot in small hermetically sealed containers. In contrast, ACC deaminase activity had no significant effect on the ability of CHA0 to protect tomato against Fusarium crown and root rot, and potato tubers against soft rot in large hermetically sealed containers. These results suggest that (i) ACC deaminase activity may have lowered the level of plant ethylene thereby increasing root length; (ii) the role of stress-generated plant ethylene in susceptibility or resistance depends on the host-pathogen system, and on the experimental conditions used; and (iii) the constructed strains could be developed as biosensors for the role of ethylene in plant diseases.

Bacterial Proteins↗

PubMed1999

Efficient refocusing of one-spin and two-spin interactions for NMR quantum computation.

The use of spin echoes to refocus one-spin interactions (chemical shifts) and two-spin interactions (spin-spin couplings) plays a central role in both conventional NMR experiments and NMR quantum computation. Here we describe schemes for efficient refocusing of such interactions in both fully and partially coupled spin systems.

Magnetic Resonance Spectroscopy↗

PubMed1996

Interpretation of pooling experiments using the Markov chain Monte Carlo method.

This paper describes an effective method for extracting as much information as possible from pooling experiments for library screening. Pools are collections of clones, and screening a pool with a probe determines whether any of these clones are positive for the probe. The results of the pool screenings are interpreted, or decoded, to infer which clones are candidates to be positive. These candidate positives are subjected to confirmatory testing. Decoding the pool screening results is complicated by the presence of errors, which typically lead to ambiguities in the inference of positive clones. However, in many applications there are reasonable models for the prior distributions for positives and for errors, and Bayes inference is the preferred method for ranking candidate positives. Because of the combinatoric complexity of the Bayes formulation, we implemented a decoding algorithm using a Markov chain Monte Carlo method. The algorithm was used in screening a library with 1298 clones using 47 pools. We corroborated the posterior probabilities for positives with results from confirmatory screening. We also simulated the screening of a 10-fold coverage library of 33,000 clones using 253 pools. The use of our algorithm, effective under conditions where combinatorial decoding techniques are imprudent, allows the use of fewer pools and also introduces needed robustness.

Algorithms↗

PubMed1995

Efficient pooling designs for library screening.

We describe efficient methods for screening clone libraries, based on pooling schemes that we call "random k-sets designs." In these designs, the pools in which any clone occurs are equally likely to be any possible selection of k from the v pools. The values of k and v can be chosen to optimize desirable properties. Random k-sets designs have substantial advantages over alternative pooling schemes: they are efficient, flexible, and easy to specify, require fewer pools, and have error-correcting and error-detecting capabilities. In addition, screening can often be achieved in only one pass, thus facilitating automation. For design comparison, we assume a binomial distribution for the number of "positive" clones, with parameters n, the number of clones, and c, the coverage. We propose the expected number of resolved positive clones--clones that are definitely positive based upon the pool assays--as a criterion for the efficiency of a pooling design. We determine the value of k that is optimal, with respect to this criterion, as a function of v, n, and c. We also describe superior k-sets designs called k-sets packing designs. As an illustration, we discuss a robotically implemented design for a 2.5-fold-coverage, human chromosome 16 YAC library of n = 1298 clones. We also estimate the probability that each clone is positive, given the pool-assay data and a model for experimental errors.

Binomial Distribution↗