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:1410.3979 · Physical Review A

Boson sampling with photons of arbitrary spectral structure

Peter P. Rohde

Published Jan 8, 2015• 33 citations
arXivHTMLPDF

Abstract

Boson sampling has attracted much interest as a simplified approach to implementing a subset of optical quantum computing. Boson sampling requires indistinguishable photons, but far fewer of them than universal optical quantum computing architectures. In reality, photons are never indistinguishable, and exhibit a rich spectral structure. Here we consider the operation of boson sampling with photons of arbitrary spectral structure and relate the sampling statistics of the device to matrix permanents. This sheds light on the computational complexity of different regimes of the photons' spectral characteristics, and provides very general results for the operation of linear optics interferometers in the presence of partially distinguishable photons. Our results apply to both the cases of spectrally resolving and nonspectrally resolving detectors.

DOI
10.1103/physreva.91.012307

Related papers

Quantum simulation of partially distinguishable boson sampling

Alexandra E. Moylett, Peter S. Turner

Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational complexity conjectures, in general the problem is difficult to solve classically, motivating optical experiments aimed at demonstrating quantum computational ``supremacy.'' There are a number of challenges faced by such experiments, including the generation of indistinguishable single photons. We provide a quantum circuit that simulates Boson Sampling with arbitrarily distinguishable particles. This makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model, allowing insight to be gained. At the heart of the circuit is the quantum Schur transform, which follows from a representation theoretic approach to the physics of distinguishable particles in first quantization. The techniques are quite general and have application beyond Boson Sampling.

arXiv:1803.03657•Physical Review A•Jun 20, 2018•22 citations

Classically simulating near-term partially-distinguishable and lossy boson sampling

Alexandra E. Moylett, Raúl García−Patrón, Jelmer J Renema +1 more

Abstract Boson sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantum computation which is believed to be feasible in the near term and cannot be simulated on a classical machine. Like all purported demonstrations of ‘quantum computational supremacy’, this motivates optimising classical simulation schemes for a realistic model of the problem, in this case boson sampling when the implementations experience lost or distinguishable photons. Although current simulation schemes for sufficiently imperfect boson sampling are classically efficient, in principle the polynomial runtime can be infeasibly large. In this work, we develop a scheme for classical simulation of boson sampling under uniform distinguishability and loss, based on the idea of sampling from distributions where at most k photons are indistinguishable. We show that asymptotically this scheme can provide a polynomial improvement in the runtime compared to classically simulating idealised boson sampling. More significantly, we show that in the regime considered experimentally relevant, our approach gives an substantial improvement in runtime over other classical simulation approaches.

arXiv:1907.00022•Quantum Science and Technology•Nov 7, 2019•32 citations

Efficient Classical Algorithm for Boson Sampling with Partially Distinguishable Photons

Jelmer J. Renema, Adrian J. Menssen, William R. Clements +3 more

We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed with photons of partial distinguishability. We find conditions for which this algorithm is efficient, which gives a lower limit on the required indistinguishability to demonstrate a quantum advantage. Under these conditions, adding more photons only polynomially increases the computational cost to simulate a boson sampling experiment.

arXiv:1707.02793•Physical Review Letters•May 30, 2018•111 citations

Scaling of boson sampling experiments

P. D. Drummond, Bogdan Opanchuk, L. Rosales-Zárate +2 more

Boson sampling is the problem of generating a multiphoton state whose counting probability is the permanent of an $n\ifmmode\times\else\texttimes\fi{}n$ matrix. This is created as the output $n$-photon coincidence rate of a prototype quantum computing device with $n$ input photons. It is a fundamental challenge to verify boson sampling, and therefore the question of how output count rates scale with matrix size $n$ is crucial. Here we apply results from random matrix theory as well as the characteristic function approach from quantum optics to establish analytical scaling laws for average count rates. We treat boson sampling experiments with arbitrary inputs, outputs, and losses. Using the scaling laws we analyze grouping of channel outputs and the count rates for this case.

arXiv:1605.05796•Physical Review A•Oct 24, 2016•14 citations

Partial indistinguishability theory for multiphoton experiments in multiport devices

V. S. Shchesnovich

We generalize an approach for description of multiphoton experiments with multiport unitary linear optical devices, started in Phys. Rev. A 89, 022333 (2014) with single photons in mixed spectral states, to arbitrary (multiphoton) input and arbitrary photon detectors. We show that output probabilities are always given in terms of the matrix permanents of the Hadamard product of a matrix built from the network matrix and matrices built from the spectral state of photons and spectral sensitivities of detectors. Moreover, in the case of input with up to one photon per mode, the output probabilities are given by a sum (or integral) with each term being the absolute value squared of such a matrix permanent. We conjecture that, for an arbitrary multiphoton input, zero output probability of an output configuration is always the result of an exact cancellation of quantum transition amplitudes of completely indistinguishable photons (a subset of all input photons) and, moreover, is independent of coherence between only partially indistinguishable photons. The conjecture is supported by examples. Furthermore, we propose a measure of partial indistinguishability of photons which generalizes Mandel's observation, and find the law of degradation of quantum coherence in a realistic boson-sampling device with increase of the total number of photons and/or their ``classicality parameter.''

arXiv:1410.1506•Physical Review A•Jan 29, 2015•111 citations

Photonic implementation of boson sampling: a review

Daniel J. Brod, Ernesto F. Galvão, Andrea Crespi +3 more

Boson sampling is a computational problem that has recently been proposed as a candidate to obtain an unequivocal quantum computational advantage. The problem consists in sampling from the output distribution of indistinguishable bosons in a linear interferometer. There is strong evidence that such an experiment is hard to classically simulate, but it is naturally solved by dedicated photonic quantum hardware, comprising single photons, linear evolution, and photodetection. This prospect has stimulated much effort resulting in the experimental implementation of progressively larger devices. We review recent advances in photonic boson sampling, describing both the technological improvements achieved and the future challenges. We also discuss recent proposals and implementations of variants of the original problem, theoretical issues occurring when imperfections are considered, and advances in the development of suitable techniques for validation of boson sampling experiments. We conclude by discussing the future application of photonic boson sampling devices beyond the original theoretical scope.

Advanced Photonics•May 9, 2019•160 citations
Boson sampling has attracted much interest as a simplified approach to implementing a subset of optical quantum computing. Boson sampling requires indistinguishable photons, but far fewer of them than universal optical quantum computing architectures. In reality, photons are never indistinguishable, and exhibit a rich spectral structure. Here we consider the operation of boson sampling with photons of arbitrary spectral structure and relate the sampling statistics of the device to matrix permanents. This sheds light on the computational complexity of different regimes of the photons' spectral characteristics, and provides very general results for the operation of linear optics interferometers in the presence of partially distinguishable photons. Our results apply to both the cases of spectrally resolving and nonspectrally resolving detectors.
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational complexity conjectures, in general the problem is difficult to solve classically, motivating optical experiments aimed at demonstrating quantum computational ``supremacy.'' There are a number of challenges faced by such experiments, including the generation of indistinguishable single photons. We provide a quantum circuit that simulates Boson Sampling with arbitrarily distinguishable particles. This makes clear how distinguishabililty leads to decoherence in the standard quantum circuit model, allowing insight to be gained. At the heart of the circuit is the quantum Schur transform, which follows from a representation theoretic approach to the physics of distinguishable particles in first quantization. The techniques are quite general and have application beyond Boson Sampling.
Abstract Boson sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantum computation which is believed to be feasible in the near term and cannot be simulated on a classical machine. Like all purported demonstrations of ‘quantum computational supremacy’, this motivates optimising classical simulation schemes for a realistic model of the problem, in this case boson sampling when the implementations experience lost or distinguishable photons. Although current simulation schemes for sufficiently imperfect boson sampling are classically efficient, in principle the polynomial runtime can be infeasibly large. In this work, we develop a scheme for classical simulation of boson sampling under uniform distinguishability and loss, based on the idea of sampling from distributions where at most k photons are indistinguishable. We show that asymptotically this scheme can provide a polynomial improvement in the runtime compared to classically simulating idealised boson sampling. More significantly, we show that in the regime considered experimentally relevant, our approach gives an substantial improvement in runtime over other classical simulation approaches.
We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed with photons of partial distinguishability. We find conditions for which this algorithm is efficient, which gives a lower limit on the required indistinguishability to demonstrate a quantum advantage. Under these conditions, adding more photons only polynomially increases the computational cost to simulate a boson sampling experiment.
Boson sampling is the problem of generating a multiphoton state whose counting probability is the permanent of an $n\ifmmode\times\else\texttimes\fi{}n$ matrix. This is created as the output nnn-photon coincidence rate of a prototype quantum computing device with nnn input photons. It is a fundamental challenge to verify boson sampling, and therefore the question of how output count rates scale with matrix size nnn is crucial. Here we apply results from random matrix theory as well as the characteristic function approach from quantum optics to establish analytical scaling laws for average count rates. We treat boson sampling experiments with arbitrary inputs, outputs, and losses. Using the scaling laws we analyze grouping of channel outputs and the count rates for this case.
We generalize an approach for description of multiphoton experiments with multiport unitary linear optical devices, started in Phys. Rev. A 89, 022333 (2014) with single photons in mixed spectral states, to arbitrary (multiphoton) input and arbitrary photon detectors. We show that output probabilities are always given in terms of the matrix permanents of the Hadamard product of a matrix built from the network matrix and matrices built from the spectral state of photons and spectral sensitivities of detectors. Moreover, in the case of input with up to one photon per mode, the output probabilities are given by a sum (or integral) with each term being the absolute value squared of such a matrix permanent. We conjecture that, for an arbitrary multiphoton input, zero output probability of an output configuration is always the result of an exact cancellation of quantum transition amplitudes of completely indistinguishable photons (a subset of all input photons) and, moreover, is independent of coherence between only partially indistinguishable photons. The conjecture is supported by examples. Furthermore, we propose a measure of partial indistinguishability of photons which generalizes Mandel's observation, and find the law of degradation of quantum coherence in a realistic boson-sampling device with increase of the total number of photons and/or their ``classicality parameter.''
Boson sampling is a computational problem that has recently been proposed as a candidate to obtain an unequivocal quantum computational advantage. The problem consists in sampling from the output distribution of indistinguishable bosons in a linear interferometer. There is strong evidence that such an experiment is hard to classically simulate, but it is naturally solved by dedicated photonic quantum hardware, comprising single photons, linear evolution, and photodetection. This prospect has stimulated much effort resulting in the experimental implementation of progressively larger devices. We review recent advances in photonic boson sampling, describing both the technological improvements achieved and the future challenges. We also discuss recent proposals and implementations of variants of the original problem, theoretical issues occurring when imperfections are considered, and advances in the development of suitable techniques for validation of boson sampling experiments. We conclude by discussing the future application of photonic boson sampling devices beyond the original theoretical scope.