| Title: |
Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Mark Braverman |
-
Princeton University, Department of Computer Science
|
| Ankit Garg |
-
Princeton University, Department of Computer Science
|
| Young Kun-Ko |
-
Princeton University, Department of Computer Science
|
| Jieming Mao |
-
Princeton University, Department of Computer Science
|
| Dave Touchette |
-
University of Waterloo, Institute for Quantum Computing
-
University of Waterloo, Department of Combinatorics and Optimization
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1149888
|
| DBLP Key: |
conf/focs/BravermanGKMT15
|
| Author Comments: |
|