Reflections for quantum query algorithms
From MaRDI portal
Publication:5365063
zbMATH Open1373.68230arXiv1005.1601MaRDI QIDQ5365063FDOQ5365063
Authors: Ben Reichardt 
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1005.1601
Recommendations
Semidefinite programming (90C22) Quantum algorithms and complexity in the theory of computing (68Q12)
Cited In (47)
- Fourier concentration from shrinkage
- Title not available (Why is that?)
- Quantum adversary lower bound for element distinctness with small range
- Correlation bounds and \#SAT algorithms for small linear-size circuits
- Quantum adversary (upper) bound
- Quantum adversary (upper) bound
- Approximating the AND-OR tree
- Quantum algorithm design: techniques and applications
- Optimal direct sum results for deterministic and randomized decision tree complexity
- Quantum query as a state decomposition
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- On exact quantum query complexity
- Title not available (Why is that?)
- A stronger LP bound for formula size lower bounds via clique constraints
- Quantum counterfeit coin problems
- A universal adiabatic quantum query algorithm
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- Title not available (Why is that?)
- Span programs are equivalent to quantum query algorithms
- Evaluation of exact quantum query complexities by semidefinite programming
- A composition theorem for decision tree complexity
- Forrelation: a problem that optimally separates quantum from classical computing
- Hardness amplification and the approximate degree of constant-depth circuits
- Low-sensitivity functions from unambiguous certificates
- Quantum query algorithms are completely bounded forms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved quantum query algorithms for triangle detection and associativity testing
- Correlation bounds and \#SAT algorithms for small linear-size circuits
- A strong direct product theorem for quantum query complexity
- Recent developments in quantum algorithms and complexity
- Superlinear advantage for exact quantum algorithms
- On the power of non-adaptive learning graphs
- Dual polynomials for collision and element distinctness
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
- Quantum query algorithms are completely bounded forms
- Span-program-based quantum algorithm for evaluating unbalanced formulas
- Quantum bounds for 2D-grid and Dyck language
- What circuit classes can be learned with non-trivial savings?
- Small bias requires large formulas
- Approximate Degree in Classical and Quantum Computing
- Extended learning graphs for triangle finding
- Approximate span programs
- The quantum query complexity of read-many formulas
- Improved average-case lower bounds for De Morgan formula size: matching worst-case lower bound
- Title not available (Why is that?)
- Quantum Algorithms for Classical Probability Distributions
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)
