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

Optics Express

Connection between BosonSampling with quantum and classical input states

Yosep Kim, Kang-Hee Hong, Yoon-Ho Kim, Joonsuk Huh

Published Feb 13, 2020• 9 citations
Publisher

Abstract

BosonSampling is a problem of sampling events according to the transition probabilities of indistinguishable photons in a linear optical network. Computational hardness of BosonSampling depends on photon-number statistics of the input light. BosonSampling with multi-photon Fock states at the input is believed to be classically intractable but there exists an efficient classical algorithm for classical input states. In this paper, we present a mathematical connection between BosonSampling with quantum and classical light inputs. Specifically, we show that the generating function of a transition probability for Fock-state BosonSampling (FBS) can be expressed as a transition probability of thermal-light inputs. The closed-form expression of a thermal-light transition probability allows all possible transition probabilities of FBS to be obtained by calculating a single matrix permanent. Moreover, the transition probability of FBS is shown to be expressed as an integral involving a Gaussian function multiplied by a Laguerre polynomial, resulting in a fast oscillating integrand. Our work sheds new light on computational hardness of FBS by identifying the mathematical connection between BosonSampling with quantum and classical light.

DOI
10.1364/oe.384973

Related papers

Boson sampling with displaced single-photon Fock states versus single-photon-added coherent states: The quantum-classical divide and computational-complexity transitions in linear optics

Kaushik P. Seshadreesan, Jonathan P. Olson, Keith R. Motes +2 more

Boson sampling is a specific quantum computation, which is likely hard to implement efficiently on a classical computer. The task is to sample the output photon-number distribution of a linear-optical interferometric network, which is fed with single-photon Fock-state inputs. A question that has been asked is if the sampling problems associated with any other input quantum states of light (other than the Fock states) to a linear-optical network and suitable output detection strategies are also of similar computational complexity as boson sampling. We consider the states that differ from the Fock states by a displacement operation, namely the displaced Fock states and the photon-added coherent states. It is easy to show that the sampling problem associated with displaced single-photon Fock states and a displaced photon-number detection scheme is in the same complexity class as boson sampling for all values of displacement. On the other hand, we show that the sampling problem associated with single-photon-added coherent states and the same displaced photon-number detection scheme demonstrates a computational-complexity transition. It transitions from being just as hard as boson sampling when the input coherent amplitudes are sufficiently small to a classically simulatable problem in the limit of large coherent amplitudes.

arXiv:1402.0531•Physical Review A•Feb 27, 2015•47 citations

What Can Quantum Optics Say about Computational Complexity Theory?

Saleh Rahimi-Keshari, Austin P. Lund, Timothy C. Ralph

Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational complexity theory point of view. We derive a general formula for calculating the output probabilities, and by considering input thermal states, we show that the output probabilities are proportional to permanents of positive-semidefinite Hermitian matrices. It is believed that approximating permanents of complex matrices in general is a #P-hard problem. However, we show that these permanents can be approximated with an algorithm in the BPP^{NP} complexity class, as there exists an efficient classical algorithm for sampling from the output probability distribution. We further consider input squeezed-vacuum states and discuss the complexity of sampling from the probability distribution at the output.

arXiv:1408.3712•Physical Review Letters•Feb 11, 2015•99 citations

Efficient classical algorithm for estimating linear statistics of Boson Sampling

Benoit Seron, Hugo Thomas, Eduardo Araujo +3 more

Boson Sampling is a prominent candidate for the demonstration of quantum computational advantage but it remains unclear whether a large-scale boson sampler can find useful computational applications. The challenge is that to use a boson sampler to estimate, for example, a physical observable, it is necessary to coarse grain the outcome distribution, owing to the exponential size of the outcome space and the anti-concentration properties of the Boson Sampling distribution. In this work, we analyse the complexity of a specific type of coarse-graining of Boson Sampling distributions based on linear functions of the output photon occupation numbers, which we refer to as linear statistics. We present an efficient classical algorithm for approximating linear statistics of boson samplers within additive error for different kinds of input states, such as Fock states and squeezed states. This allows us to unify in the same framework recent results on efficient quantum-inspired classical algorithms for simulating molecular vibronic spectra, or efficient classical approximations of coarse-grained distributions based on detector binning. Additionally, we show how our algorithm can be used to classically evaluate a proposed one-way function based on Boson Sampling, while other proposals for cryptographic applications escape our classical simulation techniques. We leave open the question of classical simulability of non-linear statistics and connect it to the problem of computing transition amplitudes of linear-optical circuits with one layer of interactions.

quant-pharXiv:2609.35447•Sep 29, 2026•3 citations

BosonSampling with lost photons

Scott Aaronson, Daniel J. Brod

BosonSampling is an intermediate model of quantum computation where linear-optical networks are used to solve sampling problems expected to be hard for classical computers. Since these devices are not expected to be universal for quantum computation, it remains an open question of whether any error-correction techniques can be applied to them, and thus it is important to investigate how robust the model is under natural experimental imperfections, such as losses and imperfect control of parameters. Here, we investigate the complexity of BosonSampling under photon losses, more specifically, the case where an unknown subset of the photons is randomly lost at the sources. We show that if $k$ out of $n$ photons are lost, then we cannot sample classically from a distribution that is $1/{n}^{\mathrm{\ensuremath{\Theta}}(k)}$ close (in total variation distance) to the ideal distribution, unless a ${\text{BPP}}^{\text{NP}}$ machine can estimate the permanents of Gaussian matrices in ${n}^{O(k)}$ time. In particular, if $k$ is constant, this implies that simulating lossy BosonSampling is hard for a classical computer, under exactly the same complexity assumption used for the original lossless case.

arXiv:1510.05245•Physical Review A•Jan 21, 2016•88 citations

BosonSampling is far from uniform

Scott Aaronson, Alex Arkhipov

BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. \ In a recent manuscript, Gogolin et al.\ claimed that even an ideal BosonSampling device's output would be operationally indistinguishable\textquotedblright\ from a uniform random outcome, at least \textquotedblleft without detailed a priori knowledge; or at any rate, that telling the two apart might itself be a hard problem. We first answer these claims---explaining why the first is based on a definition of a priori knowledge such that, were it adopted, almost no quantum algorithm could be distinguished from a pure random-number source; while the second is neither new nor a practical obstacle to interesting BosonSampling experiments.However, we then go further, and address some interesting research questions inspired by Gogolin et al.'s arguments. We prove that, with high probability over a Haar-random matrix $A$, the BosonSampling distribution induced by $A$ is far from the uniform distribution in total variation distance. More surprisingly, and counter to Gogolin et al., we give an efficient algorithm that distinguishes these two distributions with constant bias. Finally, we offer three bonus results about BosonSampling. First, we report an observation of Fernando Brandao: that one can efficiently sample a distribution that has large entropy and that's indistinguishable from a BosonSampling distribution by any circuit of fixed polynomial size. Second, we show that BosonSampling distributions can be efficiently distinguished from uniform even with photon losses and for general initial states. Third, we offer the simplest known proof that Fermion Sampling is solvable in classical polynomial time, and we reuse techniques from our Boson Sampling analysis to characterize random FermionSampling distributions.

arXiv:1309.7460•Quantum Information and Computation•Nov 1, 2014•175 citations

Threshold and Parity BosonSampling in the Linear-Mode Regime

Byeongseon Go, Hyunseok Jeong, Changhun Oh

BosonSampling is among the most prominent candidates for demonstrating quantum advantage. However, while the hardness of BosonSampling relies on photon-number-resolving detection, many experimentally relevant settings and applications instead use binary readout based on threshold or parity measurements, whose computational complexity has not yet been rigorously characterized. In this work, we investigate the computational complexity of BosonSampling with threshold and parity measurements in the linear-mode regime, where the number of modes scales linearly with the number of photons and is most relevant to current experiments. In particular, we establish average-case #P-hardness of estimating typical output probabilities in threshold and parity BosonSampling, a crucial ingredient in proving the classical hardness of the corresponding sampling problems. The resulting imprecision bounds match those obtained in prior hardness results for standard photon-number-resolving BosonSampling in the linear-mode regime. The key technical ingredient is a Fourier-coefficient extraction method, induced by coherent beam-splitter rotations, that extracts hidden hard components within coarse-grained output probabilities. These results indicate that the hard output-probability structure of photon-number-resolving BosonSampling can persist under natural binary coarse-grainings, even in collision-dominant regimes.

quant-pharXiv:2608.24008•Aug 26, 2026•1 citation
BosonSampling is a problem of sampling events according to the transition probabilities of indistinguishable photons in a linear optical network. Computational hardness of BosonSampling depends on photon-number statistics of the input light. BosonSampling with multi-photon Fock states at the input is believed to be classically intractable but there exists an efficient classical algorithm for classical input states. In this paper, we present a mathematical connection between BosonSampling with quantum and classical light inputs. Specifically, we show that the generating function of a transition probability for Fock-state BosonSampling (FBS) can be expressed as a transition probability of thermal-light inputs. The closed-form expression of a thermal-light transition probability allows all possible transition probabilities of FBS to be obtained by calculating a single matrix permanent. Moreover, the transition probability of FBS is shown to be expressed as an integral involving a Gaussian function multiplied by a Laguerre polynomial, resulting in a fast oscillating integrand. Our work sheds new light on computational hardness of FBS by identifying the mathematical connection between BosonSampling with quantum and classical light.
Boson sampling is a specific quantum computation, which is likely hard to implement efficiently on a classical computer. The task is to sample the output photon-number distribution of a linear-optical interferometric network, which is fed with single-photon Fock-state inputs. A question that has been asked is if the sampling problems associated with any other input quantum states of light (other than the Fock states) to a linear-optical network and suitable output detection strategies are also of similar computational complexity as boson sampling. We consider the states that differ from the Fock states by a displacement operation, namely the displaced Fock states and the photon-added coherent states. It is easy to show that the sampling problem associated with displaced single-photon Fock states and a displaced photon-number detection scheme is in the same complexity class as boson sampling for all values of displacement. On the other hand, we show that the sampling problem associated with single-photon-added coherent states and the same displaced photon-number detection scheme demonstrates a computational-complexity transition. It transitions from being just as hard as boson sampling when the input coherent amplitudes are sufficiently small to a classically simulatable problem in the limit of large coherent amplitudes.
Considering the problem of sampling from the output photon-counting probability distribution of a linear-optical network for input Gaussian states, we obtain results that are of interest from both quantum theory and the computational complexity theory point of view. We derive a general formula for calculating the output probabilities, and by considering input thermal states, we show that the output probabilities are proportional to permanents of positive-semidefinite Hermitian matrices. It is believed that approximating permanents of complex matrices in general is a #P-hard problem. However, we show that these permanents can be approximated with an algorithm in the BPP^{NP} complexity class, as there exists an efficient classical algorithm for sampling from the output probability distribution. We further consider input squeezed-vacuum states and discuss the complexity of sampling from the probability distribution at the output.
Boson Sampling is a prominent candidate for the demonstration of quantum computational advantage but it remains unclear whether a large-scale boson sampler can find useful computational applications. The challenge is that to use a boson sampler to estimate, for example, a physical observable, it is necessary to coarse grain the outcome distribution, owing to the exponential size of the outcome space and the anti-concentration properties of the Boson Sampling distribution. In this work, we analyse the complexity of a specific type of coarse-graining of Boson Sampling distributions based on linear functions of the output photon occupation numbers, which we refer to as linear statistics. We present an efficient classical algorithm for approximating linear statistics of boson samplers within additive error for different kinds of input states, such as Fock states and squeezed states. This allows us to unify in the same framework recent results on efficient quantum-inspired classical algorithms for simulating molecular vibronic spectra, or efficient classical approximations of coarse-grained distributions based on detector binning. Additionally, we show how our algorithm can be used to classically evaluate a proposed one-way function based on Boson Sampling, while other proposals for cryptographic applications escape our classical simulation techniques. We leave open the question of classical simulability of non-linear statistics and connect it to the problem of computing transition amplitudes of linear-optical circuits with one layer of interactions.
BosonSampling is an intermediate model of quantum computation where linear-optical networks are used to solve sampling problems expected to be hard for classical computers. Since these devices are not expected to be universal for quantum computation, it remains an open question of whether any error-correction techniques can be applied to them, and thus it is important to investigate how robust the model is under natural experimental imperfections, such as losses and imperfect control of parameters. Here, we investigate the complexity of BosonSampling under photon losses, more specifically, the case where an unknown subset of the photons is randomly lost at the sources. We show that if kkk out of nnn photons are lost, then we cannot sample classically from a distribution that is $1/{n}^{\mathrm{\ensuremath{\Theta}}(k)}$ close (in total variation distance) to the ideal distribution, unless a BPPNP{\text{BPP}}^{\text{NP}}BPPNP machine can estimate the permanents of Gaussian matrices in nO(k){n}^{O(k)}nO(k) time. In particular, if kkk is constant, this implies that simulating lossy BosonSampling is hard for a classical computer, under exactly the same complexity assumption used for the original lossless case.
BosonSampling, which we proposed three years ago, is a scheme for using linear-optical networks to solve sampling problems that appear to be intractable for a classical computer. \ In a recent manuscript, Gogolin et al.\ claimed that even an ideal BosonSampling device's output would be operationally indistinguishable\textquotedblright\ from a uniform random outcome, at least \textquotedblleft without detailed a priori knowledge; or at any rate, that telling the two apart might itself be a hard problem. We first answer these claims---explaining why the first is based on a definition of a priori knowledge such that, were it adopted, almost no quantum algorithm could be distinguished from a pure random-number source; while the second is neither new nor a practical obstacle to interesting BosonSampling experiments.However, we then go further, and address some interesting research questions inspired by Gogolin et al.'s arguments. We prove that, with high probability over a Haar-random matrix AAA, the BosonSampling distribution induced by AAA is far from the uniform distribution in total variation distance. More surprisingly, and counter to Gogolin et al., we give an efficient algorithm that distinguishes these two distributions with constant bias. Finally, we offer three bonus results about BosonSampling. First, we report an observation of Fernando Brandao: that one can efficiently sample a distribution that has large entropy and that's indistinguishable from a BosonSampling distribution by any circuit of fixed polynomial size. Second, we show that BosonSampling distributions can be efficiently distinguished from uniform even with photon losses and for general initial states. Third, we offer the simplest known proof that Fermion Sampling is solvable in classical polynomial time, and we reuse techniques from our Boson Sampling analysis to characterize random FermionSampling distributions.
BosonSampling is among the most prominent candidates for demonstrating quantum advantage. However, while the hardness of BosonSampling relies on photon-number-resolving detection, many experimentally relevant settings and applications instead use binary readout based on threshold or parity measurements, whose computational complexity has not yet been rigorously characterized. In this work, we investigate the computational complexity of BosonSampling with threshold and parity measurements in the linear-mode regime, where the number of modes scales linearly with the number of photons and is most relevant to current experiments. In particular, we establish average-case #P-hardness of estimating typical output probabilities in threshold and parity BosonSampling, a crucial ingredient in proving the classical hardness of the corresponding sampling problems. The resulting imprecision bounds match those obtained in prior hardness results for standard photon-number-resolving BosonSampling in the linear-mode regime. The key technical ingredient is a Fourier-coefficient extraction method, induced by coherent beam-splitter rotations, that extracts hidden hard components within coarse-grained output probabilities. These results indicate that the hard output-probability structure of photon-number-resolving BosonSampling can persist under natural binary coarse-grainings, even in collision-dominant regimes.