Catalyst-assisted probabilistic entanglement transformation

Feng, Y; Duan, R; Ying, M

Catalyst-assisted probabilistic entanglement transformation

Feng, Y

Duan, R

Ying, M

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Theory, 2005, 51 (3), pp. 1090 - 1101
Issue Date:: 2005-03-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (245.17 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896	en_US
dc.contributor.author	Duan, R https://orcid.org/0000-0002-4388-7487	en_US
dc.contributor.author	Ying, M https://orcid.org/0000-0003-4847-702X	en_US
dc.date.issued	2005-03-01	en_US
dc.identifier.citation	IEEE Transactions on Information Theory, 2005, 51 (3), pp. 1090 - 1101	en_US
dc.identifier.issn	0018-9448	en_US
dc.identifier.uri	http://hdl.handle.net/10453/9035
dc.description.abstract	We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming probability of a given entanglement transformation. We also design an algorithm which leads to an efficient method for finding the most economical partial catalysts with minimal dimension. The mathematical structure of catalyst-assisted probabilistic transformation is carefully investigated. © 2005 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Information Theory	en_US
dc.relation.isbasedon	10.1109/TIT.2004.842574	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	Catalyst-assisted probabilistic entanglement transformation	en_US
dc.type	Journal Article
utslib.citation.volume	3	en_US
utslib.citation.volume	51	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	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	open_access
pubs.issue	3	en_US
pubs.publication-status	Published	en_US
pubs.volume	51	en_US

Abstract:

We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming probability of a given entanglement transformation. We also design an algorithm which leads to an efficient method for finding the most economical partial catalysts with minimal dimension. The mathematical structure of catalyst-assisted probabilistic transformation is carefully investigated. © 2005 IEEE.

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

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