Notes on deterministic programming of quantum observables and channels

From MaRDI portal
Publication:496916

DOI10.1007/S11128-015-1025-XzbMATH Open1321.81016arXiv1412.0419OpenAlexW3101010823WikidataQ62561377 ScholiaQ62561377MaRDI QIDQ496916FDOQ496916


Authors: Teiko Heinosaari, Mikko Tukiainen Edit this on Wikidata


Publication date: 23 September 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: We study the limitations of deterministic programmability of quantum circuits, e.g., quantum computer. More precisely, we analyse the programming of quantum observables and channels via quantum multimeters. We show that the programming vectors for any two different sharp observables are necessarily orthogonal, whenever post-processing is not allowed. This result then directly implies that also any two different unitary channels require orthogonal programming vectors. This approach generalizes the well-known orthogonality result first proven by Nielsen and Chuang. In addition, we give size-bounds for a multimeter to be efficient in quantum programming.


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




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Notes on deterministic programming of quantum observables and channels

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