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)
875
questions
0
votes
0
answers
3
views
What is the logical gate speed of a superconduting quantum computer?
What is the logical gate speed of a photonic quantum computer? says
In a simple world the speed of a photonic quantum computer would just be the speed at which it’s possible to make small (fixed ...
- 1,726
0
votes
0
answers
23
views
AGP Fault-tolerance of the flag qubit QEC for 7-qubit Steane code
I was trying to apply the flag qubit QEC (https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.121.050502) for 7-qubit Steane code.
From the AGP method (https://arxiv.org/pdf/quant-ph/0504218),
...
- 21
2
votes
1
answer
53
views
How do Union-Find Decoders deal with Measurement errors through multiple measurement rounds?
I've read a few papers regarding to Surface Code and its decoding algorithms. I've learned that a Union-Find decoder need up to $d$ measurement rounds to deal with measurement errors.
These ...
- 21
1
vote
1
answer
28
views
How to find the undetected errors for general stabilizer codes in Stim?
In Stim, we use the detectors to track syndrome flips and infer the error pattern. However, the syndrome stays the same if the actual error pattern is a logical operator of the code by coincidence. It'...
- 11
1
vote
0
answers
26
views
Are transversal entangling gates possible for stabilizer codes other than CSS?
It is well known that CSS codes can have lots of transversal entangling gates. For example, $ CNOT $ is exactly transversal on 2 blocks of any $ [[n,1,d]] $ CSS code. And https://arxiv.org/abs/1304....
- 4,460
1
vote
2
answers
55
views
Is working with the |+> , |-> basis any harder than the |0>, |1> basis?
Say I have a code, for example the $ [[5,1,3]] $ code, and I want to (fault tolerantly) prepare the logical $ |+ \rangle $ state. Is that any harder than preparing the logical $ | 0 \rangle $ state? ...
- 4,460
1
vote
3
answers
78
views
Highest theoretical threshold to fight single-qubit depolarizing noise for noiseless error-correction
Let's consider that each qubit in the lab faces a single-qubit depolarizing channel $\mathcal{N}(\rho)=(1-p) \rho + p \mathbb{I}/2$.
Is there a theoretical result indicating the largest value of $p$ ...
- 1,756
0
votes
0
answers
18
views
Is it sufficient to assume a constant coherent error?
I've recently started working with quantum errors and noise and came across an intriguing but simple question. When we consider coherent errors in quantum gate operations, it's common to model them as ...
- 23
0
votes
0
answers
18
views
Boundary conditions for surface code
I have a question about boundary conditions for surface codes. Do any surface codes have torus-like boundary conditions? Are there any surface codes that don't actually have boundary conditions, i.e. ...
- 11
1
vote
1
answer
49
views
How is $(\langle \psi| E_{a}^\dagger E_{b} | \psi \rangle)^\dagger = C_{ba}^*\langle \psi| \psi \rangle $
I am reading through Daniel Gottesmans surviving as a quantum computer in a classical world. On page 36, he presents the following theorem:
Theorem 2.7 (QECC Conditions). $(Q, \mathcal{E})$ is a $Q E ...
- 1,127
2
votes
0
answers
53
views
Is every code with a universal set of transversal gates trivial?
The quantum repetition code is an $ [[n,1,1]] $ stabilizer code with stabilizer generators $ Z_iZ_{i+1} $ for $ i=1, \dots, n-1 $.
The Eastin-Knill theorem states that a $ d >1 $ code cannot have a ...
- 4,460
0
votes
1
answer
25
views
What does DETECTORs mean in the example circuit for rotated surface code in Stim?
In Stim, an example circuit for rotated surface code is provided:
...
- 51
0
votes
1
answer
35
views
Advantages and disadvantages of rotated surface code
I think one of the advantages of rotated surface code is that it can express surface code with fewer physical bits. Are there any other advantages?
Also, are there any disadvantages compared to ...
- 11
0
votes
1
answer
26
views
What is the easiest way to get path graph from Stim?
In Stim, we can get a detector graph with the probability of each error mechanism occurring. Now I want to construct a path graph from the detector graph, which is usually done by Dijkstra's algorithm....
- 61
1
vote
1
answer
53
views
How does measurement based quantum computing (MBQC) behave under error propagation?
In the quantum circuit model, we know how to handle error propagation if we implement a unitary $U'$, which is $\varepsilon$-close to the ideal unitary $U$ and a state $|\psi'\rangle$, which is also $\...
- 33