Quick Navigation

Topics

Quantum Algorithms

Optimal Quantum Subtracting Machine

arXiv
Authors: Farzad Kianvash, Marco Fanizza, Vittorio Giovannetti

Year

2018

Paper ID

23282

Status

Preprint

Abstract Read

~2 min

Abstract Words

91

Citations

N/A

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.

Why This Paper Matters

  • It adds a 2018 reference point for readers tracking recent quantum research.
  • The impossibility of undoing a mixing process is analysed in the context of quantum information theory.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #23282 #69983 Spectral Leakage and Masking Ef... #69982 Dimensionality Reduction of QAO... #69981 A Hybrid Quantum-Classical Appr... #69980 Complexity Inequalities for Qua...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.