Pith. sign in

REVIEW 2 minor 51 references

A fault-tolerant error-correction round can be turned into a programmable logical dissipator by randomizing the decoder and recovery.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Partial quantum error correction enables compilation of target dissipators into effective logical dynamics via randomized decoder/recovery operations in fault-tolerant rounds.

T0 review reviewed 2026-06-29 challenge →

load-bearing objection The paper shows how randomized partial QEC rounds can compile logical dissipators with a relaxed accuracy condition that only needs uncontrolled errors to be a small fraction of the target rate.

arxiv 2605.30217 v1 pith:ZYFV7OIF submitted 2026-05-28 quant-ph

Programmable Dissipation via Partial Quantum Error Correction

Sameer Dambal , Michael AD Taylor , Yu Zhang This is my paper
classification quant-ph
keywords quantum error correctionopen quantum systemsprogrammable dissipationlogical channelsfault toleranceKraus operatorsquantum simulation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The reading

The paper shows that a single round of fault-tolerant quantum error correction produces a logical completely positive trace-preserving map. Randomizing the choice of decoder and recovery generates a family of such maps, and convex mixtures of these maps realize any desired Kraus-channel mixing for a target dissipator. This compiles open-system dynamics directly onto the logical qubits. The method avoids allocating separate ancilla qubits to represent bath degrees of freedom. Accuracy for multi-step runs follows from choosing code distance so that residual logical errors stay a small fraction of the programmed dissipation per step.

Core claim

One fault-tolerant round induces a logical completely positive trace-preserving map, and decoder/recovery randomization generates a controllable family of logical channels whose convex mixtures realize Kraus-channel mixing, enabling direct compilation of target dissipators into effective logical dynamics without explicit ancilla qubits for encoding the bath degree of freedoms. The accuracy criterion chooses code distance so that uncontrolled logical errors remain only a small fraction of the intended dissipation per step.

What carries the argument

The controllable family of logical channels generated by randomizing decoder and recovery operations within a fault-tolerant error-correction cycle, whose convex mixtures implement Kraus-channel mixing for target dissipators.

Load-bearing premise

An accuracy criterion can be satisfied by selecting code distance such that uncontrolled logical errors remain only a small fraction of the intended dissipation per step, rather than requiring the errors to be driven below an arbitrarily small closed-system tolerance.

What would settle it

Implement randomized decoder/recovery sequences on a small-distance logical qubit, apply several rounds, and measure whether the resulting logical channel matches the target dissipator within the predicted fraction of uncontrolled errors.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • Target dissipators compile directly into logical dynamics via convex mixtures of correction-induced channels.
  • No extra ancilla qubits are required to encode bath degrees of freedom.
  • Multi-step simulation accuracy holds when code distance keeps uncontrolled errors a small fraction of intended dissipation per step.
  • Fault-tolerant hardware is repurposed to sculpt rather than only suppress logical noise.

Where Pith is reading between the lines

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

  • The method may reduce total qubit count for open-system simulations by reusing the same correction cycle for both protection and dissipation engineering.
  • Hybrid coherent-dissipative logical evolution could be scheduled on the same device without separate bath registers.
  • Surface-code or other topological-code implementations could be tested by extracting the effective Kraus operators from randomized correction statistics.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 2 minor

Summary. The manuscript claims that a single fault-tolerant error-correction round induces a logical CPTP map, and that randomization over decoder/recovery choices produces a controllable family of such maps whose convex mixtures realize target Kraus dissipators on the logical level. This repurposes partial QEC to program open-system dynamics without dedicated bath ancillas. An accuracy criterion is derived requiring only that uncontrolled logical errors (scaling as p^{(d+1)/2}) remain a small fraction of the programmed dissipation (scaling linearly with p) per step, achieved by sufficient code distance below threshold.

Significance. If the central construction holds, the work supplies a structurally economical route to logical open-system simulation that directly exploits the CPTP structure already present in fault-tolerant primitives. The scaling separation between intended and uncontrolled channels is internally consistent and does not require driving logical error rates to closed-system tolerances, which is a practical advantage for near-term hardware.

minor comments (2)
  1. The abstract and introduction would benefit from an explicit low-dimensional example (e.g., a single-qubit amplitude-damping channel realized by a specific mixture of recovery maps) to illustrate the compilation procedure before the general argument.
  2. Notation for the randomized recovery map (presumably introduced in §3 or §4) should be defined once with an explicit convex-combination formula rather than left implicit in the text.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our central construction, as well as for recognizing the practical advantage that the scaling separation between programmed dissipation and uncontrolled logical errors does not require closed-system error tolerances. We are pleased with the recommendation for minor revision.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper's central claim is a structural repurposing of fault-tolerant error-correction rounds into programmable logical CPTP maps via decoder randomization, with an accuracy criterion based on standard distance-dependent error scaling (uncontrolled errors ~p^{(d+1)/2} vs. intended dissipation ~p). No equations, fitted parameters, or self-citations appear in the abstract or described argument that reduce any prediction or uniqueness claim to its own inputs by construction. The derivation remains self-contained against external benchmarks of quantum error correction and open-system simulation primitives.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proposal rests on standard quantum-channel assumptions plus the novel domain assumption that error-correction cycles can be treated as tunable primitives; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption A fault-tolerant error-correction round can be treated as a programmable primitive that induces a logical CPTP map.
    This premise is invoked at the start of the abstract to enable the subsequent randomization and mixing construction.

reviewed 2026-06-29 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Programmable Dissipation via Partial Quantum Error Correction." pith.science (2026). https://pith.science/paper/ZYFV7OIF

@misc{pith2026260530217,
  author       = {Pith},
  title        = {Pith review of: Programmable Dissipation via Partial Quantum Error Correction},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZYFV7OIF}},
  note         = {Machine review of arXiv:2605.30217}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Noise is typically treated as the adversary of quantum information processing. For open quantum dynamics, however, dissipation is part of the target physics, creating a tension with fault-tolerant architectures designed to suppress decoherence. Here we show that logical noise can instead be turned into a calibrated resource. We treat the error-correction cycle as a programmable primitive: one fault-tolerant round induces a logical completely positive trace-preserving map, and decoder/recovery randomization generates a controllable family of logical channels whose convex mixtures realize Kraus-channel mixing. This enables direct compilation of target dissipators into effective logical dynamics without explicit ancilla qubits for encoding the bath degree of freedoms. We derive an accuracy criterion for multi-step simulation in which the code distance is chosen so that uncontrolled logical errors remain a small fraction of the intended dissipation per step, rather than being driven below an arbitrarily small closed-system tolerance. Partial quantum error correction thus repurposes fault-tolerant structure to sculpt dissipation, offering a resource-efficient route to quantum simulation of open quantum systems.

Figures

Figures reproduced from arXiv: 2605.30217 by Michael AD Taylor, Sameer Dambal, Yu Zhang.

Figure 1
Figure 1. Figure 1: FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗

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

51 extracted references · 1 canonical work pages

  1. [1]

    Ifη= 0, the exact solutionr k ∈∆ M(d), i.e.,PM(d) k=1 rkx(d) k =x tar, can be found withS r bounded by|S r| ≤n aff

  2. [2]

    Theorems 3, 4 and Proposition 5 constitute the main results of this work

    The projection-free Frank-Wolfe algorithm finds the optimal solutionr k for the objective function over the simplex, with a convergence rate scaling as [45] (see the SM for the proof): O LM2(d) η .(24) whereLis the Lipschitz coefficient of the objective function(23),M(d)is the dimension of the simplex as defined earlier, andηis the accuracy. Theorems 3, 4...

  3. [3]

    Alexeev, V

    Y. Alexeev, V. S. Batista, N. Bauman, L. Bertels, D. Claudino, R. Dutta, L. Gagliardi, S. Godwin, N. Govind, M. Head-Gordon, M. R. Hermes, K. Kowal- ski, A. Li, C. Liu, J. Liu, P. Liu, J. M. Garc´ ıa-Lastra, D. Mejia-Rodriguez, K. Mueller, M. Otten, B. Peng, M. Raugas, M. Reiher, P. Rigor, W. J. Shaw, M. van Schilfgaarde, T. Vegge, Y. Zhang, M. Zheng, and...

    2025

  4. [4]

    Zhang, L

    Y. Zhang, L. Cincio, C. F. A. Negre, P. Czarnik, P. J. Coles, P. M. Anisimov, S. M. Mniszewski, S. Tretiak, and P. A. Dub, Variational quantum eigensolver with re- duced circuit complexity, npj Quantum Information8, 96 (2022)

    2022

  5. [5]

    Z. Cai, R. Babbush, S. C. Benjamin, S. Endo, W. J. Hug- gins, Y. Li, J. R. McClean, and T. E. O’Brien, Quantum error mitigation, Rev. Mod. Phys.95, 045005 (2023)

    2023

  6. [6]

    van den Berg, Z

    E. van den Berg, Z. K. Minev, A. Kandala, and K. Temme, Probabilistic error cancellation with sparse pauli–lindblad models on noisy quantum processors, Na- ture Physics19, 1116 (2023)

    2023

  7. [7]

    P. W. Shor, Scheme for reducing decoherence in quantum computer memory, Physical Review A52, R2493 (1995)

    1995

  8. [8]

    A. M. Steane, Multiple-particle interference and quan- tum error correction, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineer- ing Sciences452, 2551 (1996)

    1996

  9. [9]

    Knill and R

    E. Knill and R. Laflamme, Theory of quantum error- correcting codes, Physical Review A55, 900 (1997). 7

    1997

  10. [10]

    A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Physical Review A54, 1098 (1996)

    1996

  11. [11]

    Laflamme, C

    R. Laflamme, C. Miquel, J. P. Paz, and W. H. Zurek, Perfect quantum error correcting code, Physical Review Letters77, 198 (1996)

    1996

  12. [12]

    Dennis, A

    E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, Journal of Mathematical Physics43, 4452 (2002)

    2002

  13. [13]

    A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A86, 032324 (2012)

    2012

  14. [14]

    B. M. Terhal, Quantum error correction for quantum memories, Reviews of Modern Physics87, 307 (2015)

    2015

  15. [15]

    K. Wang, Z. Lu, C. Zhang, G. Liu, J. Chen, Y. Wang, Y. Wu, S. Xu, X. Zhu, F. Jin, Y. Gao, Z. Tan, Z. Cui, N. Wang, Y. Zou, A. Zhang, T. Li, F. Shen, J. Zhong, Z. Bao, Z. Zhu, Y. Han, Y. He, J. Shen, H. Wang, J.- N. Yang, Z. Song, J. Deng, H. Dong, Z.-Z. Sun, W. Li, Q. Ye, S. Jiang, Y. Ma, P.-X. Shen, P. Zhang, H. Li, Q. Guo, Z. Wang, C. Song, H. Wang, and...

    2026

  16. [16]

    C. K. Andersen, A. Remm, S. Lazar, S. Krinner, N. Lacroix, G. J. Norris, M. Gabureac, C. Eichler, and A. Wallraff, Repeated quantum error detection in a sur- face code, Nature Physics16, 875 (2020)

    2020

  17. [17]

    Krinner, N

    S. Krinner, N. Lacroix, A. Remm, A. Di Paolo, E. Genois, C. Leroux, C. Hellings, S. Lazar, F. Swiadek, J. Her- rmann, G. J. Norris, C. K. Andersen, M. M¨ uller, A. Blais, C. Eichler, and A. Wallraff, Realizing repeated quantum error correction in a distance-three surface code, Nature 605, 669 (2022)

    2022

  18. [18]

    Acharya, I

    R. Acharya, I. Aleiner, R. Allen, T. I. Andersen, M. Ans- mann, F. Arute, K. Arya, A. Asfaw, J. Atalaya, R. Bab- bush, D. Bacon, J. C. Bardin, J. Basso, A. Bengtsson, S. Boixo, G. Bortoli, A. Bourassa, J. Bovaird, L. Brill, M. Broughton, B. B. Buckley, D. A. Buell, T. Burger, B. Burkett, N. Bushnell, Y. Chen, Z. Chen, B. Chiaro, J. Cogan, R. Collins, P. C...

    2023

  19. [19]

    Breuer and F

    H. Breuer and F. Petruccione,The Theory of Open Quan- tum Systems(Oxford University Press, 2002)

    2002

  20. [20]

    Gardiner and P

    C. Gardiner and P. Zoller,Quantum noise: a handbook of Markovian and non-Markovian quantum stochastic meth- ods with applications to quantum optics(Springer Science & Business Media, 2004)

    2004

  21. [21]

    Lindblad, On the generators of quantum dynamical semigroups, Commun

    G. Lindblad, On the generators of quantum dynamical semigroups, Commun. Math. Phys.48, 119 (1976)

    1976

  22. [22]

    Gorini, A

    V. Gorini, A. Kossakowski, and E. C. G. Sudarshan, Completely positive dynamical semigroups of n-level sys- tems, Journal of Mathematical Physics17, 821 (1976)

    1976

  23. [23]

    Manzano, A short introduction to the lindblad master equation, AIP Advances10(2020)

    D. Manzano, A short introduction to the lindblad master equation, AIP Advances10(2020)

    2020

  24. [24]

    Mostame, P

    S. Mostame, P. Rebentrost, A. Eisfeld, A. J. Kerman, D. I. Tsomokos, and A. Aspuru-Guzik, Quantum simu- lator of an open quantum system using superconducting qubits: exciton transport in photosynthetic complexes, New J. Phys.14, 105013 (2012)

    2012

  25. [25]

    Dmitriev, N

    R. Dmitriev, N. Younas, Y. Zhang, A. Piryatinski, and E. R. Bittner, Tensorial spin-phonon relaxation reveals mode-selective relaxation pathways in a single-molecule qubit, The Journal of Chemical Physics163, 224110 (2025)

    2025

  26. [26]

    Lunghi, A unified ab initio theory of spin-phonon re- laxation and decoherence uncovers fast dephasing in mag- netic molecules, Science Advances12, eaeb3868

    A. Lunghi, A unified ab initio theory of spin-phonon re- laxation and decoherence uncovers fast dephasing in mag- netic molecules, Science Advances12, eaeb3868

  27. [27]

    Zhang, C

    Y. Zhang, C. Y. Yam, and G. Chen, Dissipative time- dependent quantum transport theory, J. Chem. Phys. 138, 164121 (2013)

    2013

  28. [28]

    L. Chen, Y. Zhang, G. Chen, and I. Franco, Stark con- trol of electrons along nanojunctions, Nature Communi- cations9, 2070 (2018)

    2070

  29. [29]

    Kraus,States, Effects, and Operations: Fundamental Notions of Quantum Theory, Lecture Notes in Physics, Vol

    K. Kraus,States, Effects, and Operations: Fundamental Notions of Quantum Theory, Lecture Notes in Physics, Vol. 190 (Springer, Berlin, Heidelberg, 1983)

    1983

  30. [30]

    W. F. Stinespring, Positive functions on C ∗-algebras, Proceedings of the American Mathematical Society6, 211 (1955)

    1955

  31. [31]

    M. A. Nielsen and I. L. Chuang,Quantum computation and quantum information(Cambridge university press, 2010)

    2010

  32. [32]

    Watrous,The Theory of Quantum Information(Cam- bridge University Press, 2018)

    J. Watrous,The Theory of Quantum Information(Cam- bridge University Press, 2018)

    2018

  33. [33]

    Bauer, S

    B. Bauer, S. Bravyi, M. Motta, and G. K.-L. Chan, Quantum algorithms for quantum chemistry and quan- tum materials science, Chem. Rev.120, 12685 (2020)

    2020

  34. [34]

    P. J. Ollitrault, A. Miessen, and I. Tavernelli, Molecular quantum dynamics: A quantum computing perspective, Accounts of Chemical Research54, 4229 (2021)

    2021

  35. [35]

    Z. Ding, X. Li, and L. Lin, Simulating open quantum systems using hamiltonian simulations, PRX Quantum 5, 020332 (2024)

    2024

  36. [36]

    A. W. Schlimgen, K. Head-Marsden, L. M. Sager, P. Narang, and D. A. Mazziotti, Quantum simulation of open quantum systems using a unitary decomposition of operators, Physical Review Letters127, 270503 (2021)

    2021

  37. [37]

    Z. Hu, R. Xia, and S. Kais, A quantum algorithm for 8 evolving open quantum dynamics on quantum computing devices, Sci. Rep.10, 3301 (2020)

    2020

  38. [38]

    Y. Wang, E. Mulvihill, Z. Hu, N. Lyu, S. Shivpuje, Y. Liu, M. B. Soley, E. Geva, V. S. Batista, and S. Kais, Simulating open quantum system dynamics on nisq com- puters with generalized quantum master equations, Jour- nal of Chemical Theory and Computation19, 4851 (2023)

    2023

  39. [39]

    L. H. Delgado-Granados, T. J. Krogmeier, L. M. Sager- Smith, I. Avdic, Z. Hu, M. Sajjan, M. Abbasi, S. E. Smart, P. Narang, S. Kais, A. W. Schlimgen, K. Head- Marsden, and D. A. Mazziotti, Quantum algorithms and applications for open quantum systems, Chem. Rev.125, 1823 (2025)

    2025

  40. [40]

    D. W. Leung, M. A. Nielsen, I. L. Chuang, and Y. Ya- mamoto, Approximate quantum error correction can lead to better codes, Physical Review A56, 2567 (1997)

    1997

  41. [41]

    B´ eny and O

    C. B´ eny and O. Oreshkov, General conditions for ap- proximate quantum error correction and near-optimal re- covery channels, Physical Review Letters104, 120501 (2010)

    2010

  42. [42]

    D. W. Kribs, R. Laflamme, and D. Poulin, Unified and generalized approach to quantum error correction, Phys- ical Review Letters94, 180501 (2005)

    2005

  43. [43]

    Reinhold, S

    P. Reinhold, S. Rosenblum, W.-L. Ma, L. Frunzio, L. Jiang, and R. J. Schoelkopf, Error-corrected gates on an encoded qubit, Nature Physics16, 822 (2020)

    2020

  44. [44]

    S. J. Devitt, W. J. Munro, and K. Nemoto, Quantum error correction for beginners, Reports on Progress in Physics76, 076001 (2013)

    2013

  45. [45]

    Equivalently one may stay entirely within the code space and use logical Pauli/frame tracking; the abstract chan- nelB d captures the logical input–output relation after discarding classical records

  46. [46]

    Choi, Completely positive linear maps on complex matrices, Linear Algebra Its Appl.10, 285 (1975)

    M.-D. Choi, Completely positive linear maps on complex matrices, Linear Algebra Its Appl.10, 285 (1975)

    1975

  47. [47]

    Pokutta, The frank-wolfe algorithm: a short in- troduction, Jahresbericht der Deutschen Mathematiker- Vereinigung126, 3 (2024)

    S. Pokutta, The frank-wolfe algorithm: a short in- troduction, Jahresbericht der Deutschen Mathematiker- Vereinigung126, 3 (2024)

    2024

  48. [48]

    Higgott, PyMatching: A python package for decoding quantum codes with minimum-weight perfect matching, ACM Transactions on Quantum Computing3, 1 (2022), arXiv:2105.13082 [quant-ph]

    O. Higgott, Pymatching: A python package for decoding quantum codes with minimum-weight perfect matching (2021), arXiv:2105.13082 [quant-ph]

    work page arXiv 2021

  49. [49]

    Cygorek, M

    M. Cygorek, M. Cosacchi, A. Vagov, V. M. Axt, B. W. Lovett, J. Keeling, and E. M. Gauger, Simulation of open quantum systems by automated compression of arbitrary environments, Nature Physics18, 662 (2022)

    2022

  50. [50]

    Y. Zhan, Z. Ding, J. Huhn, J. Gray, J. Preskill, G. K.-L. Chan, and L. Lin, Rapid quantum ground state prepa- ration via dissipative dynamics, Physical Review X16, 011004 (2026)

    2026

  51. [51]

    Verstraete, M

    F. Verstraete, M. M. Wolf, and J. Ignacio Cirac, Quan- tum computation and quantum-state engineering driven by dissipation, Nature Physics5, 633 (2009)

    2009

This paper was first reviewed by grok-4.3 on June 29, 2026.