Experimental demonstration of boson sampling as a hardware accelerator for monte carlo integration
- URL: http://arxiv.org/abs/2509.25404v1
- Date: Mon, 29 Sep 2025 18:59:34 GMT
- Title: Experimental demonstration of boson sampling as a hardware accelerator for monte carlo integration
- Authors: Malaquias Correa Anguita, Teun Roelink, Sara Marzban, Wim Briels, Claudia Filippi, Jelmer Renema,
- Abstract summary: We present an experimental demonstration of boson sampling as a hardware accelerator for Monte Carlo integration.<n>We implement a proof-of-principle experiment on a programmable photonic platform to compute the first-order energy correction of a three-boson system.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We present an experimental demonstration of boson sampling as a hardware accelerator for Monte Carlo integration. Our approach leverages importance sampling to factorize an integrand into a distribution that can be sampled using quantum hardware and a function that can be evaluated classically, enabling hybrid quantum-classical computation. We argue that for certain classes of integrals, this method offers a quantum advantage by efficiently sampling from probability distributions that are hard to simulate classically. We also identify structural criteria that must be satisfied to preserve computational hardness, notably the sensitivity of the classical post-processing function to high-order quantum correlations. To validate our protocol, we implement a proof-of-principle experiment on a programmable photonic platform to compute the first-order energy correction of a three-boson system in a harmonic trap under an Efimov-inspired three-body perturbation. The experimental results are consistent with theoretical predictions and numerical simulations, with deviations explained by photon distinguishability, discretization, and unitary imperfections. Additionally, we provide an error budget quantifying the impact of these same sources of noise. Our work establishes a concrete use case for near-term photonic quantum devices and highlights a viable path toward practical quantum advantage in scientific computing.
Related papers
- Fermionic Born Machines: Classical training of quantum generative models based on Fermion Sampling [0.0]
We introduce Fermionic Born Machines as an example of classically trainable quantum generative models.<n>The model employs parameterized magic states and fermionic linear optical (FLO) transformations with learnable parameters.<n>The specific structure of the ansatz induces a loss landscape that exhibits favorable characteristics for optimization.
arXiv Detail & Related papers (2025-11-17T19:03:03Z) - Anticipating Decoherence: a Predictive Framework for Enhancing Coherence in Quantum Emitters [96.41185946460115]
We develop an anticipatory framework for forecasting and decoherence engineering in remote quantum emitters.<n>We show that a machine learning model trained on limited data can accurately forecast unseen spectral behavior.<n>These results pave the way for real-time decoherence engineering in scalable quantum systems.
arXiv Detail & Related papers (2025-08-04T17:23:14Z) - Quantum computational advantage of noisy boson sampling with partially distinguishable photons [0.0]
In this work, we identify the level of partial distinguishability noise that upholds the classical intractability of boson sampling.<n>We find that boson sampling with on average $O(log N)$ number of distinguishable photons out of $N$ input photons maintains the equivalent complexity to the ideal boson sampling case.
arXiv Detail & Related papers (2025-01-23T07:37:29Z) - Phase-space negativity as a computational resource for quantum kernel methods [2.5499055723658097]
Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning.
We provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems.
Our results underpin the role of the negativity in phase-space quasi-probability distributions as an essential resource in quantum machine learning.
arXiv Detail & Related papers (2024-05-20T21:18:53Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Validation of a noisy Gaussian boson sampler via graph theory [0.0]
photonic-based sampling machines solving the Gaussian Boson Sampling problem play a central role in the experimental demonstration of a quantum computational advantage.<n>In this work, we test the performances of the recently developed photonic machine Borealis as a sampling machine and its possible use cases in graph theory.
arXiv Detail & Related papers (2023-06-21T09:02:55Z) - 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) - On Quantum Circuits for Discrete Graphical Models [1.0965065178451106]
We provide the first method that allows one to provably generate unbiased and independent samples from general discrete factor models.
Our method is compatible with multi-body interactions and its success probability does not depend on the number of variables.
Experiments with quantum simulation as well as actual quantum hardware show that our method can carry out sampling and parameter learning on quantum computers.
arXiv Detail & Related papers (2022-06-01T11:03:51Z) - Generalization Metrics for Practical Quantum Advantage in Generative
Models [68.8204255655161]
Generative modeling is a widely accepted natural use case for quantum computers.
We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance.
Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
arXiv Detail & Related papers (2022-01-21T16:35:35Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - 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) - Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on
Quantum Computers [52.77024349608834]
We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits.
We evaluate the algorithm by simulating thermal states of the transverse Ising model.
arXiv Detail & Related papers (2021-03-04T18:21:00Z) - Probing the Universality of Topological Defect Formation in a Quantum
Annealer: Kibble-Zurek Mechanism and Beyond [46.39654665163597]
We report on experimental tests of topological defect formation via the one-dimensional transverse-field Ising model.
We find that the quantum simulator results can indeed be explained by the KZM for open-system quantum dynamics with phase-flip errors.
This implies that the theoretical predictions of the generalized KZM theory, which assumes isolation from the environment, applies beyond its original scope to an open system.
arXiv Detail & Related papers (2020-01-31T02:55:35Z)
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.