pith. sign in

arxiv: 2504.12945 · v1 · submitted 2025-04-17 · 🪐 quant-ph

A resource theory of asynchronous quantum information processing

Chloe Kim , Eric Chitambar , Felix Leditzky This is my paper

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

classification 🪐 quant-ph
keywords port-based teleportationasynchronous quantum processingresource theoryquantum teleportationisotropic statesgraph statesEPR statesclassical threshold
0
0 comments X

The pith

A bipartite state breaks the one-way classical teleportation threshold precisely when the trivial discarding map suffices.

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

The paper constructs a hierarchy of communication models starting from port-based teleportation and successively adding free classical processing and quantum pre-processing. Each model preserves the defining feature of asynchronicity, so the receiver can begin local operations before the classical message arrives. The analysis computes tight bounds on achievable teleportation fidelity for isotropic states, bipartite graph states, and symmetrized EPR states inside these models. The central result is an equivalence: the strongest model in the hierarchy has exactly the same power as ordinary one-way teleportation for exceeding the classical threshold. This equivalence means the resource theory of asynchronous processing collapses to a simple test based on the discarding map alone.

Core claim

Among the hierarchy of communication models for asynchronous quantum information processing that augment port-based teleportation with free classical processing and quantum pre-processing, the strongest resource theory is equivalent in power to any standard one-way teleportation protocol for surpassing the classical teleportation threshold. Consequently, a bipartite state can break the one-way classical teleportation threshold if and only if it succeeds under the trivial decoding map obtained by discarding subsystems.

What carries the argument

The hierarchy of port-based teleportation protocols augmented by free classical processing and/or quantum pre-processing, which keeps the protocol asynchronous while progressively strengthening the decoder.

If this is right

  • Tight upper and lower bounds on optimal teleportation fidelity are obtained for isotropic states, bipartite graph states, and symmetrized EPR states inside each model of the hierarchy.
  • Asynchronous distributed quantum computation remains feasible under each successively stronger decoding strategy.
  • The ability to surpass the classical threshold reduces exactly to the performance of the discarding decoder, independent of the added pre-processing.
  • The resource theory therefore classifies states by whether they can beat classical limits with the simplest possible asynchronous decoder.

Where Pith is reading between the lines

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

  • The equivalence suggests that asynchronicity itself does not impose extra restrictions on beating classical limits beyond those already present in ordinary one-way communication.
  • The same hierarchy could be applied to other asynchronous tasks such as entanglement distillation or distributed sensing to check whether similar collapses occur.
  • One could test whether the equivalence survives when the states are noisy or when the dimension is increased beyond the cases explicitly computed.

Load-bearing premise

The proposed hierarchy of models continues to permit asynchronous distributed quantum computation even after classical and quantum pre-processing are added to the decoder.

What would settle it

A bipartite state that exceeds the classical teleportation threshold only when a non-trivial decoder is used, yet fails when subsystems are simply discarded, would falsify the claimed equivalence.

Figures

Figures reproduced from arXiv: 2504.12945 by Chloe Kim, Eric Chitambar, Felix Leditzky.

Figure 1
Figure 1. Figure 1: FIG. 1. Using teleportation in distributed computation. (a) In standard teleportation or general one-way LOCC protocols, any [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. The teleportation fidelity of PBT protocols as a function of the number of EPR pairs used as a resource. [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
read the original abstract

In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.

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 paper introduces a hierarchy of communication models for port-based teleportation (PBT) that preserve asynchrony while allowing free classical processing and/or quantum pre-processing. It computes tight bounds on optimal teleportation fidelities for isotropic states, bipartite graph states, and symmetrized EPR states. The central claim is that, within this hierarchy, the strongest model is equivalent in power to arbitrary one-way teleportation for exceeding the classical threshold: a bipartite state breaks the one-way classical teleportation threshold if and only if it does so using the trivial decoding map of discarding subsystems.

Significance. If the equivalence holds generally, the result would simplify resource-theoretic characterizations of asynchronous quantum communication by showing that additional classical or quantum processing confers no advantage in threshold violation beyond trivial decoding. The explicit tight bounds for the three state families provide concrete, falsifiable benchmarks that could guide applications in distributed quantum computation. The work also supplies a clear motivation for the hierarchy in terms of practical asynchronous processing.

major comments (1)
  1. [Abstract and concluding equivalence result] Abstract and the final equivalence statement: the 'only if' direction asserts that free classical post-processing and quantum pre-processing add no power beyond the trivial discarding map for breaking the classical threshold. This is load-bearing for the general claim. The manuscript derives tight bounds only for isotropic states, bipartite graph states, and symmetrized EPR states; if the general proof relies on state-specific symmetries or optimizers derived for these families (rather than a model-independent reduction), the equivalence does not necessarily extend to arbitrary bipartite states. Please identify the theorem or section containing the general argument and indicate whether it is independent of the analyzed families.
minor comments (1)
  1. [Abstract] The abstract states that the hierarchy 'still permits asynchronous distributed quantum computation'; a brief explicit verification that the added pre-processing steps do not violate the asynchrony condition (e.g., no requirement for classical messages before local operations begin) would improve clarity.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their thoughtful review and for highlighting the importance of clarifying the scope of our central equivalence result. We address this point directly below.

read point-by-point responses

  1. Referee: [Abstract and concluding equivalence result] Abstract and the final equivalence statement: the 'only if' direction asserts that free classical post-processing and quantum pre-processing add no power beyond the trivial discarding map for breaking the classical threshold. This is load-bearing for the general claim. The manuscript derives tight bounds only for isotropic states, bipartite graph states, and symmetrized EPR states; if the general proof relies on state-specific symmetries or optimizers derived for these families (rather than a model-independent reduction), the equivalence does not necessarily extend to arbitrary bipartite states. Please identify the theorem or section containing the general argument and indicate whether it is independent of the analyzed families.

    Authors: The general equivalence is established in Theorem 5.1 (Section 5). The proof is model-independent: it shows via a direct reduction that, for any bipartite state, the strongest asynchronous model (free classical post-processing plus quantum pre-processing) can break the one-way classical threshold if and only if the trivial discarding map already does so. The argument compares the communication models directly and does not invoke symmetries, optimizers, or other properties specific to the isotropic, graph, or symmetrized EPR families. Those families are treated separately in Sections 3 and 4 solely to obtain explicit tight fidelity bounds; the equivalence claim itself applies to arbitrary bipartite states. revision: no

Circularity Check

0 steps flagged

No circularity: derivation relies on direct analysis of specific states

full rationale

The paper computes tight fidelity bounds for isotropic states, bipartite graph states, and symmetrized EPR states under a hierarchy of asynchronous PBT models that include free classical processing and quantum pre-processing. The central iff claim is asserted after these calculations, with the 'if' direction immediate and the 'only if' direction presented as following from the model hierarchy and state-specific optimizations. No self-citations, parameter fitting, ansatzes smuggled via prior work, or self-definitional reductions appear in the abstract or described derivation. The result is therefore self-contained against the analyzed families and does not reduce to its inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on standard quantum information assumptions for teleportation and resource theories; no free parameters, new entities, or ad-hoc axioms are introduced in the abstract.

axioms (1)
  • standard math Standard framework of quantum teleportation and resource theories in quantum information
    Invoked throughout the motivation and analysis of PBT protocols.

pith-pipeline@v0.9.0 · 5740 in / 1137 out tokens · 33196 ms · 2026-05-22T19:04:41.803242+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.

Reference graph

Works this paper leans on

87 extracted references · 87 canonical work pages · 24 internal anchors

  1. [1]

    While the form we propose is specific to bipartite graphs shared between Alice and Bob, its generalization to arbitrary graphs is straightforward

    PBT canonical form of graphs Our goal is to introduce a unique canonical graph bΓ ∈ Gr,n for any graph Γ ∈ G m,n with r := rk(ΓBn) such that |Γ⟩ ∼Ω |bΓ⟩ for Ω ∈ {PBT, PBTcl, PBTq}. While the form we propose is specific to bipartite graphs shared between Alice and Bob, its generalization to arbitrary graphs is straightforward. Let Γ ∈ G m+n be a graph with...

    work page

  2. [2]

    As noted above, it suffices to consider PCF graphs in Gr,n

    PBT ordering among bipartite graphs We now analyze the PBT teleportation fidelities for bipartite graph states. As noted above, it suffices to consider PCF graphs in Gr,n. Throughout this section, we assume that Bob has a port structure Bn with each system Bi being a qubit. Hence, the classical threshold for all teleportation channels considered is 1

    work page

  3. [3]

    (51) as Γ = Γ k-EPR ⊗ Γ0 depends essentially on the number k of isolated EPR pairs

    Our main finding shows that the teleportation fidelity of any bi- partite PCF graph expressed in the form of Eq. (51) as Γ = Γ k-EPR ⊗ Γ0 depends essentially on the number k of isolated EPR pairs. Proposition 13 first addresses the extreme case in which Γ does not have any isolated EPR pairs, i.e. Γ = Γ 0; its proof is given in Appendix G. Proposition 13....

    work page

  4. [4]

    Therefore, it is of interest to compute the teleportation fidelities of Γk-EPR

    Comparing FPBT(Γk-EPR) and FPBTcl(Γk-EPR) Theorem 14 expresses the performance of PBT, PBTcl, and PBTq for any PCF bipartite graph state in relation to Γ k-EPR = Ψ+⊗k, where k denotes the number of iso- lated EPR pairs contained as a sub-graph. Therefore, it is of interest to compute the teleportation fidelities of Γk-EPR. The precise computation of FPBTc...

    work page

  5. [5]

    C. H. Bennett, G. Brassard, C. Cr´ epeau, R. Jozsa, A. Peres, and W. K. Wootters, Teleporting an unknown quantum state via dual classical and einstein-podolsky- rosen channels, Phys. Rev. Lett. 70, 1895 (1993)

    work page 1993

  6. [6]

    Devetak and A

    I. Devetak and A. Winter, Distilling common random- ness from bipartite quantum states, IEEE Transactions on Information Theory 50, 3183 (2004), arXiv:quant- ph/0304196

    work page arXiv 2004

  7. [7]

    C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed-state entanglement and quantum error correction, Phys. Rev. A 54, 3824 (1996), arXiv:quant- ph/9604024

    work page arXiv 1996

  8. [8]

    M. B. Plenio and S. Virmani, An introduction to entan- glement measures, Quantum Information & Computa- tion 7, 1 (2007), arXiv:quant-ph/0504163

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  9. [9]

    Quantum Resource Theories

    E. Chitambar and G. Gour, Quantum resource theories, Rev. Mod. Phys. 91, 025001 (2019), arXiv:1806.06107 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  10. [10]

    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, 1 (2008), arXiv:0807.4568 [quant- ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2008

  11. [11]

    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. A 79, 1 (2009), arXiv:0901.2975 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2009

  12. [12]

    Simplified instantaneous non-local quantum computation with applications to position-based cryptography

    S. Beigi and R. K¨ onig, Simplified instantaneous non-local quantum computation with applications to position- based cryptography, New Journal of Physics13, 1 (2011), arXiv:1101.1065 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2011

  13. [13]

    Pirandola, R

    S. Pirandola, R. Laurenza, C. Lupo, and J. L. Pereira, Fundamental limits to quantum channel discrimination, npj Quantum Information 5, 1 (2019), arXiv:1803.02834 [quant-ph]

    work page arXiv 2019

  14. [14]

    Muguruza and F

    G. Muguruza and F. Speelman, Port-Based State Prepa- ration and Applications, Quantum 8, 1573 (2024), arXiv:2402.18356 [quant-ph]

    work page arXiv 2024

  15. [15]

    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 uni- tary transformation, Phys. Rev. A 81, 032324 (2010), arXiv:0903.0543 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2010

  16. [16]

    Optimal probabilistic storage and retrieval of unitary channels

    M. Sedl´ ak, A. Bisio, and M. Ziman, Optimal probabilistic storage and retrieval of unitary channels, Phys. Rev. Lett. 122, 170502 (2019), arXiv:1809.04552 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  17. [17]

    M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao, Reversing unknown quantum transforma- tions: Universal quantum circuit for inverting general unitary operations, Phys. Rev. Lett. 123, 210502 (2019), arXiv:1810.06944 [quant-ph]

    work page arXiv 2019

  18. [18]

    Horodecki, P

    M. Horodecki, P. Horodecki, and R. Horodecki, Gen- eral teleportation channel, singlet fraction, and quasidis- tillation, Phys. Rev. A 60, 1888 (1999), arXiv:quant- ph/9807091

    work page arXiv 1999

  19. [19]

    Horodecki, P

    M. Horodecki, P. Horodecki, and R. Horodecki, Insepara- ble two spin- 1 2 density matrices can be distilled to a sin- glet form, Phys. Rev. Lett. 78, 574 (1997), arXiv:quant- ph/9607009

    work page arXiv 1997

  20. [20]

    Chitambar and F

    E. Chitambar and F. Leditzky, On the duality of telepor- tation and dense coding, IEEE Transactions on Informa- tion Theory 70, 3529 (2024), arXiv:2302.14798 [quant- ph]

    work page arXiv 2024

  21. [21]

    Reduction criterion of separability and limits for a class of protocols of entanglement distillation

    M. Horodecki and P. Horodecki, Reduction criterion of separability and limits for a class of distillation protocols, Phys. Rev. A 59, 4206 (1999), arXiv:quant-ph/9708015

    work page internal anchor Pith review Pith/arXiv arXiv 1999

  22. [22]

    Optimal Port-based Teleportation

    M. Mozrzymas, M. Studzi´ nski, S. Strelchuk, and M. Horodecki, Optimal port-based teleportation, New Journal of Physics 20, 1 (2018), arXiv:1707.08456 [quant- ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  23. [23]

    Knill, R

    E. Knill, R. Laflamme, and G. J. Milburn, A scheme for efficient quantum computation with linear optics, Nature 409, 46 (2001)

    work page 2001

  24. [24]

    J. D. Franson, M. M. Donegan, M. J. Fitch, B. C. Jacobs, and T. B. Pittman, High-fidelity quantum logic opera- tions using linear optical elements, Phys. Rev. Lett. 89, 137901 (2002), arXiv:quant-ph/0202160

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  25. [25]

    M. A. Nielsen and I. L. Chuang, Programmable quan- tum gate arrays, Phys. Rev. Lett. 79, 321 (1997), arXiv:quant-ph/9703032

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  26. [26]

    Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle

    D. Pital´ ua-Garc´ ıa, Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle, Phys. Rev. A 87, 1 (2013), arXiv:1206.4836 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  27. [27]

    Some remarks on port-based teleportation

    S. Ishizaka, Some remarks on port-based teleportation, arXiv preprint (2015), arXiv:1506.01555 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  28. [28]

    Entropy in Quantum Information Theory -- Communication and Cryptography

    C. Majenz, Entropy in Quantum Information Theory – Communication and Cryptography, Ph.D. thesis, Univer- sity of Copenhagen (2018), arXiv:1810.10436 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  29. [29]

    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 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  30. [30]

    Wang and S

    Z.-W. Wang and S. L. Braunstein, Higher-dimensional performance of port-based teleportation, Scientific Re- 17 ports 6, 33004 (2016), arXiv:2207.04593 [quant-ph]

    work page arXiv 2016

  31. [31]

    Port-based teleportation in arbitrary dimension

    M. Studzi´ nski, S. Strelchuk, M. Mozrzymas, and M. Horodecki, Port-based teleportation in arbi- trary dimension, Scientific Reports 7, 10871 (2017), arXiv:1612.09260 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  32. [32]

    Leditzky, Optimality of the pretty good measurement for port-based teleportation, Letters in Mathematical Physics 112, 98 (2022), arXiv:2008.11194 [quant-ph]

    F. Leditzky, Optimality of the pretty good measurement for port-based teleportation, Letters in Mathematical Physics 112, 98 (2022), arXiv:2008.11194 [quant-ph]

    work page arXiv 2022

  33. [33]

    Christandl, F

    M. Christandl, F. Leditzky, C. Majenz, G. Smith, F. Speelman, and M. Walter, Asymptotic performance of port-based teleportation, Communications in Mathemat- ical Physics 381, 379 (2021), arXiv:1809.10751 [quant- ph]

    work page arXiv 2021

  34. [34]

    Simplified formalism of the algebra of partially transposed permutation operators with applications

    M. Mozrzymas, M. Studzi´ nski, and M. Horodecki, A simplified formalism of the algebra of partially trans- posed permutation operators with applications, Journal of Physics A: Mathematical and Theoretical 51, 125202 (2018), arXiv:1708.02434 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  35. [35]

    Mozrzymas, M

    M. Mozrzymas, M. Horodecki, and M. Studzi´ nski, From port-based teleportation to Frobenius reciprocity theo- rem: partially reduced irreducible representations and their applications, Letters in Mathematical Physics 114, 56 (2024), arXiv:2310.16423 [quant-ph]

    work page arXiv 2024

  36. [36]

    Studzi´ nski, T

    M. Studzi´ nski, T. M lynik, M. Mozrzymas, and M. Horodecki, Irreducible matrix representations for the walled Brauer algebra, arXiv preprint (2025), arXiv:2501.13067 [quant-ph]

    work page arXiv 2025

  37. [37]

    Generalized teleportation and entanglement recycling

    S. Strelchuk, M. Horodecki, and J. Oppenheim, Gener- alized teleportation and entanglement recycling, Phys. Rev. Lett. 110, 1 (2013), arXiv:1209.2683 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  38. [38]

    Studzi´ nski, M

    M. Studzi´ nski, M. Mozrzymas, and P. Kopszak, Square- root measurements and degradation of the resource state in port-based teleportation scheme, Journal of Physics A: Mathematical and Theoretical 55, 375302 (2022), arXiv:2105.14886 [quant-ph]

    work page arXiv 2022

  39. [39]

    Kopszak, D

    P. Kopszak, D. Grinko, A. Burchardt, M. Ozols, M. Studzi´ nski, and M. Mozrzymas, Entanglement re- cycling in probabilistic port-based teleportation, arXiv preprint (2025), arXiv:2504.00710 [quant-ph]

    work page arXiv 2025

  40. [40]

    Kopszak, M

    P. Kopszak, M. Mozrzymas, M. Studzinski, and M. Horodecki, Multiport based teleportation - transmis- sion of a large amount of quantum information, Quantum 5, 1 (2021), arXiv:2008.00856 [quant-ph]

    work page arXiv 2021

  41. [41]

    Mozrzymas, M

    M. Mozrzymas, M. Studzi´ nski, and P. Kopszak, Opti- mal Multi-port-based Teleportation Schemes, Quantum 5, 477 (2021), arXiv:2011.09256 [quant-ph]

    work page arXiv 2021

  42. [42]

    Studzi´ nski, M

    M. Studzi´ nski, M. Mozrzymas, P. Kopszak, and M. Horodecki, Efficient multi port-based teleportation schemes, IEEE Transactions on Information Theory 68, 7892 (2022), arXiv:2008.00984 [quant-ph]

    work page arXiv 2022

  43. [43]

    Boisselle, Port-based teleportation of continuous quan- tum variables , Master’s thesis, University of Waterloo (2014)

    J. Boisselle, Port-based teleportation of continuous quan- tum variables , Master’s thesis, University of Waterloo (2014)

    work page 2014

  44. [44]

    J. L. Pereira, L. Banchi, and S. Pirandola, Continu- ous variable port-based teleportation, Journal of Physics A: Mathematical and Theoretical 57, 015305 (2023), arXiv:2302.08522 [quant-ph]

    work page arXiv 2023

  45. [45]

    Quantum message compression with applications

    A. Anshu, V. K. Devabathini, and R. Jain, Quantum communication using coherent rejection sampling, Phys. Rev. Lett. 119, 120506 (2017), arXiv:1410.3031 [quant- ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  46. [46]

    Jeong, J

    K. Jeong, J. Kim, and S. Lee, Generalization of port- based teleportation and controlled teleportation capabil- ity, Phys. Rev. A102, 1 (2020), arXiv:2002.12651 [quant- ph]

    work page arXiv 2020

  47. [47]

    Collins, Teleportation of Post-Selected Quantum States, Quantum 8, 1280 (2024), arXiv:2303.12456 [quant-ph]

    D. Collins, Teleportation of Post-Selected Quantum States, Quantum 8, 1280 (2024), arXiv:2303.12456 [quant-ph]

    work page arXiv 2024

  48. [48]

    Eum Kim and K

    H. Eum Kim and K. Jeong, Asymptotic teleportation scheme bridging between standard and port-based tele- portation, Quantum Science and Technology 9, 045014 (2024), arXiv:2403.04315 [quant-ph]

    work page arXiv 2024

  49. [49]

    Strelchuk and M

    S. Strelchuk and M. Studzi´ nski, Minimal port-based teleportation, New Journal of Physics 25, 1 (2023), arXiv:2111.05499 [quant-ph]

    work page arXiv 2023

  50. [50]

    J. Fei, S. Timmerman, and P. Hayden, Efficient Quantum Algorithm for Port-based Teleportation, arXiv preprint (2023), arXiv:2310.01637 [quant-ph]

    work page arXiv 2023

  51. [51]

    Wills, M.-H

    A. Wills, M.-H. Hsieh, and S. Strelchuk, Efficient algo- rithms for all port-based teleportation protocols, PRX Quantum 5, 030354 (2024), arXiv:2311.12012 [quant-ph]

    work page arXiv 2024

  52. [52]

    Grinko, A

    D. Grinko, A. Burchardt, and M. Ozols, Gelfand-Tsetlin basis for partially transposed permutations, with appli- cations to quantum information, arXiv preprint (2023), arXiv:2310.02252 [quant-ph]

    work page arXiv 2023

  53. [53]

    Grinko, A

    D. Grinko, A. Burchardt, and M. Ozols, Efficient quan- tum circuits for port-based teleportation, arXiv preprint (2024), arXiv:2312.03188 [quant-ph]

    work page arXiv 2024

  54. [54]

    Q. T. Nguyen, The mixed Schur transform: efficient quantum circuit and applications, arXiv preprint (2023), arXiv:2310.01613 [quant-ph]

    work page arXiv 2023

  55. [55]

    Banchi, J

    L. Banchi, J. Pereira, S. Lloyd, and S. Pirandola, Con- vex optimization of programmable quantum computers, npj Quantum Information 6, 42 (2020), arXiv:1905.01318 [quant-ph]

    work page arXiv 2020

  56. [56]

    Quantum communication complexity advantage implies violation of a Bell inequality

    H. Buhrman, l. Czekaj, A. Grudka, M. Horodecki, P. Horodecki, M. Markiewicz, F. Speelman, and S. Strelchuk, Quantum communication complexity ad- vantage implies violation of a Bell inequality, Proceed- ings of the National Academy of Sciences of the United States of America 113, 3191 (2016), arXiv:1502.01058 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  57. [57]

    Dolev and S

    K. Dolev and S. Cree, Non-local computation of quantum circuits with small light cones, arXiv preprint (2022), arXiv:2203.10106 [quant-ph]

    work page arXiv 2022

  58. [58]

    Dolev and S

    K. Dolev and S. Cree, Holography as a resource for non-local quantum computation, arXiv preprint (2022), arXiv:2210.13500 [quant-ph]

    work page arXiv 2022

  59. [59]

    May, Complexity and entanglement in non-local computation and holography, Quantum 6, 864 (2022), arXiv:2204.00908 [quant-ph]

    A. May, Complexity and entanglement in non-local computation and holography, Quantum 6, 864 (2022), arXiv:2204.00908 [quant-ph]

    work page arXiv 2022

  60. [60]

    Pereira, L

    J. Pereira, L. Banchi, and S. Pirandola, Characterising port-based teleportation as universal simulator of qubit channels, Journal of Physics A: Mathematical and The- oretical 54, 1 (2021), arXiv:1912.10374 [quant-ph]

    work page arXiv 2021

  61. [61]

    M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao, Probabilistic exact universal quantum circuits for transforming unitary operations, Phys. Rev. A 100, 062339 (2019), arXiv:1909.01366 [quant-ph]

    work page arXiv 2019

  62. [62]

    M. T. Quintino and D. Ebler, Deterministic transforma- tions between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefi- nite causality, Quantum 6, 679 (2022), arXiv:2109.08202 [quant-ph]

    work page arXiv 2022

  63. [63]

    Yoshida, Y

    S. Yoshida, Y. Koizumi, M. Studzi´ nski, M. T. Quintino, and M. Murao, One-to-one correspondence between de- terministic port-based teleportation and unitary estima- tion, arXiv preprint (2024), arXiv:2408.11902 [quant- 18 ph]

    work page arXiv 2024

  64. [64]

    Multicopy quantum state teleportation with application to storage and retrieval of quantum programs

    F. Grosshans, M. Horodecki, M. Murao, T. M lynik, M. T. Quintino, M. Studzi´ nski, and S. Yoshida, Multicopy quantum state teleportation with application to stor- age and retrieval of quantum programs, arXiv preprint (2024), arXiv:2409.10393 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  65. [65]

    Lewandowska, R

    P. Lewandowska, R. Kukulski, L. Pawela, and Z. Pucha la, Storage and retrieval of von Neumann measurements, Phys. Rev. A 106, 052423 (2022), arXiv:2204.03029 [quant-ph]

    work page arXiv 2022

  66. [66]

    H. E. Kim and K. Jeong, Port-based entanglement tele- portation via noisy resource states, Physica Scripta 99, 035105 (2024), arXiv:2309.01550 [quant-ph]

    work page arXiv 2024

  67. [67]

    Okada, K

    R. Okada, K. Kato, and F. Buscemi, Port-based tele- cloning of an unknown quantum state, arXiv preprint (2025), arXiv:2501.16878 [quant-ph]

    work page arXiv 2025

  68. [68]

    M. A. Ballester, S. Wehner, and A. Winter, State dis- crimination with post-measurement information, IEEE Transactions on Information Theory 54, 4183 (2008)

    work page 2008

  69. [69]

    Carmeli, T

    C. Carmeli, T. Heinosaari, and A. Toigo, State discrim- ination with postmeasurement information and incom- patibility of quantum measurements, Phys. Rev. A 98, 012126 (2018)

    work page 2018

  70. [70]

    Buscemi, E

    F. Buscemi, E. Chitambar, and W. Zhou, Complete re- source theory of quantum incompatibility as quantum programmability, Phys. Rev. Lett. 124, 120401 (2020)

    work page 2020

  71. [71]

    Ji and E

    K. Ji and E. Chitambar, Incompatibility as a resource for programmable quantum instruments, PRX Quantum 5, 010340 (2024)

    work page 2024

  72. [72]

    Chitambar, G

    E. Chitambar, G. Gour, K. Sengupta, and R. Zibakhsh, Quantum bell nonlocality as a form of entanglement, Phys. Rev. A 104, 052208 (2021)

    work page 2021

  73. [73]

    Davies, Information and quantum measurement, IEEE Transactions on Information Theory 24, 596 (1978)

    E. Davies, Information and quantum measurement, IEEE Transactions on Information Theory 24, 596 (1978)

    work page 1978

  74. [74]

    Vidal, Entanglement of pure states for a single copy, Phys

    G. Vidal, Entanglement of pure states for a single copy, Phys. Rev. Lett. 83, 1046 (1999), arXiv:quant- ph/9902033

    work page arXiv 1999

  75. [75]

    Entanglement monotones

    G. Vidal, Entanglement monotones, Journal of Modern Optics 47, 355–376 (2000), arXiv:quant-ph/9807077

    work page internal anchor Pith review Pith/arXiv arXiv 2000

  76. [76]

    B. M. Terhal and K. G. H. Vollbrecht, Entanglement of formation for isotropic states, Phys. Rev. Lett. 85, 2625 (2000), arXiv:quant-ph/0005062

    work page internal anchor Pith review Pith/arXiv arXiv 2000

  77. [77]

    Raussendorf and H

    R. Raussendorf and H. J. Briegel, A one-way quantum computer, Phys. Rev. Lett. 86, 5188 (2001)

    work page 2001

  78. [78]

    Raussendorf, D

    R. Raussendorf, D. E. Browne, and H. J. Briegel, Measurement-based quantum computation on cluster states, Phys. Rev. A 68, 022312 (2003), arXiv:quant- ph/0301052

    work page arXiv 2003

  79. [79]

    M. Hein, W. D¨ ur, J. Eisert, R. Raussendorf, M. Van Den Nest, and H. J. Briegel, Entanglement in graph states and its applications, Proceedings of the International School of Physics ”Enrico Fermi” 162, 115 (2006), arXiv:quant- ph/0602096 [quant-ph]

    work page arXiv 2006

  80. [80]

    Maximally-Disordered Distillable Quantum States

    S. Bandyopadhyay and V. Roychowdhury, Maximally disordered distillable quantum states, Phys. Rev. A 69, 040302 (2004), arXiv:quant-ph/0302043

    work page internal anchor Pith review Pith/arXiv arXiv 2004

Showing first 80 references.