Related papers: Toward fault-tolerant quantum computation without …
Quantum computers promise to solve certain problems exponentially faster than possible classically but are challenging to build because of their increased susceptibility to errors. Remarkably, however, it is possible to detect and correct…
Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum…
Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom…
Typically, fault-tolerant operations and code concatenation are reserved for quantum error correction due to their resource overhead. Here, we show that fault tolerant operations have a large impact on the performance of symmetry based…
Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…
Quantum error correction is a crucial step beyond the current noisy-intermediate-scale quantum device towards fault-tolerant quantum computing. However, most of the error corrections ever demonstrated rely on post-selection of events or…
Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
This work compares the overhead of quantum error correction with concatenated and topological quantum error-correcting codes. To perform a numerical analysis, we use the Quantum Resource Estimator Toolbox (QuRE) that we recently developed.…
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…
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of universal quantum…
Recently Shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. We improve this bound and describe fault tolerant quantum computation when the error probability is smaller than…
We show that universal quantum computation can be concretely made fault-tolerant without mid-circuit measurements. To this end, we introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $\mathit{CCZ}$…
The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a…
Designing quantum error correcting codes that promise a high error threshold, low resource overhead and efficient decoding algorithms is crucial to achieve large-scale fault-tolerant quantum computation. The concatenated quantum Hamming…
Scalable quantum computing can only be achieved if qubits are manipulated fault-tolerantly. Topological error correction - a novel method which combines topological quantum computing and quantum error correction - possesses the highest…
Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits…
We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be…
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…
The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…