pith. sign in

arxiv: 2507.10784 · v4 · pith:SZ6YCFAFnew · submitted 2025-07-14 · 🪐 quant-ph

Quantum Advantage in Storage and Retrieval of Isometry Channels

Satoshi Yoshida , Jisho Miyazaki , Mio Murao This is my paper

Pith reviewed 2026-05-19 04:15 UTC · model grok-4.3

classification 🪐 quant-ph
keywords isometry channelsstorage and retrievalquantum advantageport-based teleportationchannel estimationfidelitydiamond normquery complexity
0
0 comments X

The pith

Quantum strategies store unknown isometry channels using only the square root as many queries as classical estimation.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the task of encoding an unknown isometry channel into a quantum program state so the channel can later be retrieved on demand. Classical approaches first estimate the channel from multiple queries and then store the classical description of that estimate, but the derived optimal fidelity shows this requires the number of queries to grow inversely with the target error. The authors prove the best estimation fidelity takes the form 1 minus d times D minus d over n plus higher-order corrections and use this to establish the linear scaling in inverse error for classical methods. They introduce a quantum strategy that directly encodes the isometry into a program state via port-based teleportation, reducing the required queries to scale only with the square root of the inverse error. The same construction also yields lower program costs when applied to arbitrary quantum channels.

Core claim

The optimal fidelity for isometry estimation is given by F = 1 - d(D-d)/n + O(n^{-2}). This shows that the classical strategy is suboptimal for isometry channels and requires n = Θ(ε^{-1}) queries to achieve diamond-norm error ε. A quantum strategy based on port-based teleportation stores the isometry channel in a program state using only n = Θ(1/√ε) queries and achieves a quadratic improvement.

What carries the argument

The port-based teleportation scheme that directly encodes the unknown isometry into a quantum program state for approximate retrieval.

If this is right

  • Classical estimation is no longer optimal for the storage and retrieval of isometry channels, unlike the case for unitary channels.
  • The number of queries needed to reach a given diamond-norm error drops from linear in the inverse error to square-root scaling.
  • The same port-based teleportation construction improves the program cost when storing general quantum channels compared with earlier results.
  • The performance gap arises because isometries map a d-dimensional input space into a D-dimensional output space rather than acting on a single space.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Similar quadratic advantages may exist for storage of other restricted classes of channels such as those with fixed Kraus rank.
  • The scaling result could be tested directly in small-scale quantum optics or superconducting circuit experiments with low-dimensional isometries.
  • The technique might connect to improved protocols for quantum channel discrimination or approximate cloning of channels.

Load-bearing premise

The analysis assumes multiple independent queries to the fixed but unknown isometry channel are available and that the large-n asymptotic regime governs the error scaling.

What would settle it

Measure the diamond-norm error achieved by the quantum strategy after n queries and check whether the error decreases proportionally to one over the square root of n rather than one over n.

Figures

Figures reproduced from arXiv: 2507.10784 by Jisho Miyazaki, Mio Murao, Satoshi Yoshida.

Figure 1
Figure 1. Figure 1: FIG. 1. (a) Classical (estimation-based) strategy for dSAR of [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. Quantum state estimation obeys the SQL, where [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
read the original abstract

Storage and retrieval refer to the task of encoding an unknown quantum channel $\Lambda$ 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 $\Lambda$ to estimate $\Lambda$ 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)\over 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 = \Theta(\epsilon^{-1})$ to achieve the diamond-norm error $\epsilon$. We propose a more efficient quantum strategy based on port-based teleportation, which stores the isometry channel in a program state using only $n = \Theta(1/\sqrt{\epsilon})$ 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 \textbf{5}, 488 (2021)].

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript investigates storage and retrieval of unknown isometry channels. It derives the asymptotic optimal fidelity for isometry estimation with n queries as F = 1 - d(D-d)/n + O(n^{-2}), claims that the classical estimation-based strategy requires n = Θ(ε^{-1}) queries to reach diamond-norm error ε, and proposes a quantum strategy via port-based teleportation that achieves the same error with n = Θ(1/√ε) queries, establishing a quadratic quantum advantage. The method is extended to general channels with improved program cost relative to prior work.

Significance. If the claimed scalings are accurate, the work demonstrates a concrete quantum advantage for isometry (but not unitary) channel storage and retrieval, with the explicit fidelity formula and port-based teleportation reduction providing falsifiable predictions and a constructive protocol. These elements strengthen the contribution beyond prior channel-programming results.

major comments (1)
  1. Abstract: The asserted classical scaling 'n = Θ(ε^{-1}) to achieve the diamond-norm error ε' is inconsistent with the stated fidelity formula F = 1 - d(D-d)/n + O(n^{-2}). Because the diamond norm between the corresponding isometry channels equals the trace norm of the difference of their (normalized) Choi operators and obeys the state inequality 1-F ≤ ε/2 ≤ √(1-F), the relation ε ≈ 2√(1-F) holds for small errors. Substituting the fidelity scaling then yields n = Θ(ε^{-2}), not Θ(ε^{-1}). This mismatch directly undermines the quadratic-advantage claim and is load-bearing for the central comparison between classical and quantum strategies.
minor comments (1)
  1. Abstract: The symbols d and D (input and output dimensions) are introduced without prior definition; a brief parenthetical clarification would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their detailed and constructive report. We have carefully considered the major comment regarding the classical scaling and agree that a correction is needed. Below we provide a point-by-point response.

read point-by-point responses

  1. Referee: Abstract: The asserted classical scaling 'n = Θ(ε^{-1}) to achieve the diamond-norm error ε' is inconsistent with the stated fidelity formula F = 1 - d(D-d)/n + O(n^{-2}). Because the diamond norm between the corresponding isometry channels equals the trace norm of the difference of their (normalized) Choi operators and obeys the state inequality 1-F ≤ ε/2 ≤ √(1-F), the relation ε ≈ 2√(1-F) holds for small errors. Substituting the fidelity scaling then yields n = Θ(ε^{-2}), not Θ(ε^{-1}). This mismatch directly undermines the quadratic-advantage claim and is load-bearing for the central comparison between classical and quantum strategies.

    Authors: We thank the referee for identifying this inconsistency. We agree that the relation between the isometry estimation fidelity F and the diamond-norm channel error ε is given by ε ≈ 2√(1-F) for small errors, as the diamond norm equals the trace norm of the difference of the normalized Choi operators. Consequently, the classical estimation-based strategy requires n = Θ(ε^{-2}) queries rather than Θ(ε^{-1}). We will revise the abstract, the introduction, and the relevant discussion sections to correct this scaling. With the corrected classical complexity, our port-based teleportation protocol (which achieves n = Θ(ε^{-1/2})) actually yields a stronger advantage than originally stated. We will update the manuscript to present the accurate comparison between the two strategies while preserving all technical results on the quantum protocol and the fidelity formula. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the derivation chain

full rationale

The paper derives the optimal fidelity F = 1 - d(D-d)/n + O(n^{-2}) for isometry estimation from standard asymptotic analysis of multiple independent queries to the unknown isometry, reducing to known results for pure-state estimation in the d=1 case. This result is not equivalent to its inputs by construction, nor does it rename a fitted parameter as a prediction. The subsequent claims on n = Θ(ε^{-1}) for classical diamond-norm error and the quadratic improvement via port-based teleportation follow from this derivation combined with standard quantum channel formalism and relations to the diamond norm; no load-bearing self-citation, imported uniqueness theorem, or ansatz smuggling is present. The extension to general channels builds on external prior work. The derivation chain is self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work relies on established quantum information theory without new free parameters or invented entities.

axioms (1)
  • standard math Standard framework of quantum channels and isometries in finite-dimensional Hilbert spaces.
    The analysis uses the definition of quantum channels as completely positive trace-preserving maps and isometries as inner-product-preserving linear maps.

pith-pipeline@v0.9.0 · 5829 in / 1250 out tokens · 58073 ms · 2026-05-19T04:15:59.906761+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Strict Hierarchy for Quantum Channel Certification to Unitary

    quant-ph 2026-04 unverdicted novelty 8.0

    Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.

  2. Quantum channel tomography: optimal bounds and a Heisenberg-to-classical phase transition

    quant-ph 2026-04 unverdicted novelty 7.0

    Quantum channel tomography query complexity transitions from Heisenberg scaling Θ(r d1 d2 / ε) at dilation rate τ=1 to classical scaling Θ(r d1 d2 / ε²) for τ ≥ 1+Ω(1).

  3. Random dilation superchannel

    quant-ph 2025-12 unverdicted novelty 7.0

    Presents a poly-complexity quantum circuit implementing the random dilation superchannel for parallel channel queries, with approximate sequential extension, a no-go theorem for exact sequential dilation, and an appli...

Reference graph

Works this paper leans on

101 extracted references · 101 canonical work pages · cited by 3 Pith papers · 37 internal anchors

  1. [1]

    Isometry operatorV∈V iso(d, D) is defined by ad×Dcomplex matrix satisfyingV †V=1 d, which is given byd 2 independent conditions on real param- eters

    An arbitraryd×Dcomplex matrix can be represented by 2Ddreal parameters. Isometry operatorV∈V iso(d, D) is defined by ad×Dcomplex matrix satisfyingV †V=1 d, which is given byd 2 independent conditions on real param- eters. Subtracting the number of constraintsd 2 and the degree of freedom of the global phase 1 from 2Dd, we obtain 2Dd−d 2 −1

    work page

  2. [2]

    ,|v d⟩} ⊂C D

    An isometry operatorV∈V iso(d, D) can be represented by dorthonormalD-dimensional vectors{|v 1⟩, . . . ,|v d⟩} ⊂C D. We associate real parameters to represent|v i⟩recursively as follows. The vector|v 1⟩is a unit normD-dimensional com- plex vector, which can be represented by 2D−2 real parame- ters by ignoring the global phase. The vector|v i+1⟩is a unit n...

    work page

  3. [3]

    Definition of the Young diagrams 6

    work page

  4. [4]

    Schur-Weyl duality 7

    work page

  5. [5]

    Review on quantum testers 10

    Schur-Weyl duality applied for isometry channels 9 C. Review on quantum testers 10

    work page

  6. [6]

    Choi representation 10

    work page

  7. [7]

    The optimal retrieval error of the estimation-based and PBT-based strategies for dSAR of isometry channels 11 E

    Quantum testers 10 D. The optimal retrieval error of the estimation-based and PBT-based strategies for dSAR of isometry channels 11 E. Proof of Thm. 1 (Asymptotic fidelity of optimal isometry estimation) 13

    work page

  8. [8]

    S4 (Parallel covariant form of optimal isometry channel) 15

    Proof of Lem. S4 (Parallel covariant form of optimal isometry channel) 15

    work page

  9. [9]

    S5 (Construction of the asymptotically optimal isometry estimation protocol) 20 F

    Proof of Lem. S5 (Construction of the asymptotically optimal isometry estimation protocol) 20 F. The SQL in parameter estimation of isometry channels 23 G. Proof of Cor. 2 (Program cost of the estimation-based universal programming of isometry channels) 25 H. Proof of Thm. 3 (Asymptotic optimality of the PBT-based strategy for dSAR of isometry channels an...

    work page

  10. [10]

    , αd)∈Z d α1 ≥ · · · ≥α d ≥0, dX i=1 αi =n ) ,(B1) whereZis the set of integers

    Definition of the Young diagrams We define the setY d n by Yd n := ( α= (α 1, . . . , αd)∈Z d α1 ≥ · · · ≥α d ≥0, dX i=1 αi =n ) ,(B1) whereZis the set of integers. An elementα∈Y d n is called a Young diagram. For a Young diagram, we define the sets α+ d □ :={α+e i |i∈ {1, . . . , d}} ∩Y d n+1,(B2) α− d □ :={α−e i |i∈ {1, . . . , d}} ∩Y d n−1,(B3) 7 TABLE...

    work page

  11. [11]

    Schur-Weyl duality We consider the following representations on (C d)⊗n of the special unitary group SU(d) and the symmetric group Sn: SU(d)∋U7→U ⊗n ∈ L(C d)⊗n,(B6) Sn ∋σ7→P σ ∈ L(C d)⊗n,(B7) whereP σ is a permutation operator defined as Pσ |i1 · · ·i n⟩ := iσ−1(1) · · ·i σ−1(n) (B8) 8 for the computational basis{|i⟩} d i=1 ofC d. Then, these representati...

    work page

  12. [12]

    [65, 66], then-fold isometry operatorV ⊗n forV∈V iso(d, D) can be decomposed as V ⊗n = M α∈Ydn Vα ⊗1 Sµ ,(B24) whereV α :U (d) α → U (D) α is an isometry operator

    Schur-Weyl duality applied for isometry channels As shown in Refs. [65, 66], then-fold isometry operatorV ⊗n forV∈V iso(d, D) can be decomposed as V ⊗n = M α∈Ydn Vα ⊗1 Sµ ,(B24) whereV α :U (d) α → U (D) α is an isometry operator. The isometry operatorV α has the following property: Lemma S1.For anyα∈Y d n andV∈V iso(d, D), Vα ⊗V= M µ∈α+d□ Vµ ⊗ |α⟩ ⟨α|mul...

    work page

  13. [13]

    Choi representation We consider a quantum channel Λ :L(I)→ L(O), whereIandOare the Hilbert spaces corresponding to the input and output systems. The Choi matrixJ Λ ∈ L(I ⊗ O) is defined by JΛ := X i,j |i⟩ ⟨j|I ⊗Λ(|i⟩ ⟨j|)O,(C1) where{|i⟩} i is the computational basis ofI, and the subscriptsIandOrepresent the Hilbert spaces where each term is defined. The ...

    work page

  14. [14]

    The set of quantum testers contains the set of protocols allowed in the quantum circuit framework [72, 73] as a subset

    Quantum testers A quantum tester is a multi-linear transformation from multiple quantum channels to a probability distribution. The set of quantum testers contains the set of protocols allowed in the quantum circuit framework [72, 73] as a subset. It also contains protocols beyond the quantum circuit framework, called the indefinite causal order protocols...

    work page

  15. [15]

    for the concave functionfand 1 d P i(αi −i) = n d − d+1 2 . 15

    work page

  16. [16]

    Proof of Lem. S4 (Parallel covariant form of optimal isometry channel) We show that a parallel covariant protocol can obtain the optimal fidelity of isometry estimation for a given number of queries. We prove this statement in a constructive way, similarly to the arguments shown in Refs. [44, 81–83]. We show the construction of a parallel covariant protoc...

    work page

  17. [17]

    Hamiltonian-not-in-Kraus-span

    Proof of Lem. S5 (Construction of the asymptotically optimal isometry estimation protocol) We construct a parallel covariant isometry estimation protocol achieving the fidelity shown in Lem. S5, which is used in the proof of Thm. 1 to construct the asymptotically optimal isometry estimation protocol. We use a similar strategy used in [16] to construct the...

    work page

  18. [18]

    M. A. Nielsen and I. L. Chuang, Programmable Quantum Gate Arrays, Phys. Rev. Lett.79, 321 (1997), arXiv:quant- ph/9703032

    work page arXiv 1997

  19. [19]

    J. Kim, Y. Cheong, J.-S. Lee, and S. Lee, Storing unitary operators in quantum states, Phys. Rev. A65, 012302 (2001), arXiv:quant-ph/0109097

    work page internal anchor Pith review Pith/arXiv arXiv 2001

  20. [20]

    Storing quantum dynamics in quantum states: stochastic programmable gate for U(1) operations

    G. Vidal, L. Masanes, and J. I. Cirac, Storing Quantum Dynamics in Quantum States: A Stochastic Programmable Gate, Phys. Rev. Lett.88, 047905 (2002), arXiv:quant-ph/0102037

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  21. [21]

    Probabilistic implementation of universal quantum processors

    M. Hillery, V. Buˇ zek, and M. Ziman, Probabilistic implementation of universal quantum processors, Phys. Rev. A65, 022301 (2002), arXiv:quant-ph/0106088

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  22. [22]

    Hillery, M

    M. Hillery, M. Ziman, and V. Buˇ zek, Implementation of quantum maps by programmable quantum processors, Phys. Rev. A66, 042302 (2002)

    work page 2002

  23. [23]

    A. Winter, Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels, Journal of Mathematical Physics43, 4341 (2002), arXiv:quant-ph/0108066

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  24. [24]

    Y. Yu, J. Feng, and M. Zhan, Multi-output programmable quantum processor, Phys. Rev. A66, 052310 (2002), arXiv:quant- ph/0209069

    work page arXiv 2002

  25. [25]

    Improving performance of probabilistic programmable quantum processors

    M. Hillery, M. Ziman, and V. Buˇ zek, Improving the performance of probabilistic programmable quantum processors, Phys. Rev. A69, 042311 (2004), arXiv:quant-ph/0311170

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  26. [26]

    Probabilistic programmable quantum processors with multiple copies of program state

    A. Brazier, V. Buˇ zek, and P. L. Knight, Probabilistic programmable quantum processors with multiple copies of program states, Phys. Rev. A71, 032306 (2005), arXiv:quant-ph/0505202. 31

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  27. [27]

    Approximate programmable quantum processors

    M. Hillery, M. Ziman, and V. Buˇ zek, Approximate programmable quantum processors, Phys. Rev. A73, 022345 (2006), arXiv:quant-ph/0510161

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  28. [28]

    Asymptotic teleportation scheme as a universal programmable quantum processor

    S. Ishizaka and T. Hiroshima, Asymptotic Teleportation Scheme as a Universal Programmable Quantum Processor, Phys. Rev. Lett.101, 240501 (2008), arXiv:0807.4568

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  29. [29]

    Quantum teleportation scheme by selecting one of multiple output ports

    S. Ishizaka and T. Hiroshima, Quantum teleportation scheme by selecting one of multiple output ports, Phys. Rev. A79, 042306 (2009), arXiv:0901.2975

    work page internal anchor Pith review Pith/arXiv arXiv 2009

  30. [30]

    Optimal probabilistic storage and retrieval of unitary channels

    M. Sedl´ ak, A. Bisio, and M. Ziman, Optimal Probabilistic Storage and Retrieval of Unitary Channels, Physical Review Letters122, 170502 (2019), arXiv:1809.04552 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  31. [31]

    A. M. Kubicki, C. Palazuelos, and D. P´ erez-Garc´ ıa, Resource Quantification for the No-Programing Theorem, Phys. Rev. Lett.122, 080505 (2019), arXiv:1805.00756

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  32. [32]

    Sedl´ ak and M

    M. Sedl´ ak and M. Ziman, Probabilistic storage and retrieval of qubit phase gates, Phys. Rev. A102, 032618 (2020), arXiv:2008.09555

    work page arXiv 2020

  33. [33]

    Y. Yang, R. Renner, and G. Chiribella, Optimal Universal Programming of Unitary Gates, Phys. Rev. Lett.125, 210501 (2020), arXiv:2007.10363

    work page arXiv 2020

  34. [34]

    Banchi, J

    L. Banchi, J. Pereira, S. Lloyd, and S. Pirandola, Convex optimization of programmable quantum computers, npj Quantum Information6, 42 (2020), arXiv:1905.01316

    work page arXiv 2020

  35. [35]

    Gschwendtner, A

    M. Gschwendtner, A. Bluhm, and A. Winter, Programmability of covariant quantum channels, Quantum5, 488 (2021), arXiv:2012.00717

    work page arXiv 2021

  36. [36]

    Pavliˇ cko and M

    J. Pavliˇ cko and M. Ziman, Robustness of optimal probabilistic storage and retrieval of unitary channels to noise, Phys. Rev. A106, 052416 (2022), arXiv:2211.07079

    work page arXiv 2022

  37. [37]

    Schoute, D

    E. Schoute, D. Grinko, Y. Subasi, and T. Volkoff, Quantum programmable reflections, arXiv:2411.03648 (2024)

    work page arXiv 2024

  38. [38]

    Duˇ sek and V

    M. Duˇ sek and V. Buˇ zek, Quantum-controlled measurement device for quantum-state discrimination, Phys. Rev. A66, 022112 (2002)

    work page 2002

  39. [39]

    Universal measurement apparatus controlled by quantum software

    J. Fiur´ aˇ sek, M. Duˇ sek, and R. Filip, Universal Measurement Apparatus Controlled by Quantum Software, Phys. Rev. Lett. 89, 190401 (2002), arXiv:quant-ph/0202152

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  40. [40]

    J. P. Paz and A. Roncaglia, Quantum gate arrays can be programmed to evaluate the expectation value of any operator, Phys. Rev. A68, 052316 (2003), arXiv:quant-ph/0306143

    work page internal anchor Pith review Pith/arXiv arXiv 2003

  41. [41]

    Generalized measurements via programmable quantum processor

    M. Roˇ sko, V. Buˇ zek, P. R. Chouha, and M. Hillery, Generalized measurements via a programmable quantum processor, Phys. Rev. A68, 062302 (2003), arXiv:quant-ph/0311172

    work page internal anchor Pith review Pith/arXiv arXiv 2003

  42. [42]

    Probabilistic quantum multimeters

    J. Fiur´ aˇ sek and M. Duˇ sek, Probabilistic quantum multimeters, Phys. Rev. A69, 032302 (2004), arXiv:quant-ph/0308111

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  43. [43]

    G. M. D’Ariano and P. Perinotti, Efficient Universal Programmable Quantum Measurements, Phys. Rev. Lett.94, 090401 (2005), arXiv:quant-ph/0410169

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  44. [44]

    J. A. Bergou, V. Buˇ zek, E. Feldman, U. Herzog, and M. Hillery, Programmable quantum-state discriminators with simple programs, Phys. Rev. A73, 062334 (2006)

    work page 2006

  45. [45]

    Universal programmable devices for unambiguous discrimination

    C. Zhang, M. Ying, and B. Qiao, Universal programmable devices for unambiguous discrimination, Phys. Rev. A74, 042308 (2006), arXiv:quant-ph/0606189

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  46. [46]

    P´ erez-Garc´ ıa, Optimality of programmable quantum measurements, Phys

    D. P´ erez-Garc´ ıa, Optimality of programmable quantum measurements, Phys. Rev. A73, 052315 (2006), arXiv:quant- ph/0602084

    work page arXiv 2006

  47. [47]

    Programmable unknown quantum-state discriminators with multiple copies of program and data: A Jordan basis approach

    B. He and J. A. Bergou, Programmable unknown quantum-state discriminators with multiple copies of program and data: A jordan-basis approach, Phys. Rev. A75, 032316 (2007), arXiv:quant-ph/0610226

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  48. [48]

    Sent´ ıs, E

    G. Sent´ ıs, E. Bagan, J. Calsamiglia, and R. Mu˜ noz Tapia, Multicopy programmable discrimination of general qubit states, Phys. Rev. A82, 042312 (2010)

    work page 2010

  49. [49]

    Quantum learning algorithms for quantum measurements

    A. Bisio, G. M. D’Ariano, P. Perinotti, and M. Sedl´ ak, Quantum learning algorithms for quantum measurements, Physics Letters A375, 3425 (2011), arXiv:1103.0480

    work page internal anchor Pith review Pith/arXiv arXiv 2011

  50. [50]

    T. Zhou, J. X. Cui, X. Wu, and G. L. Lon, Multicopy programmable discriminators between two unknown qubit states with group-theoretic approach, Quantum Information & Computation12, 1017 (2012), arXiv:1112.0931

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  51. [51]

    Success probabilities for universal unambiguous discriminators between unknown pure states

    T. Zhou, Success probabilities for universal unambiguous discriminators between unknown pure states, Phys. Rev. A89, 014301 (2014), arXiv:1308.0707

    work page internal anchor Pith review Pith/arXiv arXiv 2014

  52. [52]

    M. A. Jafarizadeh, P. Mahmoudi, D. Akhgar, and E. Faizi, Designing an optimal, universal, programmable, and unam- biguous discriminator fornunknown qubits, Phys. Rev. A96, 052111 (2017)

    work page 2017

  53. [53]

    Chabaud, E

    U. Chabaud, E. Diamanti, D. Markham, E. Kashefi, and A. Joux, Optimal quantum-programmable projective measurement with linear optics, Phys. Rev. A98, 062318 (2018), arXiv:1805.02546

    work page arXiv 2018

  54. [54]

    Lewandowska, R

    P. Lewandowska, R. Kukulski, L. Pawela, and Z. Pucha la, Storage and retrieval of von Neumann measurements, Phys. Rev. A106, 052423 (2022), arXiv:2204.03029

    work page arXiv 2022

  55. [55]

    Gschwendtner and A

    M. Gschwendtner and A. Winter, Infinite-Dimensional Programmable Quantum Processors, PRX Quantum2, 030308 (2021), arXiv:2012.00736

    work page arXiv 2021

  56. [56]

    Miyadera and R

    T. Miyadera and R. Takakura, Programming of channels in generalized probabilistic theories, Journal of Mathematical Physics64(2023), arXiv:2205.08940

    work page arXiv 2023

  57. [57]

    Ac´ ın, E

    A. Ac´ ın, E. Jan´ e, and G. Vidal, Optimal estimation of quantum dynamics, Phys. Rev. A64, 050302(R) (2001), arXiv:quant- ph/0012015

    work page arXiv 2001

  58. [58]

    Optimal quantum learning of a unitary transformation

    A. Bisio, G. Chiribella, G. M. D’Ariano, S. Facchini, and P. Perinotti, Optimal quantum learning of a unitary transforma- tion, Physical Review A81, 032324 (2010), arXiv:0903.0543

    work page internal anchor Pith review Pith/arXiv arXiv 2010

  59. [59]

    Fast rate estimation of an unitary operation in SU(d)

    J. Kahn, Fast rate estimation of a unitary operation in SU(d), Phys. Rev. A75, 022326 (2007), arXiv:quant-ph/0603115

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  60. [60]

    J. Haah, R. Kothari, R. O’Donnell, and E. Tang, Query-optimal estimation of unitary channels in diamond distance, in2023 32 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)(IEEE, 2023) pp. 363–390, arXiv:2302.14066

    work page arXiv 2023

  61. [61]

    Yoshida, Y

    S. Yoshida, Y. Koizumi, M. Studzi´ nski, M. T. Quintino, and M. Murao, One-to-one Correspondence between Deterministic Port-Based Teleportation and Unitary Estimation, arXiv:2408.11902 (2024)

    work page arXiv 2024

  62. [62]

    Yoshida, H

    S. Yoshida, H. Yoshida, and M. Murao, Asymptotically optimal unitary estimation in SU(3), in preparation

    work page

  63. [63]

    Port-based teleportation in arbitrary dimension

    M. Studzi´ nski, S. Strelchuk, M. Mozrzymas, and M. Horodecki, Port-based teleportation in arbitrary dimension, Scientific Reports7, 10871 (2017), arXiv:1612.09260

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  64. [64]

    M. A. Nielsen and I. Chuang,Quantum Computation and Quantum Information(Cambridge University Press, 2010)

    work page 2010

  65. [65]

    M. M. Wilde,Quantum Information Theory(Cambridge University Press, Cambridge, 2013) arXiv:1106.1445

    work page arXiv 2013

  66. [66]

    Watrous,The Theory of Quantum Information(Cambridge University Press, Cambridge, UK, 2018)

    J. Watrous,The Theory of Quantum Information(Cambridge University Press, Cambridge, UK, 2018)

    work page 2018

  67. [67]

    Optimal state estimation for d-dimensional quantum systems

    D. Bruß and C. Macchiavello, Optimal state estimation for d-dimensional quantum systems, Physics Letters A253, 249 (1999), arXiv:quant-ph/9812016

    work page internal anchor Pith review Pith/arXiv arXiv 1999

  68. [68]

    A. A. Mele, Introduction to Haar Measure Tools in Quantum Information: A Beginner’s Tutorial, Quantum8, 1340 (2024), arXiv:2307.08956

    work page arXiv 2024

  69. [69]

    A fidelity measure for quantum channels

    M. Raginsky, A fidelity measure for quantum channels, Physics Letters A290, 11 (2001), arXiv:quant-ph/0107108

    work page internal anchor Pith review Pith/arXiv arXiv 2001

  70. [70]

    Truncations of random unitary matrices

    K. Zyczkowski and H.-J. Sommers, Truncations of random unitary matrices, Journal of Physics A: Mathematical and General33, 2045 (2000), arXiv:chao-dyn/9910032

    work page internal anchor Pith review Pith/arXiv arXiv 2045

  71. [71]

    Kukulski, I

    R. Kukulski, I. Nechita, L. Pawela, Z. Pucha la, and K. ˙Zyczkowski, Generating random quantum channels, Journal of Mathematical Physics62(2021), arXiv:2011.02994

    work page arXiv 2021

  72. [72]

    See the Supplemental Material for the detail of the proof, which includes Refs. [67–84]

    work page

  73. [73]

    A. Y. Kitaev, Quantum computations: algorithms and error correction, Russian Mathematical Surveys52, 1191 (1997)

    work page 1997

  74. [74]

    Notes on super-operator norms induced by Schatten norms

    J. Watrous, Notes on super-operator norms induced by Schatten norms, Quantum Info. Comput.5, 58–68 (2005), arXiv:quant-ph/0411077

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  75. [75]

    Arora and B

    S. Arora and B. Barak,Computational Complexity: A Modern Approach(Cambridge University Press, 2009)

    work page 2009

  76. [76]

    Entanglement assisted alignment of reference frames using a dense covariant coding

    E. Bagan, M. Baig, and R. Mu˜ noz-Tapia, Entanglement-assisted alignment of reference frames using a dense covariant coding, Phys. Rev. A69, 050303(R) (2004), arXiv:quant-ph/0303019

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  77. [77]

    C. W. Helstrom, Quantum detection and estimation theory, Journal of Statistical Physics1, 231 (1969)

    work page 1969

  78. [78]

    A. S. Holevo,Probabilistic and statistical aspects of quantum theory, Vol. 1 (Springer Science & Business Media, 2011)

    work page 2011

  79. [79]

    Zhou and L

    S. Zhou and L. Jiang, Asymptotic theory of quantum channel estimation, PRX Quantum2, 010343 (2021), arXiv:2003.10559

    work page arXiv 2021

  80. [80]

    Choi, Completely positive linear maps on complex matrices, Linear algebra and its applications10, 285 (1975)

    M.-D. Choi, Completely positive linear maps on complex matrices, Linear algebra and its applications10, 285 (1975)

    work page 1975

Showing first 80 references.