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

Quantum Science and Technology / Validating multi-photon quantum interference with finite data

Fulvio Flamini, Mattia Walschaers, Nicolò Spagnolo, Nathan Wiebe, Andreas Buchleitner, Fabio Sciarrino

Published Jan 1, 2020• 9 citations
Publisher

Abstract

Multi-particle interference is a key resource for quantum information processing, as exemplified by Boson Sampling. Hence, given its fragile nature, an essential desideratum is a solid and reliable framework for its validation. However, while several protocols have been introduced to this end, the approach is still fragmented and fails to build a big picture for future developments. In this work, we propose an operational approach to validation that encompasses and strengthens the state of the art for these protocols. To this end, we consider the Bayesian hypothesis testing and the statistical benchmark as most favorable protocols for small- and large-scale applications, respectively. We numerically investigate their operation with finite sample size, extending previous tests to larger dimensions, and against two adversarial algorithms for classical simulation: the mean-field sampler and the metropolized independent sampler. To evidence the actual need for refined validation techniques, we show how the assessment of numerically simulated data depends on the available sample size, as well as on the internal hyper-parameters and other practically relevant constraints. Our analyses provide general insights into the challenge of validation, and can inspire the design of algorithms with a measurable quantum advantage.

DOI
10.1088/2058-9565/aba03a

Related papers

Validating multi-photon quantum interference with finite data

Fulvio Flamini, Mattia Walschaers, Nicolò Spagnolo +3 more

Abstract Multi-particle interference is a key resource for quantum information processing, as exemplified by Boson Sampling. Hence, given its fragile nature, an essential desideratum is a solid and reliable framework for its validation. However, while several protocols have been introduced to this end, the approach is still fragmented and fails to build a big picture for future developments. In this work, we propose an operational approach to validation that encompasses and strengthens the state of the art for these protocols. To this end, we consider the Bayesian hypothesis testing and the statistical benchmark as most favorable protocols for small- and large-scale applications, respectively. We numerically investigate their operation with finite sample size, extending previous tests to larger dimensions, and against two adversarial algorithms for classical simulation: the mean-field sampler and the metropolized independent sampler. To evidence the actual need for refined validation techniques, we show how the assessment of numerically simulated data depends on the available sample size, as well as on the internal hyper-parameters and other practically relevant constraints. Our analyses provide general insights into the challenge of validation, and can inspire the design of algorithms with a measurable quantum advantage.

arXiv:1904.12318•Quantum Science and Technology•Jun 25, 2020•0 citations

Signature of multi-photon interference in boson sampling experiments

Taira Giordani, Fulvio Flamini, Matteo Pompili +8 more

The progressive development of quantum technologies in many areas, ranging from investigation on foundamentals of quantum of mechanics to quantum information and computation, has increased the interest on those problems that can exhibit a quantum advantage. The Boson Sampling problem is a clear example where traditional computers fail in the task of sampling from the distribution of n indistinguishable photons after a propagation in a m-mode optical interferometer. In this context, in the absence of classical algorithms able to simulate efficiently multi-photon interference, the validation of Boson Sampling is still an open problem. Here we investigate a novel approach to Boson Sampling validation based on statistical properties of correlation functions. In particular we discuss its feasibility in actual proof-of-principle experiments. Furthermore we provide an extensive study of the physical resources required to validate experiments, investigating also the role of bosonic bunching in high-dimensional applications. Our investigation confirms the goodness of the validation protocol, paving the way to use this toolbox for the validation of Boson Sampling devices.

Quantum Photonic Devices•Sep 11, 2018•0 citations

Requirements for the validation of a quantum advantage in Boson Sampling

Fulvio Flamini, Mattia Walschaers, Nicolò Spagnolo +3 more

Quantum algorithms provide advantages for specific computational and sampling tasks, though little attention has so far been dedicated to the validation of the output of experimental implementations of such algorithms. In this work we address this issue for the Boson Sampling problem, and propose an operational definition of validation. To evidence the actual need for refined validation techniques, we examine two recent protocols: Metropolized independent sampling, to classically simulate Boson Sampling, and a statistical benchmark to validate quantum interference. We show how the acceptance or rejection of numerically simulated data depends on the available sample size, as well as on the internal hyper-parameters and other practically relevant constraints. Our analysis provides general insights into the challenge of validation, and may inspire further research into the design of algorithms with a measurable quantum advantage.

•Apr 28, 2019•0 citations

Sample space filling analysis for boson sampling validation

A. A. Mazanik, A. N. Rubtsov

Achieving a quantum computational advantage regime, and thus providing evidence against the extended Church-Turing thesis, remains one of the key challenges of modern science. Boson sampling seems to be a very promising platform in this regard, but to be confident of attaining the advantage regime, one must provide evidence of operating with a correct boson sampling distribution, rather than with a pathological classically simulatable one. This problem is often called the validation problem, and it poses a major challenge to demonstrating unambiguous quantum advantage. In this work, using the recently proposed wave function network approach, we study the sample space filling behavior with increasing the number of collected samples. We show that due to the intrinsic nature of the boson sampling wave function, its filling behavior can be computationally efficiently distinguished from classically simulated cases. Therefore, we propose a new validation protocol based on the sample space filling analysis and test it for problems of up to $20$ photons injected into a $400$-mode interferometer. Due to its simplicity and computational efficiency, it can be used among other protocols to validate future experiments to provide more convincing results.

arXiv:2411.14076•Nov 21, 2024•0 citations

Benchmarking Bayesian quantum estimation

Valeria Cimini, Emanuele Polino, Mauro Valeri +2 more

Abstract The quest for precision in parameter estimation is a fundamental task in different scientific areas. The relevance of this problem thus provided the motivation to develop methods for the application of quantum resources to estimation protocols. Within this context, Bayesian estimation offers a complete framework for optimal quantum metrology techniques, such as adaptive protocols. However, the use of the Bayesian approach requires extensive computational resources, especially in the multiparameter estimations that represent the typical operational scenario for quantum sensors. Hence, the requirement to characterize protocols implementing Bayesian estimations can become a significant challenge. This work focuses on the crucial task of robustly benchmarking the performances of these protocols in both single and multiple-parameter scenarios. By comparing different figures of merits, evidence is provided in favor of using the median of the quadratic error in the estimations in order to mitigate spurious effects due to the numerical discretization of the parameter space, the presence of limited data, and numerical instabilities. These results, providing a robust and reliable characterization of Bayesian protocols, find natural applications to practical problems within the quantum estimation framework.

arXiv:2401.14900•Quantum Science and Technology•May 8, 2024•10 citations

Exponential improvement in benchmarking multiphoton interference

Rodrigo M. Sanz, Emilio Annoni, Stephen C. Wein +4 more

Several photonic quantum technologies rely on the ability to generate multiple indistinguishable photons. Benchmarking the level of indistinguishability of these photons is essential for scalability. The Hong-Ou-Mandel dip provides a benchmark for the indistinguishability between two photons, and extending this test to the multi-photon setting has so far resulted in a protocol that computes the genuine n-photon indistinguishability (GI). However, this protocol has a sample complexity that increases exponentially with the number of input photons for an estimation of GI up to a given additive error. To address this problem, we introduce new theorems that strengthen our understanding of the relationship between distinguishability and the suppression laws of the quantum Fourier transform interferometer (QFT). Building on this, we propose a protocol using the QFT for benchmarking GI that achieves constant sample complexity for the estimation of GI up to a given additive error for prime photon numbers, and sub-polynomial scaling otherwise, representing an exponential improvement over the state of the art. We prove the optimality of our protocol in many relevant scenarios and validate our approach experimentally on Quandela's reconfigurable photonic quantum processor, where we observe a clear advantage in runtime and precision over the state of the art. We therefore establish the first scalable method for computing multi-photon indistinguishability, which applies naturally to current and near-term photonic quantum hardware.

quant-pharXiv:2601.10289•Jan 16, 2026•0 citations
Multi-particle interference is a key resource for quantum information processing, as exemplified by Boson Sampling. Hence, given its fragile nature, an essential desideratum is a solid and reliable framework for its validation. However, while several protocols have been introduced to this end, the approach is still fragmented and fails to build a big picture for future developments. In this work, we propose an operational approach to validation that encompasses and strengthens the state of the art for these protocols. To this end, we consider the Bayesian hypothesis testing and the statistical benchmark as most favorable protocols for small- and large-scale applications, respectively. We numerically investigate their operation with finite sample size, extending previous tests to larger dimensions, and against two adversarial algorithms for classical simulation: the mean-field sampler and the metropolized independent sampler. To evidence the actual need for refined validation techniques, we show how the assessment of numerically simulated data depends on the available sample size, as well as on the internal hyper-parameters and other practically relevant constraints. Our analyses provide general insights into the challenge of validation, and can inspire the design of algorithms with a measurable quantum advantage.
Abstract Multi-particle interference is a key resource for quantum information processing, as exemplified by Boson Sampling. Hence, given its fragile nature, an essential desideratum is a solid and reliable framework for its validation. However, while several protocols have been introduced to this end, the approach is still fragmented and fails to build a big picture for future developments. In this work, we propose an operational approach to validation that encompasses and strengthens the state of the art for these protocols. To this end, we consider the Bayesian hypothesis testing and the statistical benchmark as most favorable protocols for small- and large-scale applications, respectively. We numerically investigate their operation with finite sample size, extending previous tests to larger dimensions, and against two adversarial algorithms for classical simulation: the mean-field sampler and the metropolized independent sampler. To evidence the actual need for refined validation techniques, we show how the assessment of numerically simulated data depends on the available sample size, as well as on the internal hyper-parameters and other practically relevant constraints. Our analyses provide general insights into the challenge of validation, and can inspire the design of algorithms with a measurable quantum advantage.
The progressive development of quantum technologies in many areas, ranging from investigation on foundamentals of quantum of mechanics to quantum information and computation, has increased the interest on those problems that can exhibit a quantum advantage. The Boson Sampling problem is a clear example where traditional computers fail in the task of sampling from the distribution of n indistinguishable photons after a propagation in a m-mode optical interferometer. In this context, in the absence of classical algorithms able to simulate efficiently multi-photon interference, the validation of Boson Sampling is still an open problem. Here we investigate a novel approach to Boson Sampling validation based on statistical properties of correlation functions. In particular we discuss its feasibility in actual proof-of-principle experiments. Furthermore we provide an extensive study of the physical resources required to validate experiments, investigating also the role of bosonic bunching in high-dimensional applications. Our investigation confirms the goodness of the validation protocol, paving the way to use this toolbox for the validation of Boson Sampling devices.
Quantum algorithms provide advantages for specific computational and sampling tasks, though little attention has so far been dedicated to the validation of the output of experimental implementations of such algorithms. In this work we address this issue for the Boson Sampling problem, and propose an operational definition of validation. To evidence the actual need for refined validation techniques, we examine two recent protocols: Metropolized independent sampling, to classically simulate Boson Sampling, and a statistical benchmark to validate quantum interference. We show how the acceptance or rejection of numerically simulated data depends on the available sample size, as well as on the internal hyper-parameters and other practically relevant constraints. Our analysis provides general insights into the challenge of validation, and may inspire further research into the design of algorithms with a measurable quantum advantage.
Achieving a quantum computational advantage regime, and thus providing evidence against the extended Church-Turing thesis, remains one of the key challenges of modern science. Boson sampling seems to be a very promising platform in this regard, but to be confident of attaining the advantage regime, one must provide evidence of operating with a correct boson sampling distribution, rather than with a pathological classically simulatable one. This problem is often called the validation problem, and it poses a major challenge to demonstrating unambiguous quantum advantage. In this work, using the recently proposed wave function network approach, we study the sample space filling behavior with increasing the number of collected samples. We show that due to the intrinsic nature of the boson sampling wave function, its filling behavior can be computationally efficiently distinguished from classically simulated cases. Therefore, we propose a new validation protocol based on the sample space filling analysis and test it for problems of up to 202020 photons injected into a 400400400-mode interferometer. Due to its simplicity and computational efficiency, it can be used among other protocols to validate future experiments to provide more convincing results.
Abstract The quest for precision in parameter estimation is a fundamental task in different scientific areas. The relevance of this problem thus provided the motivation to develop methods for the application of quantum resources to estimation protocols. Within this context, Bayesian estimation offers a complete framework for optimal quantum metrology techniques, such as adaptive protocols. However, the use of the Bayesian approach requires extensive computational resources, especially in the multiparameter estimations that represent the typical operational scenario for quantum sensors. Hence, the requirement to characterize protocols implementing Bayesian estimations can become a significant challenge. This work focuses on the crucial task of robustly benchmarking the performances of these protocols in both single and multiple-parameter scenarios. By comparing different figures of merits, evidence is provided in favor of using the median of the quadratic error in the estimations in order to mitigate spurious effects due to the numerical discretization of the parameter space, the presence of limited data, and numerical instabilities. These results, providing a robust and reliable characterization of Bayesian protocols, find natural applications to practical problems within the quantum estimation framework.
Several photonic quantum technologies rely on the ability to generate multiple indistinguishable photons. Benchmarking the level of indistinguishability of these photons is essential for scalability. The Hong-Ou-Mandel dip provides a benchmark for the indistinguishability between two photons, and extending this test to the multi-photon setting has so far resulted in a protocol that computes the genuine n-photon indistinguishability (GI). However, this protocol has a sample complexity that increases exponentially with the number of input photons for an estimation of GI up to a given additive error. To address this problem, we introduce new theorems that strengthen our understanding of the relationship between distinguishability and the suppression laws of the quantum Fourier transform interferometer (QFT). Building on this, we propose a protocol using the QFT for benchmarking GI that achieves constant sample complexity for the estimation of GI up to a given additive error for prime photon numbers, and sub-polynomial scaling otherwise, representing an exponential improvement over the state of the art. We prove the optimality of our protocol in many relevant scenarios and validate our approach experimentally on Quandela's reconfigurable photonic quantum processor, where we observe a clear advantage in runtime and precision over the state of the art. We therefore establish the first scalable method for computing multi-photon indistinguishability, which applies naturally to current and near-term photonic quantum hardware.