28 search results - page 1 / 6 » Quantum Arthur-Merlin Games |
COCO
2004
Springer
13 years 10 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
ECCC
2010
12 years 11 months ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
STOC
2007
ACM
14 years 5 months ago
2007
ACM
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
STOC
2007
ACM
14 years 5 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...