Questions tagged [error-correction]

Quantum error correction (QEC) is a collection of techniques to protect quantum information from decoherence and other quantum noise, to realise fault-tolerant quantum computation. Quantum error correction is expected to be essential for practical quantum computation in the face of noise on stored quantum information, faulty quantum gates, faulty state preparations, and faulty measurements. (Wikipedia)

168 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
10 votes
0 answers
100 views

Entanglement-assisted hashing bound for asymmetric depolarizing channels

I reading the paper EXIT-Chart Aided Quantum Code Design Improves the Normalised Throughput of Realistic Quantum Devices, which proposes the use of QTCs in order to do quantum error correction for ...
Josu Etxezarreta Martinez's user avatar
6 votes
0 answers
179 views

Smallest qudit error correcting/detecting codes

Consider encoding a qubit into $n$ qubits. It is well known that the smallest error detecting code is in $n=4$ qubits and the smallest error correcting code is in $n=5$ qubits. Is there a similar ...
Eric Kubischta's user avatar
6 votes
0 answers
140 views

Is every $ ((11,2,5)) $ code equivalent to the $ [[11,1,5]] $ stabilizer code?

Two codes are said to be equivalent if their code spaces are related by a non-entangling gate, i.e., a gate from $U(2)^{\otimes n} \rtimes S_n$, the local unitaries together with permutations. It is ...
Ian Gershon Teixeira's user avatar
6 votes
0 answers
162 views

Why is combined amplitude and phase damping considered sufficient for noise modeling?

In QECC literature, I often come across the "combined amplitude and phase damping channel" as being representative of a realistic noise model which makes sense (as amplitude damping and de-...
Sam's user avatar
  • 187
6 votes
1 answer
372 views

State of the art decoding algorithms for surface code

I am interested to know what are the "most promising" decoder algorithms that are used in surface code today. Of course, different criteria can tell what we expect from a good decoder. In ...
Marco Fellous-Asiani's user avatar
6 votes
0 answers
214 views

In what situation are three rounds of syndrome measurement required for fault-tolerance in the surface code?

I have heard multiple times the claim that three rounds of syndrome measurement required for fault-tolerance in the surface code. I'm not sure what situation would require this, as I think less would ...
James Wootton's user avatar
6 votes
0 answers
194 views

Why can a point in anti-de Sitter space be modeled as a logical qutrit and how is its error correction done?

This isn't my area but the recent Quanta article How Space and Time Could Be a Quantum Error-Correcting Code struck me as interesting. They mention: In their paper[1] conjecturing that holographic ...
Sanchayan Dutta's user avatar
5 votes
0 answers
43 views

Finding all small stabilizer codes

Given some choice of parameters $ [[n,k,d]] $ with $ n $ small, is there any computationally easy way to find all of (or at least many of) the stabilizer codes with those parameters? For certain ...
Ian Gershon Teixeira's user avatar
5 votes
0 answers
90 views

Famous qutrit codes with no qubit analogue

No $ [[3,1,2]] $ qubit code exists (more generally no $ ((3,2,2)) $ qubit code exists). See Why can't there be an error detecting code with fewer than 4 qubits? However there does a exist a $ [[3,...
Ian Gershon Teixeira's user avatar
5 votes
0 answers
145 views

Does a $ [[23,1,9]] $ code exist?

The $ [[23,1,7]] $ Golay code is an excellent code. It is a doubly even CSS code with $ H_X=H_Z $ and allows transversal implementation of all Clifford gates. One way in which it is not optimal is ...
Ian Gershon Teixeira's user avatar
5 votes
0 answers
148 views

Why the perfect 5-qubit code was used for magic state distillation?

I am currently trying to understand magic state distillation. So far, my understanding is that the general idea is to find a code where a non-Clifford gate is transversal (very well explained in https:...
Diego's user avatar
  • 51
5 votes
1 answer
319 views

Regarding the inductive proof that any Clifford gate can be made of Hadamard, phase and c-not

In Exercise 10.40 of Nielsen and Chunang's textbook, the reader is supposed to construct an inductive proof of Theorem 10.6 that any Clifford gate can be made of Hadamard, phase and c-not. There it is ...
user3493403's user avatar
5 votes
0 answers
334 views

Scaling functions for the logical error rate of the surface code

I'm trying to understand where the common expression $P_L=A\left(\frac{p}{p_{th}}\right)^{\lceil \frac d 2 \rceil}$ comes from. When estimating the logical error rate of the surface code, people seem ...
Jahan Claes's user avatar
5 votes
0 answers
120 views

Which improvements can we expect in Quantum Error Correction?

According to this article: The surface code is currently the most widely pursued quantum error correction scheme (Emphasis mine). It is also said: However, there are drawbacks to the surface code, ...
Tristan Nemoz's user avatar
  • 6,152
5 votes
0 answers
372 views

Which codes can implement transversal non-Clifford gates

A paper Three-dimensional surface codes: Transversal gates and fault-tolerant architectures discusses 3D surface codes and shows that CZ and CCZ gates are transversal in [these] codes. They give a ...
unknown's user avatar
  • 2,082
5 votes
0 answers
169 views

Quantum Belief Propagation decoding

I have been reading about a family of quantum error correction codes called Quantum Turbo Codes, which are the quantum analog of the well-known classical Turbo codes. This codes were introduced in ...
Josu Etxezarreta Martinez's user avatar
4 votes
0 answers
63 views

Magic state distillation, eigenvectors of Clifford gates, and transversal gates

I have some (possibly mistaken) ideas about magic state distillation. Please disabuse me of them? In section III "Universal Quantum Computation with Magic States" of the original paper on ...
Ian Gershon Teixeira's user avatar
4 votes
0 answers
119 views

A better name for "weakly self-dual CSS codes"

Does anyone know a better name than "weakly self-dual"/"self-orthogonal" for CSS codes where $H_X=H_Z$, for example the Steane code, and the color codes? Details In the discussion ...
Balint Pato's user avatar
4 votes
0 answers
43 views

When do we need to decode live the syndromes? Various examples to understand

I would like to precisely understand why we need to decode syndrome "live" when we want to perform $T$ gates. For this reason I consider different scenario (some are fictive but helpful to ...
Marco Fellous-Asiani's user avatar
4 votes
0 answers
46 views

What is the smallest system to apply nonlocal quantum LDPC codes?

I just learned that there are very promising nonlocal low-density parity check codes (LDPC) codes for quantum error correction. What is the smallest number of qubits necessary to carry out these ...
Mauricio's user avatar
  • 2,306
4 votes
0 answers
92 views

If you had a 100 qubit fully fault-tolerant quantum computer, what would you do?

As quantum computers improve, eventually we may have error-corrected devices that have very low error rate. However, many applications (Shor's algorithm, quantum chemistry) appear to require thousands ...
shixian105's user avatar
4 votes
0 answers
72 views

Why is it necessary for the Fault-tolerant error correction condition to take into account two qubit errors?

The Fault-tolerant error correction (FTEC) condition states that for a code distance of 3, if there are no input errors, even if up to one gate fault (including a two qubit error occurring on a two ...
lan's user avatar
  • 51
4 votes
0 answers
42 views

Can we have a constant-overhead threshold theorem?

The threshold theorem states that any abstract circuit in BQP can be computed by another polynomial-depth circuit that succeeds in the presence of noise. The original construction from 1996 requires ...
Dudu Ponar's user avatar
4 votes
0 answers
72 views

Resource Estimation for Ion Trap Architecture

Most resource estimation papers (computing physical qubit count, algorithm run time, power consumption, etc.) target the superconducting qubit architecture. Some examples include How to factor 2048 ...
quantum123's user avatar
4 votes
0 answers
65 views

QEC code with transversal Hadamard on one logical qubit

Is there a known QEC code that encodes more than one logical qubit, and which has a transversal logical Hadamard gate on only one of the logical qubits?
Peter-Jan's user avatar
  • 1,529
4 votes
0 answers
55 views

Which kinds of codes have their automorphism group in the Clifford Group

Two quantum codes are said to be equivalent if they are related by a non-entangling gate. The automorphism group of a quantum code is the group of all code equivalences. Every automorphism of a $GF(4)$...
Eric Kubischta's user avatar
4 votes
1 answer
138 views

How to correct error during the syndrome measurement or recovery process?

Here's the figure 10.21 from Nielsen's Quantum Computation and Quantum Information to explain the fault-tolerant quantum computing, where the circuit in the figure corrects the error that happens in ...
SUSY's user avatar
  • 41
4 votes
0 answers
88 views

Eastin Knill Theorem and global phase

In quantum we don't care about global phases, but I want to ask a question about global phases anyway. The original Eastin-Knill theorem paper https://arxiv.org/abs/0811.4262 says $$ CP = \Pi_{i=1}^k ...
Ian Gershon Teixeira's user avatar
4 votes
0 answers
66 views

Why are all the error cosets $Q.S$ given the erasure chain $\mathcal E$ and a syndrome $\sigma$ equiprobable? (Delfosse-Zémor)

In arXiv 1703.01517 (published here), a maximum likelihood decoding for qubit loss is explained. A quantum erasure channel erases each qubit independently with some probability $p$ and replaces it ...
Sanchayan Dutta's user avatar
4 votes
0 answers
101 views

How many times does syndrome extraction need to be repeated?

As part of implementing a QEC code, we need to do some syndrome measurement. In order for this syndrome measurement, we need to make sure that any $k \leq t$ errors (with a distance $2t + 1$ code) ...
itsabijection's user avatar
4 votes
0 answers
132 views

Is it interesting to look at surface codes where the boundary conditions give the shape of a Mobius strip, Klein bottle, or the projective plane?

I was reading about the Toric code and how the boundary codes give it a shape of of a torus. Is it interesting to look at other ways to orient the edges of a square lattice? I.e. a mobius strip, Klein ...
user2521987's user avatar
4 votes
0 answers
105 views

What is the algorithm for the optimal decoder in a quantum erasure channel?

I'm reading this paper : Holographic Quantum Error Correcting Codes and on page 3 they describe an optimal decoder for erasure channel. The description is for CSS codes but they claim that "it is ...
unknown's user avatar
  • 2,082
4 votes
0 answers
79 views

How to translate performance of two classical codes to a quantum CSS code?

I have a database of classical codes with simulation results in binary symmetric channel (BSC). The codes are defined by their parity check matrices $H$. I can pick pairs of codes and call them $H_x$ ...
unknown's user avatar
  • 2,082
4 votes
0 answers
121 views

What do Z logical errors look like in 3d color codes?

I am trying to better understand (standard, not gauge) 3d color codes. In particular, I am working with the lattice proposed in 1. I understand how X error works, forming strings of the kind Vertex -&...
Pablo's user avatar
  • 501
4 votes
0 answers
67 views

Calculating symplectic dual of a code

Stabilizer codes can be treated as symplectic codes over $\mathbb{F}_2$ (or over $\mathbb{F}_p$ when taking about q-dits). While treating error class, symplectic dual of the code plays a crucial part (...
Root's user avatar
  • 479
4 votes
0 answers
74 views

Calculating length of code words in quantum information(compression)

I was studying this article by Boestrom and Felbinger. We define the significant length of the codewords in the preparation of the communication protocol : $$L_c(w_i) = \lceil log_k(i) \rceil$$ We ...
John Jones's user avatar
4 votes
0 answers
54 views

How to do the counting when computing the fault tolerant threshold of quantum codes?

Here, I want to ask a basic question about how to compute the fault tolerance threshold of quantum codes. As I know, maybe, the most usual way is to do some simulations. Howvever, I am more intersted ...
Bruce Fang's user avatar
4 votes
0 answers
131 views

Proper definition of logical operation in Q.E.C

My question is related to this topic I consider working with error correcting code on which I want to define logical operations. Let's assume I want to define a logical operation on logical qubit. In ...
Marco Fellous-Asiani's user avatar
4 votes
0 answers
153 views

The importance of length-4 cycles in Quantum LDPC codes

It is a proven and well-known fact that length-4 cycles are detrimental to the performance of classical LDPC codes. This is due to the fact that such short cycles impair the decoding algorithm (Sum ...
Patrick Fuentes's user avatar
4 votes
0 answers
110 views

Is the quantum Singleton bound compatible with the Toric Code?

Note: Cross-posted on Physics SE. The quantum Singleton bound states that for an error-correcting code with $n$ physical qubits and $k$ encoded qubits, and some subsystem $R$ of $m$ qubits that can '...
Joe's user avatar
  • 141
3 votes
0 answers
60 views

How to perform logical operations between logical qubits in a $[\![8,3,2]\!]$ quantum code?

I have a small question on codes like $[\![8,3,2]\!]$, which encodes physical qubits to multiple logical qubits. How do we perform logical operations in between these logical qubits? Of course, if I ...
AndyLiuin's user avatar
  • 165
3 votes
0 answers
22 views

How many $ [[9,1,3]] $ surface codes are there?

Two codes are said to be equivalent if their code spaces are related by a non-entangling gate, i.e., a gate from $U(2)^{\otimes n} \rtimes S_n$, the local unitaries together with permutations. The ...
Ian Gershon Teixeira's user avatar
3 votes
0 answers
51 views

How to address the 2 logical qubits on the toric code individually? In general, how to address $k$ logical qubits in a $[[n,k,d]]$ code independently?

Suppose I have a $[[n,k,d]]$-quantum error correction code. Let us take the toric code $(T^2=S^1 \times S^1)$ as an example. We have 2 logical qubits whose logical operators lie along the different ...
JoJo P's user avatar
  • 315
3 votes
1 answer
96 views

Single-shot error correction for the surface code with measurement errors

I am trying to implement a single-shot error correction for the surface code with data + measurement errors (both with prob. p), using the (build-in) BP+OSD decoder. I am mostly following these papers:...
David Dentelski's user avatar
3 votes
0 answers
53 views

What are the advantages of building CSS codes out of dual-containing classical codes?

Is there any advantage to building CSS codes out of dual-containing classical codes, as opposed to general CSS codes? Other than satisfying the commutation conditions directly, are there any useful ...
Dina's user avatar
  • 31
3 votes
1 answer
177 views

Simulating erasures with stim

We're trying to simulate erasure errors on the surface code using Stim. The threshold for erasure errors on the data qubits (after initialization) is 50%. We followed the following post: How do I ...
MystMan's user avatar
  • 131
3 votes
0 answers
44 views

Show that ${\cal C}(\rho)={\rm Tr}[U(\rho\otimes|0\rangle\!\langle0|)U^\dagger]$ can be corrected iff $t=0$, where $U=I+(e^{it}-1)|\Psi^-〉〈\Psi^-|$

Let $ \mathcal{C} $ be the quantum channel defined by $$ \mathcal{C}(\rho)=\operatorname{Tr}_{2}\left[U(\rho \otimes|0\rangle\langle 0|) U^{\dagger}\right], $$ where $ U $ is the two-qubit unitary ...
Dennis's user avatar
  • 31
3 votes
0 answers
153 views

How does Teleportation based Error Correction (TEC) detect and correct loss/erasure errors?

I'm looking at papers like Demonstration of teleportation-based error correction in the IBM quantum computer (page) 10 and Role of syndrome information on a one-way quantum repeater using ...
Saurabh Shringarpure's user avatar
3 votes
0 answers
104 views

Obtaining low weight stabilizer generators

Suppose I know a set of stabilizer generators of a qubit quantum code. Is there a systematic (and possibly efficient) way to transform this set of generators to a different set (generating the same ...
user1677907's user avatar
3 votes
0 answers
63 views

How is the theory of modular representation involved with error-correction?

Recently, I have heard that the theory of modular representation can be involved with error correction in quantum information theory. However, from a point of view of mathematician, I am still quite ...
Chloé.X.AI's user avatar