QMA variants with polynomially many provers
Quantum Information and Computation
Saved in:
Main Authors: | Gharibian, S., Sikora, J., Upadhyay, S. |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Article |
Published: |
2016
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/126297 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
EXPLORING DIFFERENT MODELS OF QUERY COMPLEXITY AND COMMUNICATION COMPLEXITY
by: SUPARTHA PODDER
Published: (2016) -
Interior-point methods with decomposition for solving large-scale linear programs
by: Zhao, G.Y.
Published: (2014) -
Two-message quantum interactive proofs are in PSPACE
by: Jain, R., et al.
Published: (2013) -
Quantum Sizes: Complexity, Dimension and Many-Box Locality
by: CAI YU
Published: (2015) -
Studies in Models of Quantum Proof Systems
by: ATTILA PERESZLENYI
Published: (2015)