Optimal universal quantum circuits for unitary complex conjugation

Abstract

Let $U_d$ be a unitary operator representing an arbitrary $d$-dimensional unitary quantum operation. This work presents optimal quantum circuits for transforming a number $k$ of calls of $U_d$ into its complex conjugate $\overline{U_d}$. Our circuits admit a parallel implementation and are proven to be optimal for any $k$ and $d$ with an average fidelity of $⟨F⟩=\frac{k+1}{d(d-k)}$. Optimality is shown for average fidelity, robustness to noise, and other standard figures of merit. This extends previous works which considered the scenario of a single call ($k=1$) of the operation $U_d$, and the special case of $k=d-1$ calls. We then show that our results encompass optimal transformations from $k$ calls of $U_d$ to $f(U_d)$ for any arbitrary homomorphism $f$ from the group of $d$-dimensional unitary operators to itself, since complex conjugation is the only non-trivial automorphisms on the group of unitary operators. Finally, we apply our optimal complex conjugation implementation to design a probabilistic circuit for reversing arbitrary quantum evolutions.

20 pages, 5 figures. Improved presentation, typos corrected, and some proofs are now clearer. Close to the published version

References in corpus (31)

• Quantum correlations with no causal order
• Quantum computations without definite causal structure
• Theoretical framework for quantum networks
• Quantum Circuits Architecture
• Transforming quantum operations: quantum supermaps
• Memory effects in quantum channel discrimination
• Optimal quantum learning of a unitary transformation
• Quantum circuits cannot control unknown operations
• Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations
• A fidelity measure for quantum channels
• Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination
• Optimal cloning of unitary transformations
• Optimal quantum networks and one-shot entropies
• Optimal probabilistic storage and retrieval of unitary channels
• Theoretical framework for Higher-Order Quantum Theory
• Probabilistic exact universal quantum circuits for transforming unitary operations
• Quantum speedup in the identification of cause-effect relations
• Causal structures and the classification of higher order quantum computations
• 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
• Resetting uncontrolled quantum systems
• Efficient multi port-based teleportation schemes
• Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
• Quantum conditional operations
• Success-or-Draw: A Strategy Allowing Repeat-Until-Success in Quantum Computation
• A universal quantum rewinding protocol with an arbitrarily high probability of success
• Optimal processing of reversible quantum channels
• Controlled quantum operations and combs, and their applications to universal controllization of divisible unitary operations
• Translating Uncontrolled Systems in Time
• Quantum-enhanced learning of rotations about an unknown direction
• No-iteration of unknown quantum gates

Cited by in corpus (6)

• Semidefinite programming relaxations for quantum correlations
• Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
• Exponential learning advantages with conjugate states and minimal quantum memory
• Linear programming with unitary-equivariant constraints
• Universal adjointation of isometry operations using conversion of quantum supermaps
• Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations