scientific article; zbMATH DE number 6783415
From MaRDI portal
Publication:5365063
zbMath1373.68230arXiv1005.1601MaRDI QIDQ5365063
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1005.1601
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semidefinite programming (90C22) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (38)
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits ⋮ What Circuit Classes Can Be Learned with Non-Trivial Savings? ⋮ Low-Sensitivity Functions from Unambiguous Certificates. ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Breaking the Minsky--Papert Barrier for Constant-Depth Circuits ⋮ Correlation bounds and \#SAT algorithms for small linear-size circuits ⋮ Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits ⋮ A strong direct product theorem for quantum query complexity ⋮ Forrelation: A Problem That Optimally Separates Quantum from Classical Computing ⋮ Approximate span programs ⋮ Optimal direct sum results for deterministic and randomized decision tree complexity ⋮ Quantum bounds for 2D-grid and Dyck language ⋮ Unnamed Item ⋮ Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound ⋮ A stronger LP bound for formula size lower bounds via clique constraints ⋮ Unnamed Item ⋮ Quantum Query Algorithms are Completely Bounded Forms. ⋮ Quantum algorithm design: techniques and applications ⋮ Quantum Query Algorithms Are Completely Bounded Forms ⋮ On the power of non-adaptive learning graphs ⋮ Unnamed Item ⋮ Improved quantum query algorithms for triangle detection and associativity testing ⋮ Fourier concentration from shrinkage ⋮ Quantum counterfeit coin problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Superlinear Advantage for Exact Quantum Algorithms ⋮ Quantum Algorithms for Classical Probability Distributions ⋮ Unnamed Item ⋮ Extended learning graphs for triangle finding ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithms and lower bounds for de morgan formulas of low-communication leaf gates ⋮ Quantum branch-and-bound algorithm and its application to the travelling salesman problem ⋮ On exact quantum query complexity
This page was built for publication:
