The following pages link to Forrelation (Q2941519):
Displaying 21 items.
- Quantum query as a state decomposition (Q1643135) (← links)
- Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup (Q1643528) (← links)
- Optimal separation in exact query complexities for Simon's problem (Q1672002) (← links)
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions (Q1993748) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- A relational time-symmetric framework for analyzing the quantum computational speedup (Q2286506) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Time evolution of complexity: a critique of three methods (Q2421658) (← links)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← 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)
- (Q5088887) (← links)
- (Q5091154) (← links)
- Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems (Q5889069) (← links)
- Following forrelation -- quantum algorithms in exploring Boolean functions' spectra (Q6067842) (← links)
- Introducing nega-forrelation: quantum algorithms in analyzing nega-Hadamard and nega-crosscorrelation spectra (Q6130621) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms (Q6646783) (← links)
- Quantum advantage from one-way functions (Q6652974) (← links)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)
