Computational Complexity Measures of Multipartite Quantum Entanglement

Simple item page
dc.creatorYamakami, Tomoyuki
dc.date2003-08-13
dc.date.accessioned2026-07-07T06:07:36Z
dc.date.available2026-07-07T06:07:36Z
dc.descriptionWe 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.
dc.descriptionTo appear in the Proceedings of the 14th Annual International Conference on Algorithms and Computation, December 2003
dc.identifierhttps://arxiv.org/abs/quant-ph/0308072
dc.identifierhttp://arxiv.org/abs/quant-ph/0308072
dc.identifierProc. 14th ISAAC. Springer's LNCS, Vol.2906, pp.117-128, 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91348
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleComputational Complexity Measures of Multipartite Quantum Entanglement
dc.typetext

Files

Collections

arXiv