30,613 research outputs found
Quantum communication using a bounded-size quantum reference frame
Typical quantum communication schemes are such that to achieve perfect
decoding the receiver must share a reference frame with the sender. Indeed, if
the receiver only possesses a bounded-size quantum token of the sender's
reference frame, then the decoding is imperfect, and we can describe this
effect as a noisy quantum channel. We seek here to characterize the performance
of such schemes, or equivalently, to determine the effective decoherence
induced by having a bounded-size reference frame. We assume that the token is
prepared in a special state that has particularly nice group-theoretic
properties and that is near-optimal for transmitting information about the
sender's frame. We present a decoding operation, which can be proven to be
near-optimal in this case, and we demonstrate that there are two distinct ways
of implementing it (corresponding to two distinct Kraus decompositions). In
one, the receiver measures the orientation of the reference frame token and
reorients the system appropriately. In the other, the receiver extracts the
encoded information from the virtual subsystems that describe the relational
degrees of freedom of the system and token. Finally, we provide explicit
characterizations of these decoding schemes when the system is a single qubit
and for three standard kinds of reference frame: a phase reference, a Cartesian
frame (representing an orthogonal triad of spatial directions), and a reference
direction (representing a single spatial direction).Comment: 17 pages, 1 figure, comments welcome; v2 published versio
On quantum coding for ensembles of mixed states
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.Comment: 23 pages, LaTe
Improving success probability and embedding efficiency in code based steganography
For stegoschemes arising from error correcting codes, embedding depends on a
decoding map for the corresponding code. As decoding maps are usually not
complete, embedding can fail. We propose a method to ensure or increase the
probability of embedding success for these stegoschemes. This method is based
on puncturing codes. We show how the use of punctured codes may also increase
the embedding efficiency of the obtained stegoschemes
Classical Verification of Quantum Computations
We present the first protocol allowing a classical computer to interactively
verify the result of an efficient quantum computation. We achieve this by
constructing a measurement protocol, which enables a classical verifier to use
a quantum prover as a trusted measurement device. The protocol forces the
prover to behave as follows: the prover must construct an n qubit state of his
choice, measure each qubit in the Hadamard or standard basis as directed by the
verifier, and report the measurement results to the verifier. The soundness of
this protocol is enforced based on the assumption that the learning with errors
problem is computationally intractable for efficient quantum machines
- …