2018
DOI: 10.1088/1367-2630/aacd68
|View full text |Cite
|
Sign up to set email alerts
|

On the central limit theorem for unsharp quantum random variables

Abstract: 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 a representation theorem for all separable states, showing that the distribution can be well approximated by a mixture of normal distributions. Furthermore, we investigate the convergence rates and show that the relative frequency can stabili… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2
2

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 35 publications
0
4
0
Order By: Relevance
“…The reduction of resources can be further traced down in the case where 𝛼(n) grows in n. In this case, for a sufficiently large system (large n) this number is reduced to the logical minimum leading to the single-copy detection. [23,48] This possibility is presented in detail in the next section.…”
Section: A Certain Binary Cost Function Of Settings and Outcomes Smentioning
confidence: 99%
“…The reduction of resources can be further traced down in the case where 𝛼(n) grows in n. In this case, for a sufficiently large system (large n) this number is reduced to the logical minimum leading to the single-copy detection. [23,48] This possibility is presented in detail in the next section.…”
Section: A Certain Binary Cost Function Of Settings and Outcomes Smentioning
confidence: 99%
“…Considering it in the opposite direction: the confidence for entanglement detection grows exponentially fast in the number of repetitions N which constitutes what we dub the few-copy detection regime [24] where we achieve the high confidence detection by measuring only (thus the name) a few copies of the system (see Section 2 2.3). The reduction of resources can be further traced down in the case where α(n) grows in n. In this case, for a sufficiently large system (large n) this number is reduced to the logical minimum leading to the single-copy detection [23,47]. This possibility is presented in detail in the next section.…”
Section: If Smentioning
confidence: 99%
“…The first identity (75) follows along the lines of the second one ( 76) and so we focus on verifying the latter. Using the quantum Plancherel identity (26) and the relation (47), we apply the triangle inequality and split the integration domain into two disjoint sets such that…”
Section: Local-tail Decompositionmentioning
confidence: 99%
“…For a more detailed list of papers on noncommutative or quantum central limit theorems (QCLT), see for example [19,25] and references therein. A partially quantitative central limit theorem for unsharp measurements has been obtained in [26].…”
Section: Introductionmentioning
confidence: 99%