Programmable Quantum Networks with Pure States
Alexander Yu. Vlasov

TL;DR
This paper explores the design and theoretical principles of programmable quantum networks using pure states, aiming to emulate classical von Neumann architecture in quantum computing for future applications.
Contribution
It introduces a deterministic approach to programmable quantum networks with pure states, discussing models like control-shift architecture and quantum cellular automata.
Findings
Proposes a control-shift quantum processor architecture.
Analyzes the applicability of quantum cellular automata as a universal model.
Discusses the integration of finite and continuous quantum variables.
Abstract
Modern classical computing devices, except of simplest calculators, have von Neumann architecture, i.e., a part of the memory is used for the program and a part for the data. It is likely, that analogues of such architecture are also desirable for the future applications in quantum computing, communications and control. It is also interesting for the modern theoretical research in the quantum information science and raises challenging questions about an experimental assessment of such a programmable models. Together with some progress in the given direction, such ideas encounter specific problems arising from the very essence of quantum laws. Currently are known two different ways to overcome such problems, sometime denoted as a stochastic and deterministic approach. The presented paper is devoted to the second one, that is also may be called the programmable quantum networks with pure…
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
