Quantum Algorithms for Classical Probability Distributions
From MaRDI portal
(Redirected from Publication:5075751)
Recommendations
Cites work
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 5485488 (Why is no real title available?)
- scientific article; zbMATH DE number 7378719 (Why is no real title available?)
- Adiabatic Quantum State Generation
- Efficient quantum algorithms for (gapped) group testing and junta testing
- Improved bounds on quantum learning algorithms
- Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
- Learning graph based quantum query algorithms for finding constant-size subgraphs
- New results on quantum property testing
- Positive Definite Matrices
- Provably secure key establishment against quantum adversaries
- Quantum Algorithms for Testing Properties of Distributions
- Quantum Query Complexity of Entropy Estimation
- Quantum Query Complexity of State Conversion
- Quantum algorithms for learning symmetric juntas via the adversary bound
- Quantum cryptanalysis of hash and claw-free functions
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum speedup of Monte Carlo methods
- Reflections for quantum query algorithms
- Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
- Span programs and quantum algorithms for st-connectivity and claw detection
- Span programs for functions with constant-sized 1-certificates (extended abstract)
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)
