On quantum coding for ensembles of mixed states

Barnum H.; Caves C. M.; Fuchs C. A.; Jozsa R.; Schumacher B. W.

On quantum coding for ensembles of mixed states

Barnum H., Caves C. M., Fuchs C. A., Jozsa R., Schumacher B. W.

Research output: Working paper

Abstract

We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.

Translated title of the contribution	On quantum coding for ensembles of mixed states
Original language	English
Publisher	Department of Computer Science, University of Bristol
Publication status	Published - 2000

Bibliographical note

Other page information: -23
Other identifier: 1000500

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_master.jsp?id=1000500

Handle.net

Persistent link

Cite this

@techreport{1fce78fdd1014cc19e35f9638093457d,

title = "On quantum coding for ensembles of mixed states",

abstract = "We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.",

author = "Barnum H. and \{C. M.\}, Caves and \{C. A.\}, Fuchs and Jozsa R. and \{B. W.\}, Schumacher",

note = "Other page information: -23 Other identifier: 1000500",

year = "2000",

language = "English",

publisher = "Department of Computer Science, University of Bristol",

type = "WorkingPaper",

institution = "Department of Computer Science, University of Bristol",

}

TY - UNPB

T1 - On quantum coding for ensembles of mixed states

AU - H., Barnum

AU - C. M., Caves

AU - C. A., Fuchs

AU - R., Jozsa

AU - B. W., Schumacher

N1 - Other page information: -23 Other identifier: 1000500

PY - 2000

Y1 - 2000

N2 - We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.

AB - We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.

M3 - Working paper

BT - On quantum coding for ensembles of mixed states

PB - Department of Computer Science, University of Bristol

ER -

On quantum coding for ensembles of mixed states

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this