The following pages link to John Watrous (Q202101):
Displayed 41 items.
- Ancilla dimension in quantum channel discrimination (Q529596) (← links)
- One-dimensional quantum walks with absorbing boundaries (Q1765300) (← links)
- Two-way finite automata with quantum and classical states. (Q1853472) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- Sharp quantum versus classical query complexity separations (Q1871634) (← links)
- On the complexity of simulating space-bounded quantum computations (Q1889853) (← links)
- Space-bounded quantum complexity (Q1961378) (← links)
- On the mixed-unitary rank of quantum channels (Q2165051) (← links)
- Quantum Proofs (Q2808277) (← links)
- Quantum interactive proofs with weak error bounds (Q2826062) (← links)
- QIP = PSPACE (Q2875184) (← links)
- Zero-knowledge against quantum attacks (Q2931394) (← links)
- Limitations on Separable Measurements by Convex Optimization (Q2978595) (← links)
- (Q3002811) (← links)
- (Q3002832) (← links)
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems (Q3192033) (← links)
- Optimal Counterfeiting Attacks and Generalizations for Wiesner’s Quantum Money (Q3455197) (← links)
- (Q3522509) (← links)
- (Q3549656) (← links)
- Closed timelike curves make quantum and classical computing equivalent (Q3561861) (← links)
- (Q3602395) (← links)
- (Q3633946) (← links)
- (Q4252737) (← links)
- (Q4258586) (← links)
- (Q4578333) (← links)
- The Theory of Quantum Information (Q4608827) (← links)
- (Q4855947) (← links)
- Matchgate and space-bounded quantum computations are equivalent (Q4931028) (← links)
- Revisiting the simulation of quantum Turing machines by quantum circuits (Q5160678) (← links)
- Two-Message Quantum Interactive Proofs Are in PSPACE (Q5171198) (← links)
- One-dimensional quantum walks (Q5175951) (← links)
- Quantum algorithms for solvable groups (Q5175953) (← links)
- Hedging bets with correlated quantum strategies (Q5362012) (← links)
- Extended non-local games and monogamy-of-entanglement games (Q5363566) (← links)
- QIP = PSPACE (Q5395673) (← links)
- Simpler semidefinite programs for completely bounded norms (Q5414627) (← links)
- (Q5414630) (← links)
- STACS 2005 (Q5710712) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900941) (← links)
- Quantum simulations of classical random walks and undirected graph connectivity (Q5943095) (← links)
- Complexity limitations on one-turn quantum refereed games (Q6038714) (← links)