Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms
From MaRDI portal
Cites work
- An optimal separation of randomized and Quantum query complexity
- Forrelation: a problem that optimally separates quantum from classical computing
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- k-forrelation optimally separates Quantum and classical query complexity
- On an inequality of von Neumann and an application of the metric theory of tensor products to operators theory. (Appendix by S. Kaijser and N. Th. Varopoulos.)
- On the Fourier spectrum of functions on Boolean cubes
- On the Fourier tails of bounded functions over the discrete cube
- On the impossibility of key agreements from quantum random oracles
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Polynomials, quantum query complexity, and Grothendieck's inequality
- Quantum lower bounds by polynomials
- Quantum query algorithms are completely bounded forms
- Quantum Walk Algorithm for Element Distinctness
- Semidefinite programming and integer programming
- Some applications of hypercontractive inequalities in quantum information theory
- The influence lower bound via query elimination
- Understanding quantum algorithms via query complexity
This page was built for publication: Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646783)
