Back to Results
First PageMeta Content
Quantum complexity theory / Quantum information science / Models of computation / QMA / Interactive proof system / PP / Arthur–Merlin protocol / Quantum computer / BQP / Theoretical computer science / Computational complexity theory / Applied mathematics


QMA/qpoly ⊆ PSPACE/poly: De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract
Add to Reading List

Document Date: 2006-11-24 03:53:50

Open Document

File Size: 183,27 KB

Share Result on Facebook

City

London / /

Company

BP / Cambridge University Press / Google / JAI Press / /

/

Event

FDA Phase / Person Communication and Meetings / /

Facility

De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract But / /

IndustryTerm

public-coin protocol / classical protocol / verification algorithm / quantum protocol / private-coin protocol / ordinary protocol / interactive proof systems / computing / proof systems / /

Organization

Cambridge University / De-Merlinizing Quantum Protocols Scott Aaronson∗ University of Waterloo Abstract But / /

Person

Merlin But / Jon Yard / Oded Regev / Ashwin Nayak / Hirotada Kobayashi / Let Bob / Alice / Greg Kuperberg / /

Position

HB / advisors / quantum advisor / thesis advisor / /

Product

Y1 / RAC / Q1 / QMA1w / Theorem / /

ProvinceOrState

Oregon / Massachusetts / /

PublishedMedium

Theory of Computing / /

Technology

QMA1w protocol / random access / Q1 protocol / quantum protocol / ordinary protocol / randomized protocol / public-coin protocol / verification algorithm / simulation / classical protocol / private-coin protocol / /

URL

http /

SocialTag