Quantum Capacity Bounds of Gaussian Thermal Loss Channels and Achievable Rates With Gottesman-Kitaev-Preskill Codes
Open accessThe DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
Gaussian thermal loss channels are of particular importance to quantum communication theory since they model realistic optical communication channels. Except for special cases, the quantum capacity of Gaussian thermal loss channels is not yet quantified completely. In this paper, we provide improved upper bounds of the Gaussian thermal loss channel capacity, both in energy-constrained and unconstrained scenarios. We briefly review Gottesman-Kitaev-Preskill (GKP) codes and discuss their experimental implementation. We then prove, in the energy-unconstrained case, that a family of GKP codes achieves the quantum capacity of Gaussian thermal loss channels up to at most a constant gap from the improved upper bound. In the energy-constrained case, we formulate a biconvex encoding and decoding optimization problem to maximize entanglement fidelity. Then, we solve the biconvex optimization heuristically by an alternating semi-definite programming method and report that, starting from Haar random initial codes, our numerical optimization yields a hexagonal GKP code as an optimal encoding in a practically relevant regime.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
Werner, R. F. (1989) · Physical Review A · doi:10.1103/physreva.40.4277 · Cited by 4,062
Completely positive linear maps on complex matrices
Choi, M.-D. (1975) · Linear Algebra and its Applications · doi:10.1016/0024-3795(75)90075-0 · Cited by 2,659
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Self-citationQuantum error correction of a qubit encoded in grid states of an oscillator
Campagne-Ibarcq, P., Eickbusch, A., Touzard, S., Zalys-Geller, E., Frattini, N. E., Sivak, V. V., Reinhold, P., Puri, S., Shankar, S., Schoelkopf, R. J., et al. (2020) · Nature · doi:10.1038/s41586-020-2603-3 · Cited by 459
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Toward large-scale fault-tolerant universal photonic quantum computing
Takeda, S., & Furusawa, A. (2019) · APL Photonics · doi:10.1063/1.5100160 · Cited by 234
“This qubit can be protected against sufficiently small phase-space displacement errors and photon-loss errors 78 .”
Fast universal control of an oscillator with weak dispersive coupling to a qubit
Eickbusch, A., Sivak, V., Ding, A. Z., Elder, S. S., Jha, S. R., Venkatraman, J., Royer, B., Girvin, S. M., Schoelkopf, R. J., & Devoret, M. H. (2022) · Nature Physics · doi:10.1038/s41567-022-01776-9 · Cited by 173
“The finite energy square GKP code stabilizers and logical Pauli operators are defined as [4, 8, 23, 49, 50, 85]”
BackgroundAll-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
Baragiola, B. Q., Pantaleoni, G., Alexander, R. N., Karanjai, A., & Menicucci, N. C. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.200502 · Cited by 173
Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
Self-citationStabilization of Finite-Energy Gottesman-Kitaev-Preskill States
Royer, B., Singh, S., & Girvin, S. M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260509 · Cited by 88
Designing Codes around Interactions: The Case of a Spin
Gross, J. A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.010504 · Cited by 63
“This mirrors the situation in GKP codes, whose manifest protection of random-displacement errors extends to relaxation errors as well [2].”
BackgroundSchmidt, F., & van Loock, P. (2022) · Physical Review A · doi:10.1103/physreva.105.042427 · Cited by 20
Two-Qubit Operations for Finite-Energy Gottesman-Kitaev-Preskill Encodings
Rojkov, I., Röggla, P. M., Wagener, M., Fontboté-Schmidt, M., Welte, S., Home, J., & Reiter, F. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.100601 · Cited by 12
Gottesman-Kitaev-Preskill codes: A lattice perspective
Conrad, J., Eisert, J., & Arzani, F. (2022) · Quantum · doi:10.22331/q-2022-02-10-648
“Concrete examples are loss, thermal noise [33], and to a limited extent, finite squeezing errors [2, 34, 35].”
Background
Metadata
- Authors
- Noh, K., Albert, V. V., & Jiang, L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2019-04
- Volume
- 65
- Issue
- 4
- Pages
- 2563-2582
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2785123223
- Cited by
- 157
- References
- 17
- FWCI
- 9.90
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.