We’re rewarding the question askers & reputations are being recalculated! Read more.

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)

Filter by
Sorted by
Tagged with
3
votes
1answer
48 views

Nielsen & Chuang Excercise Question on CSS code

I was reading the CSS ( Steane Code) from the Nielsen & Chuang book. It asked in Ex. 10.27 to prove that $$|x+C_2\rangle\equiv \dfrac{1}{\sqrt{|C_2|}}\sum_{y\in C_2}(-1)^{u.y}|x+y+v\rangle $$ and ...
3
votes
1answer
68 views

Can we conclude that errors on Sycamore are Poisson-distributed Pauli errors?

In Martinis' recent Caltech lecture on the Sycamore paper, he appears to make much of the fact that FIG. 4 of the paper show straight-line fidelity - that is, the fidelity decreases log-linearly with ...
4
votes
1answer
72 views

Shor's Code: Understanding how it satisfies Knill Laflamme Theorem

I'm new to Quantum Error Correction, and I have a question on Shor's Code. If we have a protected subspace, $V \subset \mathbf{C}^2\otimes \cdots \otimes \mathbf{C}^2$ $V=\operatorname{span}\{|0_{...
4
votes
1answer
61 views

Matrix Index and multiplication rules for Hermitian Pauli group products

Given the Hermitian Pauli group products $$ \Omega_{a,b}=\{\pm 1,\pm i\}_{a,b}\cdot \{I,X,Y,Z\}_{a,b}^{\otimes n} $$ composed of $n$ 2x2 pauli matrices $(I,X,Y,Z)$ in tensor product, such that they ...
3
votes
1answer
48 views

Exercise 10.34 of Nielsen and Chuang : $-I$ not element of stabilizer group iff $g_j^2=I$ and $g_j \neq I$ where $g_j$ generators

I am stuck with this exercice of Nielsen and Chuang: Let $S = \langle g1,... ,gl \rangle $.Show that $−I$ is not an element of S if and only if $g^2_j = I$ for all $j$,and $g_j \neq − I$ for all $j$...
2
votes
0answers
19 views

Is manual or automated error correction more practically promising in the near term?

I'm curious if there's any consensus on this question among actual practitioners, but please feel free to close it if it's hopelessly opinion-based (since we've only taken baby steps toward the ...
6
votes
0answers
30 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 ...
1
vote
0answers
17 views

Distance and number of corrected errors in quantum error correction [duplicate]

In Gottesman's introduction, it writes A code that corrects t errors is said to have distance 2t + 1, because it takes 2t + 1 single-qubit changes to get from one codeword to another. Other ...
10
votes
5answers
386 views

What is quantum entanglement, and what role does it play in quantum error correction?

I want to understand what quantum entanglement is and what role does it play in quantum error correction. NOTE: As per the suggestions of @JamesWootton and @NielDeBeaudrap, I have asked a separate ...
9
votes
2answers
137 views

Are all $[[n, k, d]]$ quantum codes equivalent to additive self-orthogonal $GF(4)^n$ classical codes?

Theorem 2 of [1] states: Suppose $C$ is an additive self-orthogonal sub-code of $\textrm{GF}(4)^n$, containing $2^{n-k}$ vectors, such that there are no vectors of weight $<d$ in $C^\perp/C$. ...
2
votes
2answers
43 views

Link between distance of a stabilizer code and number of errors it is able to correct

I am confused by a property. In the N&Chuang it is said that an $[n,k,2t+1]$ stabilizer code is able to correct up to $t$ errors. But for me if the code has distance $d$ it should be able to ...
1
vote
0answers
19 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 ...
6
votes
2answers
145 views

Intuition about Knill-Laflamme QEC conditions

The Knill Laflamme QEC conditions are stated this way: We consider a code space $C$ and its associated projector $P_C$. We consider a noise acting on our system: $E(\rho)=\sum_a E_a \rho E_a^{\...
20
votes
2answers
3k views

What is 'Surface Code'? (Quantum Error Correction)

I am studying Quantum Computing and Information. I have crossed with the 'Surface Code' phrase but I can't find a brief explanation of what it is and how it works. Hopefully you guys can help me with ...
2
votes
1answer
42 views

What are the Main Classes of Quantum Error-Correcting Codes?

Classically, we have the Hamming Code, Turbo Code, Reed-Solomon Code, etc. I am interested in knowing the classes of quantum error-correcting codes. They don't have to be analogous to classical codes, ...
1
vote
1answer
143 views

How do I interpret the readout error for a quantum computer?

For example, the ibmqx2 computer has the most recent readout error of $4.40 \cdot 10^{-2}$. Does this mean per 1000 measurements, 44 faulty results exist?
1
vote
0answers
143 views

Job execution issue while using IBMQ Experience

I am trying to run QSVM algorithm on the IBMQ backend devices using the API_TOKEN. Below is the snippet of the code that I am running. The code fails the validation test and throws an exception after ...
2
votes
1answer
52 views

Questions about theorem and proof: “Quantum error correction condition”, Thm 10.1 Nielsen & Chuang

I have some basic questions around the theorem giving quantum error correction conditions that give necessary & sufficient conditions to have an error correcting operation. The theorem is stated ...
3
votes
1answer
40 views

Basics on CSS codes: manipulation of the ancillas to detect error

I am reading the very basics about CSS codes in the Nielsen & Chuang. On page 450 of this book is explained how the ancillas are used to detect a bit-flip error on the encoded data. We consider $...
4
votes
1answer
73 views

Knill-Laflamme condition and requirements for error correction

Suppose we have a stabilizer group $\mathcal{M}$, the Knill-Laflamme condition for error correction states An error with Kraus operators $\{E_k\}$ is correctable if either $$E^\dagger_kE_l\in\...
3
votes
1answer
84 views

Going from a circuit to the quantum state output of the circuit

I'm looking at the following lecture notes where we start with the circuit below for some state $\vert\psi\rangle_L$ that picks up an error to become $E\vert\psi\rangle_L$ It is later claimed in the ...
1
vote
1answer
209 views

All unitary errors are correctable

The Knill-Laflamme condition for a stabilizer $\mathcal{M}$ is An error with Kraus operators $\{E_k\}$ is correctable if either $$E^\dagger_kE_l\in\mathcal{M}\quad\forall\, k,l $$ or there exists $...
0
votes
0answers
21 views

Density Evolution to Optimize QLDPC code design

Density Evolution is a simulative tool that models the behaviour of SPA (sum-product) decoders. It is useful because it enables the optimization of code designs so that extensive simulations can be ...
2
votes
2answers
102 views

The merit of quantum error correction codes

We know that word error rate (WER) rather than qubit error rate (QER) is used to evaluate the performance of quantum Turbo codes and quantum LDPC codes. In classical coding theory, when we are ...
2
votes
0answers
48 views

I thought we had already passed this error and qubit threshold?

As outlined in Quantum Computing Progress and Prospects published this year, on page 169-171 there is the diagram showing that we are at the 10's of qubits mark. Looking into the diagram further there ...
2
votes
0answers
28 views

There seems to be a problem with the implementation of identity gates on Qiskit as compared to the circuit composer

I have been experimenting with slowing down the decay of qubits, and as a control, I implemented a circuit with just identity gates for comparison. However, when I implement such circuits in Qiskit, ...
2
votes
2answers
68 views

How do you implement a negative controlled gate using the regular controlled gate?

I have been reading a paper about perfect error correction codes, and when the circuit is described, the author uses some negative controlled gates, that is: The gate is applied if the control is $|0\...
4
votes
2answers
117 views

2 ways to do the three qubits bit-flip code

I'm trying to understand the three qubits bit-flip code. I use the book of Phillip Kaye An introduction to quantum computing. In this book he introduce the three qubits bit-flip code with this ...
5
votes
1answer
149 views

Get result measurement into a circuit with Qiskit

I'm trying to implement the three qubit bit flip code in Qiskit. Therefore, I need to get the result of a measure of two ancilla qubits, to deduce which gate I need to use do recover my logical qubit....
6
votes
1answer
106 views

What is the definition of Bell state on a n-qubit system?

Question 1: The bell state for a 2-qubit system has been defined in Neilsen and Chuang's book as the set of maximally entangled states spanned by $\{|00\rangle + |11\rangle, |00\rangle - |11\rangle, |...
6
votes
1answer
45 views

Error syndromes and recovery procedure in bit flip code

This question relates to exercise 10.4 in Nielsen and Chuang. For syndrome diagnosis, the textbook provides an example where one has four projectors, by which, you can identify where a one qubit ...
6
votes
1answer
168 views

How does measurement calibration work?

One of the possible ways to improve the results of an experiment on the IBM machine using the Qiskit language is to use the measurement calibration methods. This is the link to the documentation. I ...
7
votes
1answer
93 views

How to calculate the distance of stabilizer code?

How to calculate the distance of the stabilizer code [[n,k,d]]? It's better if you can make a 3-qubit example. And what's the relationship between d and Pauli group?
1
vote
1answer
46 views

Where (in the algorithm) is the logical qubit encoded in Q.E.C?

I have a basic question about the encoding of logical information into physical qubits. I only know the 3 qubit code (I have very limited knowledge in QEC). The 3 qubit code is usually presented as: ...
3
votes
2answers
107 views

Shor 9 qubit code — how are the observables measured and eigenvalues obtained during syndrome measurement?

Say we have the Shor 9 qubit code $$|\psi_L\rangle=\tfrac{1}{\sqrt{2^3}}((|000\rangle+|111\rangle)^{\otimes3}+(|000\rangle-|111\rangle)^{\otimes3}),$$ and we have a bit flip error. My lecture notes ...
22
votes
3answers
834 views

What level of “confidence” of the result from a quantum computer is possible?

At a very basic level, reading or measuring a qubit forces it to be in one state or the other, so the operation of a quantum computer to gain a result collapses the state into one of many ...
3
votes
1answer
55 views

State of a system after the second qubit of a Bell state sent through a bit flip error channel

The second qubit of a two-qubit system in the Bell state $$|\beta_{01}\rangle= \frac{1}{\sqrt{2}}(|01\rangle+|10\rangle)$$ is sent through an error channel which introduces a bit flip error with ...
11
votes
1answer
326 views

What is the leading edge technology for creating a quantum computer with the fewest errors?

Which technological path seems most promising to produce a quantum processor with a greater quantum volume (preferring fewer errors per qubit over more qubits), than Majorana fermions? The preferred ...
2
votes
2answers
112 views

What quantum volume is needed to represent a single logical qubit?

The quantum volume metric $V_Q$ is a proposed metric for quantifying and comparing the performance of quantum computers1. The quantum volume is defined as $$V_Q = \max_{n<N} \left(\min\left[n, d(n)...
5
votes
0answers
28 views

How is the decoherence rate connected to the error rate?

I'm reading about the threshold theorem, which states that "a quantum computer with a physical error rate below a certain threshold can, through the application of quantum error correction schemes, ...
2
votes
1answer
49 views

How does Steane code use the classical Hamming code for error correction?

I know what the Hamming code is. But I don't understand how could this idea be applied in quantum computation since it's required to cover the case of superposition and entanglement. How could you ...
4
votes
0answers
53 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 '...
3
votes
1answer
74 views

In error correction code why don't we imitate the Hamming code instead of the complicated Steane code?

Instead of the complicated Steane code, I don't understand why don't we use a much simpler and exact imitation of the classical Hamming code. So here is my idea: Let's have 7 qubits, and we will ...
1
vote
1answer
41 views

Is there an inherent difference in need for error correction between quantum annealing and gate based methods?

When I read about computing using gate based methods, I mainly read about the difficulties with error rates, circuit depth (and connectivity) and not enough qubits. With computing using quantum ...
3
votes
1answer
53 views

How does the actual measurement collapsing an error to an orthogonal basis look like?

An error can be written as a linear combination of $\Bbb I$, $X$, $Z$, $XZ$ Pauli matrices. So when measuring an errand state we aim at collapsing the error into one of these four possibilities. How ...
4
votes
0answers
86 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 ...
4
votes
1answer
146 views

How to deal with -LookupError: backend “ibmqx4” is not found?

I am using Jupyter notebook to write and running my qiskit codes (python 3.6) and every time I encounter the message: LookupError: backend "ibmqx4" is not found, right now the ibmqx4 computer is not ...
3
votes
1answer
76 views

Estimating the depolarizing probability of depolarizing channels

When considering quantum error correction over depolarizing channels, the depolarizing probability $p$ such that an error of the kind $X,Y,Z$ will happen is used as a priori information in order to ...
1
vote
1answer
62 views

What does it mean to perform a measurement in correspondence with different projections?

In error correction, like the bit flip, you perform a measurement which corresponds to different projections so that the outcomes can teach you about the error. What does it mean? How do you actually ...
2
votes
1answer
55 views

Why does phase flip correction error? Why could any error be written as a linear combination of I, X, Z and ZX matrices?

I don't understand how it's being proven that error correction can be applied only to X, Z noises and this solves all errors? Does this have to be with this set being universal? (Z is exactly like ...