Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility

• URL: http://arxiv.org/abs/2207.06931v4
• Date: Fri, 27 Jan 2023 17:48:24 GMT
• Title: Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
• Authors: Tharon Holdsworth, Vishal Singh, and Mark M. Wilde
• Abstract summary: In practice, the ideal realization of quantum teleportation relies on having access to a maximally entangled state. We present a method to quantify the performance of approximate teleportation when using an arbitrary resource state.
• Score: 5.192118773220603
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Efficient Quantum Algorithm for Port-based Teleportation [0.6144680854063939]
  We provide the first efficient algorithm for port-based teleportation, a unitarily equivariant version of teleportation useful for constructing programmable quantum processors. Our algorithm yields an exponential improvement to the known relationship between the amount of entanglement available and the complexity of the nonlocal part of any unitary.
  arXiv  Detail & Related papers  (2023-10-02T21:03:59Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• The SWAP Imposter: Bidirectional Quantum Teleportation and its Performance [6.345523830122166]
  Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two parties. We develop two different ways of quantifying the error of nonideal bidirectional teleportation. We obtain semidefinite programming lower bounds on the error of nonideal bidirectional teleportation.
  arXiv  Detail & Related papers  (2022-10-19T20:43:57Z)
• Optimal input states for quantifying the performance of continuous-variable unidirectional and bidirectional teleportation [4.779196219827506]
  Continuous-variable (CV) teleportation is a foundational protocol in quantum information science. We prove that, under certain energy constraints, the optimal input state in unidirectional, as well as bidirectional, teleportation is a finite entangled superposition of twin-Fock states saturating the energy constraint.
  arXiv  Detail & Related papers  (2022-10-10T20:29:22Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Quantifying the performance of bidirectional quantum teleportation [6.345523830122166]
  Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties. We develop two ways of quantifying the simulation error of unideal bidirectional teleportation. We find semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation.
  arXiv  Detail & Related papers  (2020-10-15T17:36:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.