Solving quantum-inspired dynamics on quantum and classical annealers

• URL: http://arxiv.org/abs/2509.03952v1
• Date: Thu, 04 Sep 2025 07:27:11 GMT
• Title: Solving quantum-inspired dynamics on quantum and classical annealers
• Authors: Philipp Hanussek, Jakub Pawłowski, Zakaria Mzaouali, Bartłomiej Gardas,
• Abstract summary: We propose a benchmarking suite inspired by physical dynamics to challenge both quantum and classical computers.<n>We convert the real-time propagator of an $n$-qubit, possibly non-Hermitian, Hamiltonian into a quadratic-unconstrained binary optimisation problem.<n>The resulting QUBO instances are executed on D-Wave quantum annealers as well as using two classical solvers, Simulated Annealing and VeloxQ.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a practical benchmarking suite inspired by physical dynamics to challenge both quantum and classical computers. Using a parallel in time encoding, we convert the real-time propagator of an $n$-qubit, possibly non-Hermitian, Hamiltonian into a quadratic-unconstrained binary optimisation (QUBO) problem. The resulting QUBO instances are executed on D-Wave quantum annealers as well as using two classical solvers, Simulated Annealing and VeloxQ, a state-of-the-art classical heuristic solver. This enables a direct comparison. To stress-test the workflow, we use eight representative models, divided into three groups: (i)~single-qubit rotations, (ii)~multi-qubit entangling gates (Bell, GHZ, cluster), and (iii)~$\text{PT}$-symmetric, parity-conserving and other non-Hermitian generators. Across this diverse suite we track the success probability and time to solution, which are well established measures in the realm of heuristic combinatorial optimisation. Our results show that D-Wave Advantage2 consistently surpasses its predecessor, while VeloxQ presently retains the overall lead, reflecting the maturity of classical optimisers. We highlight the rapid progress of analog quantum optimisation, and suggest a clear trajectory toward quantum competitive dynamics simulation, by establishing the parallel in time QUBO framework as a versatile test-bed for tracking and evaluating that progress.

Related papers

• Quantum Simulation of Coupled Harmonic Oscillators: From Theory to Implementation [0.0]
  We bridge the gap between theory and implementation by developing and comparing three concrete realizations of the algorithm.<n>First, we implement a sparse initial state preparation combined with product-formula ( Suzuki-Trotter) Hamiltonian simulation.<n>Second, we implement a fully quantum, oracle-based framework in which classical data are accessed via oracles.<n>Third, we propose an efficient alternative that combines the sparse state-preparation routine of the first approach with the oracle and block-encoding-based simulation pipeline of the second.
  arXiv  Detail & Related papers  (2026-03-05T18:49:13Z)
• Hybrid Sequential Quantum Computing [33.72751145910978]
  We introduce hybrid sequential quantum computing (HSQC)<n>HSQC systematically integrates classical and quantum methods within a structured, stage-wise workflow.<n>Compared to standalone classical solvers, HSQC achieves a speedup of up to 700 times over SA and up to 9 times over runtime.
  arXiv  Detail & Related papers  (2025-10-07T12:15:43Z)
• A Novel Solver for QUBO Problems: Performance Analysis and Comparative Study with State-of-the-Art Algorithms [18.408755407920744]
  We introduce a quantum-inspired solver (QIS) that unites branch-and-bound pruning, continuous gradient-descent refinement, and quantum-inspired strategies.<n>We benchmark QIS3 against eight state-of-the-art solvers, including genetic algorithms, coherent Ising machines, simulated bifurcation.<n>Under a uniform runtime budget, QIS3 attains the best solution on nearly all instances, achieving optimality in 94% of max-cut instances.
  arXiv  Detail & Related papers  (2025-06-05T03:22:48Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Exponential quantum speedup in simulating coupled classical oscillators [1.9398245011675082]
  We present a quantum algorithm for the classical dynamics of $2n$ coupled oscillators. Our approach leverages a mapping between the Schr"odinger equation and Newton's equation for harmonic potentials. We show that our approach solves a potentially practical application with an exponential speedup over classical computers.
  arXiv  Detail & Related papers  (2023-03-23T03:24:03Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Accelerating variational quantum algorithms with multiple quantum processors [78.36566711543476]
  Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages. Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
  arXiv  Detail & Related papers  (2021-06-24T08:18:42Z)
• High-performance parallel classical scheme for simulating shallow quantum circuits [4.963372236375303]
  We propose a high-performance two-stage classical scheme to solve a full-sampling variant of the 2D HLF problem. We show our scheme is a practically scalable, high-efficient and operationally convenient tool for simulating and verifying graph-state circuits performed by current quantum hardware.
  arXiv  Detail & Related papers  (2021-03-01T02:05:17Z)
• Experimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum Gates with Two Dark Paths in a Trapped Ion [41.36300605844117]
  We show nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $171mathrmYb+$ ion based on four-level systems with resonant drives. We find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies.
  arXiv  Detail & Related papers  (2021-01-19T06:57:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.