Reaching the Holevo Capacity via von Neumann measurement, and its use
L. Farkas

TL;DR
This paper demonstrates that the Holevo capacity can be achieved with von Neumann measurements, introduces a quantum generalization of classical channels, and presents a linear-time decoding algorithm using quantum measurement, potentially revolutionizing classical problem-solving.
Contribution
It shows the Holevo capacity can be reached by von Neumann measurements and introduces a quantum-based optimal decoding algorithm with linear complexity.
Findings
Holevo capacity achievable with von Neumann measurement
Quantum generalization of classical channels
Linear-time decoding algorithm for classical systems
Abstract
In this article we show that the Holevo capacity of a classical quantum channel, can be reached not only by a POVM but by von Neumann measurement too. Furthermore we show two use of this fact 1) We can generalize the classical compound channel to quantum environment and with this new measure technique we can give an optimal coding/decoding algorithm to it. 2) We give an algorithm, with it a classical system can be decoded by quantum apparatus in linear time, which is a surprising result, because best known optimal classical decoding algorithm need n*log(n) time. This means that if a quantum machine can perform arbitrarily von Neumann measurement with only two possible outcome, then it can solve non-polynomial classical problems in linear time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
