Quantum computers now show the promise of surpassing any possible classical machine. However, errors limit this ability and current machines do not have the ability to implement error correcting codes due to the limited number of qubits and limited control. Therefore, dynamical decoupling (DD) and encodings that limit noise with fewer qubits are more promising. For these reasons, we put forth a model of universal quantum computation that has many advantages over strategies that require a large overhead such as the standard quantum-error correcting codes. First, we separate collective noise from individual noises on physical qubits and use a decoherence-free subspace that uses just two qubits for its encoding to eliminate collective noise. Second, our bath model is very general as it uses a spin-boson-type bath but without any Markovian assumption. Third, we are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise and commute with the logical operations on the encoded qubit. This allows removal of noise while implementing gate operations. Numerical support is given for this hybrid protection strategy which provides an efficient approach to deal with the decoherence problems in quantum computation and is experimentally viable for several current quantum computing systems. This is emphasized by a recent experiment on superconducting qubits which shows promise for increasing the number of gates that can be implemented reliably with some realistic parameter assumptions.
Quantum computers now show the promise of surpassing any possible classical machine. However, errors limit this ability and current machines do not have the ability to implement error correcting codes due to the limited number of qubits and limited control. Therefore, dynamical decoupling (DD) and encodings that limit noise with fewer qubits are more promising. For these reasons, we put forth a model of universal quantum computation that has many advantages over strategies that require a large overhead such as the standard quantum-error correcting codes. First, we separate collective noise from individual noises on physical qubits and use a decoherence-free subspace that uses just two qubits for its encoding to eliminate collective noise. Second, our bath model is very general as it uses a spin-boson-type bath but without any Markovian assumption. Third, we are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise and commute with the logical operations on the encoded qubit. This allows removal of noise while implementing gate operations. Numerical support is given for this hybrid protection strategy which provides an efficient approach to deal with the decoherence problems in quantum computation and is experimentally viable for several current quantum computing systems. This is emphasized by a recent experiment on superconducting qubits which shows promise for increasing the number of gates that can be implemented reliably with some realistic parameter assumptions.
Quantum computers must be able to function in the presence of decoherence. The simplest strategy for decoherence reduction is dynamical decoupling (DD), which requires no encoding overhead and works by converting quantum gates into decoupling pulses. Here, using the IBM and Rigetti platforms, we demonstrate that the DD method is suitable for implementation in today's relatively noisy and small-scale cloud-based quantum computers. Using DD, we achieve substantial fidelity gains relative to unprotected, free evolution of individual superconducting transmon qubits. To a lesser degree, DD is also capable of protecting entangled two-qubit states. We show that dephasing and spontaneous emission errors are dominant in these systems, and that different DD sequences are capable of mitigating both effects. Unlike previous work demonstrating the use of quantum error correcting codes on the same platforms, we make no use of postselection and hence report unconditional fidelity improvements against natural decoherence.
Decoherence-free subspaces protect quantum information from the effects of noise that is correlated across the physical qubits used to implement them. Given the ability to impose suitable Hamiltonians upon such a multi-qubit system, one can also implement a set of logical gates which enables universal computation on this information without compromising this protection. Real physical systems, however, seldom come with the correct Hamiltonians built-in, let alone the ability to turn them off and on at will. In the course of our development of quantum information processing devices based on liquid-state NMR, we have found the task of operating on quantum information encoded in decoherence-free subspaces rather more challenging than is commonly assumed. This contribution presents an overview of these challenges and the methods we have developed for overcoming them in practice. These methods promise to be broadly applicable to many of the physical systems proposed for the implementation of quantum information processing devices.
We model repetitive quantum error correction (QEC) with the single-error-correcting five-qubit code on a network of individually controlled qubits with always-on Ising couplings. We use our previously designed universal set of quantum gates based on sequences of shaped decoupling pulses. In addition to being accurate quantum gates, the sequences also provide dynamical decoupling (DD) of low-frequency phase noise. The simulation involves integrating the unitary dynamics of six qubits over the duration of tens of thousands of control pulses, using classical stochastic phase noise as a source of decoherence. The combined DD and QEC protocol dramatically improves the coherence, with the QEC alone being responsible for more than an order of magnitude infidelity reduction.
Proposals for scalable quantum computing devices suffer not only from decoherence due to their interaction with the environment, but also from severe engineering constraints. For example, our ability to implement quantum gates is determined, in part, by the experimentally available interactions with which quantum information may be processed. Here we review a practical solution to some of the major concerns, control and error prevention, addressing solid state proposals for quantum computing devices. Some noise is eliminated by encoding a logical qubit into two qubits, other noise is reduced by an efficient set of decoupling pulse sequences. The same encoding removes the need for single-qubit operations which pose a difficult design constraint. We also discuss several generalizations which follow from this work.
Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.
Demonstrating that logical qubits outperform their physical counterparts represents a milestone in achieving reliable quantum computation. Here, we propose to protect logical qubits with a dynamical decoupling scheme that implements i gates on nearest-neighbor physical qubits, and we experimentally demonstrate this scheme on superconducting transmon qubits. In our scheme, each logical qubit requires only two physical qubits. A universal set of quantum gates on the logical qubits can be achieved such that each logical gate comprises only one or two physical gates. Our experiments reveal that the coherence time of a logical qubit is extended by up to 357% compared to the better-performing physical qubit. Moreover, we demonstrate—to the best of our knowledge, for the first time—that multiple logical qubits can outperform their physical superconducting counterparts. We illustrate a set of universal gates through a logical Ramsey experiment and the creation of a logical Bell state. Given its scalable nature, our scheme holds promise as a component for future reliable quantum computation.