Pages that link to "Item:Q5441359"
From MaRDI portal
The following pages link to Quantum lower bounds by polynomials (Q5441359):
Displaying 50 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Correlation bounds and \#SAT algorithms for small linear-size circuits (Q344759) (← links)
- Quantum query complexity of almost all functions with fixed on-set size (Q347109) (← links)
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- Optimality proofs of quantum weight decision algorithms (Q430107) (← links)
- On the uselessness of quantum queries (Q433109) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function (Q669952) (← links)
- Fourier 1-norm and quantum speed-up (Q670032) (← links)
- Block sensitivity of minterm-transitive functions (Q719324) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- On the solution of trivalent decision problems by quantum state identification (Q734207) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer (Q855896) (← links)
- Efficient quantum algorithms for simulating sparse Hamiltonians (Q883042) (← links)
- Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
- On the parity complexity measures of Boolean functions (Q974756) (← links)
- The quantum query complexity of the determinant (Q976107) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Quantum query as a state decomposition (Q1643135) (← links)
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- A note on the search for \(k\) elements via quantum walk (Q1675772) (← links)
- Nonadaptive quantum query complexity (Q1675876) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Complexity measures and decision tree complexity: a survey. (Q1853508) (← links)
- Mathematical models of quantum computation (Q1862645) (← links)
- From Monte Carlo to quantum computation (Q1873014) (← links)
- The power of various real-valued quantum queries (Q1888377) (← links)
- An improved lower bound on query complexity for quantum PAC learning (Q1944033) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- The hardest halfspace (Q1983325) (← links)
- Fourier concentration from shrinkage (Q2012185) (← links)
- Query complexity of generalized Simon's problem (Q2051810) (← links)
- Generic authenticated key exchange in the quantum random oracle model (Q2055699) (← links)
- Classical vs quantum random oracles (Q2056754) (← links)
- QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model (Q2061910) (← links)
- Evaluation of exact quantum query complexities by semidefinite programming (Q2100824) (← links)
- Beyond quadratic speedups in quantum attacks on symmetric schemes (Q2170092) (← links)
- Analysis and applications of quantum walks (Q2214372) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- Extended learning graphs for triangle finding (Q2300731) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
