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.7687 · Physical Review A

Sampling of partially distinguishable bosons and the relation to the multidimensional permanent

Malte C. Tichy

Published Feb 17, 2015• 133 citations
arXivHTMLPDF

Abstract

The generalization of the so-called ``boson-sampling problem'' of interference of bosons propagating through a multimode network to the case of partially distinguishable bosons is presented, and a quantitative measure for the interference capability of a given system is introduced.
DOI
10.1103/physreva.91.022316

Related papers

Partially distinguishable Boson-Sampling and the multi-dimensional permanent

Malte C. Tichy

The collective interference of partially distinguishable bosons in multi-mode networks is studied via double-sided Feynman diagrams. The probability for many-body scattering events becomes a multi-dimensional tensor-permanent, which interpolates between distinguishable particles and identical bosons, and easily extends to mixed initial states. The permanent of the distinguishability matrix, composed of all mutual scalar products of the single-particle mode-functions, emerges as a natural measure for the degree of interference: It yields a bound on the difference between event probabilities for partially distinguishable bosons and the idealized species, and exactly quantifies the degree of bosonic bunching.

•Oct 28, 2014•0 citations

Efficient classical algorithm for simulating boson sampling with heterogeneous partial distinguishability

S. N. van den Hoven, Kanis, E., Jelmer J. Renema

Boson sampling is one of the leading protocols for demonstrating a quantum advantage, but the theory of how this protocol responds to noise is still incomplete. We extend the theory of classical simulation of boson sampling with partial distinguishability to the case where the degree of indistinguishability between photon pairs is different between different pairs.

arXiv:2406.17682•Jun 25, 2024•1 citation

Efficient classical algorithm for simulating boson sampling with heterogeneous partial distinguishability

S. N. van den Hoven, E. Kanis, Jelmer J. Renema

Boson sampling is one of the leading protocols for demonstrating a quantum advantage, but the theory of how this protocol responds to noise is still incomplete. We extend the theory of classical simulation of boson sampling with partial distinguishability to the case where the degree of indistinguishability between photon pairs is different between different pairs.

Physical Review A•May 28, 2025•4 citations

Reaching Quantum Supremacy with a Boson Sampling Experiment

Ludovico Latmiral

Boson Sampling represents a promising witness of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called Permanent-of-Gaussians Conjecture and has been extended to some generalizations such as scattershot Boson Sampling, approximate and lossy sampling under some reasonable constraints. However, it is still unclear how demanding these bounds are for a quantum experimental sampler. Starting from a state of the art analysis and focusing on the foreseeable practical conditions needed to reach quantum supremacy, we look at different techniques and present a more general and effective solution. We apply our approach to both the experimental suggestions presented to date and we eventually find in both cases a new threshold that is less error sensitive and experimentally more feasible.

arXiv:1511.08161•Nov 25, 2015•0 citations

Boson sampling with photons of arbitrary spectral structure

Peter P. Rohde

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.

arXiv:1410.3979•Physical Review A•Jan 8, 2015•33 citations

Partial distinguishability as a coherence resource in boson sampling

Seungbeom Chin, Joonsuk Huh

arXiv:1807.11187•Quantum Information Processing•Dec 5, 2019•4 citations
The collective interference of partially distinguishable bosons in multi-mode networks is studied via double-sided Feynman diagrams. The probability for many-body scattering events becomes a multi-dimensional tensor-permanent, which interpolates between distinguishable particles and identical bosons, and easily extends to mixed initial states. The permanent of the distinguishability matrix, composed of all mutual scalar products of the single-particle mode-functions, emerges as a natural measure for the degree of interference: It yields a bound on the difference between event probabilities for partially distinguishable bosons and the idealized species, and exactly quantifies the degree of bosonic bunching.
Boson Sampling represents a promising witness of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called Permanent-of-Gaussians Conjecture and has been extended to some generalizations such as scattershot Boson Sampling, approximate and lossy sampling under some reasonable constraints. However, it is still unclear how demanding these bounds are for a quantum experimental sampler. Starting from a state of the art analysis and focusing on the foreseeable practical conditions needed to reach quantum supremacy, we look at different techniques and present a more general and effective solution. We apply our approach to both the experimental suggestions presented to date and we eventually find in both cases a new threshold that is less error sensitive and experimentally more feasible.
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.