Efficient Quantum Algorithm for Port-based Teleportation
- URL: http://arxiv.org/abs/2310.01637v1
- Date: Mon, 2 Oct 2023 21:03:59 GMT
- Title: Efficient Quantum Algorithm for Port-based Teleportation
- Authors: Jiani Fei, Sydney Timmerman, and Patrick Hayden
- Abstract summary: 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.
- Score: 0.6144680854063939
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this paper, we provide the first efficient algorithm for port-based
teleportation, a unitarily equivariant version of teleportation useful for
constructing programmable quantum processors and performing instantaneous
nonlocal computation (NLQC). The latter connection is important in AdS/CFT,
where bulk computations are realized as boundary NLQC. 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
that can be implemented using NLQC. Similarly, our algorithm provides the first
nontrivial efficient algorithm for an approximate universal programmable
quantum processor. The key to our approach is a generalization of Schur-Weyl
duality we call twisted Schur-Weyl duality, as well as an efficient algorithm
we develop for the twisted Schur transform, which transforms to a
subgroup-reduced irrep basis of the partially transposed permutation algebra,
whose dual is the $U^{\otimes n-k} \otimes (U^*)^{\otimes k}$ representation of
the unitary group.
Related papers
- Circuit Knitting Faces Exponential Sampling Overhead Scaling Bounded by Entanglement Cost [5.086696108576776]
We show that the sampling overhead of circuit knitting is exponentially lower bounded by the exact entanglement cost of the target bipartite dynamic.
Our work reveals a profound connection between virtual quantum information processing via quasi-probability decomposition and quantum Shannon theory.
arXiv Detail & Related papers (2024-04-04T17:41:13Z) - Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
Quantum computing sets the foundation for new ways of designing algorithms.
New challenges arise concerning which field quantum speedup can be achieved.
Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
arXiv Detail & Related papers (2024-02-26T09:32:07Z) - Hungarian Qubit Assignment for Optimized Mapping of Quantum Circuits on
Multi-Core Architectures [1.1288814203214292]
Quantum computers are expected to adopt a modular approach, featuring clusters of tightly connected quantum bits with sparser connections between these clusters.
Efficiently distributing qubits across multiple processing cores is critical for improving quantum computing systems' performance and scalability.
We propose the Hungarian Qubit Assignment (HQA) algorithm, which leverages the Hungarian algorithm to improve qubit-to-core assignment.
arXiv Detail & Related papers (2023-09-21T15:48:45Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications.
This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
arXiv Detail & Related papers (2023-01-30T15:46:39Z) - Entanglement-efficient bipartite-distributed quantum computing [1.2878452281783466]
In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit can be extended through distributed quantum computing.
To facilitate this type of DQC in experiments, we need an entanglement-efficient protocol.
We extend the protocol in [Eisert et. al., PRA, 62:052317(2000)] to a packing protocol, which can pack multiple nonlocal controlled-unitary gates locally.
arXiv Detail & Related papers (2022-12-24T08:45:44Z) - 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) - Variational quantum iterative power algorithms for global optimization [2.526320329485241]
We introduce a family of variational quantum algorithms called quantum iterative power algorithms (QIPA)
QIPA outperforms existing hybrid near-term quantum algorithms of the same kind.
We anticipate large-scale implementation and adoption of the proposed algorithm across current major quantum hardware.
arXiv Detail & Related papers (2022-08-22T17:45:14Z) - Quantum State Preparation and Non-Unitary Evolution with Diagonal
Operators [0.0]
We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices.
We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity.
We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
arXiv Detail & Related papers (2022-05-05T17:56:41Z) - Polynomial unconstrained binary optimisation inspired by optical
simulation [52.11703556419582]
We propose an algorithm inspired by optical coherent Ising machines to solve the problem of unconstrained binary optimization.
We benchmark the proposed algorithm against existing PUBO algorithms, and observe its superior performance.
The application of our algorithm to protein folding and quantum chemistry problems sheds light on the shortcomings of approxing the electronic structure problem by a PUBO problem.
arXiv Detail & Related papers (2021-06-24T16:39:31Z) - 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)
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.