Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/12272
COMPARTIR / EXPORTAR:
logo share SHARE logo core CORE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

Invitar a revisión por pares abierta
Campo DC Valor Lengua/Idioma
dc.contributor.authorLamata, Lucas-
dc.contributor.authorLeón, Juan-
dc.contributor.authorSalgado, D.-
dc.contributor.authorSolano, E.-
dc.date.accessioned2009-04-14T10:34:13Z-
dc.date.available2009-04-14T10:34:13Z-
dc.date.issued2006-11-28-
dc.identifier.citationPhysical Review A 74(5): 052336 (2006)en_US
dc.identifier.issn1050-2947-
dc.identifier.urihttp://hdl.handle.net/10261/12272-
dc.description10 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/0603243en_US
dc.description.abstractWe 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.sponsorshipThe 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.extent160478 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoengen_US
dc.publisherAmerican Physical Societyen_US
dc.rightsopenAccessen_US
dc.subjectQuantum entanglementen_US
dc.subjectQuantum computingen_US
dc.subjectStochastic processesen_US
dc.subjectQuantum communicationsen_US
dc.subjectMatrix algebraen_US
dc.titleInductive classification of multipartite entanglement under stochastic local operations and classical communicationen_US
dc.typeartículoen_US
dc.identifier.doi10.1103/PhysRevA.74.052336-
dc.description.peerreviewedPeer revieweden_US
dc.relation.publisherversionhttp://dx.doi.org/10.1103/PhysRevA.74.052336en_US
dc.type.coarhttp://purl.org/coar/resource_type/c_6501es_ES
item.openairetypeartículo-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.grantfulltextopen-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextWith Fulltext-
Aparece en las colecciones: (CFMAC-IFF) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato
PRA74-052336-2006.pdf156,72 kBAdobe PDFVista previa
Visualizar/Abrir
Show simple item record

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.