Can a quantum computer run the von Neumann architecture?

DOI10.1007/978-3-642-12821-9_14zbMATH Open1218.81035OpenAlexW13083763MaRDI QIDQ3000932FDOQ3000932

Authors:

Publication date: 31 May 2011

Published in: New Structures for Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12821-9_14

Recommendations

• Architecture of a deterministic quantum central processing unit
• scientific article; zbMATH DE number 5498842
• Universality and programmability of quantum computers
• Selected topics in quantum programming theory
• Cellular quantum computer architecture

Mathematics Subject Classification ID

Quantum computation (81P68) Mathematical problems of computer architecture (68M07)

Cites Work

• Title not available (Why is that?)
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A single quantum cannot be cloned
• Domain theory in logical form
• The geometry of tensor calculus. I
• Completely positive linear maps on complex matrices
• Teleportation as a quantum computation.
• The Heisenberg representation of quantum computers
• Dagger compact closed categories and completely positive maps (extended abstract)
• Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
• Irreversibility and Heat Generation in the Computing Process
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum Complexity Theory
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Title not available (Why is that?)
• On the role of entanglement in quantum-computational speed-up
• Quantum measurements without sums
• Quantum programming languages: survey and bibliography
• Logical Reversibility of Computation
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
• Linear logic
• Lectures on the Curry-Howard isomorphism
• Geometry of Interaction and linear combinatory algebras
• Traced monoidal categories
• Coherence for compact closed categories
• Nuclear and trace ideals in tensored \(^*\)-categories
• Linear transformations which preserve trace and positive semidefiniteness of operators
• Tortile tensor categories
• Quantum deleting and signalling
• A categorical quantum logic
• Kindergarten quantum mechanics -- lecture notes
• The measurement calculus
• Category theory applied to Pontryagin duality
• Title not available (Why is that?)
• Programmable Quantum Gate Arrays
• The computer as von Neumann planned it
• Title not available (Why is that?)
• Title not available (Why is that?)
• The One Way to Quantum Computation
• Title not available (Why is that?)
• An algebra of pure quantum programming
• Can programming be liberated from the von Neumann style?
• Can a Universal Quantum Computer Be Fully Quantum?
• Algebra and Coalgebra in Computer Science
• Radon–Nikodym derivatives of quantum operations
• Coherence in Nonmonoidal Closed Categories
• A categorical framework for finite state machines
• Physical Systems as Constructive Logics
• Machine semantics
• Quantum circuit oracles for abstract machine computations
• Embedding of Closed Categories Into Monoidal Closed Categories
• A short note on coherence and self-similarity
• The universal Turing machine. A half-century survey.
• Universality and programmability of quantum computers
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Can von Neumann's theory meet the Deutsch-Jozsa algorithm?

This page was built for publication: Can a quantum computer run the von Neumann architecture?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000932)