arXiv subjects

E. Knill

Publications and source records attributed to E. Knill.

At least 55 records · Page 3Linked to original sources

arXiv2003

Optical pumping of quantum dot nuclear spins

An all-optical scheme to polarize nuclear spins in a single quantum dot is analyzed. The hyperfine interaction with randomly oriented nuclear spins presents a fundamental limit for electron spin coherence in a quantum dot; by cooling the nuclear spins, this decoherence mechanism could be suppressed. The proposed scheme is inspired by laser cooling methods of atomic physics and implements a "controlled Overhauser effect" in a zero-dimensional structure.

cond-mat.mes-hall↗

arXiv2002

Introduction to Quantum Error Correction

In this introduction we motivate and explain the ``decoding'' and ``subsystems'' view of quantum error correction. We explain how quantum noise in QIP can be described and classified, and summarize the requirements that need to be satisfied for fault tolerance. Considering the capabilities of currently available quantum technology, the requirements appear daunting. But the idea of ``subsystems'' shows that these requirements can be met in many different, and often unexpected ways.

quant-ph↗

arXiv2002

Introduction to Quantum Information Processing

As a result of the capabilities of quantum information, the science of quantum information processing is now a prospering, interdisciplinary field focused on better understanding the possibilities and limitations of the underlying theory, on developing new applications of quantum information and on physically realizing controllable quantum devices. The purpose of this primer is to provide an elementary introduction to quantum information processing, and then to briefly explain how we hope to exploit the advantages of quantum information. These two sections can be read independently. For reference, we have included a glossary of the main terms of quantum information.

quant-ph↗

arXiv2002

Introduction to NMR Quantum Information Processing

After a general introduction to nuclear magnetic resonance (NMR), we give the basics of implementing quantum algorithms. We describe how qubits are realized and controlled with RF pulses, their internal interactions, and gradient fields. A peculiarity of NMR is that the internal interactions (given by the internal Hamiltonian) are always on. We discuss how they can be effectively turned off with the help of a standard NMR method called ``refocusing''. Liquid state NMR experiments are done at room temperature, leading to an extremely mixed (that is, nearly random) initial state. Despite this high degree of randomness, it is possible to investigate QIP because the relaxation time (the time scale over which useful signal from a computation is lost) is sufficiently long. We explain how this feature leads to the crucial ability of simulating a pure (non-random) state by using ``pseudopure'' states. We discuss how the ``answer'' provided by a computation is obtained by measurement and how this measurement differs from the ideal, projective measurement of QIP. We then give implementations of some simple quantum algorithms with a typical experimental result. We conclude with a discussion of what we have learned from NMR QIP so far and what the prospects for future NMR QIP experiments are.

quant-ph↗

arXiv2002

Generalizations of entanglement based on coherent states and convex sets

Unentangled pure states on a bipartite system are exactly the coherent states with respect to the group of local transformations. What aspects of the study of entanglement are applicable to generalized coherent states? Conversely, what can be learned about entanglement from the well-studied theory of coherent states? With these questions in mind, we characterize unentangled pure states as extremal states when considered as linear functionals on the local Lie algebra. As a result, a relativized notion of purity emerges, showing that there is a close relationship between purity, coherence and (non-)entanglement. To a large extent, these concepts can be defined and studied in the even more general setting of convex cones of states. Based on the idea that entanglement is relative, we suggest considering these notions in the context of partially ordered families of Lie algebras or convex cones, such as those that arise naturally for multipartite systems. The study of entanglement includes notions of local operations and, for information-theoretic purposes, entanglement measures and ways of scaling systems to enable asymptotic developments. We propose ways in which these may be generalized to the Lie-algebraic setting, and to a lesser extent to the convex-cones setting. One of our original motivations for this program is to understand the role of entanglement-like concepts in condensed matter. We discuss how our work provides tools for analyzing the correlations involved in quantum phase transitions and other aspects of condensed-matter systems.

quant-ph↗

arXiv2001

The quantum dynamics of two coupled qubits

We investigate the difference between classical and quantum dynamics of coupled magnetic dipoles. We prove that in general the dynamics of the classical interaction Hamiltonian differs from the corresponding quantum model, regardless of the initial state. The difference appears as non positive-definite diffusion terms in the quantum evolution equation of an appropriate positive phase-space probability density. Thus, it is not possible to express the dynamics in terms of a convolution of a positive transition probability function and the initial condition as can be done in the classical case. We conclude that the dynamics is a quantum element of NMR quantum information processing. There are two limits where our quantum evolution coincide with the classical one: the short time limit before spin-spin interaction sets in and the long time limit when phase diffusion is incorporated.

quant-ph↗

arXiv2001

A Note on Linear Optics Gates by Post-Selection

Recently it was realized that linear optics and photo-detectors with feedback can be used for theoretically efficient quantum information processing. The first of three steps toward efficient linear optics quantum computation (eLOQC) was to design a simple non-deterministic gate, which upon post-selection based on a measurement result implements a non-linear phase shift on one mode. Here a computational strategy is given for finding non-deterministic gates for bosonic qubits with helper photons. A more efficient conditional sign flip gate is obtained.

quant-ph↗

arXiv2001

Simulating Physical Phenomena by Quantum Networks

Physical systems, characterized by an ensemble of interacting elementary constituents, can be represented and studied by different algebras of observables or operators. For example, a fully polarized electronic system can be investigated by means of the algebra generated by the usual fermionic creation and annihilation operators, or by using the algebra of Pauli (spin-1/2) operators. The correspondence between the two algebras is given by the Jordan-Wigner isomorphism. As we previously noted similar one-to-one mappings enable one to represent any physical system in a quantum computer. In this paper we evolve and exploit this fundamental concept in quantum information processing to simulate generic physical phenomena by quantum networks. We give quantum circuits useful for the efficient evaluation of the physical properties (e.g, spectrum of observables or relevant correlation functions) of an arbitrary system with Hamiltonian $H$.

quant-ph↗

arXiv2001

Fermionic Linear Optics and Matchgates

Fermionic linear optics is efficiently classically simulatable. Here it is shown that the set of states achievable with fermionic linear optics and particle measurements is the closure of a low dimensional Lie group. The weakness of fermionic linear optics and measurements can therefore be explained and contrasted with the strength of bosonic linear optics with particle measurements. An analysis of fermionic linear optics is used to show that the two-qubit matchgates and the simulatable matchcircuits introduced by Valiant generate a monoid of extended fermionic linear optics operators. A useful interpretation of efficient classical simulations such as this one is as a simulation of a model of non-deterministic quantum computation. Problem areas for future investigations are suggested.

quant-ph↗

arXiv2001

Implementation of the Five Qubit Error Correction Benchmark

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.

quant-ph↗

arXiv2000

Quantum Algorithms for Fermionic Simulations

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.

cond-mat↗

arXiv2000

Thresholds for Linear Optics Quantum Computation

We previously established that in principle, it is possible to quantum compute using passive linear optics with photo-detectors (quant-ph/0006088). Here we describe techniques based on error detection and correction that greatly improve the resource and device reliability requirements needed for scalability. The resource requirements are analyzed for ideal linear optics quantum computation (LOQC). The coding methods can be integrated both with loss detection and phase error-correction to deal with the primary relaxation processes in non-ideal optics, including detector inefficiencies. The main conclusion of our work is that the resource requirements for implementing quantum communication or computation with LOQC are reasonable. Furthermore, this work clearly demonstrates how special knowledge of the error behavior can be exploited for greatly improving the fault tolerance and overheads of a physical quantum computer.

quant-ph↗

arXiv2000

Efficient Linear Optics Quantum Computation

We investigate the computational power of passive and active linear optical elements and photo-detectors. We show that single photon sources, passive linear optics and photo-detectors are sufficient for implementing reliable quantum algorithms. Feedback from the detectors to the optical elements is required for this implementation. Without feedback, non-deterministic quantum computation is possible. A single photon source sufficient for quantum computation can be built with an active linear optical element (squeezer) and a photo-detector. The overheads associated with using only linear optics appear to be sufficiently low to make quantum computation based on our proposal a viable alternative.

quant-ph↗

arXiv2000

NMR Based Quantum Information Processing: Achievements and Prospects

Nuclear magnetic resonance (NMR) provides an experimental setting to explore physical implementations of quantum information processing (QIP). Here we introduce the basic background for understanding applications of NMR to QIP and explain their current successes, limitations and potential. NMR spectroscopy is well known for its wealth of diverse coherent manipulations of spin dynamics. Ideas and instrumentation from liquid state NMR spectroscopy have been used to experiment with QIP. This approach has carried the field to a complexity of about 10 qubits, a small number for quantum computation but large enough for observing and better understanding the complexity of the quantum world. While liquid state NMR is the only present-day technology about to reach this number of qubits, further increases in complexity will require new methods. We sketch one direction leading towards a scalable quantum computer using spin 1/2 particles. The next step of which is a solid state NMR-based QIP capable of reaching 10-30 qubits.

quant-ph↗

arXiv1999

Quantum Computation and Quadratically Signed Weight Enumerators

We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be cast in terms of promise problems and has two interesting variants. An oracle for the unconstrained variant may be more powerful than quantum computation, while an oracle for a more constrained variant is efficiently solvable in the one-bit model of quantum computation. Thus, problems involving estimation of quadratically signed weight enumerators yield problems in BQP (bounded error quantum polynomial time) that are distinct from the ones studied so far, include a canonical BQP complete problem, and can be used to define and study complexity classes and their relationships to quantum computation.

quant-ph↗

arXiv1999

A Cat-State Benchmark on a Seven Bit Quantum Computer

We propose and experimentally realize an algorithmic benchmark that demonstrates coherent control with a sequence of quantum operations that first generates and then decodes the cat state (|000...>+|111...>)/sqrt(2) to the standard initial state |000...>. This is the first high fidelity experimental quantum algorithm on the currently largest physical quantum register, which has seven quantum bits (qubits) provided by the nuclei of crotonic acid. The experiment has the additional benefit of verifying a seven coherence in a generic system of coupled spins. Our implementation combines numerous nuclear magnetic resonance (NMR) techniques in one experiment and introduces practical methods for translating quantum networks to control operations. The experimental procedure can be used as a reliable and efficient method for creating a standard pseudo-pure state, the first step for implementing traditional quantum algorithms in liquid state NMR. The benchmark and the techniques can be adapted for use on other proposed quantum devices.

quant-ph↗

arXiv1999

Quantum simulation of a three-body interaction Hamiltonian on an NMR quantum computer

Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and dynamics of any quantum system may be simulated by a quantum computer. A basis mapping between the systems dictates the average Hamiltonian in the quantum computer needed to implement the desired Hamiltonian in the simulated system. The flexibility of the procedure is illustrated with NMR on 13-C labelled Alanine by creating the non-physical Hamiltonian ZZZ corresponding to a three body interaction.

quant-ph↗

arXiv1999

Quantum Error Detection II: Bounds

In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argument for classical self-orthogonal quaternary codes. Upper bounds for any quantum codes are proved by linear programming. We present two general solutions of the LP problem. Together they give an upper bound on the exponent of undetected error. The upper and lower asymptotic bounds coincide for a certain interval of code rates close to 1.

quant-ph↗