Probabilistic exact universal quantum circuits for transforming unitary operations
arXiv:1909.01366 · doi:10.1103/PhysRevA.100.062339
Abstract
This paper addresses the problem of designing universal quantum circuits to transform uses of a -dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are considered, parallel circuits, where the input-operations can be simultaneously, adaptive circuits, where sequential uses of the input-operations are allowed, and general protocols, where the use of the input-operations may be performed without a definite causal order. For these three classes, we develop a systematic semidefinite programming approach that finds a circuit which obtains the desired transformation with the maximal success probability. We then analyse in detail three particular transformations; unitary transposition, unitary complex conjugation, and unitary inversion. For unitary transposition and unitary inverse, we prove that for any fixed dimension , adaptive circuits have an exponential improvement in terms of uses when compared to parallel ones. For unitary complex conjugation and unitary inversion we prove that if the number of uses is strictly smaller than , the probability of success is necessarily zero. We also discuss the advantage of indefinite causal order protocols over causal ones and introduce the concept of delayed input-state quantum circuits.
arXiv commentCloser to the published version. Typos were corrected and more details on SDP methods are now provided. This paper includes results that were removed from the first version our previous work (arXiv:1810.06944). Matlab code to accompany this article can be found at https://github.com/mtcq/unitary_inverse
References in corpus (36)
- Quantum Teleportation is a Universal Computational Primitive
- Quantum correlations with no causal order
- Quantum computations without definite causal structure
- Quantum Circuits Architecture
- Transforming quantum operations: quantum supermaps
- Computational advantage from quantum-controlled ordering of gates
- Statistical distinguishability between unitary operations
- Enhanced communication with the assistance of indefinite causal order
- Perfect discrimination of no-signalling channels via quantum superposition of causal structures
- Quantum Channels with Memory
- Witnessing causal nonseparability
- Memory effects in quantum channel discrimination
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Optimal quantum learning of a unitary transformation
- Quantum learning and universal quantum matching machine
- Storing quantum dynamics in quantum states: stochastic programmable gate for U(1) operations
- Quantum communication using a bounded-size quantum reference frame
- Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
- On the existence of physical transformations between sets of quantum states
- Optimal cloning of unitary transformations
- 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
- Port-based teleportation in arbitrary dimension
- Optimal quantum tomography for states, measurements, and transformations
- Extending quantum operations
- Quantum communication in a superposition of causal orders
- Quantum speedup in the identification of cause-effect relations
- Quantum Networks: general theory and applications
- Quantum learning by measurement and feedback
- Resetting uncontrolled quantum systems
- Improved discrimination of unitaries by entangled probes
- Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
- Optimal processing of reversible quantum channels
- Universal Refocusing of Systematic Quantum Noise
- Implementing positive maps with multiple copies of an input state
Cited by in corpus (37)
- Quantum Algorithmic Measurement
- Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
- Quantum circuits with classical versus quantum control of causal order
- Experimental Aspects of Indefinite Causal Order in Quantum Mechanics
- Quantum operations with indefinite time direction
- Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
- Deterministic transformations between unitary operations: Exponential advantage with adaptive quantum circuits and the power of indefinite causality
- Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
- Thermodynamics of Quantum Causal Models: An Inclusive, Hamiltonian Approach
- Symmetries of quantum evolutions
- Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
- Consequences of preserving reversibility in quantum superchannels
- Experimental superposition of time directions
- Experimental demonstration of input-output indefiniteness in a single quantum device
- Optimal universal quantum circuits for unitary complex conjugation
- Reversing Unknown Quantum Processes via Virtual Combs for Channels with Limited Information
- Universal construction of decoders from encoding black boxes
- Higher-order quantum transformations of Hamiltonian dynamics
- The quantum switch is uniquely defined by its action on unitary operations
- Linear programming with unitary-equivariant constraints
- Quantum Supermaps are Characterized by Locality
- Achieving the Multi-parameter Quantum Cramér-Rao Bound with Antiunitary Symmetry
- Indefinite Time Directed Quantum Metrology
- Emergent non-Markovianity and dynamical quantification of the quantum switch
- Universal adjointation of isometry operations using conversion of quantum supermaps
- Topological obstructions to quantum computation with unitary oracles
- Experimentally undoing an unknown single-qubit unitary
- Simulating the quantum switch with quantum circuits is computationally hard
- Parameterized quantum comb and simpler circuits for reversing unknown qubit-unitary operations
- Port-Based State Preparation and Applications
- Representation matching for delegated quantum computing
- Characterising transformations between quantum objects, 'completeness' of quantum properties, and transformations without a fixed causal order
- On the distinguishability of geometrically uniform quantum states
- Duality theory for Clifford tensor powers
- No quantum advantage for violating fixed-order inequalities?
- Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations
- A resource theory of asynchronous quantum information processing