High-Fidelity Scalable Quantum State Preparation via the Fusion Method

• URL: http://arxiv.org/abs/2510.19039v1
• Date: Tue, 21 Oct 2025 19:43:07 GMT
• Title: High-Fidelity Scalable Quantum State Preparation via the Fusion Method
• Authors: Matthew Patkowski, Onat Ayyildiz, Matjaž Kebrič, Katharine L. C. Hunt, Dean Lee,
• Abstract summary: Rodeo Algorithm (RA) offers exponential convergence to a target eigenstate but suffers from poor performance when the initial state has low overlap with the desired eigenstate.<n>We introduce a fusion method that preconditions the RA state by an adiabatic ramp to overcome this limitation.
• Score: 0.9786690381850356
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Robust and efficient eigenstate preparation is a central challenge in quantum simulation. The Rodeo Algorithm (RA) offers exponential convergence to a target eigenstate but suffers from poor performance when the initial state has low overlap with the desired eigenstate, hindering the applicability of the original algorithm to larger systems. In this work, we introduce a fusion method that preconditions the RA state by an adiabatic ramp to overcome this limitation. By incrementally building up large systems from exactly solvable subsystems and using adiabatic preconditioning to enhance intermediate state overlaps, we ensure that the RA retains its exponential convergence even in large-scale systems. We demonstrate this hybrid approach using numerical simulations of the spin- 1/2 XX model and find that the Rodeo Algorithm exhibits robust exponential convergence across system sizes. We benchmark against using only an adiabatic ramp as well as using the unmodified RA, finding that for state preparation precision at the level of $10^{-3}$ infidelity or better there a decisive computational cost advantage to the fusion method. These results together demonstrate the scalability and effectiveness of the fusion method for practical quantum simulations.

Related papers

• A Shadow Enhanced Greedy Quantum Eigensolver [0.0]
  We introduce the Shadow Enhanced Greedy Quantum Eigensolver (SEGQE) as a greedy, shadow-assisted framework for measurement-efficient ground-state preparation.<n>We derive rigorous worst-case per-iteration sample-complexity bounds for SEGQE, exhibiting logarithmic dependence on the number of candidate gates.
  arXiv  Detail & Related papers  (2026-02-19T18:40:35Z)
• Frozen Gaussian sampling algorithms for simulating Markovian open quantum systems in the semiclassical regime [4.655774822811101]
  This paper introduces an efficient Frozen Gaussian Sampling (FGS) algorithm based on the Wigner-Fokker-Planck phase-space formulation.<n>Its sampling error is independent of the semiclassical parameter $varepsilon$, thus breaking the prohibitive computational scaling faced by grid methods in the semiclassical limit.<n>We provide compelling numerical evidence for the existence of steady states in strongly non-harmonic potentials-a regime where rigorous analytical results are currently lacking.
  arXiv  Detail & Related papers  (2025-12-16T02:21:34Z)
• A simple method for seniority-zero quantum state preparation [0.0]
  We show that an orbital-optimized paired Cluster Doubles (oo-pCCD) method can describe the static correlation features of many strongly correlated singlet states.<n>We demonstrate that substituting leading oo-pCCD amplitudes into the UpCCD Ansatz allows to prepare high-fidelity singlet states for models of multiple-bond dissociation in ethene, ethyne and dinitrogen.
  arXiv  Detail & Related papers  (2025-08-29T14:47:45Z)
• Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization [56.78271181959529]
  SubLoRA is a rank determination method for Low-Rank Adaptation (LoRA) based on submodular function.<n>Our method combines solid theoretical foundations, second-order accuracy, and practical computational efficiency.
  arXiv  Detail & Related papers  (2025-07-02T15:56:40Z)
• Efficient Transformed Gaussian Process State-Space Models for Non-Stationary High-Dimensional Dynamical Systems [49.819436680336786]
  We propose an efficient transformed Gaussian process state-space model (ETGPSSM) for scalable and flexible modeling of high-dimensional, non-stationary dynamical systems.<n>Specifically, our ETGPSSM integrates a single shared GP with input-dependent normalizing flows, yielding an expressive implicit process prior that captures complex, non-stationary transition dynamics.<n>Our ETGPSSM outperforms existing GPSSMs and neural network-based SSMs in terms of computational efficiency and accuracy.
  arXiv  Detail & Related papers  (2025-03-24T03:19:45Z)
• Adaptive Federated Learning Over the Air [108.62635460744109]
  We propose a federated version of adaptive gradient methods, particularly AdaGrad and Adam, within the framework of over-the-air model training. Our analysis shows that the AdaGrad-based training algorithm converges to a stationary point at the rate of $mathcalO( ln(T) / T 1 - frac1alpha ).
  arXiv  Detail & Related papers  (2024-03-11T09:10:37Z)
• Hybrid algorithm simulating non-equilibrium steady states of an open quantum system [10.752869788647802]
  Non-equilibrium steady states are a focal point of research in the study of open quantum systems. Previous variational algorithms for searching these steady states have suffered from resource-intensive implementations. We present a novel variational quantum algorithm that efficiently searches for non-equilibrium steady states by simulating the operator-sum form of the Lindblad equation.
  arXiv  Detail & Related papers  (2023-09-13T01:57:27Z)
• 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)
• Scalable Imaginary Time Evolution with Neural Network Quantum States [0.0]
  The representation of a quantum wave function as a neural network quantum state (NQS) provides a powerful variational ansatz for finding the ground states of many-body quantum systems. We introduce an approach that bypasses the computation of the metric tensor and instead relies exclusively on first-order descent with Euclidean metric. We make this method adaptive and stable by determining the optimal time step and keeping the target fixed until the energy of the NQS decreases.
  arXiv  Detail & Related papers  (2023-07-28T12:26:43Z)
• A Deep Unrolling Model with Hybrid Optimization Structure for Hyperspectral Image Deconvolution [50.13564338607482]
  We propose a novel optimization framework for the hyperspectral deconvolution problem, called DeepMix.<n>It consists of three distinct modules, namely, a data consistency module, a module that enforces the effect of the handcrafted regularizers, and a denoising module.<n>This work proposes a context aware denoising module designed to sustain the advancements achieved by the cooperative efforts of the other modules.
  arXiv  Detail & Related papers  (2023-06-10T08:25:16Z)
• D4FT: A Deep Learning Approach to Kohn-Sham Density Functional Theory [79.50644650795012]
  We propose a deep learning approach to solve Kohn-Sham Density Functional Theory (KS-DFT) We prove that such an approach has the same expressivity as the SCF method, yet reduces the computational complexity. In addition, we show that our approach enables us to explore more complex neural-based wave functions.
  arXiv  Detail & Related papers  (2023-03-01T10:38:10Z)
• High-Dimensional Yield Estimation using Shrinkage Deep Features and Maximization of Integral Entropy Reduction [0.8522010776600341]
  We propose an absolute deep learning, ASDK, which automatically identifies the dominant process variation parameters in a nonlinear kernel-correlated deep kernel. Experiments on column circuits demonstrate the superiority of ASDK over the state-of-the-art (SOTA) approaches in terms of accuracy and efficiency with up to 10.3x speedup over SOTA methods.
  arXiv  Detail & Related papers  (2022-12-05T08:39:41Z)
• Versatile Single-Loop Method for Gradient Estimator: First and Second Order Optimality, and its Application to Federated Learning [45.78238792836363]
  We present a single-loop algorithm named SLEDGE (Single-Loop-E Gradient Estimator) for periodic convergence. Unlike existing methods, SLEDGE has the advantage of versatility; (ii) second-order optimal, (ii) in the PL region, and (iii) smaller complexity under less of data.
  arXiv  Detail & Related papers  (2022-09-01T11:05:26Z)
• Stochastic Hard Thresholding Algorithms for AUC Maximization [49.00683387735522]
  We develop a hard thresholding algorithm for AUC in distributiond classification. We conduct experiments to show the efficiency and effectiveness of the proposed algorithms.
  arXiv  Detail & Related papers  (2020-11-04T16:49:29Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.