The following pages link to Scott Aaronson (Q1623267):
Displayed 50 items.
- The fewest clues problem (Q1623268) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- New approaches for quantum copy-protection (Q2120093) (← links)
- The equivalence of sampling and searching (Q2254498) (← links)
- Quantum certificate complexity (Q2475404) (← links)
- The Space "Just Above" BQP (Q2800575) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Sophistication as Randomness Deficiency (Q2843094) (← links)
- A full characterization of quantum advice (Q2875139) (← links)
- BQP and the polynomial hierarchy (Q2875140) (← links)
- A linear-optical proof that the permanent is # <b>P</b> -hard (Q2901811) (← links)
- (Q2913799) (← links)
- Forrelation (Q2941519) (← links)
- Algebrization (Q2947539) (← links)
- Limitations of Quantum Advice and One-Way Communication (Q3002754) (← links)
- (Q3002757) (← links)
- (Q3002783) (← links)
- (Q3002799) (← links)
- The Equivalence of Sampling and Searching (Q3007612) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- Quantum computing and hidden variables (Q3102441) (← links)
- (Q3166192) (← links)
- A Full Characterization of Quantum Advice (Q3190695) (← links)
- (Q3191572) (← links)
- Quantum money from hidden subspaces (Q3191578) (← links)
- (Q3191607) (← links)
- (Q3395977) (← links)
- Quantum lower bounds for the collision and the element distinctness problems (Q3498860) (← links)
- The Limits of Quantum Computers (Q3499761) (← links)
- The learnability of quantum states (Q3508097) (← links)
- (Q3522430) (← links)
- Closed timelike curves make quantum and classical computing equivalent (Q3561861) (← links)
- Quantum lower bound for the collision problem (Q3579214) (← links)
- Lower bounds for local search by quantum arguments (Q3580990) (← links)
- Multilinear formulas and skepticism of quantum computing (Q3580996) (← links)
- The complexity of agreement (Q3581454) (← links)
- (Q3605726) (← links)
- Algorithms for Boolean Function Query Properties (Q4429679) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- (Q4638073) (← links)
- Skepticism of quantum computing (Q4897689) (← links)
- The computational complexity of ball permutations (Q4977982) (← links)
- (Q5091154) (← links)
- (Q5092454) (← links)
- (Q5092465) (← links)
- (Q5111152) (← links)
- A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory (Q5126830) (← links)
- Shadow Tomography of Quantum States (Q5130848) (← links)
- (Q5140846) (← links)
- Weak Parity (Q5167728) (← links)