Quantum Algorithms for Classical Probability Distributions
From MaRDI portal
Publication:5075751
DOI10.4230/LIPICS.ESA.2019.16OpenAlexW2978804772MaRDI QIDQ5075751FDOQ5075751
Authors: Aleksandrs Belovs 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1904.02192
Recommendations
Hellinger distancequantum query complexityquantum adversary methoddistinguishing probability distributions
Cites Work
- Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
- Quantum lower bounds for the collision and the element distinctness problems
- Span programs for functions with constant-sized 1-certificates (extended abstract)
- Quantum Query Complexity of State Conversion
- Positive Definite Matrices
- Reflections for quantum query algorithms
- Title not available (Why is that?)
- Quantum cryptanalysis of hash and claw-free functions
- Adiabatic Quantum State Generation
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Learning graph based quantum query algorithms for finding constant-size subgraphs
- Title not available (Why is that?)
- Quantum speedup of Monte Carlo methods
- Improved bounds on quantum learning algorithms
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Span programs and quantum algorithms for \(st\)-connectivity and claw detection
- Quantum Query Complexity of Entropy Estimation
- New results on quantum property testing
- Efficient quantum algorithms for (gapped) group testing and junta testing
- Quantum Algorithms for Testing Properties of Distributions
- Provably secure key establishment against quantum adversaries
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Quantum Algorithms for Classical Probability Distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075751)
