Related papers: Loss Tolerance with a Concatenated Graph State
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
We propose a prepare-and-measure scheme for quantum key distribution with 2-bit quantum codes. The protocol is unconditionally secure under whatever type of intercept-and-resend attack. Given the symmetric and independent errors to the…
Quantum computing using two optical coherent states as qubit basis states has been suggested as an interesting alternative to single photon optical quantum computing with lower physical resource overheads. These proposals have been…
Decoherence-induced leakage errors can couple a physical or encoded qubit to other levels, thus potentially damaging the qubit. They can therefore be very detrimental in quantum computation and require special attention. Here we present a…
We provide a systematic way of constructing entanglement-assisted quantum error-correcting codes via graph states in the scenario of preexisting perfectly protected qubits. It turns out that the preexisting entanglement can help beat the…
Many physical implementations of qubits---including ion traps, optical lattices and linear optics---suffer from loss. A nonzero probability of irretrievably losing a qubit can be a substantial obstacle to fault-tolerant methods of…
The notion of universal quantum computation can be generalized to multi-level qudits, which offer advantages in resource usage and algorithmic efficiencies. Trapped ions, which are pristine and well-controlled quantum systems, offer an…
Decoherence and loss will limit the practicality of quantum cryptography and computing unless successful error correction techniques are developed. To this end, we have discovered a new scheme for perfectly detecting and rejecting the error…
We propose a scheme to measure the parity of two distant qubits, while ensuring that losses on the quantum channel between them does not destroy coherences within the parity subspaces. This capability enables deterministic preparation of…
In the early years of fault-tolerant quantum computing (FTQC), it is expected that the available code distance and the number of magic states will be restricted due to the limited scalability of quantum devices and the insufficient…
We investigate a scheme for topological quantum computing using optical hybrid qubits and make an extensive comparison with previous all-optical schemes. We show that the photon loss threshold reported by Omkar {\it et al}. [Phys. Rev.…
Fault-tolerant quantum computation demands significant resources: large numbers of physical qubits must be checked for errors repeatedly to protect quantum data as logic gates are implemented in the presence of noise. We demonstrate that an…
We describe and analyze leakage errors of singlet-triplet qubits. Even though leakage errors are a natural problem for spin qubits encoded using quantum dot arrays, they have obtained little attention in previous studies. We describe the…
To realize long-distance quantum communication, it is crucial to design quantum repeater architectures that can deal with transmission losses and operational errors. Code concatenation of photonic graph codes is a promising way to achieve…
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code,…
The preparation of a quantum state using a noisy quantum computer (gate noise strength $\delta$), will necessarily affect an O($\delta$)-fraction of the qubits, no matter which protocol is used. Here, we show that fault-tolerant quantum…
In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local…
We present a general framework for the quantification and characterization of leakage errors that result when a quantum system is encoded in the subspace of a larger system. To do this we introduce new metrics for quantifying the coherent…
Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource…
A universal and fault tolerant scheme for quantum computation is proposed which utilizes a class of error correcting codes that is based on the detection of spontaneous emission (of, e.g., photons, phonons, and ripplons). The scheme is…