Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
arXiv:2207.06931 · doi:10.1103/PhysRevA.107.012428
Abstract
The ideal realization of quantum teleportation relies on having access to a maximally entangled state; however, in practice, such an ideal state is typically not available and one can instead only realize an approximate teleportation. With this in mind, we present a method to quantify the performance of approximate teleportation when using an arbitrary resource state. More specifically, after framing the task of approximate teleportation as an optimization of a simulation error over one-way local operations and classical communication (LOCC) channels, we establish a semi-definite relaxation of this optimization task by instead optimizing over the larger set of two-PPT-extendible channels. The main analytical calculations in our paper consist of exploiting the unitary covariance symmetry of the identity channel to establish a significant reduction of the computational cost of this latter optimization. Next, by exploiting known connections between approximate teleportation and quantum error correction, we also apply these concepts to establish bounds on the performance of approximate quantum error correction over a given quantum channel. Finally, we evaluate our bounds for various examples of resource states and channels.
arXiv commentv4: 48 pages, 7 figures, accepted for publication in Physical Review A
References in corpus (29)
- Experimental quantum teleportation
- Mixed State Entanglement and Quantum Error Correction
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein-Podolski-Rosen Channels
- Ground-to-satellite quantum teleportation
- Quantum teleportation between light and matter
- Quantum teleportation using active feed-forward between two Canary Islands
- Distance measures to compare real and ideal quantum processes
- Theoretical framework for quantum networks
- From Classical to Quantum Shannon Theory
- A complete family of separability criteria
- Distinguishing separable and entangled states
- Transforming quantum operations: quantum supermaps
- An improved bound on distillable entanglement
- Deterministic quantum teleportation of photonic quantum bits by a hybrid technique
- Memory effects in quantum channel discrimination
- Comparison of Quantum Channels by Superchannels
- On the power of PPT-preserving and non-signalling codes
- Semidefinite programming strong converse bounds for classical capacity
- Quantum Channel Simulation and the Channel's Smooth Max-Information
- Non-asymptotic entanglement distillation
- Improved Semidefinite Programming Upper Bound on Distillable Entanglement
- Geometric distinguishability measures limit quantum channel estimation and discrimination
- Amortized entanglement of a quantum channel and approximately teleportation-simulable channels
- Quantum capacity analysis of multi-level amplitude damping channels
- Extendibility limits the performance of quantum processors
- Amortization does not enhance the max-Rains information of a quantum channel
- Semidefinite programming hierarchies for constrained bilinear optimization
- Resource theory of unextendibility and non-asymptotic quantum capacity
Cited by in corpus (8)
- Semidefinite programming relaxations for quantum correlations
- On the Duality of Teleportation and Dense Coding
- Linear programming with unitary-equivariant constraints
- Adaptive Phase Estimation with Squeezed Vacuum Approaching the Quantum Limit
- Optimal input states for quantifying the performance of continuous-variable unidirectional and bidirectional teleportation
- Extendible quantum measurements and limitations on classical communication
- Unextendible entanglement of quantum channels
- Extendibility limits quantum-secured communication and key distillation