The impossibility of undoing a mixing process is analysed in the context of quantum information theory. The optimal machine to undo the mixing process is studied in the case of pure states, focusing on qubit systems. Exploiting the symmetry of the problem we parametrise the optimal machine in such a way that the number of parameters grows polynomially in the size of the problem. This simplification makes the numerical methods feasible. For simple but non-trivial cases we computed the analytical solution, comparing the performance of the optimal machine with other protocols.

Optimal Quantum Subtracting Machine

Kianvash, Farzad;Fanizza, Marco;Giovannetti, Vittorio
2019

Abstract

The impossibility of undoing a mixing process is analysed in the context of quantum information theory. The optimal machine to undo the mixing process is studied in the case of pure states, focusing on qubit systems. Exploiting the symmetry of the problem we parametrise the optimal machine in such a way that the number of parameters grows polynomially in the size of the problem. This simplification makes the numerical methods feasible. For simple but non-trivial cases we computed the analytical solution, comparing the performance of the optimal machine with other protocols.
2019
Settore FIS/03 - Fisica della Materia
Quantum Physics
File in questo prodotto:
File Dimensione Formato  
1811.07187.pdf

accesso aperto

Tipologia: Accepted version (post-print)
Licenza: Solo Lettura
Dimensione 510.66 kB
Formato Adobe PDF
510.66 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11384/134864
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact