Pith. sign in

REVIEW 3 major objections 5 minor 30 references

Depth-Efficient Quantum Topological Data Analysis for Regime-Specific Detection of Financial Stress

T0 review · 3 major / 5 minor · reviewed 2026-07-14 · grok-4.5

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

Pith's one-line read Pauli Correlation Encoding can represent null spaces of real-market combinatorial Laplacians on shallow ancilla-free circuits, recovering Betti numbers exactly once the optimizer is warm-started.

desk verdict First continuous-PCE adaptation for Betti counting is real and carefully scoped; the warm-start experiment only partially isolates encoding from landscape, and independent quantum recovery at market scale remains open. read the letter →

arxiv 2607.09906 v1 pith:AKB7M437 submitted 2026-07-10 quant-ph cs.LGq-fin.ST

Arul Rhik Mazumder , Shreyan Ronit Mazumder This is my paper · ORCID
classification quant-phcs.LGq-fin.ST
keywords quantumtopologicaldataanalysisBettinumbersPaulicorrelationencodingvariationaleigensolverfinancialcrashdetectioncombinatorialLaplacianTakensembeddingbarrenplateaus
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

This paper adapts Pauli Correlation Encoding to quantum topological data analysis so that Betti numbers of market point clouds can be estimated with shallow, ancilla-free variational circuits on a compressed qubit register. From Takens embeddings of S&P 500 returns the authors build combinatorial Laplacians and recast null-space counting as a continuous Rayleigh-quotient minimization with variational deflation, encoding each simplex index into a Pauli correlator rather than a binary variable. On real market Laplacians with first Betti numbers from 1 to 22, a random-start optimizer finds no null vector, but warm-starting from a classical null-space surrogate drives the loss to machine zero and recovers every Betti number exactly, isolating the obstacle as the hardware-efficient ansatz landscape rather than the encoding. Gradient variance of the rational loss decays only polynomially over 4–12 qubits, and the classical stage matches the standard ripser library on all 190 sliding windows. The resulting first Betti number predicts GFC-style stress with in-regime ROC AUC 0.818, yet fails to generalize to the 2020 COVID and 2022 rate-cycle regimes. A sympathetic reader cares because the work shows that the depth bottleneck of quantum TDA can be traded for a modest qubit overhead and that the encoding itself is not the barrier at market scale.

What carries the argument

Continuous-PCE Rayleigh quotient with variational deflation: each of the n_k simplex indices is encoded as a continuous Pauli correlator c_i = ⟨Π_i⟩ ∈ [−1,+1] on O(n_k^{1/κ}) qubits; the loss is the Rayleigh quotient of the combinatorial Laplacian over the resulting correlator vector, with successive deflation penalties that force orthogonality to already-found null vectors.

What would settle it

Run the continuous-PCE circuit from a purely quantum initialisation (no classical null-space guidance) on the same real-market Laplacians (β1 up to 22) and check whether the Rayleigh quotient still reaches machine zero and recovers the correct multiplicity.

Watch

Extended reading notes

Core claim

Continuous Pauli Correlation Encoding places the null vectors of real-market combinatorial Laplacians (β1 = 1–22) inside the reachable set of a shallow ancilla-free circuit on O(n_k^{1/κ}) qubits; with classical null-space warm-start the Rayleigh-quotient loss reaches ~10^{-13} and recovers every tested Betti number exactly, so the obstacle is the optimisation landscape of the hardware-efficient ansatz rather than the encoding.

Load-bearing premise

A quantum-native route to a good basin (problem-informed or adaptive ansatz) can replace the classical null-space surrogate used for warm-start; without it the pipeline remains a hybrid and does not give independent quantum Betti estimation at real-data scale.

Editorial extensions

If this is right

  • Near-term quantum TDA can trade logarithmic qubit count for shallower, ancilla-free circuits while still representing the null spaces of market-scale Laplacians.
  • Once a quantum-native warm start exists, absolute Betti numbers become recoverable on NISQ hardware without quantum phase estimation.
  • The first Betti number of a Takens–Vietoris–Rips pipeline carries regime-specific structural information about correlated-stress build-up but is not a universal crash classifier.
  • Resource extrapolations place a classical–quantum cost crossover near Laplacian dimension 10^4, a concrete target for multi-asset or tick-level embeddings.

Reading between the lines

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

  • The same continuous-PCE Rayleigh construction could be applied to other spectral counting tasks (algebraic connectivity, Fiedler multiplicity, kernel dimension of graph Laplacians) where only the nullity, not the full spectrum, is required.
  • The OOD failure suggests that topological early-warning signals may need regime-conditional calibration rather than a single fixed threshold, a design pattern transferable to non-financial time series.
  • Subspace-search variants that recover several null vectors in one optimisation would remove the linear dependence on β_k that currently limits the method in the high-multiplicity regime that motivates quantum TDA.
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

3 major / 5 minor

Summary. The paper adapts Pauli Correlation Encoding (PCE) to quantum topological data analysis by reformulating Betti-number estimation as continuous-PCE Rayleigh-quotient minimization with variational deflation. From Takens embeddings of S&P 500 returns and Vietoris–Rips filtrations it builds combinatorial Laplacians Δ_k and encodes n_k simplex indices into O(n_k^{1/κ}) qubits via κ-local Pauli correlators, using shallow ancilla-free HEA circuits. The classical stage matches ripser on all 190 windows (2007–2009). On real-market Laplacians (β_1 = 1–22) random-start PCE-VQE recovers no null vector, but classical-null-space warm-start recovers β_1 exactly (loss ~10^{-13}), isolating the obstacle as the HEA landscape rather than encoding expressivity. Gradient variance of the rational loss decays only polynomially over n = 4–12. Chronologically split classification yields in-regime ROC AUC 0.818 but fails OOD on 2020 COVID and 2022 rate-cycle episodes.

Significance. If the continuous-PCE encoding and landscape diagnosis hold, the work supplies a concrete near-term blueprint that trades the logarithmic qubit count of LGZ-style QPE for shallower, ancilla-free circuits—an attractive trade-off while depth remains the binding hardware constraint. Strengths include full classical validation against ripser (190/190), public code and data, explicit Scope and limitation statements that refuse over-claim, and an honest OOD generalization failure treated as a primary finding rather than a footnote. The principal open question (quantum-native warm-start) is correctly identified; the contribution is therefore methodological rather than a demonstrated quantum advantage at real-data scale.

major comments (3)
  1. Sec. VII-C / Table II: the warm-start protocol first constructs a classical null basis N of Δ_1, forms the surrogate B = I − NN⊤ (gap 1), optimizes the PCE Rayleigh quotient of B with exact adjoint gradients and L-BFGS (often depth 6n and an extra qubit), then polishes on true Δ_1. Success therefore shows that some PCE correlator vector can be driven into ker(Δ_1) once the optimizer is placed in a good basin; it does not certify that the reachable set of the shallow HEA under the true rational loss (Eq. 8) contains a spanning set of the null space without classical guidance. The fully-expressive-state overlap check is stronger but still classical and does not underwrite the variational resource claims. The isolation of “encoding vs landscape” is therefore only partial for an independent quantum pipeline; the manuscript should either (i) supply a quantum-native basin-finding experiment or
  2. Sec. IV-D / Eq. (9)–(10): variational deflation recovers one null vector per sequential optimization, so total circuit budget scales linearly with β_k. The paper correctly flags this as a weakness in the high-β_k regime that motivates quantum TDA, yet the real-data experiments stop at β_1 = 22 and the resource model (Sec. VII-I) does not quantify the linear factor. Subspace-search alternatives (SSVQE, weighted subspace search) are mentioned only as future work; without them the claimed depth advantage is eroded precisely when Betti numbers become large.
  3. Sec. VII-F / Fig. 4: the noise-robustness comparison is not at matched encoded problem size (PCE at fixed n = 6 encoding n_k ≈ 63; LGZ at n_k = 16). The manuscript already notes this caveat, but the abstract and resource narrative still present PCE as substantially more noise-tolerant. Either a matched-encoding noise study or a clearer demotion of the figure to an illustrative depth/noise trade-off is needed before the noise claim can support the near-term hardware argument.
minor comments (5)
  1. Abstract and Scope: the phrase “placing the obstacle in the optimisation landscape rather than the encoding” should be softened to match the hybrid character of the warm-start experiment.
  2. Sec. II-D / enumeration of Π^(κ): the deterministic enumeration is reproducible but topology-agnostic; a short remark on whether Laplacian-aware Pauli assignment could reduce G or improve expressivity would help readers.
  3. Table III: the LGZ depth column uses a generic O(N_P · r · 2^p) placeholder; a concrete numerical estimate under the same precision assumptions used for PCE would make the comparison sharper.
  4. Sec. VII-H: the bootstrap CI and permutation p-value for the in-regime AUC are welcome; adding the same diagnostics for the OOD episodes would strengthen the generalization-failure claim.
  5. Notation: c_i(θ) is used both for continuous correlators and (implicitly) for classical coefficients; a brief clarifying sentence near Eq. (7) would avoid confusion.

Circularity Check

0 steps flagged · score 1.0 of 10

No load-bearing circularity; classical ground truth and hybrid warm-start are external/diagnostic, not self-derived predictions.

full rationale

The paper's derivation chain is self-contained against external classical benchmarks and does not reduce its central claims to fitted inputs or self-citations by construction. Betti numbers for the 190 windows are obtained by dense eigensolver nullity (Eq. 11) and verified 100% against the independent library ripser (Table I, Sec. V-C); the quantum stage is never used as ground truth for itself. Continuous-PCE Rayleigh-quotient minimization (Eq. 8) plus variational deflation (Eq. 9) is a standard reformulation of null-space counting; success on toy Laplacians (Sec. VII-B) and the fully-expressive-state overlap check are independent of the later warm-start. The real-window experiment (Sec. VII-C, Table II) injects a classical null-space surrogate B = I - NN⊤ only as a diagnostic warm-start, explicitly labels the result a classical-quantum hybrid, reports random-start failure, and does not claim independent quantum recovery of β1; the Scope paragraph and Sec. IX restate this limitation. Classification thresholds are chosen solely on the chronological 2003–2006 train split and frozen for held-out and OOD evaluation (Tables IV–V); the OOD collapse (AUC 0.009/0.515) further shows the signal is not forced. Gradient-variance scaling is empirical and the paper states the Sciorilli bilinear bound does not transfer (Sec. IV-D). No self-definitional equations, no uniqueness theorems imported from the authors, and no renaming of known results appear. The single minor self-referential element is ordinary methodological citation of PCE literature; it is not load-bearing for any claimed prediction. Score 1 reflects only the diagnostic use of classical information, which the paper itself flags rather than conceals.

Assumptions & free parameters 5 free parameters · 4 assumptions · 1 invented entities

The central methodological claim rests on standard Hodge theory, Takens embedding, and the PCE correlator construction, plus a handful of hand-chosen thresholds and the unproved hope that a quantum-native warm-start exists. No new physical entities are postulated; the free parameters are ordinary algorithmic knobs.

free parameters (5)
  • working filtration scale ε* = 0.32
    Chosen by maximizing median β1 across windows with stability tie-break; fixed at 0.32 for 2007–2010 data and used for all subsequent CE and quantum experiments.
  • null-space threshold δ = 0.01
    Default 0.01 (or 10^{-2}) decides when a Rayleigh quotient counts as a null vector; directly controls reported β̃k.
  • deflation penalty strength μ = 5.0
    Default 5.0; controls orthogonality enforcement in successive searches.
  • Takens delay τ and embedding dimension m = τ=13, m=4
    Selected via mutual-information minimum and FNN <5 %; fixed at τ=13, m=4 for the entire pipeline.
  • HEA depth L and optimizer iteration budget = L≈2n–6n, ~200 iters
    L=⌈2n⌉ (or 6n for warm-start polish); COBYLA/L-BFGS budgets chosen by hand and affect whether random-start or warm-start succeeds.
assumptions (4)
  • standard math Hodge theorem: βk = dim ker(Δk)
    Used throughout to equate Betti numbers with Laplacian nullity (Eq. 2).
  • domain assumption Takens embedding with m≥2d+1 (or practical FNN) preserves attractor topology
    Justifies the R^4 point cloud from scalar S&P returns (Sec. IV-A).
  • ad hoc to paper PCE κ-local Pauli correlators can parameterize vectors that intersect ker(Δk)
    Expressivity is verified empirically for the tested windows but not proved for general Laplacians (Sec. VIII).
  • ad hoc to paper A quantum-native warm-start or better ansatz can replace classical null-space guidance
    Stated as the principal open question; without it the pipeline is hybrid (Sec. IX).
invented entities (1)
  • continuous-PCE Rayleigh-quotient loss with variational deflation
    purpose: Convert binary PCE optimization into a continuous null-space counting procedure for Betti numbers.
    The loss is rational rather than bilinear, so prior barren-plateau proofs do not apply; introduced specifically for this spectral task.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Depth-Efficient Quantum Topological Data Analysis for Regime-Specific Detection of Financial Stress." pith.science (2026). https://pith.science/paper/AKB7M437

@misc{pith2026260709906,
  author       = {Pith},
  title        = {Pith review of: Depth-Efficient Quantum Topological Data Analysis for Regime-Specific Detection of Financial Stress},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AKB7M437}},
  note         = {Machine review of arXiv:2607.09906}
}
abstract

We present, to our knowledge, the first adaptation of Pauli Correlation Encoding (PCE) to quantum topological data analysis, reformulating Betti number estimation as a depth-efficient variational optimization over a compressed qubit register. From a Takens embedding and Vietoris--Rips filtration of S&P~500 returns, we extract combinatorial Laplacians and recast null-space counting as a continuous-PCE Rayleigh-quotient minimization with variational deflation, encoding $n_k$ simplex indices into $O(n_k^{1/\kappa})$ qubits with shallow, ancilla-free circuits. Because the resulting loss is rational rather than bilinear in the correlators, the barren-plateau bound of~\cite{Sciorilli25} does not transfer; empirically the gradient variance decays only polynomially, with no exponential barren plateau, over $n=4$--$12$ qubits. The classical stage matches ripser~\cite{bauer2021ripser} on all 190 sliding windows (2007-2009). On the real market Laplacians ($\beta_1=1$--$22$), warm-starting from a classical null-space surrogate allows PCE-VQE to recover $\beta_1$ exactly at every scale, placing the obstacle in the optimisation landscape rather than the encoding. Chronologically split classification gives in-regime ROC AUC $0.818$, but out-of-distribution evaluation on the 2020 COVID shock and 2022 rate cycle (AUC $0.009$, $0.515$) shows the calibration does not generalize across crisis regimes.

Figures

Figures reproduced from arXiv: 2607.09906 by the authors.

Figure 1
Figure 1. Overview of the qTDA pipeline with PCE qubit compression: [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. First Betti number β1 over 190 sliding windows (2003–2010), computed by the classical CE benchmark and verified against ripser. Vertical lines mark Bear Stearns (14 Mar. 2008, dotted) and Lehman Brothers (15 Sep. 2008, dashed). β1 ∈ [0, 22]; mean 4.72 [PITH_FULL_IMAGE:figures/full_fig_p007_2.png] view at source ↗
Figure 3
Figure 3. PCE-VQE convergence on six toy Laplacians (6/6 correct). Each panel [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Noise robustness (illustrative; not a matched-scale comparison): PCE [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]
Figure 5
Figure 5. Figure 5: Gradient-variance scaling of the true PCE Rayleigh-quotient loss [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]
Figure 6
Figure 6. Figure 6: ROC curves for the [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 7 linked inside Pith

  1. [1]

    Towards large-scale quantum optimiza- tion solvers with few qubits,

    M. Sciorilli, L. Borges, T. L. Patti, D. Garc ´ıa-Mart´ın, G. Camilo, A. Anandkumar, and L. Aolita, “Towards large-scale quantum optimiza- tion solvers with few qubits,”Nature Communications, vol. 16, p. 476, 2025, arXiv:2401.09421

    arXiv 2025

  2. [2]

    Ripser: efficient computation of Vietoris–Rips persistence barcodes,

    U. Bauer, “Ripser: efficient computation of Vietoris–Rips persistence barcodes,”Journal of Applied and Computational Topology, vol. 5, pp. 391–423, 2021

    2021

  3. [3]

    Topological data analysis of financial time series: Landscapes of crashes,

    M. Gidea and Y . Katz, “Topological data analysis of financial time series: Landscapes of crashes,”Physica A: Statistical Mechanics and its Applications, vol. 491, pp. 820–834, 2018

    2018

  4. [4]

    Topology and data,

    G. Carlsson, “Topology and data,”Bulletin of the American Mathemat- ical Society, vol. 46, no. 2, pp. 255–308, 2009

    2009

  5. [5]

    Edelsbrunner and J

    H. Edelsbrunner and J. L. Harer,Computational Topology: An Introduc- tion. American Mathematical Society, 2010

    2010

  6. [6]

    A roadmap for the computation of persistent homology,

    N. Otter, M. A. Porter, U. Tillmann, P. Grindrod, and H. A. Harrington, “A roadmap for the computation of persistent homology,”EPJ Data Science, vol. 6, no. 17, 2017

    2017

  7. [7]

    Quantum algorithms for topological and geometric analysis of data,

    S. Lloyd, S. Garnerone, and P. Zanardi, “Quantum algorithms for topological and geometric analysis of data,”Nature Communications, vol. 7, p. 10138, 2016

    2016

  8. [8]

    Quantum topological data analysis with linear depth and exponential speedup,

    S. Ubaru, I. Y . Akhalwaya, M. S. Squillante, K. L. Clarkson, and L. Horesh, “Quantum topological data analysis with linear depth and exponential speedup,”arXiv preprint arXiv:2108.02811, 2021

    arXiv 2021

Show all 30 references
  1. [9]

    A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits,

    S. McArdle, A. Gily ´en, and M. Berta, “A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits,”arXiv preprint arXiv:2209.12887, 2022

    2022 arXiv

  2. [10]

    Towards quantum advantage via topological data analysis,

    C. Gyurik, C. Cade, and V . Dunjko, “Towards quantum advantage via topological data analysis,”Quantum, vol. 6, p. 855, 2022

    2022

  3. [11]

    Quantum algorithm for persistent Betti numbers and topological data analysis,

    R. Hayakawa, “Quantum algorithm for persistent Betti numbers and topological data analysis,”Quantum, vol. 6, p. 873, 2022

    2022

  4. [12]

    Towards quantum ad- vantage on noisy quantum computers,

    I. Y . Akhalwaya, S. Ubaru, K. L. Clarkson, M. S. Squillante, V . Jejjala, Y .-H. He, K. Naidoo, V . Kalantzis, and L. Horesh, “Towards quantum ad- vantage on noisy quantum computers,”arXiv preprint arXiv:2209.09371, 2022

    2022 arXiv

  5. [13]

    Analyzing prospects for quantum advantage in topological data analysis,

    D. W. Berry, Y . Su, C. Gyurik, R. King, J. Basso, A. Del Toro Barba, A. Rajput, N. Wiebe, V . Dunjko, and R. Babbush, “Analyzing prospects for quantum advantage in topological data analysis,”PRX Quantum, vol. 5, p. 010319, 2024

    2024

  6. [14]

    Clique homology is QMA 1-hard,

    M. Crichigno and T. Kohler, “Clique homology is QMA 1-hard,”Nature Communications, vol. 15, p. 9846, 2024

    2024

  7. [15]

    Complexity-theoretic limitations on quantum algorithms for topological data analysis,

    A. Schmidhuber and S. Lloyd, “Complexity-theoretic limitations on quantum algorithms for topological data analysis,”PRX Quantum, vol. 4, p. 040349, 2023

    2023

  8. [16]

    Large-scale portfolio optimization using Pauli Correlation Encoding,

    V . P. Soloviev and M. Krompiec, “Large-scale portfolio optimization using Pauli Correlation Encoding,”arXiv preprint arXiv:2511.21305, 2025

    2025

  9. [17]

    A competitive NISQ and qubit-efficient solver for the LABS problem,

    M. Sciorilli, G. Camilo, T. O. Maciel, A. Canabarro, L. Borges, and L. Aolita, “A competitive NISQ and qubit-efficient solver for the LABS problem,”arXiv preprint arXiv:2506.17391, 2025

    2025

  10. [18]

    Computing persistent homology,

    A. Zomorodian and G. Carlsson, “Computing persistent homology,” Discrete & Computational Geometry, vol. 33, no. 2, pp. 249–274, 2005

    2005

  11. [19]

    Quantum-enhanced topological data analysis: A peep from an implementation perspective,

    A. Khandelwal and M. G. Chandra, “Quantum-enhanced topological data analysis: A peep from an implementation perspective,”arXiv preprint arXiv:2302.09553, 2023

    2023 arXiv

  12. [20]

    Detecting strange attractors in turbulence,

    F. Takens, “Detecting strange attractors in turbulence,” inDynamical Systems and Turbulence, Warwick 1980, ser. Lecture Notes in Mathe- matics. Springer, 1981, vol. 898, pp. 366–381

    1980

  13. [21]

    Kantz and T

    H. Kantz and T. Schreiber,Nonlinear Time Series Analysis, 2nd ed. Cambridge University Press, 2004

    2004

  14. [22]

    Pauli correlation encoding to reduce MaxCut require- ments,

    IBM Quantum, “Pauli correlation encoding to reduce MaxCut require- ments,” 2025

    2025

  15. [23]

    Cost function dependent barren plateaus in shallow parametrized quantum circuits,

    M. Cerezo, A. Sone, T. V olkoff, L. Cincio, and P. J. Coles, “Cost function dependent barren plateaus in shallow parametrized quantum circuits,” Nature Communications, vol. 12, p. 1791, 2021

    2021

  16. [24]

    The topology of data hides in quantum thermal states,

    S. Scali, C. Umeano, and O. Kyriienko, “The topology of data hides in quantum thermal states,”APL Quantum, vol. 1, no. 3, p. 036106, 2024, arXiv:2402.15633

    2024 arXiv

  17. [25]

    Hybrid quantum-classical framework for Betti number estimation with applications to topological data analysis,

    N. A. Nghiem, J. Lee, and T.-C. Wei, “Hybrid quantum-classical framework for Betti number estimation with applications to topological data analysis,”arXiv preprint arXiv:2508.01516, 2025

    2025 arXiv

  18. [26]

    From Betti numbers to persistence diagrams: A hybrid quantum algorithm for topological data analysis,

    D. Liu, “From Betti numbers to persistence diagrams: A hybrid quantum algorithm for topological data analysis,”arXiv preprint arXiv:2512.02081, 2025

    2025

  19. [27]

    Pauli correla- tion encoding for budget-constrained optimization,

    J. Pad ´ın-Mart´ınez, V . P. Soloviev, A. Borrallo-Rentero, A. Rodr ´ıguez- Otero, R. Alfonso-Rodr ´ıguez, and M. Krompiec, “Pauli correla- tion encoding for budget-constrained optimization,”arXiv preprint arXiv:2602.17479, 2026

    2026

  20. [28]

    Determining em- bedding dimension for phase-space reconstruction using a geometrical construction,

    M. B. Kennel, R. Brown, and H. D. I. Abarbanel, “Determining em- bedding dimension for phase-space reconstruction using a geometrical construction,”Physical Review A, vol. 45, no. 6, pp. 3403–3411, 1992

    1992

  21. [29]

    Variational quantum computation of excited states,

    O. Higgott, D. Wang, and S. Brierley, “Variational quantum computation of excited states,”Quantum, vol. 3, p. 156, 2019

    2019

  22. [30]

    Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,

    A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, “Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets,”Nature, vol. 549, pp. 242–246, 2017

    2017

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.