Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2204.03029 · Physical Review A

Storage and retrieval of von Neumann measurements

Paulina Lewandowska, Ryszard Kukulski, Łukasz Pawela, Zbigniew Puchała

Published Nov 18, 2022• 7 citations
arXivHTMLPDF

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\ensuremath{\rightarrow}1$ learning scheme. We show that ${F}_{d}=1\ensuremath{-}\mathrm{\ensuremath{\Theta}}(\frac{1}{{N}^{2}})$ 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.

DOI
10.1103/physreva.106.052423

Related papers

Storage and retrieval of von Neumann measurements via indefinite causal order structures

Paulina Lewandowska, Ryszard Kukulski

This work presents the problem of learning an unknown von Neumann measurement of dimension $d$ using indefinite causal structures. In the considered scenario, we have access to $N$ copies of the measurement. We use the formalism of process matrices to store information about the given measurement that later will be used to reproduce its best possible approximation. Our goal is to compute the maximum value of the average fidelity function ${F}_{d}(N)$ of our procedure. We prove that ${F}_{d}(N)=1\ensuremath{-}\mathrm{\ensuremath{\Theta}}(\frac{1}{{N}^{2}})$ for arbitrary but fixed dimension $d$. Furthermore, we present the SDP program (semi-definite program) for computing ${F}_{d}(N)$. Basing on the numerical investigation, we show that for the qubit von Neumann measurements using indefinite causal learning structures provide better approximation than quantum networks, starting from $N\ensuremath{\ge}3$.

arXiv:2405.11202•Physical Review A•Oct 18, 2024•2 citations

Optimal quantum learning of a unitary transformation

Alessandro Bisio, Giulio Chiribella, Giacomo Mauro D’Ariano +2 more

We address the problem of learning an unknown unitary transformation from a finite number of examples. The problem consists in finding the learning machine that optimally emulates the examples, thus reproducing the unknown unitary with maximum fidelity. Learning a unitary is equivalent to storing it in the state of a quantum memory (the memory of the learning machine) and subsequently retrieving it. We prove that, whenever the unknown unitary is drawn from a group, the optimal strategy consists in a parallel call of the available uses followed by a ``measure-and-rotate'' retrieving. Differing from the case of quantum cloning, where the incoherent ``measure-and-prepare'' strategies are typically suboptimal, in the case of learning the ``measure-and-rotate'' strategy is optimal even when the learning machine is asked to reproduce a single copy of the unknown unitary. We finally address the problem of the optimal inversion of an unknown unitary evolution, showing also in this case the optimality of the ``measure-and-rotate'' strategies and applying our result to the optimal approximate realignment of reference frames for quantum communication.

arXiv:0903.0543•Physical Review A•Mar 25, 2010•160 citations

Optimal von Neumann Entropy Estimation

Ziyun Chen, Minbo Gao, Qisheng Wang

We show that the von Neumann entropy of an unknown $d$-dimensional quantum state $ρ$ can be estimated to within additive error $\varepsilon$ using \[ Θ\!\left(\frac{d^2}{\varepsilon\log^2(d)(1+\varepsilon\log^2(d))} + \frac{\log^2(d)}{\varepsilon^2}\right) \] samples of $ρ$, matching the lower bound due to Wang (2026). Our estimator is based on a high-degree approximation polynomial and the main technical challenge is bounding its variance despite the large polynomial degree. We overcome this using a quantum Hoeffding decomposition, which preserves cancellations between different polynomial terms and reduces the analysis to derivative bounds for the approximation polynomial.

quant-pharXiv:2608.11151•Aug 12, 2026•6 citations

Optimal reconstruction of a pure qubit state with local measurements

E. Bagán, M. Baig, Alex Monràs +1 more

We analyse the reconstruction of an unknown pure qubit state. We derive the optimal guess that can be inferred from any set of measurements on N identical copies of the system with the fidelity as a figure of merit. We study in detail the estimation process with individual von Neumann measurements and demonstrate that they are very competitive as compared to (complicated) collective measurements. We compute the expressions of the fidelity for large $N$ and show that individual measurement schemes can perform optimally in the asymptotic regime.

arXiv:quant-ph/0312167•Dec 19, 2003•1 citation

Cloning of a quantum measurement

Alessandro Bisio, Giacomo Mauro D’Ariano, Paolo Perinotti +1 more

We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about $1\ensuremath{\rightarrow}2$ learning of the measurement, otherwise the task is called $1\ensuremath{\rightarrow}2$ cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension $d$ of the Hilbert space. For $1\ensuremath{\rightarrow}2$ cloning we also propose a simple quantum network that achieves the optimal fidelity. The optimal fidelity for $1\ensuremath{\rightarrow}2$ learning just slightly outperforms the estimate and prepare strategy in which one first estimates the unknown measurement and depending on the result suitably prepares the duplicate.

arXiv:1103.5709•Physical Review A•Oct 18, 2011•7 citations

Amount of information obtained by a quantum measurement

Serge Massar, Sandu Popescu

In this paper we address the problem of how much can be learned about an unknown quantum state by a measurement. To this end we consider optimal measurements for the state estimation problem, that is measurements that maximize the expectation of a fidelity function. We then enlarge the class of optimal measurements to measurements that act collectively on blocks of input states, and in addition we only require that the fidelity of the measurement be arbitrarily close to the optimal fidelity. We then consider the Shannon information of the outputs of optimal measurements, which is the amount of data produced by the measurements. We show that in the enlarged class of optimal measurements described above one can always construct an optimal measurement so that the Shannon information of its outputs equals the von Neumann entropy of the unknown states. Since this result is valid for all choices of fidelity functions and all distributions of input states, it provides a model independent answer to the question of how much can be learned about a quantum state by a measurement. Namely, this result shows that a measurement can extract at most one meaningful bit from every qubit carried by the unknown state.

arXiv:quant-ph/9907066•Physical Review A•May 12, 2000•33 citations
This work examines the problem of learning an unknown von Neumann measurement of dimension ddd from a finite number of copies. To obtain a faithful approximation of the given measurement, we are allowed to use it NNN times. Our main goal is to estimate the asymptotic behavior of the maximum value of the average fidelity function Fd{F}_{d}Fd​ for a general N\ensuremath→1N\ensuremath{\rightarrow}1N\ensuremath→1 learning scheme. We show that Fd=1\ensuremath−\ensuremathΘ(1N2){F}_{d}=1\ensuremath{-}\mathrm{\ensuremath{\Theta}}(\frac{1}{{N}^{2}})Fd​=1\ensuremath−\ensuremathΘ(N21​) for arbitrary but fixed dimension ddd. In addition to that, we compared various learning schemes for d=2d=2d=2. We observed that the learning scheme based on deterministic port-based teleportation is asymptotically optimal but performs poorly for low NNN. 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 NNN and uses only two-qubit entangled memory states.
This work presents the problem of learning an unknown von Neumann measurement of dimension ddd using indefinite causal structures. In the considered scenario, we have access to NNN copies of the measurement. We use the formalism of process matrices to store information about the given measurement that later will be used to reproduce its best possible approximation. Our goal is to compute the maximum value of the average fidelity function Fd(N){F}_{d}(N)Fd​(N) of our procedure. We prove that ${F}_{d}(N)=1\ensuremath{-}\mathrm{\ensuremath{\Theta}}(\frac{1}{{N}^{2}})$ for arbitrary but fixed dimension ddd. Furthermore, we present the SDP program (semi-definite program) for computing Fd(N){F}_{d}(N)Fd​(N). Basing on the numerical investigation, we show that for the qubit von Neumann measurements using indefinite causal learning structures provide better approximation than quantum networks, starting from $N\ensuremath{\ge}3$.
We address the problem of learning an unknown unitary transformation from a finite number of examples. The problem consists in finding the learning machine that optimally emulates the examples, thus reproducing the unknown unitary with maximum fidelity. Learning a unitary is equivalent to storing it in the state of a quantum memory (the memory of the learning machine) and subsequently retrieving it. We prove that, whenever the unknown unitary is drawn from a group, the optimal strategy consists in a parallel call of the available uses followed by a ``measure-and-rotate'' retrieving. Differing from the case of quantum cloning, where the incoherent ``measure-and-prepare'' strategies are typically suboptimal, in the case of learning the ``measure-and-rotate'' strategy is optimal even when the learning machine is asked to reproduce a single copy of the unknown unitary. We finally address the problem of the optimal inversion of an unknown unitary evolution, showing also in this case the optimality of the ``measure-and-rotate'' strategies and applying our result to the optimal approximate realignment of reference frames for quantum communication.
We show that the von Neumann entropy of an unknown ddd-dimensional quantum state ρρρ can be estimated to within additive error ε\varepsilonε using Θ ⁣(d2εlog⁡2(d)(1+εlog⁡2(d))+log⁡2(d)ε2) Θ\!\left(\frac{d^2}{\varepsilon\log^2(d)(1+\varepsilon\log^2(d))} + \frac{\log^2(d)}{\varepsilon^2}\right) Θ(εlog2(d)(1+εlog2(d))d2​+ε2log2(d)​) samples of ρρρ, matching the lower bound due to Wang (2026). Our estimator is based on a high-degree approximation polynomial and the main technical challenge is bounding its variance despite the large polynomial degree. We overcome this using a quantum Hoeffding decomposition, which preserves cancellations between different polynomial terms and reduces the analysis to derivative bounds for the approximation polynomial.
We analyse the reconstruction of an unknown pure qubit state. We derive the optimal guess that can be inferred from any set of measurements on N identical copies of the system with the fidelity as a figure of merit. We study in detail the estimation process with individual von Neumann measurements and demonstrate that they are very competitive as compared to (complicated) collective measurements. We compute the expressions of the fidelity for large NNN and show that individual measurement schemes can perform optimally in the asymptotic regime.
We analyze quantum algorithms for cloning of a quantum measurement. Our aim is to mimic two uses of a device performing an unknown von Neumann measurement with a single use of the device. When the unknown device has to be used before the bipartite state to be measured is available we talk about $1\ensuremath{\rightarrow}2$ learning of the measurement, otherwise the task is called $1\ensuremath{\rightarrow}2$ cloning of a measurement. We perform the optimization for both learning and cloning for arbitrary dimension ddd of the Hilbert space. For $1\ensuremath{\rightarrow}2$ cloning we also propose a simple quantum network that achieves the optimal fidelity. The optimal fidelity for $1\ensuremath{\rightarrow}2$ learning just slightly outperforms the estimate and prepare strategy in which one first estimates the unknown measurement and depending on the result suitably prepares the duplicate.
In this paper we address the problem of how much can be learned about an unknown quantum state by a measurement. To this end we consider optimal measurements for the state estimation problem, that is measurements that maximize the expectation of a fidelity function. We then enlarge the class of optimal measurements to measurements that act collectively on blocks of input states, and in addition we only require that the fidelity of the measurement be arbitrarily close to the optimal fidelity. We then consider the Shannon information of the outputs of optimal measurements, which is the amount of data produced by the measurements. We show that in the enlarged class of optimal measurements described above one can always construct an optimal measurement so that the Shannon information of its outputs equals the von Neumann entropy of the unknown states. Since this result is valid for all choices of fidelity functions and all distributions of input states, it provides a model independent answer to the question of how much can be learned about a quantum state by a measurement. Namely, this result shows that a measurement can extract at most one meaningful bit from every qubit carried by the unknown state.