Related papers: Universal Fault-Tolerant Computation on Decoherenc…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
``Leakage'' errors are particularly serious errors which couple states within a code subspace to states outside of that subspace thus destroying the error protection benefit afforded by an encoded state. We generalize an earlier method for…
Quantum computing promises significant speed-up for certain types of computational problems. However, robust implementations of semiconducting qubits must overcome the effects of charge noise that currently limit coherence during gate…
We introduce fusion-based quantum computing (FBQC) - a model of universal quantum computation in which entangling measurements, called fusions, are performed on the qubits of small constant-sized entangled resource states. We introduce a…
Proposals for scalable quantum computing devices suffer not only from decoherence due to the interaction with their environment, but also from severe engineering constraints. Here we introduce a practical solution to these major concerns,…
Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus…
The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in…
Fault-tolerant quantum computation critically depends on architectures uniting high encoding rates with physical implementability. Quantum low-density parity-check (qLDPC) codes, including bivariate bicycle (BB) codes, achieve dramatic…
Recent advances in quantum error correction (QEC) codes for fault-tolerant quantum computing \cite{Terhal2015} and physical realizations of high-fidelity qubits in a broad range of platforms \cite{Kok2007, Brown2011, Barends2014,…
We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically…
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes exploit the noncommutative geometry of…
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
An interesting concept in quantum computation is that of global control (GC), where there is no need to manipulate qubits individually. One can implement a universal set of quantum gates on a one-dimensional array purely via signals that…
A formulation for performing quantum computing in a projected subspace is presented, based on the subdynamical kinetic equation (SKE) for an open quantum system. The eigenvectors of the kinetic equation are shown to remain invariant before…
Quantum bits have technological imperfections. Additionally, the capacity of a component that can be implemented feasibly is limited. Therefore, distributed quantum computation is required to scale up quantum computers. This dissertation…
We propose a feasible scheme to achieve holonomic quantum computation in a decoherence-free subspace (DFS) with trapped ions. By the application of appropriate bichromatic laser fields on the designated ions, we are able to construct two…
Proposals for quantum computing devices are many and varied. They each have unique noise processes that make none of them fully reliable at this time. There are several error correction/avoidance techniques which are valuable for reducing…
Several topics on the implementation of spin qubits in quantum dots are reviewed. We first provide an introduction to the standard model of quantum computing and the basic criteria for its realization. Other alternative formulations such as…
Decoherence free subspaces (DFS) is a theoretical tool towards experimental implementation of quantum information storage and processing. However, they represent an experimental challenge, since conditions for their existence are very…