Discover published sets by community

Computational model that uses anyons, particles with non-abelian statistics, to perform computations based on their braiding and fusion properties.

A theoretical model of a Turing machine that operates on a tape of qubits and is capable of superposition and entanglement.

A grid of cells in a quantum state that evolves through discrete time steps according to a set of rules based on the cells' neighbors.

This model slowly varies the Hamiltonian of a quantum system to evolve the qubits from the ground state of a simple system to the ground state of a system that encodes the solution to a problem.

A model of computation that interleaves classical computing algorithms with quantum sub-routines, which can be particularly effective for near-term quantum devices.

A model where computation is performed through a sequence of adaptive quantum measurements on a highly entangled resource state, such as a cluster state.

A model primarily used for optimization problems, where the system is initialized in a ground state and is slowly evolved to solve the optimization by annealing.

They generalize classical random walks, involve the superposition and interference of paths, and can be used for developing quantum algorithms.

Not a computational model per se, but a collection of methods that protect quantum information against decoherence and errors during computation.