Unified boson sampling
- URL: http://arxiv.org/abs/2509.02058v2
- Date: Mon, 15 Sep 2025 14:44:18 GMT
- Title: Unified boson sampling
- Authors: Luca Bianchi, Carlo Marconi, Laura Ares, Davide Bacco, Jan Sperling,
- Abstract summary: In this work, a unification and extension of distinct forms of boson sampling is developed.<n>It is rendered possible to harness the complexity of more interesting states, such as squeezed photons, in advanced sampling protocols.<n> Entanglement is characterized to exemplify the generation of quantum correlations from the nonlinear interactions of a unified sampler.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Boson sampling is a key candidate for demonstrating quantum advantage, and has already yielded significant advances in quantum simulation, machine learning, and graph theory. In this work, a unification and extension of distinct forms of boson sampling is developed. The devised protocol merges discrete-variable scattershot boson sampling with continuous-variable Gaussian boson sampling. Thereby, it is rendered possible to harness the complexity of more interesting states, such as squeezed photons, in advanced sampling protocols. A generating function formalism is developed for the joint description of multiphoton and multimode light undergoing Gaussian transformations. The resulting analytical tools enable one to explore interfaces of different photonic quantum-information-processing platforms. A numerical simulation of unified sampling is carried out, benchmarking its performance, complexity, and scalability. Entanglement is characterized to exemplify the generation of quantum correlations from the nonlinear interactions of a unified sampler.
Related papers
- Quantum Latent Diffusion Models [65.16624577812436]
We propose a potential version of a quantum diffusion model that leverages the established idea of classical latent diffusion models.<n>This involves using a traditional autoencoder to reduce images, followed by operations with variational circuits in the latent space.<n>The results demonstrate an advantage in using a quantum version, as evidenced by obtaining better metrics for the images generated by the quantum version.
arXiv Detail & Related papers (2025-01-19T21:24:02Z) - 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) - Quantum emulation of the transient dynamics in the multistate
Landau-Zener model [50.591267188664666]
We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity.
Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
arXiv Detail & Related papers (2022-11-26T15:04:11Z) - 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) - Certification of Gaussian Boson Sampling via graph theory [4.063872661554895]
We exploit a connection between photon counting of a genuine Gaussian Boson Sampling device and the number of perfect matchings in a graph.
Within this framework, two approaches that exploit the distributions of graph feature vectors and graph kernels are presented.
arXiv Detail & Related papers (2022-02-15T20:22:28Z) - 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) - Simulating complex networks in phase space: Gaussian boson sampling [62.997667081978825]
We show how phase-space simulations of Gaussian quantum states in a photonic network permit verification of measurable correlations.
We extend this to more than 16,000 modes, and describe how to simulate genuine multipartite entanglement.
arXiv Detail & Related papers (2021-02-20T13:12:51Z) - Boson Sampling with Gaussian input states: toward efficient scaling and certification [0.0]
We present a practically achievable pathway to scale Boson Sampling experiments.
We propose the combination of switchable dual-homodyne and single-photon detections, the temporal loop technique, and scattershot-based Boson Sampling.
arXiv Detail & Related papers (2018-12-21T07:15:03Z)
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.