Pith. sign in

REVIEW

On the central limit theorem for unsharp quantum random variables

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1609.01680 v3 pith:JVBHD6P7 submitted 2016-09-06 quant-ph

On the central limit theorem for unsharp quantum random variables

classification quant-ph
keywords quantuminputsunsharpgeneratedrandomseparablevariablescertainty
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this letter we study the weak-convergence properties of random variables generated by unsharp quantum measurements. More precisely, for a sequence of random variables generated by repeated unsharp quantum measurements, we study the limit distribution of relative frequency. We provide the de Finetti-type representation theorem for all separable states, showing that the distribution can be well approximated by mixture of normal distributions. No symmetry restrictions, such as the permutational invariance were needed. Furthermore, we investigate the convergence rates and show that the relative frequency can stabilize to some constant at best at the rate of order $1/\sqrt{N}$ for all separable inputs. On the other hand, we provide an example of a strictly unsharp quantum measurement where the better rates are achieved by using entangled inputs. This means that in certain cases the noise generated by the measurement process can be suppressed by using entanglement. We deliver our result in the form of quantum information task where the player achieves the goal with certainty in the limiting case by using entangled inputs or fails with certainty by using separable inputs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.