Quantum Differential Equation Solver via Hybrid Oscillator-Qubit Linear Combination of Hamiltonian Simulations

• URL: http://arxiv.org/abs/2605.10708v1
• Date: Mon, 11 May 2026 15:20:35 GMT
• Title: Quantum Differential Equation Solver via Hybrid Oscillator-Qubit Linear Combination of Hamiltonian Simulations
• Abstract summary: We introduce a hybrid oscillator-qubit formulation of linear combination of Hamiltonian simulation (LCHS)<n>Instead of representing the quadrature rule with a discrete-variable (DV) ancilla register in qubit-only LCHS, the method encodes the LCHS kernel in a continuous-variable ancillary mode.<n>In the heat-equation benchmarks, the Law--Eberly protocol achieves end-to-end solution fidelity at least 99.90%.
• Score: 7.438217717051814
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a hybrid oscillator-qubit formulation of linear combination of Hamiltonian simulation (LCHS) for solving linear ordinary differential equations. Instead of representing the quadrature rule with a discrete-variable (DV) ancilla register in qubit-only LCHS, the method encodes the LCHS kernel in a continuous-variable (CV) ancillary mode, thereby eliminating the explicit $O(\log M_a)$ ancilla-qubit overhead, where $M_a$ is the number of discretized integral terms in the DV quadrature rule. We derive analytical error bounds for two main approximation mechanisms for the ideal kernel state preparation, showing superalgebraic convergence for Schwartz-class kernels in the truncation cutoff $N$. The required CV non-Gaussianity is captured by the finite squeezed-Fock kernel state, which generically has stellar rank $N-1$, identifying the truncation cutoff as a discrete measure of the oracle's non-Gaussian resource. For the hybrid oscillator-qubit evolution, we also obtain a product-formula bound showing that a $p$th-order formula requires $O(t^{1+1/p}(Γ_{p,N}/ε_t)^{1/p})$ Trotter steps to reach error $ε_t$, where $Γ_{p,N}$ collects Pauli commutator terms weighted by powers of the truncated position-operator norm $\|\hat{x}\|_N$. We further derive a perturbation bound for the probability of obtaining the required oscillator measurement outcome, showing that an $ε$-close implementation of the ideal LCHS oracle in operator norm induces only an $O(ε)$ perturbation in the postselection probability. In the heat-equation benchmarks, the Law--Eberly protocol achieves end-to-end solution fidelity at least 99.90%. A comparison with a matrix-product-state-based DV LCHS implementation further shows that, the hybrid construction uses a substantially more compact oracle description with reduce circuit cost.

Related papers

• Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions [51.50375419691955]
  Distributionally robust Markov decision processes provide a principled framework for sequential decision making under model uncertainty.<n>We study how many samples are necessary and sufficient to learn an $varepsilon$-optimal robust policy under the average-reward criterion.
  arXiv  Detail & Related papers  (2026-08-06T19:49:48Z)
• A Provable Oracle-Free Quantum Algorithm for Nonlinear Dynamics on Hybrid Oscillator-Qubit Processors [14.814423713691623]
  We develop a hybrid qubit-qumode algorithm for nonlinear ordinary differential equations of the form $dotmathbfx=mathbff(mathbfx)$ with warped degree$L$.<n>The algorithm propagates the state density and returns the trajectory as the peak of that density in the small-noise limit.
  arXiv  Detail & Related papers  (2026-07-30T17:10:47Z)
• Near-Optimal Mode Scaling for Finite-Dimensional Boson Sampling via Lie-Algebraic Leakage Bounds [0.8594140167290097]
  Boson sampling on matter-based platforms requires encoding the bosonic modes in finite-dimensional local Hilbert spaces.<n>We develop a unified framework for non-interacting sampling on the irreducible representations of compact Lie groups.<n>We prove, in a Gaussian model of the transition matrix, that its spectral norm concentrates at $tildeO(stn)$ rather than the $O(n)$ worst-case of prior spin-based emulations.
  arXiv  Detail & Related papers  (2026-07-13T15:36:29Z)
• Provably Adaptive Linear Approximation for the Shapley Value and Beyond [73.0940890296463]
  A fundamental and long-standing challenge is their efficient approximation.<n>We develop a linear-space algorithm that requires $P(|hatboldsymbol-boldsymbol|_2geq)leq $ for all commonly used semi-values.<n>Our algorithm allows explicit minimization of the mean square error for each specific utility function.
  arXiv  Detail & Related papers  (2026-04-09T16:38:14Z)
• A Schrödinger Eigenfunction Method for Long-Horizon Stochastic Optimal Control [25.99003754170971]
  High-dimensional optimal control (SOC) becomes harder with longer planning horizons.<n>We prove that, under the gradient drift assumption, $mathcalL$ is unitarily equivalent to a Schrdinger operator $mathcalS = -+ mathcalV$ with purely discrete spectrum.<n>We evaluate our method on several long-horizon benchmarks, achieving an order-of-magnitude improvement in control accuracy compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-03-24T13:15:48Z)
• Preparing Fermions via Classical Sampling and Linear Combinations of Unitaries [0.0]
  We present an extension of the Evolving density matrices on Qubits (E$$OQ) framework that enables efficient fault-tolerant preparation of fermionic quantum states.<n>The original method circumvents state preparation by sampling, but faces a sign problem in fermionic systems leading to a large number of necessary circuits.
  arXiv  Detail & Related papers  (2026-03-23T18:01:03Z)
• Efficient Qubit Simulation of Hybrid Oscillator-Qubit Quantum Computation [7.0833183028318984]
  We introduce a framework for hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding.<n>By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method efficiently simulates all Gaussian and conditional Gaussian operations.<n>We provide rigorous numerical characterization of quantum transform errors for Fock-bounded states, enabling precise resource estimation.
  arXiv  Detail & Related papers  (2026-03-10T06:05:55Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Transmutation based Quantum Simulation for Non-unitary Dynamics [35.35971148847751]
  We present a quantum algorithm for simulating dissipative diffusion dynamics generated by positive semidefinite operators of the form $A=Ldagger L$.<n>Our main tool is the Kannai transform, which represents the diffusion semigroup $e-TA$ as a Gaussian-weighted superposition of unitary wave propagators.
  arXiv  Detail & Related papers  (2026-01-07T05:47:22Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Optimal policy evaluation using kernel-based temporal difference methods [78.83926562536791]
  We use kernel Hilbert spaces for estimating the value function of an infinite-horizon discounted Markov reward process. We derive a non-asymptotic upper bound on the error with explicit dependence on the eigenvalues of the associated kernel operator. We prove minimax lower bounds over sub-classes of MRPs.
  arXiv  Detail & Related papers  (2021-09-24T14:48:20Z)
• Even more efficient quantum computations of chemistry through tensor hypercontraction [0.6234350105794442]
  We describe quantum circuits with only $widetildecal O(N)$ Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of $N$ arbitrary orbitals. This is the lowest complexity that has been shown for quantum computations of chemistry within an arbitrary basis.
  arXiv  Detail & Related papers  (2020-11-06T18:03:29Z)

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.