Pages that link to "Item:Q5368759"
From MaRDI portal
The following pages link to Polynomials, quantum query complexity, and Grothendieck's inequality (Q5368759):
Displayed 7 items.
- Fourier 1-norm and quantum speed-up (Q670032) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm (Q2684233) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
- Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
- Failure of the trilinear operator space Grothendieck theorem (Q5211007) (← links)