Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
arXiv:2109.08202 · doi:10.22331/q-2022-03-31-679
Abstract
This work analyses the performance of quantum circuits and general processes to transform uses of an arbitrary unitary operation into another unitary operation . When the desired function a homomorphism, i.e., , 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., . In particular, we prove that when 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 and the unitary transposition task . 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.
25+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 (18)
- Quantum Circuits Architecture
- Transforming quantum operations: quantum supermaps
- Experimental Verification of an Indefinite Causal Order
- Quantum stochastic processes and quantum non-Markovian phenomena
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Inferring causal structure: a quantum advantage
- Quantum teleportation scheme by selecting one of multiple output ports
- 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
- Quantum circuits with classical versus quantum control of causal order
- Quartic quantum theory: an extension of the standard quantum mechanics
- Experiments on quantum causality
- Quantum operations with indefinite time direction
- Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
- 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
- Experimentally undoing an unknown single-qubit unitary
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?