Efficient Approximation of the Wigner Kernel in Phase-Space Quantum Mechanics

• URL: http://arxiv.org/abs/2606.28269v1
• Date: Fri, 26 Jun 2026 17:07:08 GMT
• Title: Efficient Approximation of the Wigner Kernel in Phase-Space Quantum Mechanics
• Abstract summary: This paper proposes an analytical approximation of the Wigner kernel for one-dimensional single body quantum systems.<n>The resulting expression provides an efficient way to approximate the Wigner kernel and the associated Gamma function.<n> Numerical comparisons between the approximated and directly computed Wigner kernels and Gamma functions show that the proposed method captures the main behavior of the exact quantities.
• Score: 0.8220217498103312
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Signed Particle Formulation provides a particle-based interpretation of quantum mechanics in phase space, where quantum dynamics are represented through the creation and evolution of signed particles. A central computational challenge in this framework is the evaluation of the Wigner kernel, which generally involves highly oscillatory integrals and can become computationally demanding in time-dependent simulations. This paper proposes an analytical approximation of the Wigner kernel for one-dimensional single body quantum systems by exploiting a series-based representation of the potential function. The resulting expression provides an efficient way to approximate the Wigner kernel and the associated Gamma function, which governs the particle-generation process in the Signed Particle Formulation framework. The proposed approximation is evaluated for several Gaussian-based potential profiles, including single, double, triple, and quadruple Gaussian potentials. Numerical comparisons between the approximated and directly computed Wigner kernels and Gamma functions show that the proposed method captures the main behavior of the exact quantities while significantly reducing the computational cost. These results indicate that the proposed approximation can serve as an efficient computational component for scalable Signed Particle Formulation based quantum simulations.

Related papers

• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• Confined few-particle systems beyond mean-field theory adopting Gaussian-type orbitals and Morse interparticle interaction [39.146761527401424]
  Recent advancements in optical tweezers enable the trapping of arbitrary numbers of neutral atoms and molecules, even arrays of tweezers with variable geometry can be realized.<n>These fascinating breakthroughs require novel full-dimensional beyond mean-field treatments for systems with more than two confined particles spread over traps that are arranged arbitrarily in space.
  arXiv  Detail & Related papers  (2025-09-12T15:35:32Z)
• Fast simulations of continuous-variable circuits using the coherent state decomposition [0.0]
  We present ttexttlcg_plus, an open-source Python library for the simulation of continuous-variable quantum circuits.<n>Our framework merges the linear combination of Gaussians methodology with the coherent state decomposition of arbitrary non-Gaussian states.<n>We demonstrate the utility of this methodology by optimizing the heralded preparation of a qunaught state, a crucial component for building a fault-tolerant photonic quantum computer.
  arXiv  Detail & Related papers  (2025-08-08T09:44:58Z)
• Phase estimation with partially randomized time evolution [36.989845156791525]
  Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers.<n>In this paper we use randomization to speed up product formulas, one of the standard approaches to Hamiltonian simulation.<n>We perform a detailed resource estimate for single-ancilla phase estimation using partially randomized product formulas for benchmark systems in quantum chemistry.
  arXiv  Detail & Related papers  (2025-03-07T18:09:32Z)
• Efficient Representation of Gaussian Fermionic Pure States in Non-Computational Bases [0.0]
  This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models. We focus on transitioning these states from the conventional computational (sigmaz) basis to more complex bases, such as (phi, fracpi2, alpha) We present a novel algorithm that not only simplifies the basis transformation but also reduces computational complexity.
  arXiv  Detail & Related papers  (2024-03-05T19:43:33Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Simulating Scattering of Composite Particles [0.09208007322096534]
  We develop a non-perturbative approach to simulating scattering on classical and quantum computers. The construction is designed to mimic a particle collision, wherein two composite particles are brought in contact. The approach is well-suited for studying strongly coupled systems in both relativistic and non-relativistic settings.
  arXiv  Detail & Related papers  (2023-10-20T18:00:50Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Physically Consistent Learning of Conservative Lagrangian Systems with Gaussian Processes [7.678864239473703]
  This paper proposes a physically consistent Gaussian Process (GP) enabling the identification of uncertain Lagrangian systems. The function space is tailored according to the energy components of the Lagrangian and the differential equation structure.
  arXiv  Detail & Related papers  (2022-06-24T13:15:43Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer [0.0]
  We present explicit expressions for the central piece of a variational method developed by Shi et al. We derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and subroutine operators. We present a simple gradient-descent-based algorithm that can be used as an optimization in combination with imaginary time evolution.
  arXiv  Detail & Related papers  (2021-05-27T10:31:45Z)
• Quantum Algorithm for Smoothed Particle Hydrodynamics [0.0]
  We present a quantum computing algorithm for the smoothed particle hydrodynamics (SPH) method.<n>Error convergence is exponentially fast in the number of qubits.<n>We extend the method to solve the one-dimensional advection and partial diffusion differential equations.
  arXiv  Detail & Related papers  (2020-06-11T18:28:24Z)

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.