Computational Complexity, volume 26, issue 1, pages 199-228

Multipartite Quantum Correlation and Communication Complexities

Rahul Jain 1, 2
Zhaohui Wei 3
Penghui Yao 4
Shengyu Zhang 5
Publication typeJournal Article
Publication date2016-05-23
scimago Q2
SJR0.453
CiteScore1.5
Impact factor0.7
ISSN10163328, 14208954
General Mathematics
Computational Mathematics
Computational Theory and Mathematics
Theoretical Computer Science
Abstract
The concepts of quantum correlation complexity and quantum communication complexity were recently proposed to quantify the minimum amount of resources needed in generating bipartite classical or quantum states in the single-shot setting. The former is the minimum size of the initially shared state $${\sigma}$$ on which local operations by the two parties (without communication) can generate the target state $${\rho}$$ , and the latter is the minimum amount of communication needed when initially sharing nothing. In this paper, we generalize these two concepts to multipartite cases, for both exact and approximate state generation. Our results are summarized as follows.
Found 

Top-30

Journals

1
1
  • We do not take into account publications without a DOI.
  • Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Share
Cite this
GOST | RIS | BibTex | MLA
Found error?