Optimal probabilistic storage and retrieval of unitary channels
We address the question of quantum memory storage for quantum dynamics. In particular,
we design an optimal protocol for N→ 1 probabilistic storage and retrieval of unitary …
we design an optimal protocol for N→ 1 probabilistic storage and retrieval of unitary …
Optimal quantum networks and one-shot entropies
We develop a semidefinite programming method for the optimization of quantum networks,
including both causal networks and networks with indefinite causal structure. Our method …
including both causal networks and networks with indefinite causal structure. Our method …
Optimal universal programming of unitary gates
A universal quantum processor is a device that takes as input a (quantum) program,
containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which …
containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which …
The mixed Schur transform: efficient quantum circuit and applications
QT Nguyen - ar** algorithms in higher-order quantum computation, which is the …
A coding theorem for bipartite unitaries in distributed quantum computation
We analyze implementations of bipartite unitaries by means of local operations and classical
communication (LOCC) assisted by shared entanglement. We employ concepts and …
communication (LOCC) assisted by shared entanglement. We employ concepts and …