The following pages link to J. Smotrovs (Q236525):
Displaying 16 items.
- Quantum Strategies Are Better Than Classical in Almost Any XOR Game (Q2843231) (← links)
- Worst Case Analysis of Non-local Games (Q2927639) (← links)
- Optimal quantum query bounds for almost all Boolean functions. (Q2957905) (← links)
- Exact Quantum Query Complexity of EXACT and THRESHOLD (Q2958430) (← links)
- (Q4247001) (← links)
- (Q4370228) (← links)
- (Q4415451) (← links)
- (Q4470530) (← links)
- Separations in Query Complexity Based on Pointer Functions (Q4640297) (← links)
- Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language (Q5089167) (← links)
- Polynomials, quantum query complexity, and Grothendieck's inequality (Q5368759) (← links)
- Multi-letter Reversible and Quantum Finite Automata (Q5428220) (← links)
- A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases (Q5504565) (← links)
- Closedness properties in ex-identification (Q5958651) (← links)
- Quantum bounds for 2D-grid and Dyck language (Q6101583) (← links)
- Representing polynomial of \textsc{St-Connectivity} (Q6599807) (← links)
