Combinatorial optimizationCombinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead.
Quantum computingA quantum computer is a computer that exploits quantum mechanical phenomena. At small scales, physical matter exhibits properties of both particles and waves, and quantum computing leverages this behavior, specifically quantum superposition and entanglement, using specialized hardware that supports the preparation and manipulation of quantum states. Classical physics cannot explain the operation of these quantum devices, and a scalable quantum computer could perform some calculations exponentially faster than any modern "classical" computer.
Serpentine subgroupSerpentine subgroup (part of the kaolinite-serpentine group in the category of phyllosilicates) are greenish, brownish, or spotted minerals commonly found in serpentinite. They are used as a source of magnesium and asbestos, and as decorative stone. The name comes from the greenish colour and smooth or scaly appearance from the Latin serpentinus, meaning "serpent rock". Serpentine subgroup is a set of common rock-forming hydrous magnesium iron phyllosilicate ((Mg,Fe)3Si2O5(OH)4) minerals, resulting from the metamorphism of the minerals that are contained in mafic to ultramafic rocks.
