The complexity of quantum disjointness
We introduce the communication problem QNDISJ, short for Quantum (Unique) Non-Disjointness, and study its complexity under different modes of communication complexity. The main motivation for the problem is that it is a candidate for the separation of the quantum communication complexity classes QMA...
Saved in:
Main Author: | Klauck, Hartmut |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89407 http://hdl.handle.net/10220/46210 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
New bounds for the garden-hose model
by: Klauck, Hartmut, et al.
Published: (2018) -
Two-message quantum interactive proofs are in PSPACE
by: Jain, R., et al.
Published: (2013) -
Correlation in hard distributions in communication complexity
by: Klauck, Hartmut, et al.
Published: (2018) -
Separating quantum communication and approximate rank
by: Anshu, Anurag, et al.
Published: (2018) -
Studies in Models of Quantum Proof Systems
by: ATTILA PERESZLENYI
Published: (2015)