A prototype of quantum von Neumann architecture

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.

arXiv commentMinor changes, please also refer to the published version

References in corpus (50)

• Quantum Cryptography
• Non-Abelian Anyons and Topological Quantum Computation
• Elementary gates for quantum computation
• Decoherence, einselection, and the quantum origins of the classical
• The density-matrix renormalization group in the age of matrix product states
• Quantum Amplitude Amplification and Estimation
• Quantum random access memory
• A Theory of Fault-Tolerant Quantum Computation
• Control of quantum phenomena: Past, present, and future
• Unconditionally secure quantum bit commitment is impossible
• Noncommuting mixed states cannot be broadcast
• Is Quantum Bit Commitment Really Possible?
• Quantum computations without definite causal structure
• Theoretical framework for quantum networks
• Universal computation by multi-particle quantum walk
• Restrictions on Transversal Encoded Quantum Gate Sets
• Quantum Circuits Architecture
• Programmable quantum gate arrays
• Transforming quantum operations: quantum supermaps
• Optimal universal quantum cloning and state estimation
• Universal Algorithm for Optimal Estimation of Quantum States from Finite Ensembles
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Quantum memories at finite temperature
• Optimal quantum learning of a unitary transformation
• Toward a general theory of quantum games
• Quantum circuits cannot control unknown operations
• Quantum Cloning Machines and the Applications
• Coherent Communication of Classical Messages
• Continuous symmetries and approximate quantum error correction
• Computational Power of Symmetry-Protected Topological Phases
• Fusion-based quantum computation
• Quantum Computing with black-box Subroutines
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
• Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
• Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
• Quantum Nondemolition Monitoring of Universal Quantum Computers
• Efficient universal programmable quantum measurements
• Error Correction of Quantum Reference Frame Information
• New perspectives on covariant quantum error correction
• Optimal universal programming of unitary gates
• Generalized channels: channels for convex subsets of the state space
• Remarks on Universal Quantum Computer
• Approximate Quantum Error Correction Revisited: Introducing the Alpha-bit
• Resource Quantification for the No-Programming Theorem
• A comparative study of universal quantum computing models: towards a physical unification
• Quasi-exact quantum computation
• Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
• Universal control of quantum processes using sector-preserving channels
• Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing
• Quantum computation by teleportation and symmetry

Cited by in corpus (7)

• Universal resources for quantum computing
• Quantum resource theory of coding for error correction
• Quantum circuit simulation of superchannels
• A survey of universal quantum von Neumann architecture
• A family of quantum von Neumann architecture
• Experimental simulation of quantum superchannels
• An additive refinement of quantum channel capacities