<p>One big open question is the existence of &quot;good&quot; quantum LDPC codes. These are stabilizer quantum error correcting codes with constant check weight, constant rate and linear distance. Most recently there was a series of breakthroughs on this front by Hastings, Haah and O'Donnell (<a href="https://arxiv.org/abs/2009.03921" rel="nofollow noreferrer">arXiv:2009.03921</a>), Breuckmann and Eberhardt (<a href="http://arxiv.org/abs/2012.09271" rel="nofollow noreferrer">arXiv:2012.09271</a>) and Panteleev and Kalachev (<a href="http://arxiv.org/abs/2012.04068" rel="nofollow noreferrer">arXiv:2012.04068</a>).</p>

CC BY-SA 4.0
2021-01-15T08:59:39.323Z
2021-01-15T08:59:39.323Z
smapers
<p>After quantum error correction was introduced in mid '90s, in subsequent years many of the classical analogues regarding the structure of code (such as singleton bound, GV bound etc) were obtained in the quantum setting as well.
Of course, there was also the big break of stabilizer formalism, fault-tolerant computing and particular families of codes like Toric code and other surface codes.</p>
<p>What are the general directions and <em>target</em> questions in the area (like current status of decoding algorithms and codes with good parameters) and applications of it?</p>
<p>For example on the application side, one key area that we see nowadays is local codes and connections to qPCP or hamiltonian complexity. What are some (big or small) questions that we are trying to answer?</p>

CC BY-SA 4.0
2021-01-12T11:53:10.540Z
I remember something from the paper *Perfect zero knowledge for quantum multiprover interactive proofs*(https://arxiv.org/abs/1905.11280). I never read the paper thoroughly, but they seem to use techniques from quantum fault-tolerance in the first part of their proof. So it sounds like an application of quantum fault-tolerance and perhaps there are connections to interactive proofs too.
raycosine
<quantum-computing><coding-theory><complexity-theory><fault-tolerance>
What are the general direction and target question in the field of quantum error correction?
Root
# What are the general direction and target question in the field of quantum error correction?

(Asked by: username_0 on 2021-01-04)

After quantum error correction was introduced in mid '90s, in subsequent years many of the classical analogues regarding the structure of code (such as singleton bound, GV bound etc) were obtained in the quantum setting as well.
Of course, there was also the big break of stabilizer formalism, fault-tolerant computing and particular families of codes like Toric code and other surface codes.

What are the general directions and *target* questions in the area (like current status of decoding algorithms and codes with good parameters) and applications of it?

For example on the application side, one key area that we see nowadays is local codes and connections to qPCP or hamiltonian complexity. What are some (big or small) questions that we are trying to answer?

**Tags:** quantum-computing, coding-theory, complexity-theory, fault-tolerance
> **Comments:**
> **username_1**: I remember something from the paper *Perfect zero knowledge for quantum multiprover interactive proofs*(https://arxiv.org/abs/1905.11280). I never read the paper thoroughly, but they seem to use techniques from quantum fault-tolerance in the first part of their proof. So it sounds like an application of quantum fault-tolerance and perhaps there are connections to interactive proofs too.  

---

## 1 answers

### Answer by username_2 on 2021-01-15. Score: 2

One big open question is the existence of "good" quantum LDPC codes. These are stabilizer quantum error correcting codes with constant check weight, constant rate and linear distance. Most recently there was a series of breakthroughs on this front by Hastings, Haah and O'Donnell ([arXiv:2009.03921](https://arxiv.org/abs/2009.03921)), Breuckmann and Eberhardt ([arXiv:2012.09271](http://arxiv.org/abs/2012.09271)) and Panteleev and Kalachev ([arXiv:2012.04068](http://arxiv.org/abs/2012.04068)).


---

