Continuous history variable for programmable quantum processors
Alexander Yu. Vlasov

TL;DR
This paper proposes using a continuous quantum history variable to simplify programmable quantum processors, potentially improving quantum algorithm models and complexity analysis.
Contribution
Introduction of a continuous quantum history variable to enhance the design of programmable quantum processors and modify quantum function evaluation schemes.
Findings
Simplifies the scheme of programmable quantum processors
Enables testing in other quantum algorithm models
Provides a modification of standard quantum function evaluation
Abstract
In this brief note is discussed application of continuous quantum history ("trash") variable for simplification of scheme of programmable quantum processor. Similar scheme may be tested also in other models of the theory of quantum algorithms and complexity, because provides modification of a standard operation: quantum function evaluation.
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 · Neural Networks and Reservoir Computing
