Optimal processing of reversible quantum channels
arXiv:1308.3254 · doi:10.1016/j.physleta.2014.04.042
Abstract
We consider the general problem of the optimal transformation of N uses of (possibly different) unitary channels to a single use of another unitary channel in any finite dimension. We show how the optimal transformation can be fully parallelized, consisting in a preprocessing channel followed by a parallel action of all the N unitaries and a final postprocessing channel. Our techniques allow to achieve an exponential reduction in the number of the free parameters of the optimization problem making it amenable to an efficient numerical treatment. Finally, we apply our general results to find the analytical solution for special cases of interest like the cloning of qubit phase gates.
arXiv comment14 pages, 2 figures
References in corpus (27)
- Quantum Copying: Beyond the No-Cloning Theorem
- Quantum correlations with no causal order
- Informational derivation of Quantum Theory
- Optimal Cloning of Pure States
- Theoretical framework for quantum networks
- Quantum process tomography of a controlled-NOT gate
- Programmable quantum gate arrays
- Transforming quantum operations: quantum supermaps
- A derivation of quantum theory from physical requirements
- Using entanglement improves precision of quantum measurements
- Quantum remote control: Teleportation of unitary operations
- Continuous Variable Quantum Cryptography using Two-Way Quantum Communication
- Quantum Process Tomography of the Quantum Fourier Transform
- Optimal quantum learning of a unitary transformation
- Optimal purification of single qubits
- Quantum computation with programmable connections between gates
- Adaptive versus non-adaptive strategies for quantum channel discrimination
- A fidelity measure for quantum channels
- Quantum Teleportation of Optical Quantum Gates
- Optimal quantum tomography for states, measurements, and transformations
- Quantum information becomes classical when distributed to many users
- Quantum Networks: general theory and applications
- Quantum learning algorithms for quantum measurements
- Minimum error discrimination of Pauli channels
- Information - Disturbance Tradeoff in the Estimation of a Unitary Transformation
- Minimal computational-space implementation of multi-round quantum protocols
- Memory cost of quantum protocols
Cited by in corpus (15)
- Optimal probabilistic storage and retrieval of unitary channels
- Updating the Born rule
- Probabilistic exact universal quantum circuits for transforming unitary operations
- 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
- Causation does not explain contextuality
- Universal super-replication of unitary gates
- Units of rotational information
- Quantum-enhanced learning of rotations about an unknown direction
- Optimal universal quantum circuits for unitary complex conjugation
- Universal construction of decoders from encoding black boxes
- Universal adjointation of isometry operations using conversion of quantum supermaps
- Experimental replication of single-qubit quantum phase gates
- Quantum Advantage in Storage and Retrieval of Isometry Channels
- Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations