Continuous-time evolution via probabilistic angle interpolation and its applications

• URL: http://arxiv.org/abs/2604.02854v1
• Date: Fri, 03 Apr 2026 08:15:13 GMT
• Title: Continuous-time evolution via probabilistic angle interpolation and its applications
• Abstract summary: We explore the applicability of a time-evolution algorithm based on probabilistic angle.<n>We take the continuous-time limit and explicitly eliminate Trotter errors.<n>We evaluate the protocol's performance through numerical simulations and experiments on a trapped-ion quantum computer.
• Score: 1.4323566945483497
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We explore the applicability of a stochastic time-evolution algorithm based on probabilistic angle interpolation. To simplify the pre-processing of the algorithm, we take the continuous-time limit, thereby explicitly eliminating Trotter errors and streamlining the resource analysis. We also introduce a noise-mitigation method tailored to it. As demonstrations, we apply the algorithm to two representative problems: estimating the ground-state energy of the $H_3^+$ molecular Hamiltonian and computing out-of-time-ordered correlators in the sparse Sachdev--Ye--Kitaev model. We evaluate the protocol's performance through numerical simulations and experiments on a trapped-ion quantum computer, Quantinuum Reimei.

Related papers

• Ancilla-Free Fast-Forwarding Lindbladian Simulation Algorithms by Hamiltonian Twirling [2.8802622551493773]
  We show that the time-$t$ evolution map can be expressed exactly a Gaussian twirl over the unitary orbit $mathrme-mathrmi Hs_sinmathbbR$.<n>This structural insight allows us to design a fast-forwarding algorithm for Lindbladian simulation.
  arXiv  Detail & Related papers  (2025-11-13T12:39:18Z)
• A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization [39.146761527401424]
  This work presents a rigorous worst-case runtime analysis of a measurement-driven quantum SAT solver.<n>We show that this quantum algorithm does not exclusively rely on Grover-type methods and shows promising numerical performance.<n>We also develop a new readout routine that efficiently finds a solution even for instances with multiple satisfying assignments.
  arXiv  Detail & Related papers  (2025-11-12T19:00:13Z)
• Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation [55.88862563823878]
  In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics.<n>We demonstrate performance of the algorithm on two PDEs: a linear equation which governs slightly compressible fluid flow in porous media and the wave equation.<n>Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest.
  arXiv  Detail & Related papers  (2025-07-24T11:02:13Z)
• Using Linearized Optimal Transport to Predict the Evolution of Stochastic Particle Systems [42.49693678817552]
  We use linearized optimal transport theory to prove that the measure-valued algorithm is first-order accurate when the measure evolves smoothly''<n>We specifically demonstrate the efficacy of our approach by showing that our algorithm vastly reduces the number of micro-scale steps needed to correctly approximate long-term behavior.
  arXiv  Detail & Related papers  (2024-08-03T20:00:36Z)
• Predicting Probabilities of Error to Combine Quantization and Early Exiting: QuEE [68.6018458996143]
  We propose a more general dynamic network that can combine both quantization and early exit dynamic network: QuEE. Our algorithm can be seen as a form of soft early exiting or input-dependent compression. The crucial factor of our approach is accurate prediction of the potential accuracy improvement achievable through further computation.
  arXiv  Detail & Related papers  (2024-06-20T15:25:13Z)
• A quantum algorithm to simulate Lindblad master equations [1.104960878651584]
  We present a quantum algorithm for simulating a family of Markovian master equations. Our approach employs a second-order product formula for the Lindblad master equation.
  arXiv  Detail & Related papers  (2024-06-18T16:08:11Z)
• Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering [0.13108652488669736]
  Hamiltonian simulation is a domain where quantum computers have the potential to outperform classical counterparts.<n>One of the main challenges of such quantum algorithms is increasing the system size.<n>We present an approach to improve the scalability of eigenspace filtering for the ground state preparation of a given Hamiltonian.
  arXiv  Detail & Related papers  (2024-01-17T09:52:24Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation [0.5729426778193399]
  We show how errors due to Trotterized time evolution can be mitigated through the use of algorithmic techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors.
  arXiv  Detail & Related papers  (2022-12-29T01:21:26Z)
• Online Multi-Agent Decentralized Byzantine-robust Gradient Estimation [62.997667081978825]
  Our algorithm is based on simultaneous perturbation, secure state estimation and two-timescale approximations. We also show the performance of our algorithm through numerical experiments.
  arXiv  Detail & Related papers  (2022-09-30T07:29:49Z)
• Losing momentum in continuous-time stochastic optimisation [42.617042045455506]
  momentum-based optimisation algorithms have become particularly widespread. In this work, we analyse a continuous-time model for gradient descent with momentum. We also train a convolutional neural network in an image classification problem.
  arXiv  Detail & Related papers  (2022-09-08T10:46:05Z)
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
  We provide a framework for encoding time dependent dynamics as time independent systems. First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
  arXiv  Detail & Related papers  (2022-03-21T21:29:22Z)
• Online Time Series Anomaly Detection with State Space Gaussian Processes [12.483273106706623]
  R-ssGPFA is an unsupervised online anomaly detection model for uni- and multivariate time series. For high-dimensional time series, we propose an extension of Gaussian process factor analysis to identify the common latent processes of the time series. Our model's robustness is improved by using a simple to skip Kalman updates when encountering anomalous observations.
  arXiv  Detail & Related papers  (2022-01-18T06:43:32Z)
• Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
  Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer. Here, we propose an adaptive approach to construct a low-depth time evolution circuit. Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
  arXiv  Detail & Related papers  (2020-11-10T18:00:42Z)

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.