Quantum Dot Cellular Automata: Computing Without Wires
Quantum dot cellular automata compute by the position of electrons in dots instead of current in wires. Logic gates, advantages and challenges.
BasicsAlgorithmsHardwareError CorrectionCryptographyMachine LearningInformation TheoryPhysics & SimulationApplicationsIndustry & Careers
Quantum Information Theory
Entropy, channel capacity, teleportation, complexity classes and the theorems that define what quantum information can and cannot do.
155 articles
Quantum State Machines and Their Transitions
How state machine models are extended to quantum systems, how they compare with classical state machines, and possible applications.
Quantum Lambda Calculus: Functional Quantum Code
Quantum lambda calculus extends the lambda calculus to describe quantum programs. Its origins, syntax, handling of entanglement and uses.
Quantum Pushdown Automata: Stacks Meet Qubits
Quantum pushdown automata add a stack to quantum finite automata. Their formal definition, operations and comparison with classical pushdown automata.
Quantum Finite Automata and Their Power
Quantum finite automata are the simplest quantum computing models. How they compare with classical automata and which languages they recognize.
The One-Way Quantum Computer: Cluster States
The one-way quantum computer starts from an entangled cluster state and computes through single-qubit measurements. How it works and scales.
The Quantum Turing Machine and Its Definition
The quantum Turing machine formalizes quantum computation, as defined by Deutsch in 1985. Its definition, relation to circuits and complexity.
Quantum Process Estimation and Gate Fidelity
Quantum process estimation characterizes what a quantum operation actually does. Process tomography, gate fidelity and randomized benchmarking.
Quantum Game Theory: Strategies With Entanglement
Quantum game theory lets players use entangled strategies. How this changes outcomes in games such as the prisoner’s dilemma.
Quantum Probability Theory and Where It Differs
Quantum probability differs from classical probability because observables do not commute. How the rules work and where they are used.
Quantum Logic: The Algebra of Quantum Propositions
Quantum logic, introduced by Birkhoff and von Neumann in 1936, replaces classical logic with the lattice of quantum propositions. Ideas and uses.
Quantum Foundations: The Questions Still Open
The open questions in the foundations of quantum mechanics: measurement, interpretation, non-locality and what the theory says about reality.
