arXiv subjects

E. Knill

Publications and source records attributed to E. Knill.

At least 37 records · Page 2Linked to original sources

arXiv2008

Liquid State NMR as a Test-bed for Developing Quantum Control Methods

In building a quantum information processor (QIP), the challenge is to coherently control a large quantum system well enough to perform an arbitrary quantum algorithm and to be able to correct errors induced by decoherence. Nuclear magnetic resonance (NMR) QIPs offer an excellent test-bed on which to develop and benchmark tools and techniques to control quantum systems. Two main issues to consider when designing control methods are accuracy and efficiency, for which two complementary approaches have been developed so far to control qubit registers with liquid-state NMR methods. The first applies optimal control theory to numerically optimize the control fields to implement unitary operations on low dimensional systems with high fidelity. The second technique is based on the efficient optimization of a sequence of imperfect control elements so that implementation of a full quantum algorithm is possible while minimizing error accumulation. This article summarizes our work in implementing both of these methods. Furthermore, we show that taken together, they form a basis to design quantum-control methods for a block-architecture QIP so that large system size is not a barrier to implementing optimal control techniques.

quant-ph↗

arXiv2007

Transport quantum logic gates for trapped ions

Many efforts are currently underway to build a device capable of large scale quantum information processing (QIP). Whereas QIP has been demonstrated for a few qubits in several systems, many technical difficulties must be overcome in order to construct a large-scale device. In one proposal for large-scale QIP, trapped ions are manipulated by precisely controlled light pulses and moved through and stored in multizone trap arrays. The technical overhead necessary to precisely control both the ion geometrical configurations and the laser interactions is demanding. Here we propose methods that significantly reduce the overhead on laser beam control for performing single and multiple qubit operations on trapped ions. We show how a universal set of operations can be implemented by controlled transport of ions through stationary laser beams. At the same time, each laser beam can be used to perform many operations in parallel, potentially reducing the total laser power necessary to carry out QIP tasks. The overall setup necessary for implementing transport gates is simpler than for gates executed on stationary ions. We also suggest a transport-based two-qubit gate scheme utilizing microfabricated permanent magnets that can be executed without laser light.

quant-ph↗

arXiv2007

Simplified motional heating rate measurements of trapped ions

We have measured motional heating rates of trapped atomic ions, a factor that can influence multi-ion quantum logic gate fidelities. Two simplified techniques were developed for this purpose: one relies on Raman sideband detection implemented with a single laser source, while the second is even simpler and is based on time-resolved fluorescence detection during Doppler recooling. We applied these methods to determine heating rates in a microfrabricated surface-electrode trap made of gold on fused quartz, which traps ions 40 microns above its surface. Heating rates obtained from the two techniques were found to be in reasonable agreement. In addition, the trap gives rise to a heating rate of 300 plus or minus 30 per second for a motional frequency of 5.25 MHz, substantially below the trend observed in other traps.

quant-ph↗

arXiv2007

Fluorescence during Doppler cooling of a single trapped atom

We investigate the temporal dynamics of Doppler cooling of an initially hot single trapped atom in the weak binding regime using a semiclassical approach. We develop an analytical model for the simplest case of a single vibrational mode for a harmonic trap, and show how this model allows us to estimate the initial energy of the trapped particle by observing the fluorescence rate during the cooling process. The experimental implementation of this temperature measurement provides a way to measure atom heating rates by observing the temperature rise in the absence of cooling. This method is technically relatively simple compared to conventional sideband detection methods, and the two methods are in reasonable agreement. We also discuss the effects of RF micromotion, relevant for a trapped atomic ion, and the effect of coupling between the vibrational modes on the cooling dynamics.

quant-ph↗

arXiv2007

Randomized Benchmarking of Quantum Gates

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computing are of the order of 0.0001 or lower. Experimentally proving such low errors is challenging. We describe a randomized benchmarking method that yields estimates of the computationally relevant errors without relying on accurate state preparation and measurement. Since it involves long sequences of randomly chosen gates, it also verifies that error behavior is stable when used in long computations. We implemented randomized benchmarking on trapped atomic ion qubits, establishing a one-qubit error probability per randomized pi/2 pulse of 0.00482(17) in a particular experiment. We expect this error probability to be readily improved with straightforward technical modifications.

quant-ph↗

arXiv2007

Diluted maximum-likelihood algorithm for quantum tomography

We propose a refined iterative likelihood-maximization algorithm for reconstructing a quantum state from a set of tomographic measurements. The algorithm is characterized by a very high convergence rate and features a simple adaptive procedure that ensures likelihood increase in every iteration and convergence to the maximum-likelihood state. We apply the algorithm to homodyne tomography of optical states and quantum tomography of entangled spin states of trapped ions and investigate its convergence properties.

quant-ph↗

arXiv2006

Transport dynamics of single ions in segmented microstructured Paul trap arrays

It was recently proposed to use small groups of trapped ions as qubit carriers in miniaturized electrode arrays that comprise a large number of individual trapping zones, between which ions could be moved. This approach might be scalable for quantum information processing with a large numbers of qubits. Processing of quantum information is achieved by transporting ions to and from separate memory and qubit manipulation zones in between quantum logic operations. The transport of ion groups in this scheme plays a major role and requires precise experimental control and fast transport. In this paper we introduce a theoretical framework to study ion transport in external potentials that might be created by typical miniaturized Paul trap electrode arrays. In particular we discuss the relationship between classical and quantum descriptions of the transport and study the energy transfer to the oscillatory motion during near-adiabatic transport. Based on our findings we suggest a numerical method to find electrode potentials as a function of time to optimize the local potential an ion experiences during transport. We demonstrate this method for one specific electrode geometry that should closely represent the situation encountered in realistic trap arrays.

quant-ph↗

arXiv2006

Entanglement Purification of Any Stabilizer State

We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The parties exchange their measurement results, detect or correct errors, and decode the desired purified state. We give sufficient conditions on the stabilizer codes that may be used in this procedure and find that Steane's seven-qubit code is the smallest error-correcting code sufficient to purify any stabilizer state. An error-detecting code that encodes two qubits in six can also be used to purify any stabilizer state. We further specify which classes of stabilizer codes can purify which classes of stabilizer states.

quant-ph↗

arXiv2006

On Protected Realizations of Quantum Information

There are two complementary approaches to realizing quantum information so that it is protected from a given set of error operators. Both involve encoding information by means of subsystems. One is initialization-based error protection, which involves a quantum operation that is applied before error events occur. The other is operator quantum error correction, which uses a recovery operation applied after the errors. Together, the two approaches make it clear how quantum information can be stored at all stages of a process involving alternating error and quantum operations. In particular, there is always a subsystem that faithfully represents the desired quantum information. We give a definition of faithful realization of quantum information and show that it always involves subsystems. This justifies the "subsystems principle" for realizing quantum information. In the presence of errors, one can make use of noiseless, (initialization) protectable, or error-correcting subsystems. We give an explicit algorithm for finding optimal noiseless subsystems. Finding optimal protectable or error-correcting subsystems is in general difficult. Verifying that a subsystem is error-correcting involves only linear algebra. We discuss the verification problem for protectable subsystems and reduce it to a simpler version of the problem of finding error-detecting codes.

quant-ph↗

arXiv2005

Error Analysis For Encoding A Qubit In An Oscillator

In the paper titled "Encoding A Qubit In An Oscillator" Gottesman, Kitaev, and Preskill [quant-ph/0008040] described a method to encode a qubit in the continuous Hilbert space of an oscillator's position and momentum variables. This encoding provides a natural error correction scheme that can correct errors due to small shifts of the position or momentum wave functions (i.e., use of the displacement operator). We present bounds on the size of correctable shift errors when both qubit and ancilla states may contain errors. We then use these bounds to constrain the quality of input qubit and ancilla states.

quant-ph↗

arXiv2005

Quantum control, quantum information processing, and quantum-limited metrology with trapped ions

We briefly discuss recent experiments on quantum information processing using trapped ions at NIST. A central theme of this work has been to increase our capabilities in terms of quantum computing protocols, but we have also applied the same concepts to improved metrology, particularly in the area of frequency standards and atomic clocks. Such work may eventually shed light on more fundamental issues, such as the quantum measurement problem.

quant-ph↗

arXiv2005

Compiling gate networks on an Ising quantum computer

Here we describe a simple mechanical procedure for compiling a quantum gate network into the natural gates (pulses and delays) for an Ising quantum computer. The aim is not necessarily to generate the most efficient pulse sequence, but rather to develop an efficient compilation algorithm that can be easily implemented in large spin systems. The key observation is that it is not always necessary to refocus all the undesired couplings in a spin system. Instead the coupling evolution can simply be tracked and then corrected at some later time. Although described within the language of NMR the algorithm is applicable to any design of quantum computer based on Ising couplings.

quant-ph↗

arXiv2004

Scalable Quantum Computation in the Presence of Large Detected-Error Rates

The tolerable erasure error rate for scalable quantum computation is shown to be at least 0.292, given standard scalability assumptions. This bound is obtained by implementing computations with generic stabilizer code teleportation steps that combine the necessary operations with error correction. An interesting consequence of the technique is that the only errors that affect the maximum tolerable error rate are storage and Bell measurement errors. If storage errors are negligible, then any detected Bell measurement error below 1/2 is permissible. Another consequence of the technique is that the maximum tolerable depolarizing error rate is dominated by how well one can prepare the required encoded states. For example, if storage and Bell measurement errors are relatively small, then independent depolarizing errors with error rate close to 0.1 per qubit are tolerable in the prepared states. The implementation overhead is dominated by the efficiency with which the required encoded states can be prepared. At present, this efficiency is very low, particularly for error rates close to the maximum tolerable ones.

quant-ph↗

arXiv2004

Quantum Computing with Very Noisy Devices

In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices called ``gates'' that tend to destroy the fragile quantum states needed for computation. The goal of fault-tolerant quantum computing is to compute accurately even when gates have a high probability of error each time they are used. Here we give evidence that accurate quantum computing is possible with error probabilities above 3% per gate, which is significantly higher than what was previously thought possible. However, the resources required for computing at such high error probabilities are excessive. Fortunately, they decrease rapidly with decreasing error probabilities. If we had quantum resources comparable to the considerable resources available in today's digital computers, we could implement non-trivial quantum computations at error probabilities as high as 1% per gate.

quant-ph↗

arXiv2004

Liquid state NMR simulations of quantum many-body problems

Recently developed quantum algorithms suggest that in principle, quantum computers can solve problems such as simulation of physical systems more efficiently than classical computers. Much remains to be done to implement these conceptual ideas into actual quantum computers. As a small-scale demonstration of their capability, we simulate a simple many-fermion problem, the Fano-Anderson model, using liquid state Nuclear Magnetic Resonance (NMR). We carefully designed our experiment so that the resource requirement would scale up polynomially with the size of the quantum system to be simulated. The experimental results allow us to assess the limits of the degree of quantum control attained in these kinds of experiments. The simulation of other physical systems, with different particle statistics, is also discussed.

quant-ph↗

arXiv2004

Fault-Tolerant Postselected Quantum Computation: Threshold Analysis

The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis is based on computer-assisted heuristics. It indicates that if classical and quantum communication delays are negligible, then scalable qubit-based quantum computation is possible with errors above 1% per elementary quantum gate.

quant-ph↗

arXiv2004

Fault-Tolerant Postselected Quantum Computation: Schemes

Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted with nonzero probability. Methods for implementing postselected quantum computation with noisy gates are proposed. These methods are based on error-detecting codes. Conditionally on detecting no errors, it is expected that the encoded computation can be made to be arbitrarily accurate. Although the probability of success of the encoded computation decreases dramatically with accuracy, it is possible to apply the proposed methods to the problem of preparing arbitrary stabilizer states in large error-correcting codes with local residual errors. Together with teleported error-correction, this may improve the error tolerance of non-postselected quantum computation.

quant-ph↗

arXiv2003

Bounds on the Probability of Success of Postselected Non-linear Sign Shifts Implemented with Linear Optics

The fundamental gates of linear optics quantum computation are realized by using single photons sources, linear optics and photon counters. Success of these gates is conditioned on the pattern of photons detected without using feedback. Here it is shown that the maximum probability of success of these gates is typically strictly less than 1. For the one-mode non-linear sign shift, the probability of success is bounded by 1/2. For the conditional sign shift of two modes, this probability is bounded by 3/4. These bounds are still substantially larger than the highest probabilities shown to be achievable so far, which are 1/4 and 2/27, respectively.

quant-ph↗