Optimal processing of reversible quantum channels

DOI10.1016/J.PHYSLETA.2014.04.042zbMATH Open1342.81085arXiv1308.3254OpenAlexW2150843938WikidataQ62107143 ScholiaQ62107143MaRDI QIDQ531201FDOQ531201

Authors: Alessandro Bisio, Paolo Perinotti, Michal Sedlák, Giacomo Mauro D'Ariano 

Publication date: 3 August 2016

Published in: Physics Letters. A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1308.3254

Recommendations

• On the most efficient unitary transformation for programming quantum channels
• Asymptotically optimal quantum channel reversal for qudit ensembles and multimode Gaussian states
• Universal transformations for finite dimensional quantum systems.
• Optimal realization of the transposition maps
• Quantum cloning of orthogonal qubits

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum state estimation, approximate cloning (81P50) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Title not available (Why is that?)
• Completely positive linear maps on complex matrices
• Title not available (Why is that?)
• Quantum remote control: teleportation of unitary operations
• States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
• Rapid solution of problems by quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A fidelity measure for quantum channels
• A derivation of quantum theory from physical requirements
• Philosophy of Quantum Information and Entanglement
• Quantum computation with programmable connections between gates
• Programmable Quantum Gate Arrays
• Quantum teleportation of optical quantum gates
• Quantum information becomes classical when distributed to many users
• Theoretical framework for quantum networks
• Quantum learning algorithms for quantum measurements

Cited In (10)

• Optimal realization of the transposition maps
• Reversing quantum dynamics with near-optimal quantum and classical fidelity
• Unitary channel discrimination beyond group structures: Advantages of sequential and indefinite-causal-order strategies
• Units of rotational information
• On the most efficient unitary transformation for programming quantum channels
• Optimizing the post-processing of online evolution reconstruction in quantum communication
• Analytical Optimization of Local Quantum Operation and Classical Communication
• Updating the Born rule
• Universal transformations for finite dimensional quantum systems.
• Asymptotically optimal quantum channel reversal for qudit ensembles and multimode Gaussian states

This page was built for publication: Optimal processing of reversible quantum channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531201)