Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1801.07488 · Physical Review A

Detailed study of Gaussian boson sampling

Regina Kruse, Craig S. Hamilton, Linda Sansoni, Sonja Barkhofen, Christine Silberhorn, Igor Jex

Published Sep 18, 2019• 210 citations
arXivHTMLPDF

Abstract

Since the development of boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper, we interpret and extend the results presented previously [Phys. Rev. Lett. 119, 170501 (2017)]. We derive an expression that relates the probability to measure a specific photon output pattern from a Gaussian state to the Hafnian matrix function and use it to design a Gaussian boson sampling protocol. Then, we discuss the advantages that this protocol has relative to other photonic protocols and the experimental requirements for Gaussian boson sampling. Finally, we relate it to the previously most general protocol, scattershot boson sampling [Phys. Rev. Lett. 113, 100502 (2014)].

DOI
10.1103/physreva.100.032326

Related papers

Gaussian Boson Sampling

Craig S. Hamilton, Regina Kruse, Linda Sansoni +3 more

Boson sampling has emerged as a tool to explore the advantages of quantum over classical computers as it does not require universal control over the quantum system, which favors current photonic experimental platforms. Here, we introduce Gaussian Boson sampling, a classically hard-to-solve problem that uses squeezed states as a nonclassical resource. We relate the probability to measure specific photon patterns from a general Gaussian state in the Fock basis to a matrix function called the Hafnian, which answers the last remaining question of sampling from Gaussian states. Based on this result, we design Gaussian Boson sampling, a #P hard problem, using squeezed states. This demonstrates that Boson sampling from Gaussian states is possible, with significant advantages in the photon generation probability, compared to existing protocols.

arXiv:1612.01199•Physical Review Letters•Oct 23, 2017•566 citations

Gaussian boson sampling using threshold detectors

Nicolás Quesada, Juan Miguel Arrazola, Nathan Killoran

We study what is arguably the most experimentally appealing boson sampling architecture: Gaussian states sampled with threshold detectors. We show that, in this setting, the probability of observing a given outcome is related to a matrix function that we name the Torontonian, which plays an analogous role to the permanent or the Hafnian in other models. We also prove that, provided that the probability of observing two or more photons in a single output mode is sufficiently small, our model remains intractable to simulate classically under standard complexity-theoretic conjectures. Finally, we leverage the mathematical simplicity of the model to introduce a physically motivated, exact sampling algorithm for all boson sampling models that employ Gaussian states and threshold detectors.

arXiv:1807.01639•Physical Review A•Dec 18, 2018•132 citations

Boson sampling from non-Gaussian states

Craig S. Hamilton, Igor Jex

Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study boson sampling from general, single-mode states using a scheme that can generate any such state by combining Gaussian states and photon number measurements. We derive a formula that can be used to calculate the output photon number probabilities of these states after they travel through a linear interferometer. This extends the Boson sampling protocol to the widest array of possible single-mode states and from this we show that the complexity scaling of all such states is similar and hence there is no complexity advantage of using complex input states over simpler ones.

arXiv:2403.17183•Physical Review A•May 15, 2024•3 citations

Gaussian boson sampling with click-counting detectors

Gabriele Bressanini, Hyukjoon Kwon, M. S. Kim

Gaussian boson sampling constitutes a prime candidate for an experimental demonstration of quantum advantage within reach with current technological capabilities. The original proposal employs photon-number-resolving detectors, however, these are not widely available. Nevertheless, inexpensive threshold detectors can be combined into a single click-counting detector to achieve approximate photon-number resolution. We investigate the problem of sampling from a general multimode Gaussian state using click-counting detectors and show that the probability of obtaining a given outcome is related to a matrix function which is dubbed as the Kensingtonian. We show how the Kensingtonian relates to the Torontonian and the Hafnian, thus bridging the gap between known Gaussian boson sampling variants. We then prove that, under standard complexity-theoretical conjectures, the model cannot be simulated efficiently. Published by the American Physical Society 2024

arXiv:2305.00853•Physical Review A•Feb 12, 2024•4 citations

Unified boson sampling

Luca Bianchi, Carlo Marconi, Laura Ares +2 more

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. Therefore, 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.

arXiv:2509.02058•Physical Review Research•Nov 13, 2025•2 citations

Quadratic Speed-Up for Simulating Gaussian Boson Sampling

Nicolás Quesada, Rachel S. Chadwick, Bryn A. Bell +4 more

We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods.The complexity of the algorithm is exponential in the number of photon pairs detected, not the number of photons, and is directly proportional to the time required to calculate a probability amplitude for a pure Gaussian state.The main innovation is to use auxiliary conditioning variables to reduce the problem of sampling to the computation of the pure-state probability amplitudes, for which the most computationally expensive step is the calculation of a loop hafnian.We implement and benchmark an improved loop-hafnian algorithm and show that it can be used to compute pure-state probabilities, the dominant step in the sampling algorithm, of events involving up to 50 photons in a single workstation, i.e., without the need of a supercomputer.

arXiv:2010.15595•PRX Quantum•Jan 11, 2022•57 citations
Since the development of boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper, we interpret and extend the results presented previously [Phys. Rev. Lett. 119, 170501 (2017)]. We derive an expression that relates the probability to measure a specific photon output pattern from a Gaussian state to the Hafnian matrix function and use it to design a Gaussian boson sampling protocol. Then, we discuss the advantages that this protocol has relative to other photonic protocols and the experimental requirements for Gaussian boson sampling. Finally, we relate it to the previously most general protocol, scattershot boson sampling [Phys. Rev. Lett. 113, 100502 (2014)].
Boson sampling has emerged as a tool to explore the advantages of quantum over classical computers as it does not require universal control over the quantum system, which favors current photonic experimental platforms. Here, we introduce Gaussian Boson sampling, a classically hard-to-solve problem that uses squeezed states as a nonclassical resource. We relate the probability to measure specific photon patterns from a general Gaussian state in the Fock basis to a matrix function called the Hafnian, which answers the last remaining question of sampling from Gaussian states. Based on this result, we design Gaussian Boson sampling, a #P hard problem, using squeezed states. This demonstrates that Boson sampling from Gaussian states is possible, with significant advantages in the photon generation probability, compared to existing protocols.
We study what is arguably the most experimentally appealing boson sampling architecture: Gaussian states sampled with threshold detectors. We show that, in this setting, the probability of observing a given outcome is related to a matrix function that we name the Torontonian, which plays an analogous role to the permanent or the Hafnian in other models. We also prove that, provided that the probability of observing two or more photons in a single output mode is sufficiently small, our model remains intractable to simulate classically under standard complexity-theoretic conjectures. Finally, we leverage the mathematical simplicity of the model to introduce a physically motivated, exact sampling algorithm for all boson sampling models that employ Gaussian states and threshold detectors.
Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study boson sampling from general, single-mode states using a scheme that can generate any such state by combining Gaussian states and photon number measurements. We derive a formula that can be used to calculate the output photon number probabilities of these states after they travel through a linear interferometer. This extends the Boson sampling protocol to the widest array of possible single-mode states and from this we show that the complexity scaling of all such states is similar and hence there is no complexity advantage of using complex input states over simpler ones.
Gaussian boson sampling constitutes a prime candidate for an experimental demonstration of quantum advantage within reach with current technological capabilities. The original proposal employs photon-number-resolving detectors, however, these are not widely available. Nevertheless, inexpensive threshold detectors can be combined into a single click-counting detector to achieve approximate photon-number resolution. We investigate the problem of sampling from a general multimode Gaussian state using click-counting detectors and show that the probability of obtaining a given outcome is related to a matrix function which is dubbed as the Kensingtonian. We show how the Kensingtonian relates to the Torontonian and the Hafnian, thus bridging the gap between known Gaussian boson sampling variants. We then prove that, under standard complexity-theoretical conjectures, the model cannot be simulated efficiently. Published by the American Physical Society 2024
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. Therefore, 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.
We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods.The complexity of the algorithm is exponential in the number of photon pairs detected, not the number of photons, and is directly proportional to the time required to calculate a probability amplitude for a pure Gaussian state.The main innovation is to use auxiliary conditioning variables to reduce the problem of sampling to the computation of the pure-state probability amplitudes, for which the most computationally expensive step is the calculation of a loop hafnian.We implement and benchmark an improved loop-hafnian algorithm and show that it can be used to compute pure-state probabilities, the dominant step in the sampling algorithm, of events involving up to 50 photons in a single workstation, i.e., without the need of a supercomputer.