Universal construction of decoders from encoding black boxes

Abstract

Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. Given an encoding operation as a black box from a $d$-dimensional system to a $D$-dimensional system, we propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. This is a probabilistic but exact protocol whose success probability is independent of $D$. For a qubit ($d=2$) encoded in $n$ qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method, which cannot avoid $D$-dependence. We present a quantum operation that converts multiple parallel calls of any given isometry operation to random parallelized unitary operations, each of dimension $d$. Applied to our setup, it universally compresses the encoded quantum information to a $D$-independent space, while keeping the initial quantum information intact. This compressing operation is combined with a unitary inversion protocol to complete the isometry inversion. We also discover a fundamental difference between our isometry inversion protocol and the known unitary inversion protocols by analyzing isometry complex conjugation and isometry transposition. General protocols including indefinite causal order are searched using semidefinite programming for any improvement in the success probability over the parallel protocols. We find a sequential "success-or-draw" protocol of universal isometry inversion for $d=2$ and $D=3$, thus whose success probability exponentially improves over parallel protocols in the number of calls of the input isometry operation for the said case.

50 pages, 12 figures. Accepted in Quantum. All codes are available at https://github.com/sy3104/isometry_inversion

References in corpus (20)

• Quantum algorithm for solving linear systems of equations
• Quantum Process Tomography: Resource Analysis of Different Strategies
• Transforming quantum operations: quantum supermaps
• Operational Markov condition for quantum processes
• Quantum stochastic processes and quantum non-Markovian phenomena
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum communication using a bounded-size quantum reference frame
• Optimal cloning of unitary transformations
• Dynamical Entanglement
• Fundamental limitations on distillation of quantum channel resources
• Optimal quantum tomography for states, measurements, and transformations
• Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
• Universal super-replication of unitary gates
• Deterministic superreplication of one-parameter unitary transformations
• Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• Information - Disturbance Tradeoff in the Estimation of a Unitary Transformation
• Routed quantum circuits
• Probabilistic storage and retrieval of qubit phase gates
• Experimental replication of single-qubit quantum phase gates

Cited by in corpus (7)

• Energy-Consumption Advantage of Quantum Computation
• Linear programming with unitary-equivariant constraints
• Universal adjointation of isometry operations using conversion of quantum supermaps
• Simulating the quantum switch with quantum circuits is computationally hard
• Identifying families of multipartite states with non-trivial local entanglement transformations
• Quantum Advantage in Storage and Retrieval of Isometry Channels
• Characterising transformations between quantum objects, 'completeness' of quantum properties, and transformations without a fixed causal order