Quantum error-correcting codes have been developed to protect a quantum computer from decoherence due to a noisy environment. In this paper, we present two methods for optimizing the physical implementation of such error correction schemes. First, we discuss an optimal quantum circuit implementation of the smallest error-correcting code (the three bit code). Quantum circuits are physically implemented by serial pulses, i.e., by switching on and off external parameters in the Hamiltonian one after another. In contrast to this, we introduce a parallel switching method which allows faster gate operation by switching all external parameters simultaneously, and which has potential applications for arbitrary quantum computer architectures. We apply both serial and parallel switching to electron spins in coupled quantum dots subject to a Heisenberg coupling $H=J(t){\mathbf{S}}_{1}\ensuremath{\cdot}{\mathbf{S}}_{2}.$ We provide a list of steps that can be implemented experimentally and used as a test for the functionality of quantum error correction.
Quantum error-correcting codes have been developed to protect a quantum computer from decoherence due to a noisy environment. In this paper, we present two methods for optimizing the physical implementation of such error correction schemes. First, we discuss an optimal quantum circuit implementation of the smallest error-correcting code (the three bit code). Quantum circuits are physically implemented by serial pulses, i.e., by switching on and off external parameters in the Hamiltonian one after another. In contrast to this, we introduce a parallel switching method which allows faster gate operation by switching all external parameters simultaneously, and which has potential applications for arbitrary quantum computer architectures. We apply both serial and parallel switching to electron spins in coupled quantum dots subject to a Heisenberg coupling H=J(t)S1\ensuremath⋅S2. We provide a list of steps that can be implemented experimentally and used as a test for the functionality of quantum error correction.
The recent discovery of efficient quantum algorithms for factoring and database search has shown that quantum computing would allow to solve important problems which are intractable with conventional computers. In contrast to the very demanding task of building a large-scale quantum computer, there are quantum communication protocols, e.g. quantum key distribution for cryptography, which—though still difficult—require much less effort and can be implemented with current technology. Apart from the technological motivation, the study of quantum information offers (at least) two additional benefits. First, new insight into fundamental questions on quantum mechanics, e.g. concerning non-locality and entanglement, are gained from an information-theoretical approach. And second, investigating a particular physical implementation of quantum information can give rise to independent physical results. Spintronics, the use of spin as opposed to charge in (classical) electronics is a new field for which some results presented here could be relevant. In this dissertation we investigate several theoretical aspects of the physical implementation of quantum computation and communication in which the fundamental unit of quantum information, the qubit, is represented by the spin of electrons in semiconductor quantum dots. The required coupling between the spins can be obtained by allowing for tunneling of electrons between adjacent dots, leading to a Heisenberg exchange coupling J S1 · S2 between the spins, a scenario which we study for laterally coupled quantum dots in a two-dimensional electron system, and for a three-dimensional setup with vertically coupled quantum dots. Furthermore, an alternative scheme to couple the spins via the interaction with an optical cavity mode is presented. Quantum error correction represents one of the important ingredients for the physical implementation of a quantum computer by protecting \nit from the e�ects of a noisy environment. As a �rst test for errorcorrection \nin a solid-state device using spins, we propose an optimized \nimplementation of the most primitive error correction scheme (the threebit \ncode). In this context, we introduce parallel switching, allowing \nto operate a quantum computer more e�ciently than the usual serial \nswitching. \nCoupling spins with the exchange interaction J S1 �S2 is not su�cient \nfor quantum computation; the spins also have to be addressed individually \nusing controllable local magnetic �elds or g-factors giBi �Si in order \nto allow for single-qubit operations. On the one hand, we discuss several \nschemes for overcoming the di�culty of applying local magnetic �elds \n(requiring large gradients), e.g. g-factor engineering, which allows for \nall-electric operation of the device. On the other hand, we show that \nat the expense of additional devices (spins) and switching operations, \nsingle-spin rotations can be dispensed with completely. \nAddressing the feasibility of quantum communication with entangled \nelectrons in mesoscopic wires, i.e. interacting many-body environments, \nwe propose an interference experiment using a scattering set-up with an \nentangler and a beam splitter. The current noise for electronic singlet \nstates turns out to be enhanced (bunching), while it is reduced for triplets \n(antibunching). Due to interactions, the �delity of the entangled singlet \nand triplet states is reduced by z4F \nin a conductor described by Fermi \nliquid theory, zF being the quasiparticle weight factor. \nFinally, we study the related but more general problem of the noise of \nthe cotunneling current through one or several tunnel-coupled quantum \ndots in the Coulomb blockade regime. The various regimes of weak and \nstrong, elastic and inelastic cotunneling are analyzed for quantum-dot \nsystems (QDS) with few-level, nearly-degenerate, and continuous electronic \nspectra. In contrast to sequential tunneling, the noise in inelastic \ncotunneling can be super-Poissonian. In order to investigate strong cotunneling \nwe develop a microscopic theory of cotunneling based on the \ndensity-operator formalism and using the projection operator technique. \nWe have derived the master equation for the QDS and the current and \nnoise in cotunneling in terms of the stationary state of the QDS. These \nresults are then applied to QDS with a nearly degenerate and continuous \nspectrum.
We propose an efficient protocol for optimizing the physical implementation of three-qubit quantum error correction with spatially separated quantum dot spins via virtual-photon-induced process. In the protocol, each quantum dot is trapped in an individual cavity and each two cavities are connected by an optical fiber. We propose the optimal quantum circuits and describe the physical implementation for correcting both the bit flip and phase flip errors by applying a series of one-bit unitary rotation gates and two-bit quantum iSWAP gates that are produced by the long-range interaction between two distributed quantum dot spins mediated by the vacuum fields of the fiber and cavity. The protocol opens promising perspectives for long distance quantum communication and distributed quantum computation networks.
In Chapter 4 we introduced different quantum gates and quantum circuits and in Chapter 5 we described several quantum algorithms. So far the analysis of the algorithms and the circuits has been made with the assumption that the required unitary operations can be implemented exactly without any error. This is an abstraction. In an actual physical system that implements a quantum algorithm or a quantum circuit there are several sources of errors. The situation is similar in classical computation and to circumvent this problem error correcting codes are used in classical digital computing. Since qubits are more delicate and more susceptible to errors we need to introduce quantum error correcting codes. It is very important, as without such codes it will not be possible to build a scalable quantum computer. Such quantum error correcting codes are introduced in this chapter. However, we will not limit ourselves to the discussion of error correcting codes alone. We will also discuss more general aspects of errors and error correction, like decoherence, decoherence free subspace and fault-tolerance.
Fault-tolerant quantum computers rely on Quantum Error-Correcting Codes (QECCs) to protect information from noise. However, no single error-correcting code supports a fully transversal and therefore fault-tolerant implementation of all gates required for universal quantum computation. Code switching addresses this limitation by moving quantum information between different codes that, together, support a universal gate set. Unfortunately, each switch is costly-adding time and space overhead and increasing the logical error rate. Minimizing the number of switching operations is, therefore, essential for quantum computations using code switching. In this work, we study the problem of minimizing the number of code switches required to run a given quantum circuit. We show that this problem can be solved efficiently in polynomial time by reducing it to a minimum-cut instance on a graph derived from the circuit. Our formulation is flexible and can incorporate additional considerations, such as reducing depth overhead by preferring switches during idle periods or biasing the compilation to favor one code over another. To the best of our knowledge, this is the first automated approach for compiling and optimizing code-switching-based quantum computations at the logical level.
In a (future) quantum computer a single logical quantum bit (qubit) will be made of multiple physical qubits. These extra physical qubits implement mandatory extensive error checking. The efficiency of error correction will fundamentally influence the performance of a future quantum computer, both in latency/speed and in error threshold (the worst error tolerated for an individual gate). Executing this quantum error correction requires scheduling the individual operations subject to architectural constraints. Since our last talk on this subject, a team of researchers at Sandia National Labortories has designed a logical qubit architecture that considers all relevant architectural issues including layout, the effects of supporting classical electronics, and the types of gates that the underlying physical qubit implementation supports most naturally. This is a two-dimensional system where 2-qubit operations occur locally, so there is no need to calculate more complex qubit/information transportation. Using integer programming, we found a schedule of qubit operations that obeys the hardware constraints, implements the local-check code in the native gate set, and minimizes qubit idle periods. Even with an optimal schedule, however, parallel Monte Carlo simulation shows that there is no finite error probability for the native gates such that the error-correction system would be benecial.more » However, by adding dynamic decoupling, a series of timed pulses that can reverse some errors, we found that there may be a threshold. Thus finding optimal schedules for increasingly-refined scheduling problems has proven critical for the overall design of the logical qubit system. We describe the evolving scheduling problems and the ideas behind the integer programming-based solution methods. This talk assumes no prior knowledge of quantum computing.« less
Quantum circuits implementing fault-tolerant quantum error correction (QEC) for the three-qubit bit-flip code and five-qubit code are studied. To describe the effect of noise, we apply a model based on a generalized effective Hamiltonian where the system-environment interactions are taken into account by including stochastic fluctuating terms in the system Hamiltonian. This noise model enables us to investigate the effect of noise in quantum circuits under realistic device conditions and avoid strong assumptions such as maximal parallelism and weak storage errors. Noise thresholds of the QEC codes are calculated. In addition, the effects of imprecision in projective measurements, collective bath, fault-tolerant repetition protocols, and level of parallelism in circuit constructions on the threshold values are also studied with emphasis on determining the optimal design for the fault-tolerant QEC circuit. These results provide insights into the fault-tolerant QEC process as well as useful information for designing the optimal fault-tolerant QEC circuit for particular physical implementation of quantum computer.