NDLI: Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Kempe, Julia Regev, Oded de Wolf, Ronald Gavinsky, Dmitry
Copyright Year	2009
Abstract	We consider the following problem of bounded-error quantum state identification: Given either state $\alpha_0$ or state $\alpha_1$, we are required to output 0, 1, or ? (don't know"), such that conditioned on outputting 0 or 1, our guess is correct with high probability. The goal is to maximize the probability of not outputting ?. We prove the following direct product theorem: If we are given two such problems, with optimal probabilities a and b, respectively, and the states in the first problem are pure, then the optimal probability for the joint bounded-error state identification problem is $O(ab)$. Our proof is based on semidefinite programming duality. Using this result, we present two exponential separations in the simultaneous message passing model of communication complexity. First, we describe a relation that can be computed with $O(\log n)$ classical bits of communication in the presence of shared randomness, but needs $\Omega(n^{1/3})$ communication if the parties don't share randomness, even if communication is quantum. This shows the optimality of Yao's recent exponential simulation of shared-randomness protocols by quantum protocols without shared randomness. Combined with an earlier separation in the other direction due to Bar-Yossef, Jayram, and Kerenidis, this shows that the quantum simultaneous message passing (SMP) model is incomparable with the classical shared-randomness SMP model. Second, we describe a relation that can be computed with $O(\log n)$ classical bits of communication in the presence of shared entanglement, but needs $\Omega((n/\log n)^{1/3})$ communication if the parties share randomness but no entanglement, even if communication is quantum. This is the first example in communication complexity of a situation where entanglement buys much more than quantum communication.
Starting Page	1
Ending Page	24
Page Count	24
File Format	PDF
ISSN	00975397
DOI	10.1137/060665798
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	1 (Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006))
Volume Number	39
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2009-05-28
Access Restriction	Subscribed
Subject Keyword	state identification Coding and information theory semidefinite programs Quantum computation Detection theory entanglement communication complexity exponential separations quantum communication duality Quantum measurement theory
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Bounded-error quantum state identification and exponential separations in communication complexity

Bounded-error quantum state identification and exponential separations in communication complexity

Bounded-error quantum state identification and exponential separations in communication complexity (2006)

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity

Bounded-error quantum state identification and exponential separations in communication complexity (2006)

Bounded-error quantum state identification and exponential separations in communication complexity (2006)

Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography

Exponential Separation of Quantum and Classical One-Way Communication Complexity

Structure, randomness and complexity in quantum computation

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity

Similar Documents

Bounded-error quantum state identification and exponential separations in communication complexity

Bounded-error quantum state identification and exponential separations in communication complexity

Bounded-error quantum state identification and exponential separations in communication complexity (2006)

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity

Bounded-error quantum state identification and exponential separations in communication complexity (2006)

Bounded-error quantum state identification and exponential separations in communication complexity (2006)

Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography

Exponential Separation of Quantum and Classical One-Way Communication Complexity

Structure, randomness and complexity in quantum computation

Bounded-Error Quantum State Identification and Exponential Separations in Communication Complexity