Can a Quantum Computer Run the von Neumann Architecture?
From MaRDI portal
Publication:3000932
DOI10.1007/978-3-642-12821-9_14zbMath1218.81035OpenAlexW13083763MaRDI QIDQ3000932
No author found.
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Lectures on the Curry-Howard isomorphism
- Machine semantics
- Quantum circuit oracles for abstract machine computations
- Coherence for compact closed categories
- Domain theory in logical form
- The geometry of tensor calculus. I
- Completely positive linear maps on complex matrices
- Tortile tensor categories
- Quantum deleting and signalling
- Teleportation as a quantum computation.
- Nuclear and trace ideals in tensored \(^*\)-categories
- A short note on coherence and self-similarity
- The universal Turing machine. A half-century survey.
- Universality and programmability of quantum computers
- Category theory applied to Pontryagin duality
- Linear transformations which preserve trace and positive semidefiniteness of operators
- An Algebra of Pure Quantum Programming
- Dagger Compact Closed Categories and Completely Positive Maps
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- The measurement calculus
- The One Way to Quantum Computation
- Irreversibility and Heat Generation in the Computing Process
- Coherence in Nonmonoidal Closed Categories
- Embedding of Closed Categories Into Monoidal Closed Categories
- Can programming be liberated from the von Neumann style?
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Programmable Quantum Gate Arrays
- Can a Universal Quantum Computer Be Fully Quantum?
- The computer as von Neumann planned it
- On the role of entanglement in quantum-computational speed-up
- Geometry of Interaction and linear combinatory algebras
- A categorical framework for finite state machines
- Radon–Nikodym derivatives of quantum operations
- Traced monoidal categories
- A single quantum cannot be cloned
- Physical Systems as Constructive Logics
- Quantum programming languages: survey and bibliography
- A categorical quantum logic
- Algebra and Coalgebra in Computer Science
- Logical Reversibility of Computation
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
This page was built for publication: Can a Quantum Computer Run the von Neumann Architecture?
