Multipartite-to-bipartite entanglement transformations and polynomial identity testing

Chitambar, E; Duan, R; Shi, Y

Multipartite-to-bipartite entanglement transformations and polynomial identity testing

Chitambar, E Duan, R

Shi, Y

Permalink

Publication Type:: Journal Article
Citation:: Physical Review A - Atomic, Molecular, and Optical Physics, 2010, 81 (5)
Issue Date:: 2010-05-10

Closed Access

	Filename	Description	Size
	2009008521OK.pdf		112.55 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Chitambar, E	en_US
dc.contributor.author	Duan, R https://orcid.org/0000-0002-4388-7487	en_US
dc.contributor.author	Shi, Y	en_US
dc.date.issued	2010-05-10	en_US
dc.identifier.citation	Physical Review A - Atomic, Molecular, and Optical Physics, 2010, 81 (5)	en_US
dc.identifier.issn	1050-2947	en_US
dc.identifier.uri	http://hdl.handle.net/10453/13068
dc.description.abstract	We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol. © 2010 The American Physical Society.	en_US
dc.relation.ispartof	Physical Review A - Atomic, Molecular, and Optical Physics	en_US
dc.relation.isbasedon	10.1103/PhysRevA.81.052310	en_US
dc.subject.classification	General Physics	en_US
dc.title	Multipartite-to-bipartite entanglement transformations and polynomial identity testing	en_US
dc.type	Journal Article
utslib.citation.volume	5	en_US
utslib.citation.volume	81	en_US
utslib.for	0105 Mathematical Physics	en_US
utslib.for	01 Mathematical Sciences	en_US
utslib.for	02 Physical Sciences	en_US
utslib.for	03 Chemical Sciences	en_US
dc.location.activity	ISI:000278140000048	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	5	en_US
pubs.publication-status	Published	en_US
pubs.volume	81	en_US

Abstract:

We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol. © 2010 The American Physical Society.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/13068