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

American Journal of Physics

Experiments, prior probabilities, and experimental prior probabilities

S. Steenstrup

Published Dec 1, 1984• 3 citations
Publisher
DOI
10.1119/1.13748

Related papers

Conditional Probabilities and Measurements

CHRISTOF WETTERICH

Fundamental theories of physics•Jan 1, 2025•0 citations

Logical error estimation from syndrome data of surface-code experiments

Evangelia Takou, Cesar Benito, Arian Vezvaee +2 more

Decoders for quantum error correction (QEC) experiments rely on detector error models (DEMs), which encode, for each error, its probability and the detectors and logical observables it flips. Here we show that estimating DEM event probabilities from experimental syndromes is feasible, avoids independent device benchmarking, and produces useful decoder priors for estimating and reducing decoded logical error probabilities. We evaluate our methods using open-source data from surface-code memory experiments performed on Google's Willow chip, and we carry out analogous surface-code experiments on IBM's \texttt{ibm\_miami} processor. Despite the different physical error scales of the Google and IBM devices, in both cases our estimated DEMs improve logical error probabilities relative to baseline device-informed DEMs, typically at the $5\%-10\%$ level and with larger gains in some IBM cases, without additional calibration circuits, decoder fine-tuning, or supervised fitting to logical outcomes.

quant-pharXiv:2606.11496•Jun 11, 2026•6 citations

Exponential improvements to the average-case hardness of BosonSampling

Adam Bouland, Ishaun Datta, Bill Fefferman +1 more

BosonSampling and Random Circuit Sampling are important both as a theoretical tool for separating quantum and classical computation, and as an experimental means of demonstrating quantum speedups. Prior works have shown that average-case hardness of sampling follows from certain unproven conjectures about the hardness of computing output probabilities, such as the Permanent-of-Gaussians Conjecture (PGC), which states that $e^{-n \log n-n-O(\log n)}$ additive-error estimates to the output probability of most random BosonSampling experiments are #P-hard. Prior works have only shown weaker average-case hardness results that do not imply sampling hardness. Proving these conjectures has become a central question in quantum complexity. In this work, we show that $e^{-n \log n-n-O\left(n^{\delta}\right)}$ additive-error estimates to output probabilities of most random BosonSampling experiments are #P-hard for any $\delta\gt 0$, exponentially improving on prior work. In the process, we circumvent all known barrier results for proving PGC. The remaining hurdle to prove PGC is now “merely” to show that the $O\left(n^{\delta}\right)$ in the exponent can be improved to $O(\log n)$. We also obtain an analogous result for Random Circuit Sampling. We then show, for the first time, a hardness of average-case classical sampling result for BosonSampling, under an anticoncentration conjecture. Specifically, we prove the impossibility of multiplicative-error sampling from random BosonSampling experiments with probability $1-2^{-\tilde{O}\left(N^{1 / 3}\right)}$ for input size N, unless the Polynomial Hierarchy collapses. This exponentially improves upon the state-of-the-art. To do this, we introduce new proof techniques which tolerate exponential loss in the worst-to-average-case reduction. This opens the possibility to show the hardness of average-case sampling without ever proving PGC.

arXiv:2411.04566•Annual Symposium on Foundations of Computer Science•Dec 14, 2025•11 citations

Experiment-dependent priors in psychology and physics

Robert F. Bordley, Joseph Born Kadane

Theory and Decision•Dec 1, 1999•21 citations

Probability as a Blend of Theory and Experiment

WORLD SCIENTIFIC eBooks•Mar 3, 2017•0 citations

Significant nonclassical paths with atoms and cavities in the double-slit experiment

J. O. de Almeida, Maciej Lewenstein, James Q. Quach

In the the double-slit experiment, nonclassical paths are Feynman paths that go through both slits. Prior work with atom cavities as which-way detectors in the double-slit experiment has shown these paths to be experimentally inaccessible. In this paper, we show how such a setup can indeed detect nonclassical paths with 1% probability if one considers a different type of nonclassical path than previously investigated. We also show how this setup can be used to erase and restore the coherence of the nonclassical paths. Finally, we also show how atom cavities may be used to implement a exact measure of Born-rule violation [Quach, Which-way double-slit experiments and Born-rule violation, Phys. Rev. A 95, 042129 (2017)], which up until now has only been a formal construct.

arXiv:2007.05279•Physical Review A•Oct 23, 2020•1 citation
Decoders for quantum error correction (QEC) experiments rely on detector error models (DEMs), which encode, for each error, its probability and the detectors and logical observables it flips. Here we show that estimating DEM event probabilities from experimental syndromes is feasible, avoids independent device benchmarking, and produces useful decoder priors for estimating and reducing decoded logical error probabilities. We evaluate our methods using open-source data from surface-code memory experiments performed on Google's Willow chip, and we carry out analogous surface-code experiments on IBM's \texttt{ibm\_miami} processor. Despite the different physical error scales of the Google and IBM devices, in both cases our estimated DEMs improve logical error probabilities relative to baseline device-informed DEMs, typically at the 5%−10%5\%-10\%5%−10% level and with larger gains in some IBM cases, without additional calibration circuits, decoder fine-tuning, or supervised fitting to logical outcomes.
BosonSampling and Random Circuit Sampling are important both as a theoretical tool for separating quantum and classical computation, and as an experimental means of demonstrating quantum speedups. Prior works have shown that average-case hardness of sampling follows from certain unproven conjectures about the hardness of computing output probabilities, such as the Permanent-of-Gaussians Conjecture (PGC), which states that e−nlog⁡n−n−O(log⁡n)e^{-n \log n-n-O(\log n)}e−nlogn−n−O(logn) additive-error estimates to the output probability of most random BosonSampling experiments are #P-hard. Prior works have only shown weaker average-case hardness results that do not imply sampling hardness. Proving these conjectures has become a central question in quantum complexity. In this work, we show that e−nlog⁡n−n−O(nδ)e^{-n \log n-n-O\left(n^{\delta}\right)}e−nlogn−n−O(nδ) additive-error estimates to output probabilities of most random BosonSampling experiments are #P-hard for any δ>0\delta\gt 0δ>0, exponentially improving on prior work. In the process, we circumvent all known barrier results for proving PGC. The remaining hurdle to prove PGC is now “merely” to show that the O(nδ)O\left(n^{\delta}\right)O(nδ) in the exponent can be improved to O(log⁡n)O(\log n)O(logn). We also obtain an analogous result for Random Circuit Sampling. We then show, for the first time, a hardness of average-case classical sampling result for BosonSampling, under an anticoncentration conjecture. Specifically, we prove the impossibility of multiplicative-error sampling from random BosonSampling experiments with probability 1−2−O~(N1/3)1-2^{-\tilde{O}\left(N^{1 / 3}\right)}1−2−O~(N1/3) for input size N, unless the Polynomial Hierarchy collapses. This exponentially improves upon the state-of-the-art. To do this, we introduce new proof techniques which tolerate exponential loss in the worst-to-average-case reduction. This opens the possibility to show the hardness of average-case sampling without ever proving PGC.
In the the double-slit experiment, nonclassical paths are Feynman paths that go through both slits. Prior work with atom cavities as which-way detectors in the double-slit experiment has shown these paths to be experimentally inaccessible. In this paper, we show how such a setup can indeed detect nonclassical paths with 1% probability if one considers a different type of nonclassical path than previously investigated. We also show how this setup can be used to erase and restore the coherence of the nonclassical paths. Finally, we also show how atom cavities may be used to implement a exact measure of Born-rule violation [Quach, Which-way double-slit experiments and Born-rule violation, Phys. Rev. A 95, 042129 (2017)], which up until now has only been a formal construct.