Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality

Abstract

This work analyses the performance of quantum circuits and general processes to transform $k$ uses of an arbitrary unitary operation $U$ into another unitary operation $f(U)$. When the desired function $f$ a homomorphism, i.e., $f(UV)=f(U)f(V)$, it is known that optimal average fidelity is attainable by parallel circuits and indefinite causality does not provide any advantage. Here we show that the situation changes dramatically when considering anti-homomorphisms, i.e., $f(UV)=f(V)f(U)$. In particular, we prove that when $f$ is an anti-homomorphism, sequential circuits could exponentially outperform parallel ones and processes with indefinite causal order could outperform sequential ones. We presented explicit constructions on how to obtain such advantages for the unitary inversion task $f(U)=U^{-1}$ and the unitary transposition task $f(U)=U^T$. We also stablish a one-to-one connection between the problem of unitary estimation and parallel unitary transposition, allowing one to easily translate results from one field to the other. Finally, we apply our results to several concrete problem instances and present a method based on computer-assisted proofs to show optimality.

arXiv comment25+12 pages, 8 figures. Some parts of the text were improved, some typos were corrected. Accepted in Quantum. Code available at https://github.com/mtcq/deterministic_unitary_transformation

References in corpus (66)

• Quantum correlations with no causal order
• Informational derivation of Quantum Theory
• Robustness of entanglement
• Optimal Cloning of Pure States
• Quantum computations without definite causal structure
• Theoretical framework for quantum networks
• Probabilistic theories with purification
• Quantum Circuits Architecture
• Transforming quantum operations: quantum supermaps
• Non-Markovian quantum processes: complete framework and efficient characterisation
• Optimal universal quantum cloning and state estimation
• Experimental Verification of an Indefinite Causal Order
• Quantum causal modelling
• Indefinite Causal Order in a Quantum Switch
• Quantum Channels with Memory
• Witnessing causal nonseparability
• Classical randomness in quantum measurements
• Quantum stochastic processes and quantum non-Markovian phenomena
• Memory effects in quantum channel discrimination
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Optimal quantum learning of a unitary transformation
• Inferring causal structure: a quantum advantage
• Toward a general theory of quantum games
• Separability properties of tripartite states with UxUxU-symmetry
• Quantum circuits cannot control unknown operations
• Quantum teleportation scheme by selecting one of multiple output ports
• Optimal estimation of group transformations using entanglement
• Experimental Quantum Communication Enhancement by Superposing Trajectories
• Optimal estimation of quantum dynamics
• Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
• A fidelity measure for quantum channels
• Process POVM: A mathematical framework for the description of process tomography experiments
• Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination
• Optimal cloning of unitary transformations
• A purification postulate for quantum mechanics with indefinite causal order
• Quantum circuits with classical versus quantum control of causal order
• Optimal quantum networks and one-shot entropies
• Quartic quantum theory: an extension of the standard quantum mechanics
• Cyclic Quantum Causal Models
• 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 continuous quantum measurements in finite dimension are actually discrete
• Port-based teleportation in arbitrary dimension
• Experiments on quantum causality
• Quantum operations with indefinite time direction
• Causal structures and the classification of higher order quantum computations
• Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
• Quantum Networks: general theory and applications
• Entanglement assisted alignment of reference frames using a dense covariant coding
• Optimal networks for Quantum Metrology: semidefinite programs and product rules
• Resetting uncontrolled quantum systems
• Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
• Simplified formalism of the algebra of partially transposed permutation operators with applications
• Simple and maximally robust processes with no classical common-cause or direct-cause explanation
• Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• Quantum conditional operations
• Transition Operators
• Consequences of preserving reversibility in quantum superchannels
• Quantum superpositions of "common-cause" and "direct-cause" causal structures
• Optimal processing of reversible quantum channels
• Translating Uncontrolled Systems in Time
• Implementing positive maps with multiple copies of an input state
• No-iteration of unknown quantum gates
• Experimentally undoing an unknown single-qubit unitary
• Compact construction algorithms for the singlets of SU(N) over mixed tensor product spaces

Cited by in corpus (19)

• Experimental Aspects of Indefinite Causal Order in Quantum Mechanics
• Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
• Reassessing thermodynamic advantage from indefinite causal order
• Experimental superposition of time directions
• Multiparameter simultaneous optimal estimation with an SU(2) coding unitary evolution
• Reversing Unknown Quantum Processes via Virtual Combs for Channels with Limited Information
• Optimal universal quantum circuits for unitary complex conjugation
• Universal construction of decoders from encoding black boxes
• Strategies for single-shot discrimination of process matrices
• Linear programming with unitary-equivariant constraints
• Quantum Query Complexity of Boolean Functions under Indefinite Causal Order
• Universal adjointation of isometry operations using conversion of quantum supermaps
• Simulating the quantum switch with quantum circuits is computationally hard
• Parameterized quantum comb and simpler circuits for reversing unknown qubit-unitary operations
• Characterising transformations between quantum objects, 'completeness' of quantum properties, and transformations without a fixed causal order
• On the distinguishability of geometrically uniform quantum states
• A resource theory of asynchronous quantum information processing
• Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations
• No quantum advantage for violating fixed-order inequalities?