Fourier 1-norm and quantum speed-up
DOI10.1007/s11128-019-2208-7zbMath1417.81086arXiv1612.08070OpenAlexW3105297487WikidataQ128389224 ScholiaQ128389224MaRDI QIDQ670032
Sebastián Alberto Grillo, Franklin de Lima Marquezino
Publication date: 15 March 2019
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.08070
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum algorithms and complexity in the theory of computing (68Q12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- Quantum query as a state decomposition
- Complexity measures and decision tree complexity: a survey.
- Some applications of hypercontractive inequalities in quantum information theory
- BQP and the polynomial hierarchy
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- On the role of entanglement in quantum-computational speed-up
- Analysis of Boolean Functions
- Polynomials, quantum query complexity, and Grothendieck's inequality
- Quantum lower bounds by polynomials
- Quantum Walk Algorithm for Element Distinctness
- On the Problem of Hidden Variables in Quantum Mechanics
- Quantum rejection sampling
This page was built for publication: Fourier 1-norm and quantum speed-up
