Quantum contextuality
Recently, quantum contextuality has been explored as a potential tool for quantum computing. In 2013, Robert Raussendorf showed that in general, any Mermin-like, inequality-free proof for quantum contextuality (such as the Kochen-Specker theorem) can be turned into a measurement-based quantum computation. More formally, "under quite natural assumptions for multi-qubit systems, MBQCs (measurement based quantum computations) which compute a non-linear Boolean function with sufficiently high success probability are contextual." Then in 2014, Mark Howard, et. al. showed that applying contextuality to magic state distillation (MSD) provides a means for arriving at universal, fault-tolerant quantum computing. MSD is a process by which a single qubit's polarization is increased along one of several "magic" directions and its state is considered "magic" once its polarization reaches a certain level. In particular, the group proved that states are non-contextual if and only if they cannot be used as inputs for magic state distillation. This provides a selection criteria for proper input states needed in MSD, and by extension aids in the efficient creation of magic states that, when coupled with fault-tolerant operators, allows for universal quantum computing. In both cases, contextuality has a potential advantage over other quantum computational techniques since contextuality itself can be thought of as a theory of information that is built directly into quantum mechanics. Comparatively, more traditional quantum phenomena such as entanglement and interference use delicate physical states which are incredibly susceptible to noise and very difficult to manipulate experimentally.
Topological quantum computer
A topological quantum computer is a theoretical quantum computer that employs two-dimensional quasiparticles called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime (i.e., one temporal plus two spatial dimensions). These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable. Small, cumulative perturbations can cause quantum states to decohere and introduce errors in the computation, but such small perturbations do not change the braids' topological properties. This is like the effort required to cut a string and reattach the ends to form a different braid, as opposed to a ball (representing an ordinary quantum particle in four-dimensional spacetime) bumping into a wall. Alexei Kitaev proposed topological quantum computation in 1997. While the elements of a topological quantum computer originate in a purely mathematical realm, experiments in fractional quantum Hall systems indicate these elements may be created in the real world using semiconductors made of gallium arsenide at a temperature of near absolute zero and subjected to strong magnetic fields.