Reflections for quantum query algorithms
From MaRDI portal
Recommendations
Cited in
(56)- Quantum query as a state decomposition
- Quantum algorithm design: techniques and applications
- Fourier concentration from shrinkage
- Evaluation of exact quantum query complexities by semidefinite programming
- Extended learning graphs for triangle finding
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- On exact quantum query complexity
- Approximate span programs
- Superlinear advantage for exact quantum algorithms
- Dual polynomials for collision and element distinctness
- Quantum adversary (upper) bound
- The quantum query complexity of read-many formulas
- Improved average-case lower bounds for De Morgan formula size: matching worst-case lower bound
- scientific article; zbMATH DE number 6667586 (Why is no real title available?)
- Span programs are equivalent to quantum query algorithms
- Quantum adversary lower bound for element distinctness with small range
- A composition theorem for decision tree complexity
- Approximating the AND-OR tree
- Correlation bounds and \#SAT algorithms for small linear-size circuits
- Correlation bounds and \#SAT algorithms for small linear-size circuits
- Hardness amplification and the approximate degree of constant-depth circuits
- Span-program-based quantum algorithm for evaluating unbalanced formulas
- A strong direct product theorem for quantum query complexity
- Optimal direct sum results for deterministic and randomized decision tree complexity
- A stronger LP bound for formula size lower bounds via clique constraints
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
- Forrelation: a problem that optimally separates quantum from classical computing
- scientific article; zbMATH DE number 6913819 (Why is no real title available?)
- Quantum query algorithms are completely bounded forms
- Low-sensitivity functions from unambiguous certificates
- What circuit classes can be learned with non-trivial savings?
- On the power of non-adaptive learning graphs
- Quantum query algorithms are completely bounded forms
- Small bias requires large formulas
- Quantum algorithms for connectivity and related problems
- Approximate Degree in Classical and Quantum Computing
- Quantum Algorithms for Classical Probability Distributions
- Applications of the quantum algorithm for st-connectivity
- Classical algorithms from quantum and Arthur-Merlin communication protocols
- A composition theorem for randomized query complexity via max-conflict complexity
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- Improved quantum query algorithms for triangle detection and associativity testing
- A universal adiabatic quantum query algorithm
- Quantum adversary (upper) bound
- Recent developments in quantum algorithms and complexity
- Quantum bounds for 2D-grid and Dyck language
- The power of many samples in query complexity
- Quantum speedups for linear programming via interior point methods
- A direct reduction from the polynomial to the adversary method
- Separations between combinatorial measures for transitive functions
- Towards stronger depth lower bounds
- Quantum lower bounds by sample-to-query lifting
- Range avoidance for low-depth circuits and connections to pseudorandomness
- Quantum counterfeit coin problems
- The quantum supremacy Tsirelson inequality
- Circuit depth reductions
This page was built for publication: Reflections for quantum query algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365063)
