|
| related topics |
| {key, protocol, security} |
| {information, entropy, channel} |
| {alice, bob, state} |
| {let, theorem, proof} |
| {states, state, optimal} |
| {qubit, qubits, gate} |
| {state, states, entangled} |
| {algorithm, log, probability} |
| {time, systems, information} |
| {cos, sin, state} |
|
Private Quantum Channels and the Cost of Randomizing Quantum Information
Michele Mosca, Alain Tapp, Ronald de Wolf
abstract: We investigate how a classical private key can be used by two players,
connected by an insecure one-way quantum channel, to perform private
communication of quantum information. In particular we show that in order to
transmit n qubits privately, 2n bits of shared private key are necessary and
sufficient. This result may be viewed as the quantum analogue of the classical
one-time pad encryption scheme. From the point of view of the eavesdropper,
this encryption process can be seen as a randomization of the original state.
We thus also obtain strict bounds on the amount of entropy necessary for
randomizing n qubits.
- oai_identifier:
- oai:arXiv.org:quant-ph/0003101
- categories:
- quant-ph
- comments:
- LaTeX, 10 pages. Minor changes in the typesetting and references
- arxiv_id:
- quant-ph/0003101
- created:
- 2000-03-21
- updated:
- 2000-03-27
Full article ▸
|
|
| related documents |
| 0009006v5 |
| 9801022v1 |
| 0410017v2 |
| 0001046v1 |
| 0308044v2 |
| 9810021v1 |
| 0405111v2 |
| 0303184v1 |
| 0302196v1 |
| 0611145v1 |
| 0403036v5 |
| 0106121v2 |
| 0509211v1 |
| 0703099v5 |
| 9702002v1 |
| 0205060v3 |
| 0009048v2 |
| 0112034v1 |
| 0610096v2 |
| 0009075v1 |
| 0101117v1 |
| 0104057v1 |
| 0303117v1 |
| 0409026v1 |
| 0511171v1 |
|