pith. machine review for the scientific record.
sign in

arxiv: 2509.03952 · v2 · submitted 2025-09-04 · 🪐 quant-ph

Quantum-inspired dynamical models on quantum and classical annealers

Pith reviewed 2026-05-18 19:28 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum dynamicsQUBOquantum annealingnon-Hermitian Hamiltoniansparallel-in-time encodingbenchmarkingD-Wave
0
0 comments X

The pith

Converting quantum dynamics to QUBO instances enables solver-agnostic benchmarking of quantum annealers and classical optimizers.

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

This paper shows how to turn the real-time propagator of an n-qubit system into quadratic unconstrained binary optimization problems that run identically on quantum annealers or classical solvers. A parallel-in-time encoding discretizes the continuous evolution so the same instance works across different hardware types. The method handles both ordinary Hermitian Hamiltonians and non-Hermitian ones, covering single-qubit rotations, entangling gates such as Bell and GHZ states, and PT-symmetric dynamics. Benchmarks measure success probability and time-to-solution on two D-Wave devices, Simulated Annealing, and GPU-accelerated VeloxQ, with results for systems up to roughly 100000 variables. The framework supplies a common, physics-based testbed for tracking how well any solver reproduces quantum time evolution.

Core claim

The real-time propagator of an n-qubit, possibly non-Hermitian, Hamiltonian is converted into QUBO instances via parallel-in-time encoding; these instances run on quantum annealers and classical optimizers alike and furnish a benchmarking suite evaluated on eight dynamical models using success probability and time-to-solution metrics.

What carries the argument

Parallel-in-time encoding that converts the continuous-time propagator into a finite QUBO instance.

If this is right

  • Success probability on the annealer directly indicates how well the dynamical simulation matches the target quantum evolution.
  • The same QUBO instance supports head-to-head performance comparisons between quantum annealers and classical heuristics.
  • The eight chosen models (rotations, Bell, GHZ, cluster states, PT-symmetric generators) form a representative stress test for any solver.
  • Large-scale instances near 10^5 variables supply a demanding classical baseline for future hardware.

Where Pith is reading between the lines

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

  • The same encoding could benchmark quantum advantage claims specifically for real-time open-system dynamics.
  • Hardware progress on annealers can be tracked quantitatively by measuring improvement on this fixed set of dynamical QUBO tasks.
  • Analogous mappings might apply to other time-dependent quantum problems that lack closed-form solutions.

Load-bearing premise

The parallel-in-time discretization preserves the essential features of the continuous-time quantum evolution inside the resulting QUBO instance.

What would settle it

For small n, solve the generated QUBO exactly and check whether the sampled bit strings reproduce the probability distribution obtained by direct matrix exponentiation of the original Hamiltonian.

Figures

Figures reproduced from arXiv: 2509.03952 by Bart{\l}omiej Gardas, Jakub Paw{\l}owski, Philipp Hanussek, Zakaria Mzaouali.

Figure 1
Figure 1. Figure 1: FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: (a) Time-dependent energy scales executed by the D-Wave quantum annealer. The coefficient [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3 [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: Scaling properties of TTS [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
read the original abstract

We propose a practical, physics-inspired benchmarking suite to challenge both quantum and classical computers by mapping real-time quantum dynamics to a common optimization format. Using a parallel-in-time encoding, we convert the real-time propagator of an $n$-qubit, possibly non-Hermitian, Hamiltonian into quadratic unconstrained binary optimization (QUBO) instances that are executable in a solver-agnostic manner on quantum annealers and classical optimizers alike. This enables direct, like-for-like performance comparisons across fundamentally different computational paradigms.To stress-test the framework, we consider eight representative dynamical models spanning single-qubit rotations, multi-qubit entangling gates (Bell, GHZ, cluster), and PT-symmetric and other non-Hermitian generators, and evaluate success probability and time-to-solution as standard benchmarking metrics. Applying this methodology to two generations of D-Wave quantum annealers and to state-of-the-art classical solvers (Simulated Annealing and the GPU-accelerated VeloxQ), we find that Advantage2 consistently outperforms its predecessor, while VeloxQ retains the shortest absolute runtimes, reflecting the maturity of classical heuristics.We further extend the benchmarks to large-scale instances ($N \simeq 10^{5}$), establishing a demanding classical baseline for future hardware. Together, these results position the parallel-in-time QUBO framework as a versatile and physically motivated testbed for quantitatively tracking progress toward quantum-competitive simulation of dynamical systems.

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

2 major / 3 minor

Summary. The paper proposes a parallel-in-time encoding to convert the real-time propagator of an n-qubit (possibly non-Hermitian) Hamiltonian into QUBO instances solvable on quantum annealers and classical optimizers. It benchmarks success probability and time-to-solution across eight dynamical models (single-qubit rotations, Bell/GHZ/cluster states, PT-symmetric and other non-Hermitian generators) on D-Wave Advantage2 and predecessor annealers, Simulated Annealing, and GPU-accelerated VeloxQ, while scaling to N ≃ 10^5 instances to establish classical baselines.

Significance. If the encoding faithfully reproduces quantum trajectories, the framework supplies a solver-agnostic, physics-motivated benchmark suite for tracking progress on dynamical simulation across quantum and classical hardware. The inclusion of non-Hermitian and PT-symmetric models and the large-scale classical reference points are useful strengths.

major comments (2)
  1. [Section 2] Section 2 (parallel-in-time encoding): the central claim that minimizing the QUBO yields configurations whose extracted states match the action of the real-time propagator U(t) requires explicit verification. No derivation of the quadratic penalties for non-Hermitian generators is supplied, nor is there a reported convergence test of extracted fidelity versus number of time slices or direct comparison to exact matrix exponentiation. Without these, success probability on the annealer does not demonstrably track dynamical fidelity.
  2. [Results section] Results section (eight-model benchmarks): success probabilities are reported without error bars or statistical analysis, and the post-hoc selection of models weakens the cross-solver comparative claims. For the PT-symmetric cases in particular, it remains unclear whether low-energy QUBO solutions correspond to physically correct norm-controlled trajectories.
minor comments (3)
  1. Clarify the precise number of qubits, time slices, and any discretization parameters used for each of the eight models; these details are needed to reproduce the QUBO instances.
  2. The large-scale (N ≃ 10^5) instances should specify the exact Hamiltonian sizes and how the parallel-in-time variables scale with system size.
  3. Figure captions would benefit from explicit statements of what quantity is plotted on each axis and whether the plotted success probabilities are averaged over multiple runs.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading and constructive comments on our manuscript. We address each major comment below and have revised the manuscript to incorporate the suggested clarifications and additions.

read point-by-point responses
  1. Referee: [Section 2] Section 2 (parallel-in-time encoding): the central claim that minimizing the QUBO yields configurations whose extracted states match the action of the real-time propagator U(t) requires explicit verification. No derivation of the quadratic penalties for non-Hermitian generators is supplied, nor is there a reported convergence test of extracted fidelity versus number of time slices or direct comparison to exact matrix exponentiation. Without these, success probability on the annealer does not demonstrably track dynamical fidelity.

    Authors: We agree that explicit verification strengthens the central claim. In the revised manuscript we will add a self-contained derivation in Section 2 of the quadratic penalty terms for non-Hermitian generators, obtained by expanding the squared residual ||U(t) |psi> - |psi(t+Delta t)>||^2 and retaining only the quadratic binary terms after the standard spin-to-binary mapping. We will also include a new figure showing extracted fidelity versus number of time slices for representative models (single-qubit rotation and a PT-symmetric case) together with a direct numerical comparison of the lowest-energy QUBO solutions against exact matrix exponentiation for small n. These additions will demonstrate that the reported success probabilities correlate with dynamical fidelity. revision: yes

  2. Referee: [Results section] Results section (eight-model benchmarks): success probabilities are reported without error bars or statistical analysis, and the post-hoc selection of models weakens the cross-solver comparative claims. For the PT-symmetric cases in particular, it remains unclear whether low-energy QUBO solutions correspond to physically correct norm-controlled trajectories.

    Authors: We accept that error bars and statistical analysis are needed. The revised Results section will report success probabilities with standard deviations obtained from 100 independent runs per instance and will include a brief statistical comparison (e.g., Wilcoxon rank-sum tests) between solvers. We will also clarify the model-selection rationale in the text, noting that the eight models were chosen a priori to cover Hermitian, entangling, and non-Hermitian dynamics rather than selected after inspection of results. For the PT-symmetric cases we will add a short subsection and an accompanying panel showing that the extracted trajectories preserve the expected norm evolution (growth or decay) by direct comparison with exact non-unitary propagation, confirming that low-energy QUBO solutions correspond to physically correct norm-controlled states. revision: yes

Circularity Check

0 steps flagged

No significant circularity; mapping and benchmarks are self-contained

full rationale

The paper presents a direct encoding of the real-time propagator into a QUBO cost function via parallel-in-time discretization, with success probability and time-to-solution measured against independent external solvers (D-Wave Advantage2, Simulated Annealing, VeloxQ) on eight distinct dynamical models. No step reduces a reported performance metric to a fitted parameter chosen from the same data, nor does any central claim rest on a self-citation chain whose validity is presupposed by the present work. The derivation chain consists of an explicit construction (binary variables per time slice, quadratic penalties for discrete Schrödinger steps) whose outputs are evaluated externally rather than by construction. This satisfies the criteria for a self-contained, non-circular framework.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the assumption that a discrete QUBO instance can faithfully represent continuous-time quantum evolution; no new physical entities are postulated.

axioms (1)
  • domain assumption The real-time propagator of an n-qubit Hamiltonian can be discretized into a quadratic binary optimization problem without loss of essential dynamical information.
    Invoked when the abstract states that the propagator is converted into QUBO instances.

pith-pipeline@v0.9.0 · 5796 in / 1373 out tokens · 35634 ms · 2026-05-18T19:28:05.531678+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

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

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

Reference graph

Works this paper leans on

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

  1. [1]

    Lanyon, C

    B. Lanyon, C. Hempel, D. Nigg, M. Müller, R. Gerritsma, F. Zähringer, P. Schindler, J. Barreiro, M. Rambach, G. Kirch- mair, M. Hennrich, P. Zoller, R. Blatt, and C. Roos, Science 334, 57 (2011)

  2. [2]

    Bernien, S

    H. Bernien, S. Schwartz, A. Keesling, H. Levine, A. Om- ran, H. Pichler, S. Choi, A. Zibrov, M. Endres, M. Greiner, V . Vuleti´c, and M. Lukin, Nature 551, 579 (2017)

  3. [3]

    Andersen, N

    T. Andersen, N. Astrakhantsev, A. Karamlou,et al., Nature 638, 79 (2025)

  4. [4]

    Aspuru-Guzik, A

    A. Aspuru-Guzik, A. Dutoi, P. Love, and M. Head-Gordon, Sci- ence 309, 1704 (2005)

  5. [5]

    Peruzzo, J

    A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. Love, A. Aspuru-Guzik, and J. O’Brien, Nature Communica- tions 5, 4213 (2014)

  6. [6]

    Georges, M

    T. Georges, M. Bothe, C. Sünderhauf, B. Berntson, R. Izsák, and A. Ivanov, npj Quantum Information 11, 55 (2025)

  7. [7]

    Euchner and I

    S. Euchner and I. Lesanovsky, arXiv preprint arXiv:2506.09865 (2025), accessed 23July2025

  8. [8]

    R. P. Feynman, International Journal of Theoretical Physics 21, 467 (1982)

  9. [9]

    Lloyd, Science 273, 1073 (1996)

    S. Lloyd, Science 273, 1073 (1996)

  10. [10]

    A framework for quantum advantage,

    O. Lanes, M. Beji, A. D. Corcoles, C. Dalyac, J. M. Gam- betta, L. Henriet, A. Javadi-Abhari, A. Kandala, A. Mezza- capo, C. Porter, S. Sheldon, J. Watrous, C. Zoufal, A. Dauphin, and B. Peropadre, A framework for quantum advantage (2025), arXiv:2506.20658 [quant-ph]

  11. [11]

    A. D. King, U. Bernardi, J. Deng, et al., Science 10.1126/sci- ence.ado6285 (2025)

  12. [12]

    Munoz-Bauza and D

    H. Munoz-Bauza and D. Lidar, Phys. Rev. Lett. 134, 160601 (2025)

  13. [13]

    Tindall, A

    J. Tindall, A. Mello, M. Fishman, M. Stoudenmire, and D. Sels, Dynamics of disordered quantum systems with two- and three- dimensional tensor networks (2025), arXiv:2503.05693 [quant- ph]

  14. [14]

    Mauron and G

    L. Mauron and G. Carleo, Challenging the quantum advantage frontier with large-scale classical simulations of annealing dy- namics (2025), arXiv:2503.08247 [quant-ph]

  15. [15]

    Pawlowski, P

    J. Pawlowski, P. Tarasiuk, J. Tuziemski, L. Pawela, and B. Gar- das, Closing the quantum-classical scaling gap in approximate optimization (2025), arXiv:2505.22514 [quant-ph]

  16. [16]

    VeloxQ: A Fast and Efficient QUBO Solver

    J. Pawłowski, J. Tuziemski, P. Tarasiuk, A. Przybysz, R. Adamski, K. Hendzel, Ł. Pawela, and B. Gardas, Veloxq: A fast and efficient qubo solver (2025), arXiv:2501.19221 [quant- ph]

  17. [17]

    Arute, K

    F. Arute, K. Arya, R. Babbush, et al., Nature 574, 505 (2019)

  18. [18]

    Wu, W.-S

    Y . Wu, W.-S. Bao, S. Cao,et al., Physical Review Letters 127, 180501 (2021)

  19. [19]

    Y . Kim, K. Temme, S. Bravyi,et al., Nature 618, 500 (2023)

  20. [20]

    Zhong, H

    H.-S. Zhong, H. Wang, Y .-H. Deng, et al., Science 370, 1460 (2020)

  21. [21]

    L. S. Madsen, F. Laudenbach, M. FalamarziAskarani, et al. , Nature 606, 75 (2022)

  22. [22]

    Hangleiter and J

    D. Hangleiter and J. Eisert, arXiv preprint arXiv:2206.04079 (2022)

  23. [23]

    Michielsen, M

    K. Michielsen, M. Nocon, D. Willsch, F. Jin, T. Lippert, and H. De Raedt, Computer Physics Communications 220, 44 (2017)

  24. [24]

    Fauseweh, Nature Communications 15, 2123 (2024)

    B. Fauseweh, Nature Communications 15, 2123 (2024)

  25. [25]

    I. M. Georgescu, S. Ashhab, and F. Nori, Rev. Mod. Phys. 86, 153 (2014). 9

  26. [26]

    Mehta, H

    V . Mehta, H. D. Raedt, K. Michielsen, and F. Jin, Understand- ing the physics of d-wave annealers: From schrödinger to lind- blad to markovian dynamics (2025), arXiv:2503.21565 [quant- ph]

  27. [27]

    Born and V

    M. Born and V . Fock, Zeitschrift für Physik51, 165 (1928)

  28. [28]

    A. D. King, J. Raymond, T. Lanting, et al. , Nature 617, 61 (2023)

  29. [29]

    Teplukhin, B

    A. Teplukhin, B. K. Kendrick, S. M. Mniszewski, et al., Scien- tific Reports 11, 18796 (2021)

  30. [30]

    Neukart, G

    F. Neukart, G. Compostella, C. Seidel, D. von Dollen, S. Yarkoni, and B. Parney, Frontiers in ICT4, 29 (2017)

  31. [31]

    Koniorczyk, K

    M. Koniorczyk, K. Krawiec, L. Botelho, N. Bešinovi ´c, and K. Domino, Journal of Rail Transport Planning & Management 34, 100521 (2025)

  32. [32]

    Domino, E

    K. Domino, E. Doucet, R. Robertson, B. Gardas, and S. Deffner, On the baltimore light raillink into the quantum fu- ture (2024), arXiv:2406.11268 [quant-ph]

  33. [33]

    ´Smierzchalski, J

    T. ´Smierzchalski, J. Pawłowski, A. Przybysz, Ł. Pawela, Z. Puchała, M. Koniorczyk, B. Gardas, S. Deffner, and K. Domino, Scientific Reports 14, 21809 (2024)

  34. [34]

    Domino, M

    K. Domino, M. Koniorczyk, K. Krawiec, K. Jałowiecki, S. Deffner, and B. Gardas, Entropy 25, 10.3390/e25020191 (2023)

  35. [35]

    Robertson, E

    R. Robertson, E. Doucet, Z. Mzaouali, K. Domino, B. Gardas, and S. Deffner, Simon’s period finding on a quantum annealer (2025), arXiv:2504.10771 [quant-ph]

  36. [36]

    Buffoni and M

    L. Buffoni and M. Campisi, Quantum Science and Technology 5, 035013 (2020)

  37. [37]

    Campisi and L

    M. Campisi and L. Buffoni, Phys. Rev. E 104, L022102 (2021)

  38. [38]

    ´Smierzchalski, Z

    T. ´Smierzchalski, Z. Mzaouali, S. Deffner, and B. Gardas, Sci- entific Reports 14, 4555 (2024)

  39. [39]

    M. S. Könz, W. Lechner, H. G. Katzgraber, and M. Troyer, PRX Quantum 2, 040322 (2021)

  40. [40]

    Mehta, H

    V . Mehta, H. De Raedt, K. Michielsen, and F. Jin, Phys. Rev. A 112, 012414 (2025)

  41. [41]

    Mehta, H

    V . Mehta, H. De Raedt, K. Michielsen, and F. Jin, Phys. Rev. A 112, 012405 (2025)

  42. [42]

    V odeb, V

    J. V odeb, V . Eržen, T. Hrga, and J. Povh, Accuracy and perfor- mance evaluation of quantum, classical and hybrid solvers for the max-cut problem (2024), arXiv:2412.07460 [math.OC]

  43. [43]

    Ising formulations of many np problems

    A. Lucas, Frontiers in Physics 2, 10.3389/fphy.2014.00005 (2014)

  44. [44]

    Jałowiecki, A

    K. Jałowiecki, A. Wi˛ eckowski, P. Gawron, and B. Gardas, Sci- entific Reports 10, 13534 (2020)

  45. [45]

    Gardas, S

    B. Gardas, S. Deffner, and A. Saxena, Phys. Rev. A 94, 040101 (2016)

  46. [46]

    QuTiP 5: The Quantum Toolbox in Python

    N. Lambert, E. Giguère, P. Menczel, B. Li, P. Hopf, G. Suárez, M. Gali, J. Lishman, R. Gadhvi, R. Agarwal, A. Galicia, N. Shammah, P. Nation, J. R. Johansson, S. Ahmed, S. Cross, A. Pitchford, and F. Nori, Qutip 5: The quantum toolbox in python (2024), arXiv:2412.04705 [quant-ph]

  47. [47]

    Johansson, P

    J. Johansson, P. Nation, and F. Nori, Computer Physics Com- munications 184, 1234 (2013)

  48. [48]

    Johansson, P

    J. Johansson, P. Nation, and F. Nori, Computer Physics Com- munications 183, 1760 (2012)

  49. [49]

    B. Li, S. Ahmed, S. Saraogi, N. Lambert, F. Nori, A. Pitchford, and N. Shammah, Quantum 6, 630 (2022)

  50. [50]

    Lambert, T

    N. Lambert, T. Raheja, S. Cross, P. Menczel, S. Ahmed, A. Pitchford, D. Burgarth, and F. Nori, Phys. Rev. Res. 5, 013181 (2023)

  51. [51]

    Croke, Phys

    S. Croke, Phys. Rev. A 91, 052113 (2015)

  52. [52]

    Pelofske, Quantum Science and Technology 10, 025025 (2025)

    E. Pelofske, Quantum Science and Technology 10, 025025 (2025)

  53. [53]

    Mehta, F

    V . Mehta, F. Jin, H. De Raedt, and K. Michielsen, Physical Re- view A 105, 10.1103/physreva.105.062406 (2022)

  54. [54]

    Zhang and A

    H. Zhang and A. Kamenev, Phys. Rev. Res. 7, 033098 (2025)

  55. [55]

    Montanaro, Phys

    A. Montanaro, Phys. Rev. Res. 2, 013056 (2020)

  56. [56]

    Solving quantum-inspired dynamics on quantum and classical computers

    P. Hanussek, J. Pawłowski, Z. Mzaouali, and B. Gardas, Solving quantum-inspired dynamics on quantum and clas- sical computers, https://github.com/atg205/ dynamics-benchmark (2025), accompanying code for the paper "Solving quantum-inspired dynamics on quantum and classical computers". S1 Supplemental Material: Solving quantum-inspired dynamics on quantum a...