Computational Complexity, volume 26, issue 1, pages 199-228
Multipartite Quantum Correlation and Communication Complexities
2
MajuLab, UMI 3654, Singapore, Singapore
|
Publication type: Journal Article
Publication date: 2016-05-23
Journal:
Computational Complexity
scimago Q2
SJR: 0.453
CiteScore: 1.5
Impact factor: 0.7
ISSN: 10163328, 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
Are you a researcher?
Create a profile to get free access to personal recommendations for colleagues and new articles.