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:2405.11202 · Physical Review A

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

Paulina Lewandowska, Ryszard Kukulski

Published Oct 18, 2024• 2 citations
arXivHTMLPDF

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

DOI
10.1103/physreva.110.042422

Related papers

Storage and retrieval of von Neumann measurements

Paulina Lewandowska, Ryszard Kukulski, Łukasz Pawela +1 more

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.

arXiv:2204.03029•Physical Review A•Nov 18, 2022•7 citations

What Can Be Computed with Indefinite Causal Structure?

Omri Shmueli

Can quantum computation become more powerful when operations do not need to follow a definite causal order? We study this question in the process matrix formalism of Oreshkov et al. (Nature Communications, 2012), which allows quantum operations to be connected without a fixed global order. In the computational model, a quantum circuit succinctly describes a process matrix, and the algorithm is given access to its generated channel, with computational cost measured by the size of the generating circuit. We give polynomial-time algorithms in two settings. First, general process matrix computation suffices to solve every problem in $\textbf{NP}$. The valid processes used by our algorithm satisfy the purification postulate of Araújo et al. (Quantum, 2017), and their generated channels are unitary, although their generating circuits are not. Second, requiring the process matrices themselves to be pure, we give a polynomial-time algorithm for unique-sink orientation, a general problem capturing several longstanding computational problems in optimization. Our unitary generators are constructed explicitly and efficiently. Assuming that unique-sink orientation has no quantum polynomial-time algorithm, our result shows that indefinite causal order can provide computational power beyond $\textbf{BQP}$ within the process matrix formalism, even while preserving unitarity.

quant-pharXiv:2610.40573•Oct 30, 2026•0 citations

Appearance of causality in process matrices when performing fixed-basis measurements for two parties

Veronika Baumann, Časlav Brukner

The recently developed framework for quantum theory with no global causal order allows for quantum processes in which operations in local laboratories are neither causally ordered nor in a probabilistic mixture of definite causal orders. The causal relation between the laboratories is described by the process matrix. We show that, if the inputs of the laboratories are measured in a fixed basis, one can introduce an effective process matrix which is operationally indistinguishable from the original one. This effective process matrix can be obtained by applying the von Neumann--L\"uders update rule for nonselective measurements to the original process matrix and, in the bipartite case, it is compatible with a definite causal order. The latter extends the original Oreshkov et al. proof where one considers that both the measurement of the input and the re-preparation of the output are performed in a fixed basis.

arXiv:1601.06620•Physical Review A•Jun 20, 2016•8 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

Superposition of dynamics, indefinite causal order, and quantum histories

Charis Anastopoulos, Ntina Savvidou

The process-matrix formalism describes quantum processes without assuming a fixed global causal order, but the physical meaning of indefinite causal order remains open. We address this question within histories theory, where temporal ordering and dynamical evolution are distinct structures. We show that the decoherence functional admits coherent superpositions of dynamics. In measurement settings, under suitable factorization conditions, these generate process matrices. In the bipartite setting considered here, process-matrix indefinite causal order is thereby identified as an operationally restricted realization of the more general phenomenon of superposition of dynamics. Histories theory also admits a distinct kinematical notion of indefinite order, in which the ordering of physical events is itself a history observable. The resulting distinction between event order and intervention order clarifies the relation between indefinite causal order, quantum dynamics, and spacetime structure.

quant-pharXiv:2608.16694•Aug 18, 2026•1 citation

Unbounded separation between definite and indefinite causal order in finite-dimensional quantum metrology

Yanglin Hu, Zi-Shen Li, Giulio Chiribella +1 more

Indefinite causal order is known to offer enhancements in quantum metrology, notably including an unbounded advantage in the measurement of a geometric phase of a harmonic oscillator. This advantage, however, is specific to the infinite dimensional setting, and its finite dimensional analogue remains elusive, with recent findings suggesting that advantages in finite dimensions may be fundamentally limited to bounded constant factors. Here we show that, in fact, arbitrarily large advantages arise for finite dimensional systems in the finite sample regime. Specifically, we establish an unbounded separation between definite and indefinite causal order in the estimation of a geometric phase associated to two sets of $N$ displacements generated by discrete position and momentum operators on a $d$-dimensional quantum system: for any given constant $R$, there exist values of $N$ and $d=Ω(N^2)$ such that a strategy with indefinite order uses an initial probe with $R$ times less energy than the probe required by every strategy with definite order achieving the same mean squared error, whenever the number of measurement shots $ν$ is bounded as $ν=\mathcal{O}(\exp(πd/16)/\mathrm{poly}(d))$. In other words, indefinite order offers an energy saving that grows arbitrarily large with the parameters of the problem. To prove this result, we establish an approximate Weyl relation for discrete Gaussian wavepackets, which is of independent technical interest.

quant-pharXiv:2610.01462•Oct 2, 2026•0 citations
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 Fd(N)=1\ensuremath−\ensuremathΘ(1N2){F}_{d}(N)=1\ensuremath{-}\mathrm{\ensuremath{\Theta}}(\frac{1}{{N}^{2}})Fd​(N)=1\ensuremath−\ensuremathΘ(N21​) 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≥3N\ensuremath{\ge}3N\ensuremath≥3.
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{\rightarrow}1$ learning scheme. We show that ${F}_{d}=1\ensuremath{-}\mathrm{\ensuremath{\Theta}}(\frac{1}{{N}^{2}})$ 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.
Can quantum computation become more powerful when operations do not need to follow a definite causal order? We study this question in the process matrix formalism of Oreshkov et al. (Nature Communications, 2012), which allows quantum operations to be connected without a fixed global order. In the computational model, a quantum circuit succinctly describes a process matrix, and the algorithm is given access to its generated channel, with computational cost measured by the size of the generating circuit. We give polynomial-time algorithms in two settings. First, general process matrix computation suffices to solve every problem in NP\textbf{NP}NP. The valid processes used by our algorithm satisfy the purification postulate of Araújo et al. (Quantum, 2017), and their generated channels are unitary, although their generating circuits are not. Second, requiring the process matrices themselves to be pure, we give a polynomial-time algorithm for unique-sink orientation, a general problem capturing several longstanding computational problems in optimization. Our unitary generators are constructed explicitly and efficiently. Assuming that unique-sink orientation has no quantum polynomial-time algorithm, our result shows that indefinite causal order can provide computational power beyond BQP\textbf{BQP}BQP within the process matrix formalism, even while preserving unitarity.
The recently developed framework for quantum theory with no global causal order allows for quantum processes in which operations in local laboratories are neither causally ordered nor in a probabilistic mixture of definite causal orders. The causal relation between the laboratories is described by the process matrix. We show that, if the inputs of the laboratories are measured in a fixed basis, one can introduce an effective process matrix which is operationally indistinguishable from the original one. This effective process matrix can be obtained by applying the von Neumann--L\"uders update rule for nonselective measurements to the original process matrix and, in the bipartite case, it is compatible with a definite causal order. The latter extends the original Oreshkov et al. proof where one considers that both the measurement of the input and the re-preparation of the output are performed in a fixed basis.
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.
The process-matrix formalism describes quantum processes without assuming a fixed global causal order, but the physical meaning of indefinite causal order remains open. We address this question within histories theory, where temporal ordering and dynamical evolution are distinct structures. We show that the decoherence functional admits coherent superpositions of dynamics. In measurement settings, under suitable factorization conditions, these generate process matrices. In the bipartite setting considered here, process-matrix indefinite causal order is thereby identified as an operationally restricted realization of the more general phenomenon of superposition of dynamics. Histories theory also admits a distinct kinematical notion of indefinite order, in which the ordering of physical events is itself a history observable. The resulting distinction between event order and intervention order clarifies the relation between indefinite causal order, quantum dynamics, and spacetime structure.
Indefinite causal order is known to offer enhancements in quantum metrology, notably including an unbounded advantage in the measurement of a geometric phase of a harmonic oscillator. This advantage, however, is specific to the infinite dimensional setting, and its finite dimensional analogue remains elusive, with recent findings suggesting that advantages in finite dimensions may be fundamentally limited to bounded constant factors. Here we show that, in fact, arbitrarily large advantages arise for finite dimensional systems in the finite sample regime. Specifically, we establish an unbounded separation between definite and indefinite causal order in the estimation of a geometric phase associated to two sets of NNN displacements generated by discrete position and momentum operators on a ddd-dimensional quantum system: for any given constant RRR, there exist values of NNN and d=Ω(N2)d=Ω(N^2)d=Ω(N2) such that a strategy with indefinite order uses an initial probe with RRR times less energy than the probe required by every strategy with definite order achieving the same mean squared error, whenever the number of measurement shots ννν is bounded as ν=O(exp⁡(πd/16)/poly(d))ν=\mathcal{O}(\exp(πd/16)/\mathrm{poly}(d))ν=O(exp(πd/16)/poly(d)). In other words, indefinite order offers an energy saving that grows arbitrarily large with the parameters of the problem. To prove this result, we establish an approximate Weyl relation for discrete Gaussian wavepackets, which is of independent technical interest.