Fetching the paper…
Reading the bibliography…
Quantum error correction has recently been shown to benefit greatly from specific physical encodings of the code qubits.
Y. Wang, “Quantum error correction with the GKP code and concatenation with stabilizer codes,” Master’s thesis, RWTH-Aachen, 2019. DOI: 10.48550/ARXIV.1908.00147
1908
Earlier work this paper cites.
R. G. Gallager, Low Density Parity Check Codes . Cambridge, MA: M.I.T. Press, 1963. DOI: 10.7551/mitpress/4347.001.0001
1963
Earlier work this paper cites.
J. Pearl, Probablisitic Reasoning in Intelligent Systems . San Francisco, CA: Kaufmann, 1988. DOI: 10.1016/C2009-0-27609-4
1988
Earlier work this paper cites.
A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A , vol. 54, no. 2, pp. 1098–1105, Aug. 1996. DOI: 10.1103/physreva.54.1098
1996
Earlier work this paper cites.
A. M. Steane, “Simple quantum error-correcting codes,” Phys. Rev. A , vol. 54, no. 6, pp. 4741–4751, Dec. 1996. DOI: 10.1103/PhysRevA.54.4741
1996
Earlier work this paper cites.
A. Steane, “Multiple-particle interference and quantum error correction,” Proc. Roy. Soc. Lon. A , vol. 452, no. 1954, pp. 2551–2577, 1996. DOI: 10.1098/rspa.1996.0136
1996
Earlier work this paper cites.
M. G. Kim, N. Imoto, K. Cho, and M. S. Kim, “Quantum noise in optical beam propagation in distributed amplifiers,” Optics Communications , vol. 130, no. 4-6, pp. 377–384, 1996. DOI: 10.1016/0030-4018(96)00248-9
1996
Earlier work this paper cites.
D. Gottesman, “Stabilizer codes and quantum error correction,” Ph.D. dissertation, California Institute of Technology, 1997. DOI: 10.7907/rzr7-dt72
1997
Earlier work this paper cites.
D. Gottesman, A. Kitaev, and J. Preskill, “Encoding a qubit in an oscillator,” Phys. Rev. A , vol. 64, no. 1, p. 012310, Jun. 2001. DOI: 10.1103/PhysRevA.64.012310
2001
Earlier work this paper cites.
F. R. Kschischang, B. J. Frey, and H. A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 498–519, Feb. 2001. DOI: 10.1109/18.910572
2001
Earlier work this paper cites.
E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” J. Math. Phys. , vol. 43, no. 9, pp. 4452–4505, 2002. DOI: 10.1063/1.1499754
2002
Earlier work this paper cites.
T. J. Richardson, “Error floors of LDPC codes,” in Proc. 41st Ann. Allerton Conf. Commun., Contr. and Comp. , Monticello, IL, USA, Sept. 2003, pp. 1426–1435. [Online]. Available: https://web.stanford.edu/class/ee388/papers/ErrorFloors.pdf
2003
Earlier work this paper cites.
D. J. C. MacKay, G. Mitchison, and P. L. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Trans. Inf. Theory , vol. 50, no. 10, pp. 2315–2330, Oct. 2004. DOI: 10.1109/TIT.2004.834737
2004
Earlier work this paper cites.
D. E. Hocevar, “A reduced complexity decoder architecture via layered decoding of LDPC codes,” in Proc. IEEE Workshop on Signal Processing Systems , 2004, pp. 107–112. DOI: 10.1109/SIPS.2004.1363033
2004
Earlier work this paper cites.
M. P. C. Fossorier, “Quasicyclic low-density parity-check codes from circulant permutation matrices,” IEEE Trans. Inf. Theory , vol. 50, no. 8, pp. 1788–1793, Aug. 2004. DOI: 10.1109/TIT.2004.831841
2004
Earlier work this paper cites.
R. Tanner, D. Sridhara, A. Sridharan, T. Fuja, and J. Costello, D.J., “LDPC block and convolutional codes based on circulant matrices,” IEEE Trans. on Inf. Theory , vol. 50, no. 12, pp. 2966–2984, Dec. 2004. DOI: 10.1109/TIT.2004.838370
2004
Earlier work this paper cites.
J. Chen, A. Dholakia, E. Eleftheriou, M. Fossorier, and X.-Y. Hu, “Reduced-complexity decoding of LDPC codes,” IEEE Trans. Commun. , vol. 53, no. 8, pp. 1288–1299, Aug. 2005. DOI: 10.1109/TCOMM.2005.852852
2005
Earlier work this paper cites.
E. Sharon, S. Litsyn, and J. Goldberger, “Efficient serial message-passing schedules for LDPC decoding,” IEEE Trans. Inf. Theory , vol. 53, no. 11, pp. 4076–4091, 2007. DOI: 10.1109/TIT.2007.907507
2007
Earlier work this paper cites.
D. Declercq and M. Fossorier, “Improved impulse method to evaluate the low weight profile of sparse binary linear codes,” in Proc. IEEE Intl. Symp. Inf. Theory , 2008, pp. 1963–1967. DOI: 10.1109/ISIT.2008.4595332
2008
Earlier work this paper cites.
P. Sarvepalli and A. Klappenecker, “Degenerate quantum codes and the quantum hamming bound,” Phys. Rev. A , vol. 81, no. 3, p. 032318, Mar. 2010. DOI: 10.1103/PhysRevA.81.032318
2010
Earlier work this paper cites.
K. K. Sabapathy, J. S. Ivan, and R. Simon, “Robustness of non-gaussian entanglement against noisy amplifier and attenuator environments,” Phys. Rev. Lett. , vol. 107, no. 13, p. 130501, 2011. DOI: 10.1103/PhysRevLett.107.130501
2011
Earlier work this paper cites.
J. S. Ivan, K. K. Sabapathy, and R. Simon, “Operator-sum representation for bosonic gaussian channels,” Phys. Rev. A , vol. 84, no. 4, p. 042311, 2011. DOI: 10.1103/PhysRevA.84.042311
2011
Cited alongside, same era.
A. A. Kovalev and L. P. Pryadko, “Improved quantum hypergraph-product LDPC codes,” in Proc. IEEE Intl. Symp. Inf. Theory , Jul. 2012, pp. 348–352. DOI: 10.1109/ISIT.2012.6284206
2012
Cited alongside, same era.
J.-P. Tillich and G. Zémor, “Quantum LDPC codes with positive rate and minimum distance proportional to the square root of the blocklength,” IEEE Trans. Inf. Theory , vol. 60, no. 2, pp. 1193–1202, 2014. DOI: 10.1109/TIT.2013.2292061
2013
Cited alongside, same era.
D. Gottesman, “Fault-tolerant quantum computation with constant overhead,” Quantum Inf. and Computation , vol. 14, no. 15–16, pp. 1338–1372, Nov. 2014. DOI: 10.26421/QIC14.15-16-5
2014
Cited alongside, same era.
N. P. Breuckmann and J. N. Eberhardt, “Quantum low-density parity-check codes,” PRX Quantum , vol. 2, no. 4, p. 040101, Oct. 2021. DOI: 10.1103/PRXQuantum.2.040101
2021
Closest in time.
M. B. Hastings, J. Haah, and R. O’Donnell, “Fiber bundle codes: Breaking the n 1 / 2 polylog ( n ) n^{1/2}\operatorname{polylog}(n) barrier for quantum LDPC codes,” in Proc. of the 53rd Ann. ACM SIGACT Symp. on Theory of Computing , New York, NY, USA, 2021, pp. 1276–1288. DOI: 10.1145/3406325.3451005
2021
Closest in time.
P. Panteleev and G. Kalachev, “Quantum LDPC codes with almost linear minimum distance,” IEEE Trans. Inf. Theory , vol. 68, no. 1, pp. 213–229, Jan. 2022. DOI: 10.1109/TIT.2021.3119384
2021
Closest in time.
N. P. Breuckmann and J. N. Eberhardt, “Balanced product quantum codes,” IEEE Trans. Inf. Theory , vol. 67, no. 10, pp. 6653–6674, Oct. 2021. DOI: 10.1109/TIT.2021.3097347
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Vasić, D. Nguyen, and S. K. Chilappagari, “Chapter 6 - Failures and error floors of iterative decoders,” in Channel Coding: Theory, Algorithms, and Applications: Academic Press Library in Mobile and Wireless Commun. Oxford: Academic Press, 2014, pp. 299–341. DOI: 10.1016/B978-0-12-396499-1.00006-6
2014
Cited alongside, same era.
K. Fukui, A. Tomita, and A. Okamoto, “Analog quantum error correction with encoding a qubit into an oscillator,” Phys. Rev. Lett. , vol. 119, no. 18, p. 180507, Nov. 2017. DOI: 10.1103/PhysRevLett.119.180507
2017
Cited alongside, same era.
O. Fawzi, A. Grospellier, and A. Leverrier, “Efficient decoding of random errors for quantum expander codes,” in Proc. 50th Ann. ACM SIGACT Symp. on Theory Computing , Los Angeles, CA, USA, 2018, pp. 521–534. DOI: 10.1145/3188745.3188886
2018
Cited alongside, same era.
K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, “High-threshold fault-tolerant quantum computation with analog quantum error correction,” Phys. Rev. X , vol. 8, no. 2, p. 021054, May 2018. DOI: 10.1103/PhysRevX.8.021054
2018
Cited alongside, same era.
K. Noh, V. V. Albert, and L. Jiang, “Quantum capacity bounds of gaussian thermal loss channels and achievable rates with Gottesman-Kitaev-Preskill codes,” IEEE Trans. Inf. Theory , vol. 65, no. 4, pp. 2563–2582, 2018. DOI: 10.1109/TIT.2018.2873764
2018
Cited alongside, same era.
V. V. Albert, K. Noh, K. Duivenvoorden, D. J. Young, R. Brierley, P. Reinhold, C. Vuillot, L. Li, C. Shen, S. Girvin, B. M. Terhal, and L. Jiang, “Performance and structure of single-mode bosonic codes,” Phys. Rev. A , vol. 97, no. 3, p. 032346, Mar. 2018. DOI: 10.1103/PhysRevA.97.032346
2018
Cited alongside, same era.
W. Zeng and L. P. Pryadko, “Higher-dimensional quantum hypergraph-product codes with finite rates,” Phys. Rev. Lett. , vol. 122, no. 23, p. 230501, Jun 2019. DOI: 10.1103/PhysRevLett.122.230501
2019
Cited alongside, same era.
C. Vuillot, H. Asasi, Y. Wang, L. P. Pryadko, and B. M. Terhal, “Quantum error correction with the toric Gottesman-Kitaev-Preskill code,” Phys. Rev. A , vol. 99, no. 3, p. 032344, Mar. 2019. DOI: 10.1103/PhysRevA.99.032344
2019
Cited alongside, same era.
2021
Closest in time.
K. Noh, “Quantum computation and communication in bosonic systems,” Ph.D. dissertation, Yale University, 2021. DOI: 10.48550/ARXIV.2103.09445
2021
Closest in time.
A. L. Grimsmo and S. Puri, “Quantum error correction with the Gottesman-Kitaev-Preskill code,” PRX Quantum , vol. 2, no. 2, p. 020101, 2021. DOI: 10.1103/PRXQuantum.2.020101
2021
Closest in time.
F. Rozpędek, K. Noh, Q. Xu, S. Guha, and L. Jiang, “Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes,” npj Quantum Inf. , vol. 7, no. 1, pp. 1–12, 2021. DOI: 10.1038/s41534-021-00438-7
2021
Closest in time.
K. Fukui, R. N. Alexander, and P. van Loock, “All-optical long-distance quantum communication with Gottesman-Kitaev-Preskill qubits,” Phys. Rev. Research , vol. 3, no. 3, p. 033118, 2021. DOI: 10.1103/PhysRevResearch.3.033118
2021
Closest in time.
W.-L. Ma, S. Puri, R. J. Schoelkopf, M. H. Devoret, S. Girvin, and L. Jiang, “Quantum control of bosonic modes with superconducting circuits,” Science Bulletin , vol. 66, no. 17, pp. 1789–1805, 2021. DOI: 10.1016/j.scib.2021.05.024
2021
Closest in time.
J. V. Coquillat, F. G. Herrero, N. Raveendran, and B. Vasić, “Syndrome-based min-sum vs OSD-0 decoders: FPGA implementation and analysis for quantum LDPC codes,” IEEE Access , vol. 9, pp. 138 734–138 743, Oct. 2021. DOI: 10.1109/ACCESS.2021.3118544
2021
Closest in time.
N. Raveendran and B. Vasić, “Trapping sets of quantum LDPC codes,” Quantum , vol. 5, p. 562, Oct. 2021. DOI: 10.22331/q-2021-10-14-562
2021
Closest in time.
P. Fuentes, J. Etxezarreta, P. Crespo, and J. Garcia-Frias, “Degeneracy and its impact on the decoding of sparse quantum codes,” IEEE Access , vol. 9, pp. 89 093–89 119, Jun. 2021. DOI: 10.1109/ACCESS.2021.3089829
2021
Closest in time.
2021
Closest in time.
2022
Closest in time.
K. Noh, C. Chamberland, and F. G. S. L. Brandão, “Low-overhead fault-tolerant quantum error correction with the surface-GKP code,” PRX Quantum , vol. 3, p. 010315, Jan 2022. DOI: 10.1103/PRXQuantum.3.010315
2022
Closest in time.
B. de Neeve, T. L. Nguyen, T. Behrle, and J. Home, “Error correction of a logical grid state qubit by dissipative pumping,” Nature Phys. , vol. 18, pp. 296–300, 2022. DOI: 10.1038/s41567-021-01487-7
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
B. M. Terhal, J. Conrad, and C. Vuillot, “Towards scalable bosonic quantum error correction,” Quantum Sci. Technol. , vol. 5, no. 4, p. 043001, Jul. 2020. DOI: 10.1088/2058-9565/ab98a5
2058
Closest in time.