Efficient Algorithms for All Port-Based Teleportation Protocols

• URL: http://arxiv.org/abs/2311.12012v2
• Date: Mon, 12 Feb 2024 04:07:47 GMT
• Title: Efficient Algorithms for All Port-Based Teleportation Protocols
• Authors: Adam Wills, Min-Hsiu Hsieh, Sergii Strelchuk
• Abstract summary: Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required. We provide algorithms in all four regimes for qudits tackling the two deterministic cases for qudits. Our approach to the implementation of the square-root measurement in PBT can be directly generalised to other highly symmetric state ensembles.
• Score: 10.720038857779135
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist - deterministic PBT in which teleportation is always successful, but is imperfect, and probabilistic PBT, in which teleportation succeeds with probability less than one, but teleportation is perfect upon a success. Two further regimes exist within each of these in which the resource state used for the teleportation is fixed to a maximally entangled state, or free to be optimised. Recently, works resolved the long-standing problem of efficiently implementing port-based teleportation, tackling the two deterministic cases for qudits. Here, we provide algorithms in all four regimes for qubits. Emphasis is placed on the practicality of these algorithms, where we give polynomial improvements in the known gate complexity for PBT, as well as an exponential improvement in the required number of ancillas (albeit in separate protocols). Our approach to the implementation of the square-root measurement in PBT can be directly generalised to other highly symmetric state ensembles. For certain families of states, such a framework yields efficient algorithms in the case that the Petz recovery algorithm for the square-root measurement runs in exponential time.

Related papers

• Joint Transmit and Pinching Beamforming for PASS: Optimization-Based or Learning-Based? [89.05848771674773]
  A novel antenna system ()-enabled downlink multi-user multiple-input single-output (MISO) framework is proposed. It consists of multiple waveguides, which equip numerous low-cost antennas, named (PAs) The positions of PAs can be reconfigured to both spanning large-scale path and space.
  arXiv  Detail & Related papers  (2025-02-12T18:54:10Z)
• Enhanced Two-Way Teleportation of Entangled States with Six-Qubit Cluster State [0.0]
  This work presents a two-way teleportation protocol for the transfer of an unknown two-qubit quantum state between two parties Alice and Bob. This bidirectional exchange is achieved by performing Bell measurements on the qubit pairs of Alice and Bob, ensuring the successful teleportation of the quantum state for both parties.
  arXiv  Detail & Related papers  (2024-12-30T18:51:28Z)
• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint-state method together with reverse-time backpropagation to solve prohibitively large open-system quantum control problems. We apply this framework to optimize two inherently dissipative operations in superconducting qubits. Our results show that while standard pulses for dispersive readout are nearly optimal, adding a transmon drive during the protocol can yield 2x improvements in fidelity and duration.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Efficient quantum circuits for port-based teleportation [0.8192907805418583]
  Port-based teleportation (PBT) is a variant of quantum teleportation that does not require a correction operation on the teleported state. Since its introduction by Ishizaka and Hiroshima in 2008, no efficient implementation of PBT was known. We construct efficient quantum algorithms for probabilistic and deterministic PBT protocols on $n$ ports of arbitrary local dimension.
  arXiv  Detail & Related papers  (2023-12-05T23:39:04Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• 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)
• Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility [5.192118773220603]
  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.
  arXiv  Detail & Related papers  (2022-07-14T13:53:50Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)
• Square-root measurements and degradation of the resource state in port-based teleportation scheme [0.0]
  Port-based teleportation (PBT) is a protocol of quantum teleportation in which a receiver does not have to apply correction to the transmitted state. We analyse for the first time the recycling protocol for the deterministic PBT beyond the qubit case.
  arXiv  Detail & Related papers  (2021-05-31T11:20:34Z)
• 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.