A prototype of quantum von Neumann architecture
From MaRDI portal
Publication:6157055
Abstract: A modern computer system, based on the von Neumann architecture, is a complicated system with several interactive modular parts. Quantum computing, as the most generic usage of quantum information, follows a hybrid architecture so far, namely, quantum algorithms are stored and controlled classically, and mainly the executions of them are quantum, leading to the so-called quantum processing units. Such a quantum-classical hybrid is constrained by its classical ingredients, and cannot reveal the computational power of a fully quantum computer system as conceived from the beginning of the field. Recently, the nature of quantum information has been further recognized, such as the no-programming and no-control theorems, and the unifying understandings of quantum algorithms and computing models. As a result, in this work we propose a model of universal quantum computer system, the quantum version of the von Neumann architecture. It uses ebits (i.e., Bell states) as elements of the quantum memory unit, and qubits as elements of the quantum control unit and processing unit. As a digital quantum system, its global configurations can be viewed as tensor-network states. Its universality is proved by the capability to execute quantum algorithms based on a program composition scheme via a universal quantum gate teleportation. It is also protected by the uncertainty principle, the fundamental law of quantum information, making it quantum-secure distinct from the classical case. In particular, we introduce a few variants of quantum circuits, including the tailed, nested, and topological ones, to characterize the roles of quantum memory and control, which could also be of independent interest in other contexts. In all, our primary study demonstrates the manifold power of quantum information and paves the way for the creation of quantum computer systems in the near future.
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3139352 (Why is no real title available?)
- scientific article; zbMATH DE number 3783731 (Why is no real title available?)
- scientific article; zbMATH DE number 3530652 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- scientific article; zbMATH DE number 6131346 (Why is no real title available?)
- scientific article; zbMATH DE number 3109251 (Why is no real title available?)
- A single quantum cannot be cloned
- Approximate quantum error correction revisited: introducing the alpha-bit
- Can a Universal Quantum Computer Be Fully Quantum?
- Completely positive linear maps on complex matrices
- Control of quantum phenomena: past, present and future
- Decoherence, einselection, and the quantum origins of the classical
- Duality quantum computing and duality quantum information processing
- Gauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
- Generalized channels: channels for convex subsets of the state space
- Linear transformations which preserve trace and positive semidefiniteness of operators
- Matrix product state representations
- Non-abelian anyons and topological quantum computation
- Programmable Quantum Gate Arrays
- Quantum Complexity Theory
- Quantum circuits cannot control unknown operations
- Quantum cryptography
- Quantum detection and estimation theory
- Quantum internet: A vision for the road ahead
- Quantum plug n' play: modular computation in the quantum regime
- Quantum random access memory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Remarks on universal quantum computer
- States, effects, and operations. Fundamental notions of quantum theory. Lectures in mathematical physics at the University of Texas at Austin. Ed. by A. Böhm, J. D. Dollard and W. H. Wootters
- The density-matrix renormalization group in the age of matrix product states
- Theoretical framework for quantum networks
- Transversality Versus Universality for Additive Quantum Codes
- Universal Algorithm for Optimal Estimation of Quantum States from Finite Ensembles via Realizable Generalized Measurement
- Universal Blind Quantum Computation
- Universal computation by multiparticle quantum walk
This page was built for publication: A prototype of quantum von Neumann architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157055)
