Papers
Topics
Authors
Recent
Search
2000 character limit reached

Storage and retrieval of von Neumann measurements

Published 6 Apr 2022 in quant-ph | (2204.03029v2)

Abstract: This work examines the problem of learning an unknown von Neumann measurement of dimension $d$ from a finite number of copies. To obtain a faithful approximation of the given measurement we are allowed to use it $N$ times. Our main goal is to estimate the asymptotic behavior of the maximum value of the average fidelity function $F_d$ for a general $N \rightarrow 1$ learning scheme. We show that $F_d = 1 - \Theta\left(\frac{1}{N2}\right)$ for arbitrary but fixed dimension $d$. In addition to that, we compared various learning schemes for $d=2$. We observed that the learning scheme based on deterministic port-based teleportation is asymptotically optimal but performs poorly for low $N$. In particular, we discovered a parallel learning scheme, which despite its lack of asymptotic optimality, provides a high value of the fidelity for low values of $N$ and uses only two-qubit entangled memory states.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.