Efficient quantum circuits for port-based teleportation

• URL: http://arxiv.org/abs/2312.03188v2
• Date: Tue, 21 May 2024 23:09:29 GMT
• Title: Efficient quantum circuits for port-based teleportation
• Authors: Dmitry Grinko, Adam Burchardt, Maris Ozols,
• Abstract summary: 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.
• Score: 0.8192907805418583
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Port-based teleportation (PBT) is a variant of quantum teleportation that, unlike the canonical protocol by Bennett et al., 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 close this long-standing gap by building on our recent results on representations of partially transposed permutation matrix algebras and mixed quantum Schur transform. We construct efficient quantum algorithms for probabilistic and deterministic PBT protocols on $n$ ports of arbitrary local dimension, both for EPR and optimized resource states. We describe two constructions based on different encodings of the Gelfand-Tsetlin basis for $n$ qudits: a standard encoding that achieves $\widetilde{O}(n)$ time and $O(n\log(n))$ space complexity, and a Yamanouchi encoding that achieves $\widetilde{O}(n^2)$ time and $O(\log(n))$ space complexity, both for constant local dimension and target error. We also describe efficient circuits for preparing the optimal resource states.

Related papers

• SWAP-less Implementation of Quantum Algorithms [0.0]
  We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity. We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
  arXiv  Detail & Related papers  (2024-08-20T14:51:00Z)
• 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)
• Efficient implementation of discrete-time quantum walks on quantum computers [0.0]
  We propose an efficient and scalable quantum circuit implementing the discrete-time quantum walk (DTQW) model. For $t$ time-steps of the DTQW, the proposed circuit requires only $O(n2 + nt)$ two-qubit gates compared to the $O(n2 t)$ of the current most efficient implementation.
  arXiv  Detail & Related papers  (2024-02-02T19:11:41Z)
• Efficient Algorithms for All Port-Based Teleportation Protocols [10.720038857779135]
  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.
  arXiv  Detail & Related papers  (2023-11-20T18:49:16Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning [17.567408246024964]
  We devise an efficient and practical quantum compiler assisted by advanced deep reinforcement learning (RL) techniques. Our protocol is compatible with various quantum machines and can be used to compile multi-qubit operators. For the first time, we demonstrate how to leverage RL-based quantum compilers to accomplish two-qubit operator compiling.
  arXiv  Detail & Related papers  (2022-04-14T12:03:47Z)
• Quantum circuit compilation and hybrid computation using Pauli-based computation [0.0]
  Pauli-based computation (PBC) is driven by a sequence of adaptively chosen, non-destructive measurements of Pauli observables. We propose practical ways of implementing PBC as adaptive quantum circuits and provide code to do the required classical side-processing.
  arXiv  Detail & Related papers  (2022-03-03T16:01:55Z)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49:44Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Communication-Efficient Distributed SVD via Local Power Iterations [33.95814240875917]
  We develop an algorithm that we call textttLocalPower for improving communication efficiency. We conduct experiments to demonstrate the effectiveness of textttLocalPower
  arXiv  Detail & Related papers  (2020-02-19T05:58:23Z)

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.