Uniformity testing when you have the source code

DOI10.4230/LIPICS.TQC.2025.7MaRDI QIDQ7313322zbMATH OpenFDO

Authors Clement L. Canonne, Robin Kothari, Ryan O'Donnell

Publication date 12 August 2026

Copyright license File:Creative commons license with attribution.png Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.TQC.2025.7

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1775388 (Why is no real title available?)
• scientific article; zbMATH DE number 7650373 (Why is no real title available?)
• Learning and testing quantum states via probabilistic combinatorics and representation theory
• Mean estimation when you have the source code; or, quantum Monte Carlo methods
• New results on quantum property testing
• On Choosing and Bounding Probability Metrics
• Quantum algorithm for distribution-free junta testing
• Quantum Algorithms for Testing Properties of Distributions
• Quantum lower bound for the collision problem with small range
• Quantum lower bounds for the collision and the element distinctness problems
• Quantum speedup of Monte Carlo methods
• Quantum summation with an application to integration.
• Quantum Walk Algorithm for Element Distinctness
• Succinct quantum testers for closeness and k-wise uniformity of probability distributions
• The computational complexity of linear optics
• The quantum query complexity of approximating the median and related statistics
• Topics and Techniques in Distribution Testing: A Biased but Representative Sample

This page was built for publication: Uniformity testing when you have the source code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313322)