Related papers: Accuracy thresholds of topological color codes on …
Fault-tolerant quantum computers which can solve hard problems rely on quantum error correction. One of the most promising error correction codes is the surface code, which requires universal gate fidelities exceeding the error correction…
Topological color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Neither a two-dimensional nor a three-dimensional topology, however, can provide a universal gate set $\{$H, T, CNOT$\}$, with the…
In this work we introduce two code families, which we call the heavy hexagon code and heavy square code. Both code families are implemented by assigning physical data and ancilla qubits to both vertices and edges of low degree graphs. Such…
Quantum error correction was invented to allow for fault-tolerant quantum computation. Systems with topological order turned out to give a natural physical realization of quantum error correcting codes (QECC) in their groundspaces. More…
Mapping quantum error correcting codes to classical disordered statistical mechanics models and studying the phase diagram of the latter has proven a powerful tool to study the fundamental error robustness and associated critical error…
Quantum error correcting (QEC) codes protect quantum information from decoherence, as long as error rates fall below critical error thresholds. In general, obtaining thresholds implies simulating the QEC procedure using, in general,…
Surface codes exploit topological protection to increase error resilience in quantum computing devices and can in principle be implemented in existing hardware. They are one of the most promising candidates for active error correction, not…
I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor (quant-ph/9505011) for…
In 2011, Guruswami-H{\aa}stad-Kopparty \cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further strengthen the result by showing that the…
The error correcting capabilities of the Calderbank-Shor-Steane [[7,1,3]] quantum code, together with a fault-tolerant syndrome extraction by means of several ancilla states, have been numerically studied. A simple probability expression to…
The robustness of the topological color code, which is a class of error correcting quantum codes, is investigated under the influence of an uniform magnetic field on the honeycomb lattice. Our study relies on two high-order series…
Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for…
Spin glass systems as lattices of disordered magnets with random interactions have important implications within the theory of magnetization and applications to a wide-range of hard combinatorial optimization problems. Nevertheless, despite…
Topological quantum memory can protect information against local errors up to finite error thresholds. Such thresholds are usually determined based on the success of decoding algorithms rather than the intrinsic properties of the mixed…
Topological subsystem codes proposed recently by Bombin are quantum error correcting codes defined on a two-dimensional grid of qubits that permit reliable quantum information storage with a constant error threshold. These codes require…
An algorithm is presented for error correction in the surface code quantum memory. This is shown to correct depolarizing noise up to a threshold error rate of 18.5%, exceeding previous results and coming close to the upper bound of 18.9%.…
The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The…
The surface code is a promising platform for a quantum memory, but its threshold under coherent errors remains incompletely understood. We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit…
We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes.…
Upper and lower bounds are given for the number of equivalence classes of error patterns in the toric code for quantum memory. The results are used to derive a lower bound on the ground-state energy of the +/-J Ising spin glass model on the…