Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with error-correction
Search options not deleted
user 14407
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)
2
votes
What are examples of scalable classical LDPC codes?
Good Classical LDPC Code of Infinitely Large Lengths.
So, the state-of-the-art solution is attributed to Sipser and Shpilman, and the modern formulation of the idea is remarkably simple. Let $C_0$ be …
- 430
2
votes
Distance of the concatenated quantum error correcting code
Distance of concatenated codes without assumptions on their structure is at least $d_1 d_2 /2$.
Another way to think about the distance is as how many qubits one should fault to trick the code's decod …
- 430
4
votes
0
answers
51
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 p …
- 430