|
| | | | |
| | | |
| Stat |
Members: 2980
Articles: 2'031'962
Articles rated: 2577
21 January 2021 |
|
| | | | |
|
Article overview
| |
|
|
Computational Complexity Measures of Multipartite Quantum Entanglement | | Tomoyuki Yamakami
; | | Date: |
13 Aug 2003 | | Journal: | Proc. 14th ISAAC. Springer’s LNCS, Vol.2906, pp.117-128, 2003 | | Subject: | Quantum Physics; Computational Complexity | quant-ph cs.CC | | Abstract: | We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon the formal treatment of partial separability, we measure the complexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial entanglement. | | Source: | arXiv, quant-ph/0308072 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser CCBot/2.0 (https://commoncrawl.org/faq/)
|
| |
|
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER