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