Pith. sign in

REVIEW 4 minor 63 references

Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions

T0 review · 0 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

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

Pith's one-line read The exact cost of reversing an unknown Hamiltonian evolution is set by additive relations among its eigenvalues, and for general families by a symmetry-sector reduction — often dropping from exponential to polynomial or constant.

desk verdict Solid theory paper: exact sumset characterization of query complexity for Hamiltonian inversion plus a Wedderburn reduction; proofs are detailed, and the separations are real. read the letter →

arxiv 2607.29382 v2 pith:G7FW3G4R submitted 2026-07-31 quant-ph

Jizhe Lai , Mingrui Jing , Erdong Huang , Xin Wang This is my paper · ORCID
classification quant-ph MSC 81P68 PACS 03.67.Lx
keywords exactunitaryinversionreversingcostquerycomplexityadditivesumsetHamiltonianfamiliesWedderburndecompositionsymmetrysectorsTavis-Cummingsmodel
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Reversing a quantum evolution U(t)=e^{iHt} normally costs as much as inverting an arbitrary unitary — Θ(d²) forward calls in dimension d. This paper asks whether knowing the structure of the Hamiltonian, while leaving its parameters hidden, lowers that cost for deterministic exact inversion. For one-parameter families with a fixed eigenbasis, it proves that the optimal number of forward calls is exactly the smallest additive-sumset completion of the distinct eigenvalues (Theorem 1), a number that ignores eigenspace degeneracy and never exceeds K−1. For noncommuting generators, a Wedderburn decomposition shows that repeated symmetry sectors are irrelevant to the query count and provides an automatic construction that assembles blockwise inverses with synchronized phases. On the Tavis–Cummings, collective-spin, and passive multimode families, these results replace exponential dimension-only benchmarks with O(1), O(n³), and O(N n²) bounds, so a rapidly growing many-body Hilbert space need not imply a harder inversion problem.

What carries the argument

The load-bearing object is the additive sumset Σ_q(Λ) of the distinct eigenvalues: in a fixed eigenbasis every forward call routes the state through one eigenspace and contributes that eigenvalue to the total phase, so a q-query protocol can produce phase c−λ only if c−λ ∈ Σ_q(Λ); κ(Λ) is the smallest q for which every λ can be completed. The universal K−1 construction rests on a cyclic-shift twirling identity: conjugating U by all powers of a cyclic shift over representative eigenstates accumulates every eigenvalue except the input one, so K−1 queries always suffice. For noncommuting generators, the Wedderburn decomposition of the algebra generated by the known H_j splits the space into pas

What would settle it

For the explicit five-level spectrum Λ = {−5, −4, 1, 3, 5} analyzed in the Supplemental Material, the formula gives κ(Λ) = 3 while the universal bound is K−1 = 4. Exhaustively searching all clean two-query inversion circuits — or explicitly constructing one — would settle Theorem 1 in this case: a clean two-query protocol would refute the sumset formula, and a certified impossibility would support it. A broader falsification would be any clean exact q-query inversion with q < κ(Λ) for any fixed-eigenbasis family.

Watch

Extended reading notes

Core claim

For a one-parameter family U(x)=e^{iHx} with distinct eigenvalues Λ, each forward call contributes one eigenvalue phase, so q-query protocols accumulate phases in the q-fold sumset Σ_q(Λ). The minimum number of calls to implement U(x)^† up to a global phase is exactly κ(Λ)=min{ q : ∃c, c−Λ ⊆ Σ_q(Λ) }: every eigenvalue must be completed to one common frequency c. Routing input components through chosen eigenspaces proves sufficiency; a unit-modulus finite exponential polynomial has a single frequency, proving necessity. The same vector-valued criterion covers commuting multiparameter families, and κ(Λ) ≤ K−1 regardless of degeneracy. For noncommuting families, Wedderburn decomposition removes

Load-bearing premise

The exact optimality claims hold only for 'clean' inversion protocols, meaning every auxiliary register must be returned to its initial state; if a protocol were allowed to leave ancillas altered or entangled, the minimum number of forward calls could in principle be smaller.

Editorial extensions

If this is right

  • For any commuting Hamiltonian family, the reversing cost is bounded by K−1, where K counts distinct eigenvalues; eigenspace degeneracy plays no role, so highly symmetric systems with few distinct energies are cheap to reverse.
  • Loschmidt echoes, OTOC sequences, and echo-verification circuits can run an exact backward branch built purely from forward calls to the same device, without estimating or recalibrating the unknown coupling strengths.
  • The Tavis–Cummings family restricted to at most N excitations admits a clean exact inverse with O_{M,N}(1) forward calls, independent of the number n of emitters — versus the O(n^{2N}) dimension-only benchmark.
  • The collective-spin (Ising/LMG-type) family is reversible in O(n³) calls instead of O(4^n), and passive n-mode links in O(N n²) calls instead of exponential-in-truncated-dimension benchmarks.
  • The Wedderburn result says that repeated copies of the same unknown dynamics — multiplicity — never increase the exact query cost; only inequivalent active blocks matter.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because exactness is what makes the sumset condition binding, the advertised speedups are expected to be sensitive: generically perturbing eigenvalues should push κ(Λ) back near K−1, so the gains are tied to the exact spectral relations of the idealized model (the paper notes that symmetry-breaking perturbations may remove the exact advantage, without quantifying the generic value).
  • The clean-ancilla assumption bounds the lower bound: allowing protocols to leave or consume ancilla states could in principle beat κ(Λ). Checking whether a 'catalyst' inversion exists for the five-level spectrum Λ={−5,−4,1,3,5} would test how tight the clean model is.
  • κ(Λ) is the optimum of an explicit integer program, so the criterion could be used in reverse as a design tool — compute the completion number for a proposed family's spectrum before searching circuit layouts; the paper does not address the complexity of evaluating κ.
  • A natural testbed is the parity-refined Lipkin–Meshkov–Glick subfamily mentioned in the Supplemental Material: computing its trace-vector synchronization certificate would show whether the O(n³) bound can be improved below cubic for a physically standard model.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 4 minor

Summary. The paper studies deterministic exact inversion of Hamiltonian evolution U(x)=exp(i∑ x_j H_j) with known generators H_j but unknown parameters x. It introduces a query-complexity measure for 'clean' protocols that return all ancillas. For one-parameter families with a fixed eigenbasis, Theorem 1 characterizes the exact query number as κ(Λ) = min{q: ∃c, c−Λ ⊆ Σ_q(Λ)}, with explicit constructions and a matching lower bound based on finite exponential polynomials. The result extends to commuting multiparameter families. For general (noncommuting) families, Theorem 2 uses Wedderburn decomposition to show that passive multiplicities do not affect the query number, and gives an automatic blockwise compiler with phase synchronization. Applications to Tavis-Cummings, collective-spin, and passive multimode systems yield structure-dependent upper bounds (constant, O(n^3), and O(N n^2) respectively) that contrast with dimension-only exponential benchmarks.

Significance. The paper gives the first exact characterization of query complexity for structured Hamiltonian inversion, moving beyond worst-case dimension-dependent bounds. The main theorems are accompanied by explicit circuit constructions and matching lower bounds, and the proofs in the Supplemental Material are detailed and self-contained. The Wedderburn reduction is a useful general tool that rigorously separates passive multiplicities from active degrees of freedom. The applications demonstrate that physically motivated symmetric families can admit polynomial or even constant reversing cost. I found no load-bearing technical errors. The clean-protocol convention is explicit and standard; the lower-bound Fourier-support argument does not rely on ancilla reset in an essential way, so this is not a hidden restriction.

minor comments (4)
  1. [Supplemental Material, Lemma S4] The definition of h# around Eq. (S45) is ambiguous; the bar over h may have been lost in typesetting. Clarify that h# denotes the coefficientwise conjugate polynomial and that the subsequent conjugation identities are taken in that sense.
  2. [Main text, Theorem 2 proof sketch] The phrase 'closed (q_β+1)-call sequence' is not defined in the main text; the reader must infer it from Lemma S16 of the Supplemental Material. Add a one-sentence explanation or a pointer to the lemma for readability.
  3. [Figure 2] The legend mixes exact optimal values (ring coupling, bright mode) with constructive upper bounds (arbitrary X). State explicitly which curves are exact and which are upper bounds, and note that the bright-mode q=2 and ring-coupling q=n are fixed-eigenbasis optima.
  4. [Discussion] The paper's model assumes clean deterministic protocols and ideal unitary queries; this is explicit in the definitions, but an explicit 'scope and limitations' sentence in the Discussion would help avoid misinterpretation (e.g., dissipative effects are not reversed, and approximate inversion is not considered).

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central query-complexity characterization is proved from spectral/Fourier arguments, and cited universal-inverter work is used only as a subroutine.

full rationale

The paper's central claim (Theorem 1 / Theorem S2) is derived self-containedly: sufficiency routes each eigenspace through a q-tuple of eigenvalues summing to c−λ_j, and necessity shows the global phase must be a single Fourier mode whose frequency lies in the intersection ∩_λ(λ+Σ_q(Λ)). This yields exactly the sumset condition rather than assuming it. The multiparameter and K−1 bounds follow by the same argument. The Wedderburn reduction (Theorem 2 / Theorem S8) is proved as an iff using explicit fixed split/load wirings, so passive multiplicities are genuinely removed rather than assumed away. The applications invoke Ref. [14] as a black-box universal inverter; although this reference shares an author, it is a prior external construction used only as a subroutine for upper bounds, and the exact lower-bound/equality results do not depend on it. No fitted parameter is relabeled as a prediction, and the clean-protocol convention is explicit and consistently applied. The paper also explicitly disclaims optimality for its automatic/completion constructions outside the fixed-eigenbasis case. Therefore no circular step is present.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The paper's results rest on standard representation theory and on the explicitly stated clean-protocol model. No free parameters are fitted and no new physical entities are introduced.

assumptions (6)
  • domain assumption Clean protocol model: every auxiliary register must return to its initial state (Definition S2).
    The reversing cost and all lower bounds are defined in this model; non-clean protocols are not considered and could in principle have different query numbers.
  • standard math Wedderburn decomposition of finite-dimensional *-algebras.
    Used to decompose the generated algebra into irreducible blocks with multiplicity spaces (Theorem S8).
  • standard math Schur-Weyl duality for (C^2)^otimes n and for bosonic symmetric powers.
    Used in the Tavis-Cummings, collective-spin, and passive-link applications.
  • standard math Universal inverter of Ref [14] with query count q_univ(d) = O(d^2).
    Used as the local block inverter in the application bounds; treated as an external proven result.
  • standard math Zariski density of U(d) in M_d(C) and unique factorization in C[z_ij].
    Used in Lemma S4 to classify universal inverter residuals as determinant powers.
  • domain assumption The hidden parameters x are real and the generators H_j are known Hermitian operators (Eq. 1).
    This is the stated problem setup.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions." pith.science (2026). https://pith.science/paper/G7FW3G4R

@misc{pith2026260729382,
  author       = {Pith},
  title        = {Pith review of: Algebraic Speedups for Exact Inversion of Hamiltonian Evolutions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/G7FW3G4R}},
  note         = {Machine review of arXiv:2607.29382}
}
abstract

Deterministic exact inversion of an arbitrary $d$-dimensional unitary requires {$\Theta(d^2)$} coherent forward calls in the worst case. We ask how this cost changes for Hamiltonian evolution $U(x)=\exp(i\sum_j x_jH_j)$ when the generators are known but the parameters are hidden. For one-parameter families with a fixed eigenbasis, we show that additive relations among the distinct eigenvalues determine the optimal query number exactly, and we construct the corresponding inversion protocol. For general families, we prove that repeated symmetry sectors do not affect the exact query complexity and give an automatic construction for combining inverses from inequivalent active sectors. We also give a sufficient phase-alignment condition under which family-specific structure can reduce the query number. These results establish structure-dependent bounds for reversing the unknown dynamics arising in Tavis-Cummings out-of-time-order correlator protocols, collective-spin echo verification, and passive multimode links, without requiring prior knowledge or explicit estimation of the underlying coupling strengths.

Figures

Figures reproduced from arXiv: 2607.29382 by the authors.

Figure 1
Figure 1. FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2 [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

63 extracted references · 40 canonical work pages

  1. [14]

    Universal algorithm for transforming Hamiltonian eigenvalues

    Universal Algorithm for Transforming Hamiltonian Eigenvalues , author=. Physical Review Research , volume=. 2025 , doi=. 2312.08848 , archivePrefix=

    work page Pith review arXiv 2025

  2. [1]

    Communications in Mathematical Physics , volume=

    Quantum conditional mutual information and approximate Markov chains , author=. Communications in Mathematical Physics , volume=. 2015 , publisher=

    work page 2015

  3. [2]

    Communications in mathematical physics , volume=

    Simple C*-algebra generated by isometries , author=. Communications in mathematical physics , volume=. 1977 , publisher=

    work page 1977

  4. [3]

    Econometrica , year=

    An Automatic Method of Solving Discrete Programming Problems , author=. Econometrica , year=

    work page

  5. [4]

    Econometrica , volume=

    An Automatic Method of Solving Discrete Programming Problems , author=. Econometrica , volume=. 1960 , doi=

    work page 1960

  6. [5]

    Physical Review A , volume=

    Quantum-Process Tomography: Resource Analysis of Different Strategies , author=. Physical Review A , volume=. 2008 , doi=. quant-ph/0702131 , archivePrefix=

    arXiv 2008

  7. [6]

    Optimal quantum learning of a unitary transformation , author =. Phys. Rev. A , volume =. 2010 , month =. doi:10.1103/PhysRevA.81.032324 , url =

    work page doi:10.1103/physreva.81.032324 2010

  8. [7]

    Physical Review Letters , volume=

    Quantum Circuit Architecture , author=. Physical Review Letters , volume=. 2008 , doi=

    work page 2008

Show all 63 references
  1. [8]

    Physical Review A , volume=

    Theoretical Framework for Quantum Networks , author=. Physical Review A , volume=. 2009 , doi=

    2009

  2. [9]

    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , volume=

    Theoretical Framework for Higher-Order Quantum Theory , author=. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , volume=. 2019 , doi=. 1806.09554 , archivePrefix=

    2019 arXiv

  3. [10]

    Physical Review Letters , volume=

    Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations , author=. Physical Review Letters , volume=. 2019 , doi=. 1810.06944 , archivePrefix=

    2019 arXiv

  4. [11]

    Physical Review Letters , volume=

    Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly , author=. Physical Review Letters , volume=. 2023 , doi=. 2209.02907 , archivePrefix=

    2023 arXiv

  5. [12]

    arXiv preprint arXiv:2403.04704 , year=

    Quantum Advantage in Reversing Unknown Unitary Evolutions , author=. arXiv preprint arXiv:2403.04704 , year=. doi:10.48550/arXiv.2403.04704 , eprint=

    doi

  6. [13]

    Physical Review Research , volume=

    Higher-Order Quantum Transformations of Hamiltonian Dynamics , author=. Physical Review Research , volume=. 2024 , doi=. 2303.09788 , archivePrefix=

    2024 arXiv

  7. [16]

    npj Quantum Information , volume=

    Parameterized Quantum Comb and Simpler Circuits for Reversing Unknown Qubit-Unitary Operations , author=. npj Quantum Information , volume=. 2025 , doi=

    2025

  8. [17]

    Europhysics Letters , volume=

    Transforming Quantum Operations: Quantum Supermaps , author=. Europhysics Letters , volume=. 2008 , doi=. 0804.0180 , archivePrefix=

    2008 arXiv

  9. [18]

    Physical Review A , volume=

    Probabilistic Exact Universal Quantum Circuits for Transforming Unitary Operations , author=. Physical Review A , volume=. 2019 , doi=. 1909.01366 , archivePrefix=

    2019 arXiv

  10. [19]

    Quantum , volume=

    Deterministic Transformations between Unitary Operations: Exponential Advantage with Adaptive Quantum Circuits and the Power of Indefinite Causality , author=. Quantum , volume=. 2022 , doi=

    2022

  11. [20]

    Physical Review Letters , volume=

    Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations , author=. Physical Review Letters , volume=. 2025 , doi=. 2405.07625 , archivePrefix=

    2025

  12. [21]

    arXiv preprint arXiv:2507.05736 , year=

    Approximation Does Not Help in Quantum Unitary Time-Reversal , author=. arXiv preprint arXiv:2507.05736 , year=. doi:10.48550/arXiv.2507.05736 , eprint=

    doi

  13. [22]

    arXiv preprint arXiv:2506.20570 , year=

    Efficient Inversion of Unknown Unitary Operations with Structured Hamiltonians , author=. arXiv preprint arXiv:2506.20570 , year=. doi:10.48550/arXiv.2506.20570 , eprint=

    doi arXiv

  14. [23]

    Quantum , volume=

    Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality , author=. Quantum , volume=. 2022 , publisher=

    2022

  15. [24]

    arXiv preprint arXiv:2403.04704 , year=

    Quantum Algorithm for Reversing Unknown Unitary Evolutions , author=. arXiv preprint arXiv:2403.04704 , year=

  16. [25]

    arXiv preprint arXiv:2506.20570 , year=

    Efficient Inversion of Unknown Unitary Operations with Structured Hamiltonians , author=. arXiv preprint arXiv:2506.20570 , year=

    arXiv

  17. [26]

    2007 , publisher=

    Algebra: Volume II: Fields with Structure, Algebras and Advanced Topics , author=. 2007 , publisher=

    2007

  18. [27]

    Communications in mathematical physics , mendeley-groups =

    Hayden, Patrick and Jozsa, Richard and Petz, Denes and Winter, Andreas , file =. Communications in mathematical physics , mendeley-groups =

  19. [28]

    Communications in Mathematical Physics , mendeley-groups =

    Ibinson, Ben and Linden, Noah and Winter, Andreas , doi =. Communications in Mathematical Physics , mendeley-groups =. arXiv , arxivId =:0611057 , file =

  20. [29]

    Physical Review Letters , keywords =

    Brand. Physical Review Letters , keywords =. doi:10.1103/PhysRevLett.115.050501 , eprint =

    doi

  21. [30]

    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , keywords =

    Sutter, David and Fawzi, Omar and Renner, Renato , doi =. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences , keywords =. arXiv , arxivId =:1504.07251 , file =

    arXiv

  22. [31]

    IEEE Transactions on Information Theory , keywords =

    Berta, Mario and Tomamichel, Marco , doi =. IEEE Transactions on Information Theory , keywords =

  23. [32]

    2011 , isbn =

    Pavel Etingof and Oleg Golberg and Sebastian Hensel and Tiankai Liu and Alex Schwendner and Dmitry Vaintrob and Elena Yudovina , title =. 2011 , isbn =

    2011

  24. [33]

    2011 , month = jan, note =

    Pavel Etingof and Oleg Golberg and Sebastian Hensel and Tiankai Liu and Alex Schwendner and Dmitry Vaintrob and Elena Yudovina , title =. 2011 , month = jan, note =

    2011

  25. [34]

    Physical Review A , volume =

    Giulio Chiribella and Giacomo Mauro D'Ariano and Paolo Perinotti , title =. Physical Review A , volume =. 2009 , doi =

    2009

  26. [35]

    Pollock and C

    Felix A. Pollock and C. Operational Markov Condition for Quantum Processes , journal =. 2018 , doi =

    2018

  27. [36]

    Physical Review A , volume=

    Measuring the scrambling of quantum information , author=. Physical Review A , volume=. 2016 , publisher=. doi:10.1103/PhysRevA.94.040302 , eprint=

    2016 doi

  28. [37]

    Quantum Chaos in the

    Tiwari, Devvrat and Banerjee, Subhashish , journal=. Quantum Chaos in the. 2023 , doi=. 2305.15505 , archivePrefix=

    2023 arXiv

  29. [38]

    Scientific Reports , volume=

    Singly-Excited Resonant Open Quantum System. Scientific Reports , volume=. 2023 , doi=. 2208.12029 , archivePrefix=

    2023 arXiv

  30. [39]

    Nature Physics , volume=

    Operational formulation of time reversal in quantum theory , author=. Nature Physics , volume=. 2015 , publisher=

    2015

  31. [40]

    Quantum , volume =

    Characterising transformations between quantum objects, ``completeness'' of quantum properties, and transformations without a fixed causal order , author =. Quantum , volume =. 2024 , doi =. 2305.01247 , archivePrefix =

    2024 arXiv

  32. [41]

    npj Quantum Information , volume=

    Optimal Hamiltonian Recognition of Unknown Quantum Dynamics , author=. npj Quantum Information , volume=. 2026 , doi=. 2412.13067 , archivePrefix=

    2026

  33. [42]

    arXiv preprint arXiv:2507.23787 , year=

    Amplitude amplification and estimation require inverses , author=. arXiv preprint arXiv:2507.23787 , year=. doi:10.48550/arXiv.2507.23787 , eprint=

    doi arXiv

  34. [43]

    Advances in Applied Mathematics , volume=

    Heisenberg models and Schur--Weyl duality , author=. Advances in Applied Mathematics , volume=. 2023 , doi=. 2201.10209 , archivePrefix=

    2023 arXiv

  35. [44]

    and Harrow, Aram W

    Bacon, Dave and Chuang, Isaac L. and Harrow, Aram W. , journal=. Efficient Quantum Circuits for. 2006 , doi=. quant-ph/0407082 , archivePrefix=

    2006 arXiv

  36. [45]

    Proceedings of the Royal Society of London

    Electron correlations in narrow energy bands , author=. Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences , volume=. 1963 , doi=

    1963

  37. [46]

    Physical Review Letters , volume=

    Absence of Mott Transition in an Exact Solution of the Short-Range, One-Band Model in One Dimension , author=. Physical Review Letters , volume=. 1968 , doi=

    1968

  38. [47]

    Quantum , volume=

    Eigenstate entanglement in integrable collective spin models , author=. Quantum , volume=. 2022 , doi=. 2108.09866 , archivePrefix=

    2022 arXiv

  39. [48]

    Quantum computation with quantum dots , author =. Phys. Rev. A , volume =. 1998 , month =. doi:10.1103/PhysRevA.57.120 , url =

    1998 doi

  40. [49]

    Coherence in Spontaneous Radiation Processes , author =. Phys. Rev. , volume =. 1954 , month =. doi:10.1103/PhysRev.93.99 , url =

    1954 doi

  41. [50]

    Exact solutions and perturbation theory , author=

    Validity of many-body approximation methods for a solvable model:(I). Exact solutions and perturbation theory , author=. Nuclear Physics , volume=. 1965 , publisher=

    1965

  42. [51]

    Nature Communications , volume=

    Does provable absence of barren plateaus imply classical simulability? , author=. Nature Communications , volume=. 2025 , publisher=

    2025

  43. [52]

    Physical Review Letters , volume=

    Error Mitigation for Short-Depth Quantum Circuits , author=. Physical Review Letters , volume=. 2017 , doi=. 1612.02058 , archivePrefix=

    2017 arXiv

  44. [53]

    Reviews of Modern Physics , volume=

    Quantum Error Mitigation , author=. Reviews of Modern Physics , volume=. 2023 , doi=. 2210.00921 , archivePrefix=

    2023 arXiv

  45. [54]

    and Kandala, Abhinav and Temme, Kristan , journal=

    van den Berg, Ewout and Minev, Zlatko K. and Kandala, Abhinav and Temme, Kristan , journal=. Probabilistic error cancellation with sparse. 2023 , doi=. 2201.09866 , archivePrefix=

    2023 arXiv

  46. [55]

    Physical Review Letters , volume=

    Reversing Unknown Quantum Processes via Virtual Combs for Channels with Limited Information , author=. Physical Review Letters , volume=. 2024 , doi=. 2401.04672 , archivePrefix=

    2024 arXiv

  47. [56]

    Nature Communications , volume=

    Quantum Simulation of Spin--Boson Models with Structured Bath , author=. Nature Communications , volume=. 2025 , doi=

    2025

  48. [57]

    Hamiltonian Learning via Shadow Tomography of Pseudo-

    Castaneda, Juan and Wiebe, Nathan , journal=. Hamiltonian Learning via Shadow Tomography of Pseudo-. 2025 , doi=. 2308.13020 , archivePrefix=

    2025 arXiv

  49. [58]

    Physical Review D , volume=

    Quantum Error Mitigation for Fourier Moment Computation , author=. Physical Review D , volume=. 2025 , doi=. 2401.13048 , archivePrefix=

    2025 arXiv

  50. [59]

    and Succi, Sauro and Coveney, Peter V

    Weaving, Tim and Ralli, Alexis and Love, Peter J. and Succi, Sauro and Coveney, Peter V. , journal=. Accurately Simulating the Time Evolution of an. 2025 , doi=. 2408.07439 , archivePrefix=

    2025 arXiv

  51. [60]

    Nature Communications , volume=

    Empowering High-Dimensional Optical Fiber Communications with Integrated Photonic Processors , author=. Nature Communications , volume=. 2024 , doi=

    2024

  52. [61]

    Physical Review Letters , volume=

    Learning a Local Hamiltonian from Local Measurements , author=. Physical Review Letters , volume=. 2019 , doi=. 1807.04564 , archivePrefix=

    2019 arXiv

  53. [62]

    Physical Review Letters , volume=

    Theory of Quantum Error Correction for General Noise , author=. Physical Review Letters , volume=. 2000 , doi=. quant-ph/9908066 , archivePrefix=

    2000 arXiv

  54. [63]

    Horn and Charles R

    Roger A. Horn and Charles R. Johnson , title =. 2012 , doi =

    2012

  55. [64]

    Physical Review A , volume =

    Topological Obstructions to Quantum Computation with Unitary Oracles , author =. Physical Review A , volume =. 2024 , doi =

    2024

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.