Pages that link to "Item:Q5368759"
From MaRDI portal
The following pages link to Polynomials, quantum query complexity, and Grothendieck's inequality (Q5368759):
Displaying 17 items.
- Grover's algorithm and the secant varieties (Q513412) (← links)
- Fourier 1-norm and quantum speed-up (Q670032) (← links)
- On zeros of exponential polynomials and quantum algorithms (Q989909) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- Polynomial degree vs. quantum query complexity (Q2490260) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- (Q3002756) (← links)
- (Q3522513) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- (Q4601823) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time (Q5056439) (← links)
- Failure of the trilinear operator space Grothendieck theorem (Q5211007) (← links)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY (Q5858921) (← links)
- A polynomial quantum algorithm for approximating the Jones polynomial (Q5891928) (← links)
- Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms (Q6646783) (← links)