arXiv:2410.23376 · Physical Review A

Storage and retrieval of two unknown unitary channels

Michal Sedlák, Robert Stárek, Nikola Horová, Michal Mičuda, Jaromı́r Fiurášek, Alessandro Bisio

Published Jun 25, 2026• 1 citation

Abstract

We address the task of converting n uses of an unknown unitary transformation into a quantum state (i.e., storage) and later retrieval of the transformation. Specifically, we consider the case where the unknown unitary is selected with equal prior probability from two options. First, we prove that the optimal storage strategy involves the sequential application of the n uses of the unknown unitary, and it produces the optimal state for discrimination between the two possible unitaries. Next, we show that incoherent “measure-and-prepare” retrieval achieves the maximum fidelity between the retrieved operation and the original (qubit) unitary. We then identify the retrieval strategy that maximizes the probability of successfully and perfectly retrieving the unknown transformation. In the regime in which the fidelity between the two possible unitaries is large the probability of success scales as P succ = 1 − O ( n − 2 ) , which is a quadratic improvement with respect to the case in which the unitaries are drawn from the entire unitary group U ( d ) with uniform prior probability. Finally, we present an optical experiment for this approach and assess the storage and retrieval quality using quantum tomography of states and processes. The results are discussed in relation to nonoptimal measure-and-prepare strategy, highlighting the advantages of our protocol.

DOI: 10.1103/56sd-xw8b

Related papers

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.0543Physical Review AMar 25, 2010148 citations

Quantum Advantage in Storage and Retrieval of Isometry Channels

Satoshi Yoshida, Jisho Miyazaki, Mio Murao

Storage and retrieval refer to the task of encoding an unknown quantum channel Λ into a quantum state, known as the program state, such that the channel can later be retrieved. There are two strategies for this task: classical and quantum strategies. The classical strategy uses multiple queries to Λ to estimate Λ and retrieves the channel based on the estimate represented in classical bits. The classical strategy turns out to offer the optimal performance for the storage and retrieval of unitary channels. In this work, we analyze the asymptotic performance of the classical and quantum strategies for the storage and retrieval of isometry channels. We show that the optimal fidelity for isometry estimation is given by F=1-[d(D-d)/n]+O(n^{-2}), where d and D denote the input and output dimensions of the isometry, and n is the number of queries. This result indicates that, unlike in the case of unitary channels, the classical strategy is suboptimal for the storage and retrieval of isometry channels, which requires n=Θ(ε^{-1}) to achieve the diamond-norm error ε. We propose a more efficient quantum strategy based on port-based teleportation, which stores the isometry channel in a program state using only n=Θ(1/sqrt[ε]) queries, achieving a quadratic improvement over the classical strategy. As an application, we extend our approach to general quantum channels, achieving improved program cost compared to prior results by Gschwendtner, Bluhm, and Winter [Quantum 5, 488 (2021)2521-327X10.22331/q-2021-06-29-488].

arXiv:2507.10784Physical Review LettersMar 27, 20261 citation

Optimal Probabilistic Storage and Retrieval of Unitary Channels

Michal Sedlák, Alessandro Bisio, Mário Ziman

We address the question of quantum memory storage for quantum dynamics. In particular, we design an optimal protocol for N→1 probabilistic storage and retrieval of unitary channels on d-dimensional quantum systems. If we access the unknown unitary gate only N times, the optimal success probability of perfect single-use retrieval is N/(N-1+d^{2}). The derived size of the memory system exponentially improves the known upper bound on the size of the program register needed for probabilistic programmable quantum processors. Our results are closely related to probabilistic perfect alignment of reference frames and probabilistic port-based teleportation.

arXiv:1809.04552Physical Review LettersMay 3, 201960 citations

Quantum theory of unambiguous measurements

Michal Sedlák

Quantum theory of unambiguous measurements In the present paper I formulate a framework that accommodates many unambiguous discrimination problems. I show that the prior information about any type of constituent (state, channel, or observable) allows us to reformulate the discrimination among finite number of alternatives as the discrimination among finite number of average constituents. Using this framework I solve several unambiguous tasks. I present a solution to optimal unambiguous comparison of two ensembles of unknown quantum states. I consider two cases: 1) The two unknown states are arbitrary pure states of qudits. 2) Alternatively, they are coherent states of single-mode optical fields. For this case I propose simple and optimal experimental setup composed of beam-splitters and a photodetector. As a second tasks I consider an unambiguous identification (UI) of coherent states. In this task identical quantum systems are prepared in coherent states and labeled as unknown and reference states, respectively. The promise is that one reference state is the same as the unknown state and the task is to find out unambiguously which one it is. The particular choice of the reference states is unknown to us, and only the probability distribution describing this choice is known. In a general case when multiple copies of unknown and reference states are available I propose a scheme consisting of beamsplitters and photodetectors that is optimal within linear optics. UI can be considered as a search in a quantum database, whose elements are the reference states and the query is represented by the unknown state. This perspective motivated me to show that reference states can be recovered after the measurement and might be used (with reduced success rate) in subsequent UI. Moreover, I analyze the influence of noise in preparation of coherent states on the performance of the proposed setup. Another problem I address is the unambiguous comparison of a pair of unknown qudit unitary channels. I characterize all solutions and identify the optimal ones. I prove that in optimal experiments for comparison of unitary channels the entanglement is necessary. The last task I studied is the unambiguous comparison of unknown non-degenerate projective measurements. I distinguish between measurement devices with apriori labeled and unlabeled outcomes. In both cases only the difference of the measurements can be concluded unambiguously. For the labeled case I derive the optimal strategy if each unknown measurement is used only once. However, if the apparatuses are not labeled, then each measurement device must be used (at least) twice. In particular, for qubit measurement apparatuses with unlabeled outcomes I derive the optimal test state in the two-shots scenario.

arXiv:1003.2448Acta Physica Slovaca Reviews and TutorialsDec 1, 200918 citations

Probabilistic Storage and Retrieval of Quantum Superchannels for "Retrospective" Intervention

Wataru Yokojima, Jisho Miyazaki, Mio Murao

Storing an unknown quantum computation in a quantum state and retrieving it at a desired later time is a challenging task, hindered by the no-programming theorem of quantum computations. In the previous studies on the task of probabilistic storage-and-retrieval (pSAR) of quantum channels, the maximum probability of exactly retrieving a single unknown unitary channel from a quantum state in which the unknown unitary has been encoded via multiple calls to the unknown unitary channel is derived. In this work, we consider a higher-order version of pSAR, the probabilistic storage-and-retrieval of definite-causal unitary superchannels, which are physically modeled by sequences of unitary channels with open slots where arbitrary channels can be inserted between the unitary channels for intervention. This task requires activating the "retrospective'' intervention functionality on the superchannel, beyond its normal intervention functionality. We propose two protocols: partial teleportation, which is supported by our numerical results for the small queries, and staircase backstitch, which achieves unit success probability asymptotically as the number of queries increases. We also derive a universal inversion protocol for unitary superchannels.

quant-pharXiv:2606.22343Jun 23, 20260 citations

Strategies for Discriminating and Comparing Unknown Unitary Transformations

Guy F. Okoko

How to discriminate or compare two unitary transformations that are completely unknown? We first examine the unambiguous discrimination of two unknown unitary transformations; we show that the results are the same as those found for the programmable discrimination of two unknown quantum states. Next we consider the minimum-error comparison of two unknown unitary transformations; the results are obtained in the general case where the prior probabilities are different. Last we study the unambiguous discrimination of two unknown unitary transformations in the case where multiple copies of data are available.

Jan 1, 20140 citations