pith. sign in

arxiv: 2607.02346 · v1 · pith:6RZ4Y7VGnew · submitted 2026-07-02 · 🪐 quant-ph

Recovery Algorithm for Correlated Errors in Permutation-Invariant Quantum Codes

Omprakash Chandra , Yingkai Ouyang , Gopikrishnan Muraleedharan , Gavin Brennen This is my paper

Pith reviewed 2026-07-03 11:44 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum error recoverypermutation-invariant codesamplitude-damping noiseCAD codescorrelated errorsquantum error correctioncoherent recovery maps
0
0 comments X

The pith

Permutation-invariant CAD codes recover states from symmetric amplitude-damping noise with higher fidelity using low-overhead circuits.

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

The paper develops quantum error recovery maps tailored to the symmetric correlated amplitude-damping channel and applies them to permutation-invariant codes. These maps are realized by quantum circuits acting on the system plus ancilla qubits, yielding higher fidelity than standard error correction that ignores noise details. A new CAD code family is defined with explicit 4-qubit and 9-qubit instances; the 9-qubit version exceeds the performance of many prior codes by more than an order of magnitude, while the 4-qubit version corrects one global symmetric error with a 10-gate circuit built from geometric phase gates. The approach exploits the tunable symmetry of PI codes to reduce addressability requirements compared with stabilizer codes.

Core claim

A coherent quantum error recovery map optimized for collective and local symmetric correlated amplitude-damping noise can be compiled into a circuit on permutation-invariant codes, including a new CAD family, that restores encoded states with fidelity exceeding noise-parameter-independent quantum error correction; the CAD9 code outperforms many existing codes by more than one order of magnitude, and the CAD4 code perfectly corrects one global symmetric AD error with a 10-gate recovery circuit realizable from linear geometric phase gates.

What carries the argument

The CAD codes, a new family of permutation-invariant codes tuned for global symmetric amplitude-damping errors that support optimized coherent recovery maps compiled into low-gate-count circuits on system and ancilla qubits.

If this is right

  • CAD9 achieves fidelity more than ten times higher than many existing codes under the modeled noise.
  • CAD4 perfectly corrects one global symmetric amplitude-damping error.
  • The recovery map for CAD4 compiles to a circuit of ten system and system-ancilla gates from linear geometric phase gates.
  • The method supplies a direct route from optimized recovery maps to experimentally realizable low-overhead protocols for non-Pauli noise.

Where Pith is reading between the lines

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

  • The same optimization procedure for recovery maps could be applied to other non-Pauli channels once their Kraus operators are known.
  • Permutation-invariant codes may lower the control precision needed in hardware where individual qubit addressing is costly.
  • If the noise model matches experiment, code design could prioritize expected error correlations over worst-case assumptions.

Load-bearing premise

The noise acting on the system is accurately described by the collective and local symmetric correlated amplitude-damping channel.

What would settle it

Apply the CAD9 code and its optimized recovery circuit to a 9-qubit system undergoing symmetric amplitude-damping noise at varying strengths, measure the output fidelity, and check whether it exceeds the fidelity of standard codes by more than a factor of ten for the noise parameters considered.

Figures

Figures reproduced from arXiv: 2607.02346 by Gavin Brennen, Gopikrishnan Muraleedharan, Omprakash Chandra, Yingkai Ouyang.

Figure 1
Figure 1. Figure 1: FIG. 1. High-level overview of Algorithm [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Compiled recovery circuit for CAD4 PI code given in Definition [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Entanglement infidelity vs cooperativity after im [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Effectiveness of QER against correlated AD er [PITH_FULL_IMAGE:figures/full_fig_p014_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Performance of the short-length PI codes listed in Table [PITH_FULL_IMAGE:figures/full_fig_p015_6.png] view at source ↗
read the original abstract

Quantum Error Recovery (QER) uses knowledge of the error channel acting on a quantum system to find optimal recovery maps. The scheme restores the uncorrupted state with a fidelity exceeding that achieved by noise parameter independent quantum error correction. We use a generic coherent QER map implemented with a quantum circuit acting on the system together with ancillary qubits to recover quantum information stored in permutation invariant (PI) codes. PI codes admit tunable parameters to suit the noise model and benefit from simple recovery operation circuits with reduced addressability requirements, unlike stabilizer codes. We showcase the method by modeling QER in PI codes after collective and local symmetric correlated amplitude-damping (AD) noise, a non-Pauli noise process for which stabilizer codes often require additional overhead. We also propose a new PI code family called CAD codes with explicit examples on 4 and 9 qubits for global symmetric AD errors. We show that CAD9 (supported on 9 qubits) code beats many existing codes by more than one order of magnitude. For the CAD4 code, which perfectly corrects 1 global symmetric AD error, the compiled recovery circuit consists of 10 system and system-ancilla gates which can be realized from linear geometric phase gates. Our work provides a direct path from optimized recovery maps to experimentally implementable, low-overhead protocols.

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

1 major / 1 minor

Summary. The manuscript develops a quantum error recovery (QER) protocol for permutation-invariant (PI) codes under collective and local symmetric correlated amplitude-damping noise. It introduces a new CAD code family with explicit 4-qubit and 9-qubit constructions, claiming that CAD9 outperforms many existing codes by more than an order of magnitude in fidelity and that CAD4 achieves perfect correction of one global symmetric AD error via a 10-gate recovery circuit realizable from linear geometric phase gates.

Significance. If the performance claims and circuit compilation hold, the work supplies a concrete, low-overhead route from optimized QER maps to implementable protocols for a non-Pauli noise model, leveraging the tunable parameters and reduced addressability of PI codes. The explicit gate count and perfect-correction statement for CAD4 constitute falsifiable, experimentally relevant predictions.

major comments (1)
  1. [Abstract] Abstract: the stated order-of-magnitude improvement for CAD9 and the perfect-correction property plus 10-gate count for CAD4 are load-bearing claims, yet the abstract supplies no fidelity values, comparison table, or derivation steps; the main text must contain the explicit QER map optimization and numerical verification to substantiate them.
minor comments (1)
  1. [Abstract] The weakest assumption (accurate modeling of the noise by the collective/local symmetric correlated AD channel) is stated but would benefit from a brief discussion of robustness to model mismatch in the main text.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the positive evaluation of the work's significance and for the constructive comment on the abstract. We address the point below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the stated order-of-magnitude improvement for CAD9 and the perfect-correction property plus 10-gate count for CAD4 are load-bearing claims, yet the abstract supplies no fidelity values, comparison table, or derivation steps; the main text must contain the explicit QER map optimization and numerical verification to substantiate them.

    Authors: We agree that the abstract states the performance claims without accompanying numerical values or derivation steps. The main text already contains the explicit QER map optimization procedure, the numerical fidelity comparisons demonstrating the order-of-magnitude improvement for CAD9, and the circuit compilation yielding the 10-gate recovery for CAD4 with its perfect-correction property. To make the abstract more self-contained and directly responsive to the referee's observation, we will revise it to include the key fidelity values and the gate count. This constitutes a targeted update to the abstract while leaving the detailed derivations and verifications unchanged in the body of the paper. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper constructs explicit CAD codes for a stated collective/local symmetric AD noise model, derives a perfect-correction property for CAD4, compiles a concrete 10-gate recovery circuit, and reports fidelity gains for CAD9. These steps are derived from the external noise model and circuit compilation rules rather than from fitted parameters on the same data or self-citation chains that close the derivation. No equation or claim reduces a reported performance metric to a quantity defined by the paper's own inputs.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 1 invented entities

The central claims rest on standard quantum channel theory plus the modeling choice that the physical noise matches the collective/local symmetric AD form; the new CAD codes are the primary added entity.

free parameters (1)
  • tunable parameters of PI codes
    PI codes admit tunable parameters to suit the noise model
axioms (1)
  • domain assumption The physical error process is collective and local symmetric correlated amplitude-damping noise
    The paper models QER after this specific noise process
invented entities (1)
  • CAD codes no independent evidence
    purpose: Correct global symmetric AD errors on 4 and 9 qubits
    New code family proposed with explicit examples

pith-pipeline@v0.9.1-grok · 5777 in / 1362 out tokens · 50108 ms · 2026-07-03T11:44:20.240509+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

80 extracted references · 80 canonical work pages · 2 internal anchors

  1. [1]

    Barnum-Knill (or Petz recovery) The problem of QER can be solved analytically us- ing the Barnum-Knill (BK) [33] recovery or Petz recov- ery scheme [34]. The high-level idea is that there exists a recovery channelR (p) (superscript (p) simply denotes Petz) that can completely reverse the action of the map Eby applying a transpose map. The Petz recovery ma...

    work page

  2. [2]

    This 4 distinction arises because entanglement fidelity as men- tioned before is a much more stringent, the gold standard for QEC

    However, even if the KL-ECC conditions are not sat- isfied, it might still be possible to perfectly recover a specific input density matrix such thatR (p) ◦ E(ρ) =ρ, but fail to achieve an entanglement fidelity of 1. This 4 distinction arises because entanglement fidelity as men- tioned before is a much more stringent, the gold standard for QEC. Equipped ...

    work page

  3. [3]

    For either choice ofϵ, the construction yields a valid code with a distance of 3, enabling it to correct any ar- bitrary single-qubit error

    is parameterized byϵ∈ {±1}, with its logical basis states defined as: |0⟩L (ϵ) = 1 8 ϵ √ 15 D7 0 − √ 7 D7 2 (8) +ϵ √ 21 D7 4 + √ 21 D7 6 , |1⟩L (ϵ) = 1 8 √ 21 D7 1 +ϵ √ 21 D7 3 − √ 7 D7 5 +ϵ √ 15 D7 7 . For either choice ofϵ, the construction yields a valid code with a distance of 3, enabling it to correct any ar- bitrary single-qubit error. 7 Definition ...

    work page

  4. [4]

    Now ex- tend the unitary to full space asU (1) S,abc =U (1) S,a ⊗I b ⊗I c

    Then apply the unitaryU (1) S,a on the systemSand the first ancillaa, given by U(1) S,a = B0 S0 S0 −B0 .(23) The superscript (1) denotes the step number. Now ex- tend the unitary to full space asU (1) S,abc =U (1) S,a ⊗I b ⊗I c. The post-unitary state is U(1) S,abcσS,abc U(1) S,abc † = h B0ρSB0 ⊗ |0⟩a⟨0|+B 0ρSS0 ⊗ |0⟩a⟨1|+ S0ρSB0 ⊗ |1⟩a⟨0|+S 0ρSS0 ⊗ |1⟩a⟨...

    work page

  5. [5]

    Now we apply an unitary U(2) S,b = ˜B1 ∗ ˜S1 ∗ ,(27) where the second column with∗denotes an appropriate choice of orthogonal basis

    The updated Kraus operators follow com- pleteness on the support ofS 0, i.e., ˜B† 1 ˜B1 + ˜S† 1 ˜S1 =I S0. Now we apply an unitary U(2) S,b = ˜B1 ∗ ˜S1 ∗ ,(27) where the second column with∗denotes an appropriate choice of orthogonal basis. The above unitary is extended to the full system such that it acts non-trivially on ancilla ain|1⟩state (from now on ...

    work page

  6. [6]

    exact arbitrary unitaries (and state synthesis) [50– 52] and approximate unitaries [53] on the Dicke subspace by coupling the qubits to a bosonic mode

    work page

  7. [7]

    arbitrary single-qubit gates; and

    work page

  8. [8]

    opt.”) is contrasted against uncorrected states (“no rec

    entangling controlled system-ancilla unitary of the form Λ(U) S,A :=I S ⊗ |0⟩A⟨0|+U⊗ |1⟩ A⟨1|.(38) In our setup,Ais a single-qubit ancilla. During com- pilation, we use the following standard single-qubit gates H= 1√ 2 1 1 1−1 , P= 1 0 0i , Z= 1 0 0−1 . The unitary in Eq. (23) can be decomposed as U(1) S,a(Θ1) = eiΘ1 S ⊗I a IS ⊗P † a (IS ⊗H a) ×Λ e−2iΘ1 S...

    work page

  9. [9]

    Acharya et al

    R. Acharya et al. Quantum error correction below the surface code threshold.Nature, 638:920–926, 2025

    work page 2025

  10. [10]

    A quan- tum engineer’s guide to superconducting qubits.Applied Physics Reviews, 6(2):021318, 2019

    Philip Krantz, Morten Kjaergaard, Fei Yan, Terry P Or- lando, Simon Gustavsson, and William D Oliver. A quan- tum engineer’s guide to superconducting qubits.Applied Physics Reviews, 6(2):021318, 2019

    work page 2019

  11. [11]

    Trapped-ion quantum comput- ing: Progress and challenges.Applied Physics Reviews, 6(2):021314, 2019

    Colin D Bruzewicz, John Chiaverini, Robert McConnell, and Jeremy M Sage. Trapped-ion quantum comput- ing: Progress and challenges.Applied Physics Reviews, 6(2):021314, 2019

    work page 2019

  12. [12]

    Erasure qubits: Over- coming thet 1 limit in superconducting circuits.Physical Review X, 13:041022, 2023

    Aleksander Kubica, Arbel Haim, Yotam Vaknin, Fer- nando Brand˜ ao, and Alex Retzker. Erasure qubits: Over- coming thet 1 limit in superconducting circuits.Physical Review X, 13:041022, 2023

    work page 2023

  13. [13]

    Achieving fault tolerance against amplitude-damping noise.Physical Review Re- search, 4(2):023034, 2022

    Akshaya Jayashankar, Min-Hsiu Long, Hui Khoon Ng, and Prabha Mandayam. Achieving fault tolerance against amplitude-damping noise.Physical Review Re- search, 4(2):023034, 2022

    work page 2022

  14. [14]

    Concate- nated codes for amplitude damping

    Tyler Jackson, Markus Grassl, and Bei Zeng. Concate- nated codes for amplitude damping. In2016 IEEE In- ternational Symposium on Information Theory (ISIT), pages 2269–2273. IEEE, 2016

    work page 2016

  15. [15]

    Fletcher, Peter W

    Andrew S. Fletcher, Peter W. Shor, and Moe Z. Win. Optimum quantum error recovery using semidefinite pro- 16 gramming.Physical Review A, 75(1):012338, 2007

    work page 2007

  16. [16]

    Approximate quantum error correction can lead to better codes.Physical Review A, 56(4):2567, 1997

    Debbie W Leung, Michael A Nielsen, Isaac L Chuang, and Yoshihisa Yamamoto. Approximate quantum error correction can lead to better codes.Physical Review A, 56(4):2567, 1997

    work page 1997

  17. [17]

    Fletcher, Peter W

    Andrew S. Fletcher, Peter W. Shor, and Moe Z. Win. Channel-adapted quantum error correction for the am- plitude damping channel.IEEE Transactions on Infor- mation Theory, 54:5705–5718, 2008

    work page 2008

  18. [18]

    Chuang, Debbie W

    Isaac L. Chuang, Debbie W. Leung, and Yoshihisa Ya- mamoto. Bosonic quantum codes for amplitude damping. Physical Review A, 56:1114–1125, 1997

    work page 1997

  19. [19]

    Quantum error-correcting codes for qudit amplitude damping.IEEE Transactions on Infor- mation Theory, 64(6):4674–4685, 2018

    Markus Grassl, Linghang Kong, Zhaohui Wei, Zhang-Qi Yin, and Bei Zeng. Quantum error-correcting codes for qudit amplitude damping.IEEE Transactions on Infor- mation Theory, 64(6):4674–4685, 2018

    work page 2018

  20. [20]

    Permutation-invariant constant-excitation quantum codes for amplitude damp- ing.IEEE Transactions on Information Theory, 66(5):2921–2933, 2019

    Yingkai Ouyang and Rui Chao. Permutation-invariant constant-excitation quantum codes for amplitude damp- ing.IEEE Transactions on Information Theory, 66(5):2921–2933, 2019

    work page 2019

  21. [21]

    Permutation-invariant quantum codes

    Yingkai Ouyang. Permutation-invariant quantum codes. Physical Review A, 90(6):062317, 2014

    work page 2014

  22. [22]

    A theory of quan- tum error correction for permutation-invariant codes

    Yingkai Ouyang and Gavin K Brennen. A theory of quan- tum error correction for permutation-invariant codes. arXiv preprint arXiv:2602.13638, 2026

    work page arXiv 2026

  23. [23]

    Measurement-free code-switching protocol for low-overhead quantum computation using permutation- invariant codes.PRX Quantum, 6(4):040341, 2025

    Yingkai Ouyang, Yumang Jing, and Gavin K Bren- nen. Measurement-free code-switching protocol for low-overhead quantum computation using permutation- invariant codes.PRX Quantum, 6(4):040341, 2025

    work page 2025

  24. [24]

    Permutation-invariant quantum coding for quantum deletion channels

    Yingkai Ouyang. Permutation-invariant quantum coding for quantum deletion channels. In2021 IEEE Interna- tional Symposium on Information Theory (ISIT), pages 1499–1503. IEEE, 2021

    work page 2021

  25. [25]

    Permutation- invariant quantum codes for deletion errors

    Taro Shibayama and Manabu Hagiwara. Permutation- invariant quantum codes for deletion errors. In2021 IEEE International Symposium on Information Theory (ISIT), pages 1493–1498. IEEE, 2021

    work page 2021

  26. [26]

    A family of permutationally invariant quantum codes

    Arda Aydin, Max A Alekseyev, and Alexander Barg. A family of permutationally invariant quantum codes. Quantum, 8:1321, 2024

    work page 2024

  27. [27]

    Permutation-invariant codes: a numerical study and qudit constructions.arXiv preprint arXiv:2603.10981, 2026

    Liam J Bond, Jiˇ r´ ı Min´ aˇ r, M¯ aris Ozols, Arghavan Safavi- Naini, and Vladyslav Visnevskyi. Permutation-invariant codes: a numerical study and qudit constructions.arXiv preprint arXiv:2603.10981, 2026

    work page arXiv 2026

  28. [28]

    Permutation- ally invariant codes for quantum error correction.Linear algebra and its applications, 392:255–288, 2004

    Harriet Pollatsek and Mary Beth Ruskai. Permutation- ally invariant codes for quantum error correction.Linear algebra and its applications, 392:255–288, 2004

    work page 2004

  29. [29]

    Permutation-invariant quantum codes with transversal generalized phase gates

    Eric Kubischta and Ian Teixeira. Permutation-invariant quantum codes with transversal generalized phase gates. IEEE Transactions on Information Theory, 71(1):485– 498, 2024

    work page 2024

  30. [30]

    Quantum and clas- sical resources for unitary design of open-system evolu- tions.Quantum Science and Technology, 2(3):034001, 2017

    Francesco Ticozzi and Lorenza Viola. Quantum and clas- sical resources for unitary design of open-system evolu- tions.Quantum Science and Technology, 2(3):034001, 2017

    work page 2017

  31. [31]

    Engineering quantum dy- namics.Physical Review A, 65(1):010101, 2001

    Seth Lloyd and Lorenza Viola. Engineering quantum dy- namics.Physical Review A, 65(1):010101, 2001

    work page 2001

  32. [32]

    Fowler, Matteo Mariantoni, John M

    Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. Surface codes: Towards prac- tical large-scale quantum computation.Physical Review A, 86:032324, 2012

    work page 2012

  33. [33]

    The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes

    Paul Webster, Lucas Berent, Omprakash Chandra, Evan T Hockings, Nou´ edyn Baspin, Felix Thomsen, Samuel C Smith, and Lawrence Z Cohen. The pinna- cle architecture: Reducing the cost of breaking rsa-2048 to 100 000 physical qubits using quantum ldpc codes. arXiv preprint arXiv:2602.11457, 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2048

  34. [34]

    Degenerate quan- tum erasure decoding.npj Quantum Information, 12(1):75, Mar 2026

    Kao-Yueh Kuo and Yingkai Ouyang. Degenerate quan- tum erasure decoding.npj Quantum Information, 12(1):75, Mar 2026

    work page 2026

  35. [35]

    Nickerson

    Nicolas Delfosse and Naomi H. Nickerson. Almost-linear time decoding algorithm for topological codes.Quantum, 5:595, 2021

    work page 2021

  36. [36]

    Sending entanglement through noisy quantum channels.Physical Review A, 54(4):2614– 2628, 1996

    Benjamin Schumacher. Sending entanglement through noisy quantum channels.Physical Review A, 54(4):2614– 2628, 1996

    work page 1996

  37. [37]

    Cambridge university press, 2010

    Michael A Nielsen and Isaac L Chuang.Quantum compu- tation and quantum information. Cambridge university press, 2010

    work page 2010

  38. [38]

    Completely positive linear maps on complex matrices.Linear algebra and its applications, 10(3):285–290, 1975

    Man-Duen Choi. Completely positive linear maps on complex matrices.Linear algebra and its applications, 10(3):285–290, 1975

    work page 1975

  39. [39]

    Linear transformations which pre- serve trace and positive semidefiniteness of operators.Re- ports on Mathematical Physics, 3(4):275–278, 1972

    Andrzej Jamio lkowski. Linear transformations which pre- serve trace and positive semidefiniteness of operators.Re- ports on Mathematical Physics, 3(4):275–278, 1972

    work page 1972

  40. [40]

    Optimizing completely positive maps using semidefinite program- ming.Physical Review A, 65(3):030302, 2002

    Koenraad Audenaert and Bart De Moor. Optimizing completely positive maps using semidefinite program- ming.Physical Review A, 65(3):030302, 2002

    work page 2002

  41. [41]

    Reversing quan- tum dynamics with near-optimal quantum and classical fidelity.Journal of Mathematical Physics, 43(5):2097– 2106, 2002

    Howard Barnum and Emanuel Knill. Reversing quan- tum dynamics with near-optimal quantum and classical fidelity.Journal of Mathematical Physics, 43(5):2097– 2106, 2002

    work page 2097

  42. [42]

    Sufficiency of channels over von neumann al- gebras.The Quarterly Journal of Mathematics, 39(1):97– 108, 1988

    D´ enes Petz. Sufficiency of channels over von neumann al- gebras.The Quarterly Journal of Mathematics, 39(1):97– 108, 1988

    work page 1988

  43. [43]

    Theory of quantum error-correcting codes.Physical Review A, 55(2):900–911, 1997

    Emanuel Knill and Raymond Laflamme. Theory of quantum error-correcting codes.Physical Review A, 55(2):900–911, 1997

    work page 1997

  44. [44]

    Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven

    Ryan Babbush, Craig Gidney, Dominic W. Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven. Encoding electronic spectra in quantum circuits with linear t complexity. Physical Review X, 8(4), October 2018

    work page 2018

  45. [45]

    Pauli exchange errors in quantum computation.Physical Review Letters, 85:194–197, 2000

    Mary Beth Ruskai. Pauli exchange errors in quantum computation.Physical Review Letters, 85:194–197, 2000

    work page 2000

  46. [46]

    California Institute of Technology, 1997

    Daniel Gottesman.Stabilizer codes and quantum error correction. California Institute of Technology, 1997

    work page 1997

  47. [47]

    Magic state distil- lation with permutation-invariant codes and a two-qubit example.arXiv preprint arXiv:2603.04310, 2026

    Heather Leitch and Yingkai Ouyang. Magic state distil- lation with permutation-invariant codes and a two-qubit example.arXiv preprint arXiv:2603.04310, 2026

    work page arXiv 2026

  48. [48]

    A four-qubits code that is a quantum deletion error-correcting code with the optimal length

    Manabu Hagiwara and Ayumu Nakayama. A four-qubits code that is a quantum deletion error-correcting code with the optimal length. In2020 IEEE International Symposium on Information Theory (ISIT), pages 1870–

    work page

  49. [49]

    Quantum storage in quantum ferro- magnets.Physical Review B, 103(14):144417, 2021

    Yingkai Ouyang. Quantum storage in quantum ferro- magnets.Physical Review B, 103(14):144417, 2021

    work page 2021

  50. [50]

    Robust quantum metrology with explicit symmetric states.IEEE Transactions on Information Theory, 68(3):1809–1821, 2021

    Yingkai Ouyang, Nathan Shettell, and Damian Markham. Robust quantum metrology with explicit symmetric states.IEEE Transactions on Information Theory, 68(3):1809–1821, 2021

    work page 2021

  51. [51]

    Finite-round quantum error correction on symmetric quantum sensors

    Yingkai Ouyang and Gavin K Brennen. Quantum error correction on symmetric quantum sensors.arXiv preprint arXiv:2212.06285, 2022

    work page internal anchor Pith review Pith/arXiv arXiv 2022

  52. [52]

    Permutation- invariant codes encoding more than one qubit.Physical Review A, 93, 2016

    Yingkai Ouyang and Joseph Fitzsimons. Permutation- invariant codes encoding more than one qubit.Physical Review A, 93, 2016. 17

    work page 2016

  53. [53]

    Permutation-invariant quantum codes with transversal generalized phase gates

    Eric Kubischta and Ian Teixeira. Permutation-invariant quantum codes with transversal generalized phase gates. IEEE Transactions on Information Theory, 71:485–498, 2025

    work page 2025

  54. [54]

    Encoding a qubit in an oscillator.Physical Review A, 64:012310, 2001

    Daniel Gottesman, Alexei Kitaev, and John Preskill. Encoding a qubit in an oscillator.Physical Review A, 64:012310, 2001

    work page 2001

  55. [55]

    Omprakash Chandra, Gopikrishnan Muraleedharan, and Gavin K. Brennen. Nonlocal resources for error correc- tion in quantum low-density parity-check codes.Physical Review Research, 7(3):033247, 2025

    work page 2025

  56. [56]

    Matthew N. H. Chow, Vikas Buchemmavari, Sivaprasad Omanakuttan, Bethany J. Little, Saurabh Pandey, Ivan H. Deutsch, and Yuan-Yu Jau. Circuit-based leakage-to-erasure conversion in a neutral-atom quantum processor.PRX Quantum, 5(4):040343, 2024

    work page 2024

  57. [57]

    Constructing quantum codes from any classical code and their embed- ding in ground space of local Hamiltonians.Quantum, 8:1541, November 2024

    Ramis Movassagh and Yingkai Ouyang. Constructing quantum codes from any classical code and their embed- ding in ground space of local Hamiltonians.Quantum, 8:1541, November 2024

    work page 2024

  58. [58]

    Nonlocal multi- qubit quantum gates via a driven cavity.Physical Review A, 110(6):062610, 2024

    Sven Jandura, Vineesha Srivastava, Laura Pecorari, Gavin K Brennen, and Guido Pupillo. Nonlocal multi- qubit quantum gates via a driven cavity.Physical Review A, 110(6):062610, 2024

    work page 2024

  59. [59]

    Johnsson, Nabomita Roy Mukty, Daniel Bur- garth, Thomas Volz, and Gavin K

    Mattias T. Johnsson, Nabomita Roy Mukty, Daniel Bur- garth, Thomas Volz, and Gavin K. Brennen. Geometric pathway to scalable quantum sensing.Physical Review Letters, 125(19):190403, 2020

    work page 2020

  60. [60]

    Entanglement-enhanced quantum sensing via optimal global control with neutral atoms in a cavity.Physical Review Letters, 136(6):060806, 2026

    Vineesha Srivastava, Sven Jandura, Gavin K Brennen, and Guido Pupillo. Entanglement-enhanced quantum sensing via optimal global control with neutral atoms in a cavity.Physical Review Letters, 136(6):060806, 2026

    work page 2026

  61. [61]

    Universal control of symmet- ric states using spin squeezing.Physical Review Letters, 132(15):153601, 2024

    Noa Gutman, Alexey Gorlach, Offek Tziperman, Ron Ruimy, and Ido Kaminer. Universal control of symmet- ric states using spin squeezing.Physical Review Letters, 132(15):153601, 2024

    work page 2024

  62. [62]

    L. J. Bond, M. J. Davis, J. ˇC. v. Min´ aˇ r, R. Gerritsma, G. K. Brennen, and A. Safavi-Naini. Global variational quantum circuits for arbitrary symmetric state prepara- tion.Physical Review Research, 7:L022072, 2025

    work page 2025

  63. [63]

    Multiparticle en- tanglement of hot trapped ions.Physical Review Letters, 82(9):1835–1838, 1999

    Klaus Mølmer and Anders Sørensen. Multiparticle en- tanglement of hot trapped ions.Physical Review Letters, 82(9):1835–1838, 1999

    work page 1999

  64. [64]

    J. A. Sauer, K. M. Fortier, M. S. Chang, C. D. Hamley, and M. S. Chapman. Cavity qed with optically trans- ported atoms.Physical Review A, 69:051804, 2004

    work page 2004

  65. [65]

    A. K. Tuchman, R. Long, G. Vrijsen, J. Boudet, J. Lee, and M. A. Kasevich. Normal-mode splitting with large collective cooperativity.Physical Review A, 74:053821, 2006

    work page 2006

  66. [66]

    Geometrically asymmetric optical cav- ity for strong atom-photon coupling.Physical Review A, 99:013437, 2019

    Akio Kawasaki, Boris Braverman, Edwin Pedrozo- Pe˜ nafiel, Chi Shu, Simone Colombo, Zeyang Li, ¨Ozge ¨Ozel, Wenlan Chen, Leonardo Salvi, Andr´ e Heinz, David Levonian, Daisuke Akamatsu, Yanhong Xiao, and Vladan Vuleti´ c. Geometrically asymmetric optical cav- ity for strong atom-photon coupling.Physical Review A, 99:013437, 2019

    work page 2019

  67. [67]

    qer-pi: Quantum error recovery utilities for permutation-invariant quantum codes, 2026

    Omprakash Chandra. qer-pi: Quantum error recovery utilities for permutation-invariant quantum codes, 2026. doi:10.5281/zenodo.21126476

    work page doi:10.5281/zenodo.21126476 2026

  68. [68]

    Open quantum systems with local and collective incoherent processes: Efficient numerical simulation using permutational in- variance.Physical Review A, 98:063815, 2018

    Nathan Shammah, Shahnawaz Ahmed, Neill Lambert, Simone De Liberato, and Franco Nori. Open quantum systems with local and collective incoherent processes: Efficient numerical simulation using permutational in- variance.Physical Review A, 98:063815, 2018

    work page 2018

  69. [69]

    P. V. Klimov, J. Kelly, Z. Chen, M. Neeley, A. Megrant, B. Burkett, R. Barends, K. Arya, B. Chiaro, Yu Chen, et al. Fluctuations of energy-relaxation times in super- conducting qubits.Physical Review Letters, 121:090502, 2018

    work page 2018

  70. [70]

    Thompson

    Yue Wu, Shimon Kolkowitz, Shruti Puri, and Jeff D. Thompson. Erasure conversion for fault-tolerant quan- tum computing in alkaline earth rydberg atom arrays. Nature Communications, 13:4657, 2022

    work page 2022

  71. [71]

    Campbell, and Kenneth R

    Mingyu Kang, Wesley C. Campbell, and Kenneth R. Brown. Quantum error correction with metastable states of trapped ions using erasure conversion.PRX Quantum, 4:020358, 2023

    work page 2023

  72. [72]

    Collective processes of an ensemble of spin-1/ 2 particles.Physical Review A, 78(5):052101, 2008

    Bradley A Chase and JM Geremia. Collective processes of an ensemble of spin-1/ 2 particles.Physical Review A, 78(5):052101, 2008

    work page 2008

  73. [73]

    Collective uncertainty in partially polarized and par- tially decohered spin-1 2 systems.Physical Review A, 81(3):032104, 2010

    Ben Q Baragiola, Bradley A Chase, and JM Geremia. Collective uncertainty in partially polarized and par- tially decohered spin-1 2 systems.Physical Review A, 81(3):032104, 2010

    work page 2010

  74. [74]

    Addition of arbitrary number of identical angular momenta.J

    V Mikhailov. Addition of arbitrary number of identical angular momenta.J. Phys. A Math. Gen, 10:147–153, 1977

    work page 1977

  75. [75]

    Characterizing the entanglement of symmetric many-particle spin-1 2 systems.Physical Review A, 67(2):022112, 2003

    John K Stockton, John M Geremia, Andrew C Doherty, and Hideo Mabuchi. Characterizing the entanglement of symmetric many-particle spin-1 2 systems.Physical Review A, 67(2):022112, 2003. Appendix A: Permutation-Invariant States and the Heisenberg Ferromagnet Permutation-invariant quantum codes (PI codes) fundamentally reside in the ground space of a Heisenb...

    work page 2003

  76. [76]

    The Lindbladian in the vectorized form becomes, L = X i (Ai ⊗A ∗ i − 1 2(A† i Ai ⊗I+I⊗A † i Ai)),(C3) whereA i are the jump operators

    Vectorization A systemρstarts in the codespace of a PI code which can be written as ρ= X m,n ρm,n J= N 2 , Jz =m J= N 2 , Jz =n .(C1) In the vectorized formρbecomes |ρ⟩⟩= X m,n ρm,n |m⟩ ⊗ |n⟩,(C2) where we have omitted writing the value ofJbecause it isN/2 for Dicke subspace. The Lindbladian in the vectorized form becomes, L = X i (Ai ⊗A ∗ i − 1 2(A† i Ai...

    work page

  77. [77]

    For the above case,r= 0

    Global symmetric amplitude damping The vectorized Lindbladian for the global symmetric amplitude damping channel is L =γ − J− ⊗J − − 1 2(J † −J− ⊗I+I⊗J † −J−) .(C6) Now the action of L on the doubled-space|m⟩ ⊗ |n⟩introduced above is, L|m, n⟩⟩= √γmγn|m−1, n−1⟩⟩ −β (m,n) 0 |m, n⟩⟩,(C7) and the coefficients are, β(m,n) r = γm−r +γ n−r 2 (C8) γm−r = (J+m−r) ...

    work page

  78. [78]

    Up to first order int We now derive a Kraus representation for the first-order inttruncation of the global symmetric amplitude-damping channel

    Truncated global symmetric AD channel a. Up to first order int We now derive a Kraus representation for the first-order inttruncation of the global symmetric amplitude-damping channel. The first-order approximation to the vectorized evolution is S1 =e Lt ≃I⊗I+ Lt.(C28) Using the action of L on the doubled basis derived above, it is clear thatS 1 only conn...

    work page

  79. [79]

    Recovery map for first-order dynamics Using the formula the recovery Kraus operators are R(1) 0 (t) =ρ 1/2 I−γ −tJ+J− − (γ−t)2 4 (J+J−)2 1/2 [E(ρ)] −1/2 ,(D2) R(1) 1 (t) = p γ−t ρ1/2J+ [E(ρ)] −1/2 ,(D3) R(1) 2 (t) = γ−t 2 ρ1/2J+J− [E(ρ)] −1/2 .(D4) IfE(ρ) is not full rank, the inverse square root is understood as the Moore–Penrose inverse on the support ofE(ρ)

    work page

  80. [80]

    Recovery map for second-order dynamics We first compute adjoints K † 0 =I− γ−t 2 J+J− + γ2 −t2 8 (J+J−)2 =K 0,(D5) K † 1 = p γ−tJ+ − γ3/2 − t3/2 4 J+J−J+ +J +J+J− ,(D6) K † 2 = γ−t√ 2 J2 +,(D7) K † 3 =K 3.(D8) Note thatK † 3 =K 3 holds because the argument inside the square root ofK 3 is a sum of Hermitian, positive semi- definite operators, making its pr...

    work page