Quantum Low-Density Parity-Check Codes
By Ivan B. Djordjevic. 2012
426 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/7b0a5099f1fcaecacedd9a26fa816e8f6fe2b640
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Suguru Endo
- Simon C. Benjamin
- Jay M. Gambetta
- Ying Li
- Jarrod R. McClean
- Ryan Babbush
- Sergey Bravyi
- Patrick J. Coles
In Computer Networks and Communications
- Sergey Bravyi
- Jay M. Gambetta
- Pavel Panteleev
- William J. Huggins
- Simon C. Benjamin
- Jarrod R. McClean
- Gleb Kalachev
- Ryan Babbush
Citations in the corpus
- The future of quantum computing with superconducting qubits (2022, background): “To approach question (3), we discuss generalizations of the surface code known as low-density parity check (LDPC) quantum codes 16,17 .”
- Asymptotically good Quantum and locally testable classical LDPC codes (2021, methodology): “In this paper, we adopt a very simple combinatorial definition (see [7, Definition 11]) that implies a rather strong form of local testability.”
- A quantum processor based on coherent transport of entangled atom arrays (2021, positive): “In addition, these techniques also enable implementation of higher-dimensional or nonlocal error correcting codes with more favorable properties [47, 48].”
- Quantum error mitigation (2022, background): “There is ongoing theoretical research to find alternative codes with a more favourable overhead, and recent progress gives reasons to be optimistic (Breuckmann and Eberhardt, 2021; Dinur et al. , 2022; Gottesman, 2014; Panteleev and Kalachev, 2022).”