Universal adjointation of isometry operations using conversion of quantum supermaps
arXiv:2401.10137 · doi:10.22331/q-2025-05-20-1750
Abstract
Identification of possible transformations of quantum objects including quantum states and quantum operations is indispensable in developing quantum algorithms. Universal transformations, defined as input-independent transformations, appear in various quantum applications. Such is the case for universal transformations of unitary operations. However, extending these transformations to non-unitary operations is nontrivial and largely unresolved. Addressing this, we introduce isometry adjointation protocols that transform an input isometry operation into its adjoint operation, which include both unitary operation and quantum state transformations. The paper details the construction of parallel and sequential isometry adjointation protocols, derived from unitary inversion protocols using quantum combs and the (dual) Clebsch-Gordan transforms, and achieving optimal approximation error. This error is shown to be independent of the output dimension of the isometry operation. In particular, we explicitly obtain an asymptotically optimal parallel protocol achieving an approximation error , where is the input dimension of the isometry operation and is the number of calls of the isometry operation. The research also extends to isometry inversion and universal error detection, employing semidefinite programming to assess optimal performances. The findings suggest that the optimal performance of general protocols in isometry adjointation and universal error detection is not dependent on the output dimension, and that indefinite causal order protocols offer advantages over sequential ones in isometry inversion and universal error detection.
arXiv comment81 pages, 9 figures. Accepted in Quantum. All codes are available at https://github.com/sy3104/isometry_adjointation
References in corpus (68)
- Black holes as mirrors: quantum information in random subsystems
- Quantum Resource Theories
- Quantum fingerprinting
- Quantum correlations with no causal order
- Measuring out-of-time-order correlations and multiple quantum spectra in a trapped ion quantum magnet
- Quantum computations without definite causal structure
- Theoretical framework for quantum networks
- Quantum Circuits Architecture
- Measuring out-of-time-order correlators on a nuclear magnetic resonance quantum simulator
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Programmable quantum gate arrays
- Transforming quantum operations: quantum supermaps
- Non-Markovian quantum processes: complete framework and efficient characterisation
- Statistical distinguishability between unitary operations
- Reversing quantum dynamics with near-optimal quantum and classical fidelity
- Quantum Information Scrambling in a Superconducting Qutrit Processor
- Towards Quantum Gravity: A Framework for Probabilistic Theories with Non-Fixed Causal Structure
- Witnessing causal nonseparability
- Quantum information scrambling in a trapped-ion quantum simulator with tunable range interactions
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- Optimal quantum learning of a unitary transformation
- Efficient use of quantum resources for the transmission of a reference frame
- Quantum circuits cannot control unknown operations
- Optimal estimation of group transformations using entanglement
- A simple approach to approximate quantum error correction based on the transpose channel
- Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
- Quantum multimeters: A programmable state discriminator
- A fidelity measure for quantum channels
- Optimal cloning of unitary transformations
- Quantum algorithm for Petz recovery channels and pretty good measurements
- Optimal quantum networks and one-shot entropies
- Universal measurement apparatus controlled by quantum software
- Optimal probabilistic storage and retrieval of unitary channels
- Theoretical framework for Higher-Order Quantum Theory
- Probabilistic exact universal quantum circuits for transforming unitary operations
- How energy conservation limits our measurements
- Quantum replication at the Heisenberg limit
- Efficient universal programmable quantum measurements
- An efficient high dimensional quantum Schur transform
- Optimal universal programming of unitary gates
- Strategies for optimal single-shot discrimination of quantum measurements
- Entanglement assisted alignment of reference frames using a dense covariant coding
- Decoding quantum information via the Petz recovery map
- Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
- Resetting uncontrolled quantum systems
- Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
- Probabilistic quantum multimeters
- Universal super-replication of unitary gates
- Efficient multi port-based teleportation schemes
- Optimal quantum-programmable projective measurement with linear optics
- Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
- Simplified formalism of the algebra of partially transposed permutation operators with applications
- Deterministic superreplication of one-parameter unitary transformations
- Quantum conditional operations
- Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
- Optimality of programmable quantum measurements
- A universal quantum rewinding protocol with an arbitrarily high probability of success
- Optimal processing of reversible quantum channels
- Translating Uncontrolled Systems in Time
- Multiple-shot and unambiguous discrimination of von Neumann measurements
- Probabilistic storage and retrieval of qubit phase gates
- Optimal universal quantum circuits for unitary complex conjugation
- Composition rules for quantum processes: a no-go theorem
- Universal construction of decoders from encoding black boxes
- Cloning of a quantum measurement
- Linear programming with unitary-equivariant constraints
- No-iteration of unknown quantum gates
- Storage and retrieval of von Neumann measurements