pith. sign in

arxiv: 2410.02608 · v2 · pith:IZ756YH7new · submitted 2024-10-03 · 🪐 quant-ph

Variational Graphical Quantum Error Correction Codes

Yuguo Shao , Yong-Chang Li , Fuchuan Wei , Hao Zhan , Ben Wang , Zhaohui Wei , Lijian Zhang , Zhengwei Liu This is my paper

Pith reviewed 2026-05-23 20:15 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum error correctionvariational methodsQuon graphsnoise tailoringgraphical quantum languagesamplitude dampingphotonic experimentscode families
0
0 comments X

The pith

VGQEC codes embed tunable parameters in Quon graphs to create noise-specific quantum error correction.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a framework for building quantum error-correcting codes whose structure can be adjusted through parameters placed inside Quon graphs. These adjustments let the same underlying graph shift between different known code families or be tuned to match a particular device's noise. A sympathetic reader would care because most existing codes assume uniform noise that real hardware rarely exhibits, so a method that reshapes codes for measured noise could reduce overhead in practice. The work illustrates the idea by linking the five-qubit repetition code to the [[5,1,3]] code and by optimizing a three-qubit-derived code for amplitude damping noise, with supporting photonic experiments.

Core claim

VGQEC codes incorporate tunable parameters embedded within their Quon graphs, allowing dynamic reconfigurations of the graph structures through parameter adjustments. This flexibility facilitates seamless transitions between various code families, exemplified by a bridge between the five-qubit repetition code and the [[5,1,3]] code, and a VGQEC code derived from the three-qubit repetition code is fine-tuned for amplitude damping noise with experimental demonstration on a photonic system.

What carries the argument

Tunable parameters placed inside Quon graphs that permit variational reconfiguration of the code structure.

If this is right

  • Parameter adjustment creates continuous families that connect repetition codes to stabilizer codes while retaining advantages of each.
  • A single graphical construction can be specialized for amplitude damping by varying the embedded parameters.
  • Photonic hardware can directly test the performance of these reconfigured codes in the low-to-medium noise regime.
  • The same variational procedure applies in principle to any device whose noise profile can be measured and fed into the optimization.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the parameters admit efficient classical optimization, the method could be used to search for entirely new code structures not derived from existing families.
  • The graphical variational approach might transfer to other graphical calculi for quantum information beyond Quon.
  • Hardware-specific calibration loops could be built by repeatedly measuring noise, updating the graph parameters, and redeploying the code.

Load-bearing premise

The tunable parameters inside the Quon graphs can be optimized to produce codes whose error-correcting performance improves on standard constructions for the actual noise of a given device.

What would settle it

A side-by-side measurement on the photonic platform showing whether the variationally tuned three-qubit VGQEC code yields lower logical error rates than the fixed three-qubit repetition code under amplitude damping noise; no improvement would falsify the adaptation benefit.

Figures

Figures reproduced from arXiv: 2410.02608 by Ben Wang, Fuchuan Wei, Hao Zhan, Lijian Zhang, Yong-Chang Li, Yuguo Shao, Zhaohui Wei, Zhengwei Liu.

Figure 1
Figure 1. Figure 1: Illustration of VGQEC codes. (a) The Quon graph of the three-qubit repetition code is derived from a circular chain of three vertices. The symbol ◦ indicates the positions where charge pairs are placed. In this representation, the Quon graph corresponds to the logical state |+⟩L = (|000⟩ + |111⟩)/ √ 2 when no charge is added, and to |−⟩L = (|000⟩ − |111⟩)/ √ 2 when all charges are added. A heuristic VGQEC … view at source ↗
Figure 2
Figure 2. Figure 2: Performance of the VGQEC codes outlined in [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Overview of the construction and the evaluation of VGQEC codes using parameterized quantum circuits, as presented [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Performance of the VGQEC codes implemented using parameterized quantum circuits. The three-qubit VGQEC [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Experimental setup. The single photons, generated in a heralded manner through the parametric down-conversion [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Experimentally measured channel fidelity as a func [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Cycle operator as stabilizers [PITH_FULL_IMAGE:figures/full_fig_p016_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: The encoding circuit for an optional five-qubit VGQEC code: The encoding map can be divided into fixed map [PITH_FULL_IMAGE:figures/full_fig_p020_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: The state |+⟩ ⊗5 is prepared by applying the inverse of the unitary operation UE, as depicted in circuit [PITH_FULL_IMAGE:figures/full_fig_p021_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: The variational quantum circuit used in QVector method: We apply [PITH_FULL_IMAGE:figures/full_fig_p022_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: The encoding map E : H⊗k → H⊗n is the composition of the original encoding map Ec and a variational quantum circuit UE. The recovery map R : H⊗n → H⊗k is made by introducing 2k auxiliary qubits, then acting a variational quantum circuit UR, after which the auxiliary qubits are traced out and finally the original recovery map Rc is acted. |0⟩ |0⟩ (a) H Rzz(− π 2 ) Rzz(− π 2 ) |0⟩ H Rzz(− π 2 ) |0⟩ H Rzz(− … view at source ↗
Figure 12
Figure 12. Figure 12: The fixed part Ec in encoding map of the VGQEC codes: (a) For the three-qubit VGQEC code modified from repetition codes, the fixed part is the original encoding maps. The figure shows the circuit for the three-qubit case. (b) For the five-qubit VGQEC code, it is modified from [[5, 1, 3]] codes, the fixed part is the encoding map of the [[5, 1, 3]] code. recovery maps of the VGQEC code. The parameters vect… view at source ↗
Figure 13
Figure 13. Figure 13: “Universal” graph GE for n = 3: every point in the figure represents a braid crossing with variable. The black and blue strings in the figure represent internal and external strings, respectively, with internal strings intersecting pairwise [PITH_FULL_IMAGE:figures/full_fig_p023_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Graphical interpretation of the Yang-Baxter equation: The black dots in the figure indicate the braid crossings with [PITH_FULL_IMAGE:figures/full_fig_p024_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: The graph represents the process of absorbing [PITH_FULL_IMAGE:figures/full_fig_p024_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: Left-right symmetric form of GE for n = 3: reshaped from [PITH_FULL_IMAGE:figures/full_fig_p024_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: (a) The variational quantum circuit UE contains a layer of Rz rotations to each qubit, a circuit block from the symmetrized GE ( [PITH_FULL_IMAGE:figures/full_fig_p024_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: Schematic illustration of Fidelity Estimation: (a) average entanglement fidelity Estimator: The average entanglement [PITH_FULL_IMAGE:figures/full_fig_p025_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: The optimal channel fidelity of the three-qubit code for amplitude damping noise. The blue curve represents the [PITH_FULL_IMAGE:figures/full_fig_p030_19.png] view at source ↗
read the original abstract

Quantum error correction is essential for achieving fault-tolerant quantum computation. However, most typical quantum error-correcting codes are designed for generic noise models, which may fail to accurately capture the intricate noise characteristics of real quantum devices, limiting their practical performance. This work introduces a learning-based framework for the constructing of quantum error-correcting codes, termed Variational Graphical Quantum Error Correction (VGQEC) codes, which adapts to specific noise profiles of different quantum devices, enabling the design of noise-tailored codes. Specifically, inspired by Quon, a graphical language for quantum information, VGQEC codes incorporate tunable parameters embedded within their Quon graphs, allowing dynamic reconfigurations of the graph structures through parameter adjustments. As the first application of this approach, we show that this flexibility in code designs facilitates seamless transitions between various code families, exemplified by the establishment of a bridge between the five-qubit repetition code and the [[5,1,3]] code, thereby combining their respective advantages. Additionally, a VGQEC code derived from the three-qubit repetition code is fine-tuned for the amplitude damping noise, showcasing the approach's ability for noise-specific code design. Moreover, we experimentally demonstrate the effectiveness of the three-qubit VGQEC code in the low-to-medium noise regime with a photonic system, highlighting its potential for real-world applications.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 1 minor

Summary. The manuscript introduces Variational Graphical Quantum Error Correction (VGQEC) codes that embed tunable parameters in Quon graphs to enable noise-tailored quantum error correction. It claims this framework allows seamless transitions between code families (e.g., bridging the five-qubit repetition code and the [[5,1,3]] code) and demonstrates fine-tuning of a three-qubit-repetition-derived VGQEC code for amplitude damping, with an experimental demonstration on a photonic system.

Significance. If the variational optimization of Quon-graph parameters yields codes whose logical error rates under amplitude damping are strictly lower than those of the parent repetition code (and other fixed baselines) at equivalent physical error rates, the approach could offer a systematic route to device-specific QEC designs that improve upon generic constructions.

major comments (3)
  1. Abstract: the claim that a VGQEC code 'derived from the three-qubit repetition code is fine-tuned for amplitude damping' and 'experimentally demonstrate[s] the effectiveness' supplies no logical-error-probability values, optimization objective, or comparison to the unparameterized three-qubit repetition code, leaving the noise-adaptation advantage unsubstantiated.
  2. The variational-optimization procedure (presumably described in the section introducing the tunable parameters) is not shown to produce a code whose stabilizer weights or distance distribution differ from simple interpolation among known repetition-code structures; without such a demonstration the central claim that the parameters enable genuine adaptation rather than reparameterization remains unverified.
  3. Experimental demonstration section: no quantitative data (e.g., measured logical error rates versus physical error rate, or comparison at the same noise strength) are provided to confirm that the photonic implementation outperforms the baseline three-qubit repetition code in the low-to-medium noise regime.
minor comments (1)
  1. Notation for the tunable parameters inside the Quon graphs should be introduced with explicit definitions and ranges before any optimization discussion.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for their constructive comments on our manuscript. We address each major point below and will revise the manuscript to provide the requested quantitative details and clarifications.

read point-by-point responses

  1. Referee: Abstract: the claim that a VGQEC code 'derived from the three-qubit repetition code is fine-tuned for amplitude damping' and 'experimentally demonstrate[s] the effectiveness' supplies no logical-error-probability values, optimization objective, or comparison to the unparameterized three-qubit repetition code, leaving the noise-adaptation advantage unsubstantiated.

    Authors: We agree that the abstract would benefit from explicit quantitative indicators. In the revision we will add the achieved logical error probability for the optimized three-qubit VGQEC code under amplitude damping, state that the objective is minimization of logical error rate for the target channel, and note the improvement relative to the unparameterized repetition code. revision: yes

  2. Referee: The variational-optimization procedure (presumably described in the section introducing the tunable parameters) is not shown to produce a code whose stabilizer weights or distance distribution differ from simple interpolation among known repetition-code structures; without such a demonstration the central claim that the parameters enable genuine adaptation rather than reparameterization remains unverified.

    Authors: The Quon-graph parameterization permits continuous structural changes that are not equivalent to interpolation between fixed codes. To verify this distinction we will add, in the revision, explicit tabulations of stabilizer weights and logical-operator supports for the optimized VGQEC code versus interpolated repetition-code instances, confirming that the variational procedure yields non-interpolated configurations. revision: yes

  3. Referee: Experimental demonstration section: no quantitative data (e.g., measured logical error rates versus physical error rate, or comparison at the same noise strength) are provided to confirm that the photonic implementation outperforms the baseline three-qubit repetition code in the low-to-medium noise regime.

    Authors: We acknowledge that quantitative experimental comparisons are required for substantiation. The revised manuscript will include measured logical error rates for both the VGQEC code and the baseline repetition code, plotted versus physical error rate, together with direct comparisons at identical noise strengths in the low-to-medium regime. revision: yes

Circularity Check

0 steps flagged

No circularity: framework rests on external Quon language and experimental validation rather than self-referential fitting.

full rationale

The paper defines VGQEC via tunable parameters in Quon graphs (external graphical language) and demonstrates transitions between known codes plus noise-specific tuning with photonic experiments. No equations are supplied that reduce a claimed performance prediction to a fitted parameter by construction, nor does any load-bearing step collapse to self-citation or ansatz smuggling. The central claim of noise adaptation is presented as an empirical outcome of variational optimization, not as a definitional identity. This is the normal non-circular case for a construction paper whose value is tested externally.

Axiom & Free-Parameter Ledger

1 free parameters · 0 axioms · 0 invented entities

The abstract introduces tunable parameters inside Quon graphs as the central new degree of freedom; these act as free parameters whose values are chosen to match device noise. No additional axioms or invented entities are stated.

free parameters (1)
  • tunable parameters in Quon graphs
    Adjustable numbers placed in the graphical representation that control code structure and are optimized for a target noise model.

pith-pipeline@v0.9.0 · 5784 in / 1269 out tokens · 29099 ms · 2026-05-23T20:15:18.212845+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing

    quant-ph 2026-04 unverdicted novelty 1.0

    A literature review of VQAs covering ansatz design, classical optimization, barren plateaus, error mitigation strategies, and theoretical adaptations for fault-tolerant quantum computing.

Reference graph

Works this paper leans on

91 extracted references · 91 canonical work pages · cited by 1 Pith paper · 2 internal anchors

  1. [1]

    Quantum computation and quantum information,

    M. A. Nielsen and I. Chuang, “Quantum computation and quantum information,” 2002

    work page 2002

  2. [2]

    Polynomial-time algorithms for prime fac- 11 torization and discrete logarithms on a quantum com- puter,

    P. W. Shor, “Polynomial-time algorithms for prime fac- 11 torization and discrete logarithms on a quantum com- puter,” SIAM review, vol. 41, no. 2, pp. 303–332, 1999

    work page 1999

  3. [3]

    A fast quantum mechanical algorithm for database search,

    L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the twenty-eighth an- nual ACM symposium on Theory of computing , pp. 212– 219, 1996

    work page 1996

  4. [4]

    Computational speedups using small quantum devices,

    V. Dunjko, Y. Ge, and J. I. Cirac, “Computational speedups using small quantum devices,” Physical review letters, vol. 121, no. 25, p. 250501, 2018

    work page 2018

  5. [5]

    Applying quantum algorithms to constraint satisfaction problems,

    E. Campbell, A. Khurana, and A. Montanaro, “Applying quantum algorithms to constraint satisfaction problems,” Quantum, vol. 3, p. 167, 2019

    work page 2019

  6. [6]

    Faster quantum chemistry simulation on fault- tolerant quantum computers,

    N. C. Jones, J. D. Whitfield, P. L. McMahon, M.-H. Yung, R. Van Meter, A. Aspuru-Guzik, and Y. Ya- mamoto, “Faster quantum chemistry simulation on fault- tolerant quantum computers,” New Journal of Physics , vol. 14, no. 11, p. 115023, 2012

    work page 2012

  7. [7]

    Quantum al- gorithm for linear systems of equations,

    A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum al- gorithm for linear systems of equations,” Physical review letters, vol. 103, no. 15, p. 150502, 2009

    work page 2009

  8. [8]

    Quantum error correction for quantum memories,

    B. M. Terhal, “Quantum error correction for quantum memories,” Reviews of Modern Physics , vol. 87, no. 2, pp. 307–346, 2015

    work page 2015

  9. [9]

    Scheme for reducing decoherence in quan- tum computer memory,

    P. W. Shor, “Scheme for reducing decoherence in quan- tum computer memory,”Physical review A, vol. 52, no. 4, p. R2493, 1995

    work page 1995

  10. [10]

    D. A. Lidar and T. A. Brun, Quantum error correction. Cambridge university press, 2013

    work page 2013

  11. [11]

    Introduction to quantum error correction and fault tolerance,

    S. M. Girvin, “Introduction to quantum error correction and fault tolerance,” arXiv preprint arXiv:2111.08894 , 2021

    work page arXiv 2021

  12. [12]

    Quantum computations: algorithms and error correction,

    A. Y. Kitaev, “Quantum computations: algorithms and error correction,” Russian Mathematical Surveys, vol. 52, no. 6, p. 1191, 1997

    work page 1997

  13. [13]

    Surface codes: Towards practical large-scale quantum computation,

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A , vol. 86, no. 3, p. 032324, 2012

    work page 2012

  14. [14]

    Topological quantum memory,

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, “Topological quantum memory,” Journal of Mathemati- cal Physics, vol. 43, no. 9, pp. 4452–4505, 2002

    work page 2002

  15. [15]

    High-threshold universal quantum computation on the surface code,

    A. G. Fowler, A. M. Stephens, and P. Groszkowski, “High-threshold universal quantum computation on the surface code,” Physical Review A , vol. 80, no. 5, p. 052312, 2009

    work page 2009

  16. [16]

    Quantum codes on a lattice with boundary

    S. B. Bravyi and A. Y. Kitaev, “Quantum codes on a lat- tice with boundary,” arXiv preprint quant-ph/9811052 , 1998

    work page internal anchor Pith review Pith/arXiv arXiv 1998

  17. [17]

    Good quantum error- correcting codes exist,

    A. R. Calderbank and P. W. Shor, “Good quantum error- correcting codes exist,” Physical Review A, vol. 54, no. 2, p. 1098, 1996

    work page 1996

  18. [18]

    Multiple-particle interference and quantum error correction,

    A. Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineer- ing Sciences, vol. 452, no. 1954, pp. 2551–2577, 1996

    work page 1954

  19. [19]

    Gottesman, Stabilizer codes and quantum error cor- rection

    D. Gottesman, Stabilizer codes and quantum error cor- rection. California Institute of Technology, 1997

    work page 1997

  20. [20]

    Code- word stabilized quantum codes,

    A. Cross, G. Smith, J. A. Smolin, and B. Zeng, “Code- word stabilized quantum codes,” in 2008 IEEE Interna- tional Symposium on Information Theory , pp. 364–368, IEEE, 2008

    work page 2008

  21. [21]

    Codeword stabilized quantum codes: Algorithm and structure,

    I. Chuang, A. Cross, G. Smith, J. Smolin, and B. Zeng, “Codeword stabilized quantum codes: Algorithm and structure,” Journal of Mathematical Physics , vol. 50, no. 4, p. 042109, 2009

    work page 2009

  22. [22]

    Quantum low- density parity-check codes,

    N. P. Breuckmann and J. N. Eberhardt, “Quantum low- density parity-check codes,” PRX Quantum, vol. 2, no. 4, p. 040101, 2021

    work page 2021

  23. [23]

    Asymptotically good quantum and locally testable classical ldpc codes,

    P. Panteleev and G. Kalachev, “Asymptotically good quantum and locally testable classical ldpc codes,” in Proceedings of the 54th Annual ACM SIGACT Sympo- sium on Theory of Computing , pp. 375–388, 2022

    work page 2022

  24. [24]

    Noise thresholds for optical quantum computers,

    C. M. Dawson, H. L. Haselgrove, and M. A. Nielsen, “Noise thresholds for optical quantum computers,” Phys- ical review letters, vol. 96, no. 2, p. 020501, 2006

    work page 2006

  25. [25]

    Correlated charge noise and relaxation errors in superconducting qubits,

    C. D. Wilen, S. Abdullah, N. Kurinsky, C. Stanford, L. Cardani, G. d’Imperio, C. Tomei, L. Faoro, L. Ioffe, C. Liu, et al. , “Correlated charge noise and relaxation errors in superconducting qubits,” Nature, vol. 594, no. 7863, pp. 369–373, 2021

    work page 2021

  26. [26]

    Testing a quantum error-correcting code on various platforms,

    Q. Guo, Y.-Y. Zhao, M. Grassl, X. Nie, G.-Y. Xiang, T. Xin, Z.-Q. Yin, and B. Zeng, “Testing a quantum error-correcting code on various platforms,” Science Bul- letin, vol. 66, no. 1, pp. 29–35, 2021

    work page 2021

  27. [27]

    Approximate quantum error correction can lead to better codes,

    D. W. Leung, M. A. Nielsen, I. L. Chuang, and Y. Ya- mamoto, “Approximate quantum error correction can lead to better codes,” Physical Review A , vol. 56, no. 4, p. 2567, 1997

    work page 1997

  28. [28]

    Quantum error-correcting codes for qudit amplitude damping,

    M. Grassl, L. Kong, Z. Wei, Z.-Q. Yin, and B. Zeng, “Quantum error-correcting codes for qudit amplitude damping,” IEEE Transactions on Information Theory , vol. 64, no. 6, pp. 4674–4685, 2018

    work page 2018

  29. [29]

    Optimized four-qubit quantum error correcting code for amplitude damping channel,

    X. Mao, Q. Xu, and L. Jiang, “Optimized four-qubit quantum error correcting code for amplitude damping channel,” arXiv preprint arXiv:2411.12952 , 2024

    work page arXiv 2024

  30. [30]

    Macroscopically distinct quantum-superposition states as a bosonic code for amplitude damping,

    P. T. Cochrane, G. J. Milburn, and W. J. Munro, “Macroscopically distinct quantum-superposition states as a bosonic code for amplitude damping,” Physical Re- view A, vol. 59, no. 4, p. 2631, 1999

    work page 1999

  31. [31]

    Cat codes with optimal deco- herence suppression for a lossy bosonic channel,

    L. Li, C.-L. Zou, V. V. Albert, S. Muralidharan, S. Girvin, and L. Jiang, “Cat codes with optimal deco- herence suppression for a lossy bosonic channel,”Physical review letters, vol. 119, no. 3, p. 030502, 2017

    work page 2017

  32. [32]

    New class of quantum error-correcting codes for a bosonic mode,

    M. H. Michael, M. Silveri, R. Brierley, V. V. Albert, J. Salmilehto, L. Jiang, and S. M. Girvin, “New class of quantum error-correcting codes for a bosonic mode,” Physical Review X, vol. 6, no. 3, p. 031006, 2016

    work page 2016

  33. [33]

    Channel- adapted quantum error correction for the amplitude damping channel,

    A. S. Fletcher, P. W. Shor, and M. Z. Win, “Channel- adapted quantum error correction for the amplitude damping channel,” IEEE Transactions on Information Theory, vol. 54, no. 12, pp. 5705–5718, 2008

    work page 2008

  34. [34]

    Robust quan- tum error correction via convex optimization,

    R. L. Kosut, A. Shabani, and D. A. Lidar, “Robust quan- tum error correction via convex optimization,” Physical review letters, vol. 100, no. 2, p. 020502, 2008

    work page 2008

  35. [35]

    Channel- optimized quantum error correction,

    S. Taghavi, R. L. Kosut, and D. A. Lidar, “Channel- optimized quantum error correction,” IEEE transactions on information theory , vol. 56, no. 3, pp. 1461–1473, 2010

    work page 2010

  36. [36]

    Semidefinite programming hierarchies for constrained bilinear optimization,

    M. Berta, F. Borderi, O. Fawzi, and V. B. Scholz, “Semidefinite programming hierarchies for constrained bilinear optimization,” Mathematical Programming , pp. 1–49, 2022

    work page 2022

  37. [37]

    Quantum error correction via convex optimization,

    R. L. Kosut and D. A. Lidar, “Quantum error correction via convex optimization,”Quantum Information Process- ing, vol. 8, no. 5, pp. 443–459, 2009

    work page 2009

  38. [38]

    Struc- tured near-optimal channel-adapted quantum error cor- rection,

    A. S. Fletcher, P. W. Shor, and M. Z. Win, “Struc- tured near-optimal channel-adapted quantum error cor- rection,” Physical Review A , vol. 77, no. 1, p. 012320, 12 2008

    work page 2008

  39. [39]

    Iterative optimization of quantum error correcting codes,

    M. Reimpell and R. F. Werner, “Iterative optimization of quantum error correcting codes,” Physical review letters, vol. 94, no. 8, p. 080501, 2005

    work page 2005

  40. [40]

    Optimizing quantum error correction codes with reinforcement learning,

    H. P. Nautrup, N. Delfosse, V. Dunjko, H. J. Briegel, and N. Friis, “Optimizing quantum error correction codes with reinforcement learning,” Quantum, vol. 3, p. 215, 2019

    work page 2019

  41. [41]

    Reinforcement learning with neural networks for quan- tum feedback,

    T. F¨ osel, P. Tighineanu, T. Weiss, and F. Marquardt, “Reinforcement learning with neural networks for quan- tum feedback,” Physical Review X , vol. 8, no. 3, p. 031084, 2018

    work page 2018

  42. [42]

    Quantum error correction with quantum autoencoders,

    D. F. Locher, L. Cardarelli, and M. M¨ uller, “Quantum error correction with quantum autoencoders,” Quantum, vol. 7, p. 942, 2023

    work page 2023

  43. [43]

    Quantum codes from neu- ral networks,

    J. Bausch and F. Leditzky, “Quantum codes from neu- ral networks,” New Journal of Physics , vol. 22, no. 2, p. 023005, 2020

    work page 2020

  44. [44]

    QVECTOR: an algorithm for device-tailored quantum error correction

    P. D. Johnson, J. Romero, J. Olson, Y. Cao, and A. Aspuru-Guzik, “Qvector: an algorithm for device- tailored quantum error correction,” arXiv preprint arXiv:1711.02249, 2017

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  45. [45]

    Quantum variational learning for quantum error- correcting codes,

    C. Cao, C. Zhang, Z. Wu, M. Grassl, and B. Zeng, “Quantum variational learning for quantum error- correcting codes,” arXiv preprint arXiv:2204.03560 , 2022

    work page arXiv 2022

  46. [46]

    Improving the speed of variational quantum algorithms for quan- tum error correction,

    F. Zoratti, G. De Palma, B. Kiani, Q. T. Nguyen, M. Marvian, S. Lloyd, and V. Giovannetti, “Improving the speed of variational quantum algorithms for quan- tum error correction,” Physical Review A, vol. 108, no. 2, p. 022611, 2023

    work page 2023

  47. [47]

    Mathematical picture language program,

    A. M. Jaffe and Z. Liu, “Mathematical picture language program,” Proceedings of the National Academy of Sci- ences, vol. 115, no. 1, pp. 81–86, 2018

    work page 2018

  48. [48]

    Quon 3d language for quantum information,

    Z. Liu, A. Wozniakowski, and A. M. Jaffe, “Quon 3d language for quantum information,” Proceedings of the National Academy of Sciences, vol. 114, no. 10, pp. 2497– 2502, 2017

    work page 2017

  49. [49]

    Quantum computing in the nisq era and be- yond,

    J. Preskill, “Quantum computing in the nisq era and be- yond,” Quantum, vol. 2, p. 79, 2018

    work page 2018

  50. [50]

    Quantized graphs and quantum error correc- tion,

    Z. Liu, “Quantized graphs and quantum error correc- tion,” arXiv preprint arXiv:1910.12065 , 2019

    work page arXiv 1910

  51. [51]

    This is a simple heuristic modification, where parallel edges are replaced with variable crossings to make the graphical transformation appear most dramatic

    work page

  52. [52]

    Opti- mum quantum error recovery using semidefinite pro- gramming,

    A. S. Fletcher, P. W. Shor, and M. Z. Win, “Opti- mum quantum error recovery using semidefinite pro- gramming,” Physical Review A, vol. 75, no. 1, p. 012338, 2007

    work page 2007

  53. [53]

    Perfect quantum error correcting code,

    R. Laflamme, C. Miquel, J. P. Paz, and W. H. Zurek, “Perfect quantum error correcting code,” Physical Re- view Letters, vol. 77, no. 1, p. 198, 1996

    work page 1996

  54. [54]

    Quantum crosstalk analysis for si- multaneous gate operations on superconducting qubits,

    P. Zhao, K. Linghu, Z. Li, P. Xu, R. Wang, G. Xue, Y. Jin, and H. Yu, “Quantum crosstalk analysis for si- multaneous gate operations on superconducting qubits,” PRX quantum, vol. 3, no. 2, p. 020301, 2022

    work page 2022

  55. [55]

    Control and mit- igation of microwave crosstalk effect with superconduct- ing qubits,

    R. Wang, P. Zhao, Y. Jin, and H. Yu, “Control and mit- igation of microwave crosstalk effect with superconduct- ing qubits,” Applied Physics Letters , vol. 121, no. 15, 2022

    work page 2022

  56. [56]

    Reversing quantum dynamics with near-optimal quantum and classical fidelity,

    H. Barnum and E. Knill, “Reversing quantum dynamics with near-optimal quantum and classical fidelity,” Jour- nal of Mathematical Physics , vol. 43, no. 5, pp. 2097– 2106, 2002

    work page 2097

  57. [57]

    Quantum algorithm for petz recovery channels and pretty good measurements,

    A. Gily´ en, S. Lloyd, I. Marvian, Y. Quek, and M. M. Wilde, “Quantum algorithm for petz recovery channels and pretty good measurements,”Physical Review Letters, vol. 128, no. 22, p. 220502, 2022

    work page 2022

  58. [58]

    universal

    This variable graphical structure GE is designed to exhibit “universal” properties. For n qubits, it is characterized by 2n internal strings that cross each other with variable crossings, which admits all possible connections of 2 n in- ternal strings. This flexibility facilitates transformations into a wide range of graphical configurations. The total nu...

    work page

  59. [59]

    Consequently, it can be easily realized using quantum circuits

    The construction of GE enables the straightforward im- plementation of UE using circuits composed of RX, RZ and RZZ gates. Consequently, it can be easily realized using quantum circuits

    work page

  60. [60]

    The intuition of this design is to ensure that the recov- ery map can implement the original code’s recovery pro- cess and retain the flexibility for further optimization, with auxiliary qubits extending its degrees of freedom, see Supplementary Section H

    work page

  61. [61]

    To avoid ambiguity, we clarify that the VGQEC codes in this section differ from the structure depicted in Fig. 1. Instead, they are constructed by gluing together GE, shown in Fig. 3(a)

    work page

  62. [62]

    Linear-optics realization of channels for single- photon multimode qudits,

    M. Piani, D. Pitkanen, R. Kaltenbaek, and N. L¨ utken- haus, “Linear-optics realization of channels for single- photon multimode qudits,” Phys. Rev. A , vol. 84, p. 032304, Sep 2011

    work page 2011

  63. [63]

    Functional integral construction of topological quantum field theory,

    Z. Liu, “Functional integral construction of topological quantum field theory,” arXiv preprint arXiv:2409.17103, 2024

    work page arXiv 2024

  64. [64]

    Sending entanglement through noisy quantum channels,

    B. Schumacher, “Sending entanglement through noisy quantum channels,” Physical Review A , vol. 54, no. 4, p. 2614, 1996

    work page 1996

  65. [65]

    Introduction to haar measure tools in quantum information: A beginner’s tutorial,

    A. A. Mele, “Introduction to haar measure tools in quantum information: A beginner’s tutorial,” Quantum, vol. 8, p. 1340, 2024

    work page 2024

  66. [66]

    Exact and approximate unitary 2-designs and their application to fidelity estimation,

    C. Dankert, R. Cleve, J. Emerson, and E. Livine, “Exact and approximate unitary 2-designs and their application to fidelity estimation,” Physical Review A, vol. 80, no. 1, p. 012304, 2009

    work page 2009

  67. [67]

    Estimating the fidelity of t gates using standard interleaved randomized bench- marking,

    R. Harper and S. T. Flammia, “Estimating the fidelity of t gates using standard interleaved randomized bench- marking,” Quantum Science and Technology , vol. 2, no. 1, p. 015008, 2017

    work page 2017

  68. [68]

    Exact and approximate unitary 2-designs and their application to fidelity estimation,

    C. Dankert, R. Cleve, J. Emerson, and E. Livine, “Exact and approximate unitary 2-designs and their application to fidelity estimation,” Phys. Rev. A , vol. 80, p. 012304, Jul 2009

    work page 2009

  69. [69]

    Mutually unbiased bases, spherical designs, and frames,

    A. Klappenecker and M. Roetteler, “Mutually unbiased bases, spherical designs, and frames,” in Wavelets XI , vol. 5914, p. 59140P, SPIE, 2005

    work page 2005

  70. [70]

    Symmetric informationally complete quan- tum measurements,

    J. M. Renes, R. Blume-Kohout, A. J. Scott, and C. M. Caves, “Symmetric informationally complete quan- tum measurements,” Journal of Mathematical Physics , vol. 45, no. 6, pp. 2171–2180, 2004

    work page 2004

  71. [71]

    Tight informationally complete quantum measurements,

    A. J. Scott, “Tight informationally complete quantum measurements,” Journal of Physics A: Mathematical and General, vol. 39, no. 43, p. 13507, 2006

    work page 2006

  72. [72]

    A simple formula for the average gate fidelity of a quantum dynamical operation,

    M. A. Nielsen, “A simple formula for the average gate fidelity of a quantum dynamical operation,” Physics Let- ters A, vol. 303, no. 4, pp. 249–252, 2002

    work page 2002

  73. [73]

    Elementare begr¨ undung der knoten- 13 theorie,

    K. Reidemeister, “Elementare begr¨ undung der knoten- 13 theorie,” in Abhandlungen aus dem Mathematischen Seminar der Universit¨ at Hamburg, vol. 5, pp. 24–32, Springer, 1927

    work page 1927

  74. [74]

    Ibm quantum compute resources web- site

    IBM company, “Ibm quantum compute resources web- site.” https://quantum-computing.ibm.com/services/ resources?system=ibmq_lima Accessed October 14, 2022

    work page 2022

  75. [75]

    Smallest quan- tum codes for amplitude damping noise,

    S. Dutta, A. Jain, and P. Mandayam, “Smallest quan- tum codes for amplitude damping noise,” arXiv preprint arXiv:2410.00155, 2024

    work page arXiv 2024

  76. [76]

    Completely positive linear maps on com- plex matrices,

    M.-D. Choi, “Completely positive linear maps on com- plex matrices,” Linear algebra and its applications , vol. 10, no. 3, pp. 285–290, 1975

    work page 1975

  77. [77]

    On the limited memory bfgs method for large scale optimization,

    D. C. Liu and J. Nocedal, “On the limited memory bfgs method for large scale optimization,” Mathematical pro- gramming, vol. 45, no. 1, pp. 503–528, 1989

    work page 1989

  78. [78]

    Some exact results for the many-body prob- lem in one dimension with repulsive delta-function inter- action,

    C.-N. Yang, “Some exact results for the many-body prob- lem in one dimension with repulsive delta-function inter- action,” Physical Review Letters, vol. 19, no. 23, p. 1312, 1967

    work page 1967

  79. [79]

    R. J. Baxter, Exactly solved models in statistical mechan- ics. Elsevier, 2016

    work page 2016

  80. [80]

    Unitary 2-designs from random x-and z-diagonal uni- taries,

    Y. Nakata, C. Hirche, C. Morgan, and A. Winter, “Unitary 2-designs from random x-and z-diagonal uni- taries,” Journal of Mathematical Physics , vol. 58, no. 5, p. 052203, 2017

    work page 2017

Showing first 80 references.