Por favor, use este identificador para citar o enlazar a este item:
http://hdl.handle.net/10261/12272
COMPARTIR / EXPORTAR:
SHARE CORE BASE | |
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE | |
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Lamata, Lucas | - |
dc.contributor.author | León, Juan | - |
dc.contributor.author | Salgado, D. | - |
dc.contributor.author | Solano, E. | - |
dc.date.accessioned | 2009-04-14T10:34:13Z | - |
dc.date.available | 2009-04-14T10:34:13Z | - |
dc.date.issued | 2006-11-28 | - |
dc.identifier.citation | Physical Review A 74(5): 052336 (2006) | en_US |
dc.identifier.issn | 1050-2947 | - |
dc.identifier.uri | http://hdl.handle.net/10261/12272 | - |
dc.description | 10 pages, no figures.-- PACS nrs.: 03.67.Mn; 03.65.Ud; 02.10.Yn.-- ArXiv pre-print available at: http://arxiv.org/abs/quant-ph/0603243 | en_US |
dc.description.abstract | We propose an inductive procedure to classify N-partite entanglement under stochastic local operations and classical communication provided such a classification is known for N−1 qubits. The method is based upon the analysis of the coefficient matrix of the state in an arbitrary product basis. We illustrate this approach in detail with the well-known bipartite and tripartite systems, obtaining as a by-product a systematic criterion to establish the entanglement class of a given pure state without resourcing to any entanglement measure. The general case is proved by induction, allowing us to find an upper bound for the number of N-partite entanglement classes in terms of the number of entanglement classes for N−1 qubits. | en_US |
dc.description.sponsorship | The authors acknowledge financial support from the Spanish MEC Projects No. FIS2005-05304 (L.L. and J.L.) and No. FIS2004-01576 (D.S.) and the EU RESQ and DFG SFB631 projects (E.S.). L.L. also acknowledges support from the FPU Grant No. AP2003.0014. | en_US |
dc.format.extent | 160478 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | eng | en_US |
dc.publisher | American Physical Society | en_US |
dc.rights | openAccess | en_US |
dc.subject | Quantum entanglement | en_US |
dc.subject | Quantum computing | en_US |
dc.subject | Stochastic processes | en_US |
dc.subject | Quantum communications | en_US |
dc.subject | Matrix algebra | en_US |
dc.title | Inductive classification of multipartite entanglement under stochastic local operations and classical communication | en_US |
dc.type | artículo | en_US |
dc.identifier.doi | 10.1103/PhysRevA.74.052336 | - |
dc.description.peerreviewed | Peer reviewed | en_US |
dc.relation.publisherversion | http://dx.doi.org/10.1103/PhysRevA.74.052336 | en_US |
dc.type.coar | http://purl.org/coar/resource_type/c_6501 | es_ES |
item.openairetype | artículo | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | en | - |
item.grantfulltext | open | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | With Fulltext | - |
Aparece en las colecciones: | (CFMAC-IFF) Artículos |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
PRA74-052336-2006.pdf | 156,72 kB | Adobe PDF | Visualizar/Abrir |
CORE Recommender
SCOPUSTM
Citations
63
checked on 19-mar-2024
WEB OF SCIENCETM
Citations
58
checked on 23-feb-2024
Page view(s)
347
checked on 28-mar-2024
Download(s)
285
checked on 28-mar-2024
Google ScholarTM
Check
Altmetric
Altmetric
NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.