Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Single-Shot Decoding of Quantum Codes (2310.18138v2)

Published 27 Oct 2023 in quant-ph, cs.IT, and math.IT

Abstract: We discuss single-shot decoding of quantum Calderbank-Shor-Steane codes with faulty syndrome measurements. We state the problem as a joint source-channel coding problem. By adding redundant rows to the code's parity-check matrix we obtain an additional syndrome error correcting code which addresses faulty syndrome measurements. Thereby, the redundant rows are chosen to obtain good syndrome error correcting capabilities while keeping the stabilizer weights low. Optimal joint decoding rules are derived which, though too complex for general codes, can be evaluated for short quantum codes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. on Comp., vol. 26, no. 5, pp. 1484–1509, 1997.
  2. P. W. Shor, “Fault-tolerant quantum computation,” in Proc. Conf. on Foundations of Comp. Sci.   IEEE, 1996, pp. 56–65.
  3. H. Bombín, “Single-shot fault-tolerant quantum error correction,” Physical Review X, vol. 5, no. 3, p. 031043, 2015.
  4. A. Ashikhmin, C.-Y. Lai, and T. A. Brun, “Quantum data-syndrome codes,” IEEE J. Select. Areas Commun., vol. 38, no. 3, pp. 449–462, 2020.
  5. A. R. Calderbank and P. W. Shor, “Good quantum error-correcting codes exist,” Physical Review A, vol. 54, no. 2, pp. 1098–1105, Aug. 1996.
  6. D. MacKay, G. Mitchison, and P. McFadden, “Sparse-graph codes for quantum error correction,” IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2315–2330, Oct. 2004.
  7. M. Fresia, F. Perez-Cruz, H. V. Poor, and S. Verdu, “Joint source and channel coding,” IEEE Signal Processing Mag., vol. 27, no. 6, pp. 104–113, Nov. 2010.
  8. J. Leon, “A probabilistic algorithm for computing minimum weights of large error-correcting codes,” IEEE Trans. Inf. Theory, vol. 34, no. 5, pp. 1354–1359, May 1988.
  9. D. Poulin and Y. Chung, “On the iterative decoding of sparse quantum codes,” 2008.
  10. D. Ostrev, D. Orsucci, F. Lázaro, and B. Matuz, “Classical product code constructions for quantum calderbank-shor-steane codes,” [online]. Available: arXiv:2209.13474 [quant-ph], 2022.
  11. A. Y. Kitaev, “Quantum error correction with imperfect gates,” in gates, Quantum Communication, Computing, and Measurement (Proc. 3rd Int. Conf. of Quantum Communication and Measurement.   Plenum Press, New York, 1997, pp. 181–188.

Summary

We haven't generated a summary for this paper yet.