|
| related topics |
| {observables, space, algebra} |
| {let, theorem, proof} |
| {states, state, optimal} |
| {state, states, entangled} |
| {bell, inequality, local} |
| {vol, operators, histories} |
| {state, phys, rev} |
| {key, protocol, security} |
| {information, entropy, channel} |
| {algorithm, log, probability} |
|
Cloning and Broadcasting in Generic Probabilistic Theories
Howard Barnum, Jonathan Barrett, Matthew Leifer, Alexander Wilce
abstract: We prove generic versions of the no-cloning and no-broadcasting theorems,
applicable to essentially {\em any} non-classical finite-dimensional
probabilistic model that satisfies a no-signaling criterion. This includes
quantum theory as well as models supporting ``super-quantum'' correlations that
violate the Bell inequalities to a larger extent than quantum theory. The proof
of our no-broadcasting theorem is significantly more natural and more
self-contained than others we have seen: we show that a set of states is
broadcastable if, and only if, it is contained in a simplex whose vertices are
cloneable, and therefore distinguishable by a single measurement. This
necessary and sufficient condition generalizes the quantum requirement that a
broadcastable set of states commute.
- oai_identifier:
- oai:arXiv.org:quant-ph/0611295
- categories:
- quant-ph
- arxiv_id:
- quant-ph/0611295
- report_no:
- LAUR-06-8337
- created:
- 2006-11-30
Full article ▸
|
|
| related documents |
| 0702023v1 |
| 0007060v1 |
| 9805066v1 |
| 0612226v1 |
| 0008020v1 |
| 0701113v1 |
| 0202057v1 |
| 0406132v1 |
| 0507231v2 |
| 0701217v1 |
| 0612096v1 |
| 0701143v2 |
| 0703162v1 |
| 0701037v2 |
| 0702212v1 |
| 0703061v1 |
| 0702033v1 |
| 0703243v2 |
| 0612123v2 |
| 0701054v1 |
| 0612052v2 |
| 0701079v1 |
| 0701200v3 |
| 0612033v1 |
| 0703193v2 |
|