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

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$.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2024-10-18
DOI
https://doi.org/10.1103/physreva.110.042422
Primary Topic
Control Systems and Identification
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Ryszard Kukulski, Paulina Lewandowska
Physical review. A/Physical review, A
Control Systems and Identification
article

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

Ryszard Kukulski, Paulina Lewandowska
article en

Abstract

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$.

Physical review. A/Physical review, AVol. 110(4)
Jagiellonian University (PL), VSB - Technical University of Ostrava (CZ)
European Commission, Narodowe Centrum Nauki
Openalex Percentile: Top 79%
Control Systems and Identification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.