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.

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

References in corpus (71)

• Quantum algorithm for solving linear systems of equations
• Quantum Teleportation is a Universal Computational Primitive
• Quantum Resource Theories
• Quantum correlations with no causal order
• On the Theory of Quantum Secret Sharing
• General Entanglement Breaking Channels
• Quantum computations without definite causal structure
• Theoretical framework for quantum networks
• Quantum Process Tomography: Resource Analysis of Different Strategies
• Transforming quantum operations: quantum supermaps
• Non-Markovian quantum processes: complete framework and efficient characterisation
• Operational Markov condition for quantum processes
• Quantum Channels with Memory
• Witnessing causal nonseparability
• Quantum stochastic processes and quantum non-Markovian phenomena
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Exploiting the causal tensor network structure of quantum processes to efficiently simulate non-Markovian path integrals
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Optimal quantum learning of a unitary transformation
• Toward a general theory of quantum games
• Completely Positive Divisibility Does Not Mean Markovianity
• Operational Resource Theory of Quantum Channels
• Quantum circuits cannot control unknown operations
• Quantifying Operations with an Application to Coherence
• A functional quantum programming language
• Optimal estimation of group transformations using entanglement
• How to quantify a dynamical quantum resource
• Quantum communication using a bounded-size quantum reference frame
• Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
• When is a non-Markovian quantum process classical?
• Optimal cloning of unitary transformations
• Resource theories of communication
• Quantum Markov Order
• The Structure of Quantum Stochastic Processes with Finite Markov Order
• A purification postulate for quantum mechanics with indefinite causal order
• Optimal quantum networks and one-shot entropies
• Optimal probabilistic storage and retrieval of unitary channels
• Theoretical framework for Higher-Order Quantum Theory
• Dynamical Entanglement
• Entanglement of a bipartite channel
• Fundamental limitations on distillation of quantum channel resources
• Tomographically reconstructed master equations for any open quantum dynamics
• Probabilistic exact universal quantum circuits for transforming unitary operations
• Port-based teleportation in arbitrary dimension
• Optimal quantum tomography for states, measurements, and transformations
• On the definition and characterisation of multipartite causal (non)separability
• Witnessing quantum memory in non-Markovian processes
• Entanglement, non-Markovianity, and causal non-separability
• An efficient high dimensional quantum Schur transform
• Optimal universal programming of unitary gates
• Reconstructing open quantum system dynamics with limited control
• Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
• Resetting uncontrolled quantum systems
• Quantifying dynamical coherence with dynamical entanglement
• Universal super-replication of unitary gates
• Certifying quantumness: Benchmarks for the optimal processing of generalized coherent and squeezed states
• Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
• Non-Markovian quantum control as coherent stochastic trajectories
• Deterministic superreplication of one-parameter unitary transformations
• Communication, Dynamical Resource Theory, and Thermodynamics
• Information - Disturbance Tradeoff in the Estimation of a Unitary Transformation
• Quantum conditional operations
• Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• Consequences of preserving reversibility in quantum superchannels
• Routed quantum circuits
• Optimal processing of reversible quantum channels
• Uniqueness and Optimality of Dynamical Extensions of Divergences
• Entanglement-breaking superchannels
• Probabilistic storage and retrieval of qubit phase gates
• No-iteration of unknown quantum 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