On the most efficient unitary transformation for programming quantum channels

2005/09/26 by Giacomo Mauro D’Ariano, Giacomo Mauro D'Ariano, D'Ariano, Giacomo Mauro +2 · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/0509183

8 pages, ws-procs9x6 and qcircuit styles. Proceedings "26th Conference: QP and IDA" - Levico (Trento), February 20-26, 2005

arxiv created 2005/09/26 · arxiv updated 2009/12/01

Abstract

We address the problem of finding the optimal joint unitary transformation on system + ancilla which is the most efficient in programming any desired channel on the system by changing the state of the ancilla. We present a solution to the problem for dim(H)=2 for both system and ancilla.

Citations

• Storage of quantum dynamics on quantum states: a quasi-perfect programmable quantum gate

Cited by

• Programmable quantum channels and measurements

Related

• Programmable quantum channels and measurements
• Quantum Advantage in Learning Mixed Unitary Channels
• Efficient implementation of unitary transformations
• Kolmogorov complexity of unitary transformations in quantum computing
• A feasible and unitary quantum programming language