Topological Qubits: The Promise and the Evidence
Topological qubits promise built-in error resistance through anyon braiding. The promise, the gates, the challenges and the experimental evidence.
Topological qubits promise built-in error resistance through anyon braiding. The promise, the gates, the challenges and the experimental evidence.
The quantum circuit model describes computation as qubits passing through gates and ending in measurement. Design, complexity and simulation.
The quantum Turing machine formalizes quantum computation, as defined by Deutsch in 1985. Its definition, relation to circuits and complexity.
Majorana qubits would store information non-locally in pairs of Majorana zero modes. Their structure, braiding, and the state of the evidence.
Error mitigation techniques compared, including zero-noise extrapolation, probabilistic error cancellation and dynamical decoupling.
Quantum coding theory protects quantum information against noise. How quantum codes differ from classical codes, main families and uses.
Hardware-software co-design tailors quantum algorithms to qubit connectivity and noise, and hardware to algorithms. Strategies and examples.
Quantum error detection flags errors without correcting them. Syndrome measurement, detection codes and their role in fault-tolerant systems.
Probabilistic polynomial time in the quantum setting: how BQP and PP are defined, how error probability is bounded, and how they relate to P and NP.
The threshold theorem says arbitrarily long quantum computations are possible if physical error rates stay below a threshold. What that requires.
How error correction codes are adapted to correlated and non-standard noise, from error models and channels to implementation strategies.
The main families of stabilizer codes compared: history, properties, encoding, recovery, fault tolerance, applications and limitations.