Subspace Variational Quantum Simulation: Fidelity Lower Bounds as Measures of Training Success

• URL: http://arxiv.org/abs/2509.06360v2
• Date: Mon, 20 Oct 2025 00:33:36 GMT
• Title: Subspace Variational Quantum Simulation: Fidelity Lower Bounds as Measures of Training Success
• Authors: Seung Park, Dongkeun Lee, Jeongho Bang, Hoon Ryu, Kyunghyun Baek,
• Abstract summary: We propose an iterative variational quantum algorithm to simulate the time evolution of arbitrary initial states within a given subspace.<n>The algorithm compresses the Trotter circuit into a shorter-depth parameterized circuit, which is optimized simultaneously over multiple initial states.<n>We show our cost function exhibits a barren-plateau-free region near the initial parameters at each iteration in the training landscape.
• Score: 4.387699521196243
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose an iterative variational quantum algorithm to simulate the time evolution of arbitrary initial states within a given subspace. The algorithm compresses the Trotter circuit into a shorter-depth parameterized circuit, which is optimized simultaneously over multiple initial states in a single training process using fidelity-based cost functions. After the whole training procedure, we provide an efficiently computable lower bound on the fidelities for arbitrary states within the subspace, which guarantees the performance of the algorithm in the worst-case training scenario. We also show our cost function exhibits a barren-plateau-free region near the initial parameters at each iteration in the training landscape. The experimental demonstration of the algorithm is presented through the simulation of a 2-qubit Ising model on an IBMQ processor. As a demonstration for a larger system, a simulation of a 10-qubit Ising model is also provided.

Related papers

• 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)
• Quantum Simulation-Based Optimization of a Cooling System [0.0]
  Quantum algorithms promise up to exponential speedups for specific tasks relevant to numerical simulations.<n>However, these advantages quickly vanish when considering data input and output on quantum computers.<n>The recently introduced Quantum Simulation-Based Optimization (QuSO) treats simulations as subproblems within a larger optimization.
  arXiv  Detail & Related papers  (2025-04-21T21:58:21Z)
• Parallel simulation for sampling under isoperimetry and score-based diffusion models [56.39904484784127]
  As data size grows, reducing the iteration cost becomes an important goal.<n>Inspired by the success of the parallel simulation of the initial value problem in scientific computation, we propose parallel Picard methods for sampling tasks.<n>Our work highlights the potential advantages of simulation methods in scientific computation for dynamics-based sampling and diffusion models.
  arXiv  Detail & Related papers  (2024-12-10T11:50:46Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• Efficient and practical Hamiltonian simulation from time-dependent product formulas [1.2534672170380357]
  We propose an approach for implementing time-evolution of a quantum system using product formulas. Our algorithms generate a decomposition of the evolution operator into a product of simple unitaries that are directly implementable on a quantum computer. Although the theoretical scaling is suboptimal compared with state-of-the-art algorithms, the performance of the algorithms we propose is highly competitive in practice.
  arXiv  Detail & Related papers  (2024-03-13T17:29:05Z)
• Noisy intermediate-scale quantum simulation of the one-dimensional wave equation [0.0]
  We design and implement quantum circuits for the simulation of the one-dimensional wave equation on the Quantinuum H1-1 quantum computer.<n>Our approach to simulating the wave equation can be used with appropriate state preparation algorithms across different quantum processors and serve as an application-oriented benchmark.
  arXiv  Detail & Related papers  (2024-02-29T15:21:41Z)
• Single-ancilla ground state preparation via Lindbladians [4.328210085579236]
  We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer.
  arXiv  Detail & Related papers  (2023-08-30T00:11:19Z)
• Accelerated First-Order Optimization under Nonlinear Constraints [61.98523595657983]
  We exploit between first-order algorithms for constrained optimization and non-smooth systems to design a new class of accelerated first-order algorithms.<n>An important property of these algorithms is that constraints are expressed in terms of velocities instead of sparse variables.
  arXiv  Detail & Related papers  (2023-02-01T08:50:48Z)
• Learning neural state-space models: do we need a state estimator? [0.0]
  We provide insights for calibration of neural state-space training algorithms based on extensive experimentation and analyses. Specific focus is given to the choice and the role of the initial state estimation. We demonstrate that advanced initial state estimation techniques are really required to achieve high performance on certain classes of dynamical systems.
  arXiv  Detail & Related papers  (2022-06-26T17:15:35Z)
• Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Brain [62.997667081978825]
  Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system. Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
  arXiv  Detail & Related papers  (2020-09-11T11:56:34Z)
• Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learning [145.54544979467872]
  We propose two single-timescale single-loop algorithms that require only one data point each step. Our results are expressed in a form of simultaneous primal and dual side convergence.
  arXiv  Detail & Related papers  (2020-08-23T20:36:49Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.