Related papers: Concatenation Schemes for Topological Fault-tolera…
We present a scheme to improve the noise threshold for the fault-tolerant topological one-way computation with a constant overhead. Certain cluster states of finite size, say star clusters, are constructed with logical qubits through an…
We design low-complexity error correction coding schemes for channels that introduce different types of errors and erasures: on the one hand, the proposed schemes can successfully deal with symbol errors and erasures, and, on the other…
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rates. This perspective manuscript describes how bosonic codes,…
Conventional quantum error correcting codes require multiple rounds of measurements to detect errors with enough confidence in fault-tolerant scenarios. Here I show that for suitable topological codes a single round of local measurements is…
Achieving scalable, fault-tolerant quantum computation requires quantum memory architectures that minimize error correction overhead while preserving coherence. This work presents a framework for high-dimensional qudit memory in…
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…
The essential requirement for fault-tolerant quantum computation (FTQC) is the total protocol design to achieve a fair balance of all the critical factors relevant to its practical realization, such as the space overhead, the threshold, and…
Quantum error correction requires decoders that are both accurate and efficient. To this end, union-find decoding has emerged as a promising candidate for error correction on the surface code. In this work, we benchmark a weighted variant…
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit to avoid resource escalation typical of multi-qubit codes. These codes can be customized to the specific physical errors on the qudit,…
Quantum error correction allows for faulty quantum systems to behave in an effectively error free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to…
Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state…
Quantum error correction is an important ingredient for scalable quantum computing. Stabilizer codes are one of the most promising and straightforward ways to correct quantum errors, are convenient for logical operations, and improve…
The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate…
One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an…
For a simple model of mutually interacting qubits it is shown how the errors induced by mutual interactions can be eliminated using concatenated coding. The model is solved exactly for arbitrary interaction strength, for two well-known…
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…
Blind Quantum Computation (BQC) is a delegation computing protocol that allows a client to utilize a remote quantum server to implement desired quantum computations while keeping her inputs, outputs, and algorithms private. However, qubit…
Fault-tolerant quantum computing will require accurate estimates of the resource overhead, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors of logical performance. We present a scalable…
In the shallow sub-threshold regime, fault-tolerant quantum computation requires a tremendous amount of qubits. In this paper, we study the error correction in the deep sub-threshold regime. We estimate the physical error rate for achieving…
Performing entangling gates between physical qubits is necessary for building a large-scale universal quantum computer, but in some physical implementations - for example, those that are based on linear optics or networks of ion traps -…