Related papers: Fault-Tolerant Measurement-Based Quantum Computing…
Achieving fault-tolerant quantum computation (FTQC) demands simultaneous progress in physical qubit performance and quantum error correction (QEC). This work reviews and benchmarks experimental advancements towards FTQC across leading…
The quantum error-correcting code in the continuous-variable (CV) system attracts much attention due to its flexibility and high resistance against specific noise. However, the theory of fault tolerance in CV systems is premature and lacks…
We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which estimates the scale-up in the size of the circuit due…
Measurement-based one-way quantum computation (QC) using cluster states as resources provides an efficient model to perform computation and information processing of quantum codes. Arbitrary Gaussian QC can be implemented by sufficiently…
Hybridizing different physical systems or degrees of freedom offers significant advantages for realizing practical, universal, scalable, and fault-tolerant quantum computation (FTQC). Here, we propose optical FTQC schemes with low squeezing…
Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in…
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…
Quantum error correction is necessary to perform large-scale quantum computations in the presence of noise and decoherence. As a result, several aspects of quantum error correction have already been explored. These have been primarily…
We present a study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous-variable quantum computing. A central aim is to compare mathematically-idealized cluster states defined using…
We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by…
This work introduces optimization strategies to continuous variable measurement based quantum computation (MBQC) at different levels. We provide a recipe for mitigating the effects of finite squeezing, which affect the production of cluster…
We present a detailed description of an architecture for fault-tolerant quantum computation, which is based on the cluster model of encoded qubits. In this cluster-based architecture, concatenated computation is implemented in a quite…
The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled…
Threshold theorems for fault-tolerant quantum computing assume that errors are of certain types. But how would one detect whether errors of the "wrong" type occur in one's experiment, especially if one does not even know what type of error…
Many proposals for fault tolerant quantum computation (FTQC) suffer detectable loss processes. Here we show that topological FTQC schemes, which are known to have high error thresholds, are also extremely robust against losses. We…
Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality"…
Photonics represents one of the most promising approaches to large-scale quantum computation with millions of qubits and billions of gates, owing to the potential for room-temperature operation, high clock speeds, miniaturization of…
Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…
The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals rely on nearest-neighbour communication, which requires…
Quantum computing potentially offers exponential speed-ups over classical computing for certain tasks. A central, outstanding challenge to making quantum computing practical is to achieve fault tolerance, meaning that computations of any…