Asymptotic Performance of Port-Based Teleportation

@article{Christandl2021AsymptoticPO,
  title={Asymptotic Performance of Port-Based Teleportation},
  author={Matthias Christandl and Felix Leditzky and Christian Majenz and Graeme Smith and Florian Speelman and Michael Walter},
  journal={Communications in Mathematical Physics},
  year={2021},
  volume={381},
  pages={379 - 451}
}
Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number N of ports, the error of… 
Multiport based teleportation -- protocol and its performance
TLDR
A lower bound on the performance of the protocol, measured in the entanglement fidelity, is derived using equivalence between the teleportation process and state discrimination task and it is obtained that maximal number of faithfully teleported systems differs qualitatively in deterministic and probabilistic scheme.
Optimality of the pretty good measurement for port-based teleportation
TLDR
This paper gives an explicit proof that the so-called pretty good measurement, or square-root measurement, is optimal for the PBT protocol with independent copies of maximally entangled states as the port state, and shows that the very same measurement remains optimal even when theport state is optimized to yield the best possible P BT protocol.
Multiport based teleportation – transmission of a large amount of quantum information
TLDR
The obtained bound is effectively computable and outperforms the explicit values of the entanglement fidelity calculated for the pre-existing variants of the port-based protocols, allowing for teleportation of a much larger amount of quantum information.
Square-root measurements and degradation of the resource state in port-based teleportation scheme
TLDR
This paper analyzes for the first time the recycling protocol for the deterministic PBT beyond the qubit case and presents the explicit formula for the recycling fidelity involving only group-theoretic parameters describing irreducible representations in the Schur-Weyl duality.
Minimal Port-based Teleportation
TLDR
The minimal set of requirements that define a feasible P BT protocol are introduced and a simple PBT protocol is constructed that satisfies these requirements: it teleports an unknown state of a qubit with success probability psucc = 1− N+2 2N+1 and fidelity 1−O( 1 N ) with the resource state consisting of N maximally entangled states.
Optimization and learning of quantum programs
TLDR
This work proves that the search for the optimal quantum program is a convex optimization problem, and applies this general result to a number of different designs for the programmable quantum processor, from the shallow protocol of quantum teleportation, to deeper schemes relying on port-based teleportation and parametric quantum circuits.
Infinite-Dimensional Programmable Quantum Processors
TLDR
This work generalizes the concept of a finite-dimensional programmable quantum processor to infinite dimension assuming an energy constraint on the input and output of the target quantum channels and gives upper and lower bounds on the program dimension of a processor implementing all Gaussian unitary channels.
Algebraic and Statistical ways into Quantum Resource Theories
Quantum information science is one of the most active, intellectually stimulating, and technologically promising areas in science. It offers a unique opportunity to engage in a wide variety of
Approximate Programmable Quantum Processors in Infinite Dimensions
TLDR
This work generalizes the concept of a finite-dimensional programmable quantum processor to infinite dimensions assuming an energy constraint on the input and output of the target quantum channels.
Efficient multi port-based teleportation schemes
Michał Studziński1, Marek Mozrzymas2, Piotr Kopszak2 and Michał Horodecki3 1 Institute of Theoretical Physics and Astrophysics and National Quantum Information Centre in Gdańsk, Faculty of
...
1
2
...

References

SHOWING 1-10 OF 96 REFERENCES
Port-based teleportation in arbitrary dimension
TLDR
The theory of the partially reduced irreducible representations is introduced which is used to obtain a simpler representation of the algebra of partially transposed permutation operators and thus explicitly determine the properties of any port-based teleportation scheme for fixed dimension in polynomial time.
Higher-dimensional performance of port-based teleportation
TLDR
A graph-theoretic algebra is constructed which allows us to explicitly compute the higher-dimensional performance of PBT for so-called “pretty-good measurements” with negligible representational overhead and shows that the entanglement fidelity asymptotically approaches N/d2 for large d, confirming the performance of one lower bound from the literature.
Fundamental limits to quantum channel discrimination
TLDR
This work investigates the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations, and derives ultimate limits and no-go theorems for adaptive quantum illumination and single-photon quantum optical resolution.
Quantum teleportation scheme by selecting one of multiple output ports
TLDR
The scheme of quantum teleportation, where Bob has multiple output ports and obtains the teleported state by simply selecting one of the $N$ ports, is thoroughly studied and the optimal protocols can achieve the perfect teleportation in the asymptotic limit of $N\ensuremath{\rightarrow}\ensure math{\infty}$.
Instantaneous Non-Local Computation of Low T-Depth Quantum Circuits
TLDR
A protocol which uses entanglement exponential in the T-depth of a quantum circuit, able to perform non-local computation of quantum circuits with a (poly-)logarithmic number of layers of T gates with quasi-polynomial entangler is presented.
Postselection technique for quantum channels with applications to quantum cryptography.
TLDR
A general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems, and a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks.
Simplified instantaneous non-local quantum computation with applications to position-based cryptography
TLDR
Novel protocols are proposed for instantaneous measurements of non-local observables between space-like separated regions and it is proved that certain schemes are secure under the assumption that the adversary has less entanglement than a given bound and is restricted to classical communication.
Asymptotic teleportation scheme as a universal programmable quantum processor.
TLDR
It is demonstrated that a scheme of quantum teleportation where a receiver has multiple output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed.
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
TLDR
A linear amount of entanglement suffices, (in the size of the computation), as long as the parties share nonlocal correlations as given by the Popescu-Rohrlich box, which implies the impossibility of secure position-based cryptography against adversaries with nonsignaling correlations.
Generalized teleportation and entanglement recycling.
We introduce new teleportation protocols which are generalizations of the original teleportation protocols that use the Pauli group and the port-based teleportation protocols, introduced by Hiroshima
...
1
2
3
4
5
...