Related papers: Highly resilient, error-protected quantum gates in…
Arrays of optically trapped neutral atoms are a promising architecture for the realization of quantum computers. In order to run increasingly complex algorithms, it is advantageous to demonstrate high-fidelity and flexible gates between…
This dissertation explores quantum computation using qudits encoded into large spins, emphasizing the concept of quantum co-design to harness the unique capabilities of physical platforms for enhanced quantum information processing. First,…
Experimental realization of a universal set of quantum logic gates is the central requirement for implementation of a quantum computer. An all-geometric approach to quantum computation offered a paradigm for implementation where all the…
The development of scalable, high-fidelity qubits is a key challenge in quantum information science. Neutral atom qubits have progressed rapidly in recent years, demonstrating programmable processors and quantum simulators with scaling to…
Many current quantum error-correcting codes that achieve full fault tolerance suffer from having low ratios of logical to physical qubits and significant overhead. This makes them difficult to implement on current noisy intermediate-scale…
In this paper, we place bounds on when it is impossible to purify a noisy two-qubit state if all the gates used in the purification protocol are subject to adversarial local, independent, noise. It is found that the gate operations must be…
We present a composite pulse controlled phase gate which together with a bus architecture improves the feasibility of a recent quantum computing proposal based on rare-earth-ion doped crystals. Our proposed gate operation is tolerant to…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
In state-of-the-art quantum computing platforms, including superconducting qubits and trapped ions, imperfections in the 2-qubit entangling gates are the dominant contributions of error to system-wide performance. Recently, a novel 2-qubit…
It is not so well-known that measurement-free quantum error correction protocols can be designed to achieve fault-tolerant quantum computing. Despite the potential advantages of using such protocols in terms of the relaxation of accuracy,…
Large-scale quantum computers rely on quantum error correction to protect the fragile quantum information. Among the possible candidates of quantum computing devices, silicon-based spin qubits hold a great promise due to their compatibility…
We present composite pulse sequences that perform fault-tolerant two-qubit gate operations on exchange-only quantum dot spin qubits in various experimentally relevant geometries. We show how to perform dynamically corrected two-qubit gates…
High-fidelity quantum gates are crucial for achieving fault-tolerant quantum computing; however, decoherence significantly reduces gate fidelities during long operation times. Although optimal control techniques can theoretically minimize…
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms.…
We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative…
Entangling operations are among the most important primitive gates employed in quantum computing and it is crucial to ensure high-fidelity implementations as systems are scaled up. We experimentally realize and characterize a simple scheme…
The goal of this paper is to review the theoretical basis for achieving a faithful quantum information transmission and processing in the presence of noise. Initially encoding and decoding, implementing gates and quantum error correction…
Quantum computers hold the promise of solving computational problems which are intractable using conventional methods. For fault-tolerant operation quantum computers must correct errors occurring due to unavoidable decoherence and limited…
Gate fidelity -- an average fidelity over all possible input states -- is the workhorse metric for benchmarking quantum gates or circuits, yet fault-tolerant quantum computing ultimately depends on the worst-case behavior, typically…
The high-speed implementation and robustness against of non-adiabatic holonomic quantum computation provide a new idea for overcoming the difficulty of quantum system interacting with the environment easily decoherence, which realizing…