Port-Based State Preparation and Applications
arXiv:2402.18356 · doi:10.22331/q-2024-12-18-1573
Abstract
We introduce Port-Based State Preparation (PBSP), a teleportation task where Alice holds a complete classical description of the target state and Bob's correction operations are restricted to only tracing out registers. We show a protocol that implements PBSP with error decreasing exponentially in the number of ports, in contrast to the polynomial trade-off for the related task of Port-Based Teleportation, and we prove that this is optimal when a maximally entangled resource state is used. As an application, we introduce approximate Universal Programmable Hybrid Processors (UPHP). Here the goal is to encode a unitary as a quantum state, and the UPHP can apply this unitary to a quantum state when knowing its classical description. We give a construction that needs strictly less memory in terms of dimension than the optimal approximate Universal Programmable Quantum Processor achieving the same error. Additionally, we provide lower bounds for the optimal trade-off between memory and error of UPHPs.
arXiv commentquantum journal version, minor errors fixed
References in corpus (19)
- Remote State Preparation
- Programmable quantum gate arrays
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Remote preparation of quantum states
- Simplified instantaneous non-local quantum computation with applications to position-based cryptography
- Fundamental limits to quantum channel discrimination
- Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
- Optimal probabilistic storage and retrieval of unitary channels
- Quantum communication complexity advantage implies violation of a Bell inequality
- Probabilistic exact universal quantum circuits for transforming unitary operations
- Port-based teleportation in arbitrary dimension
- Optimal Port-based Teleportation
- Optimal universal programming of unitary gates
- Approximate programmable quantum processors
- Asymptotic performance of port-based teleportation
- Resource Quantification for the No-Programming Theorem
- Optimality of the pretty good measurement for port-based teleportation
- Optimality of programmable quantum measurements
- Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle