Difference between revisions of "Quantum computation"

From apm
Jump to: navigation, search
(very minimal basic page)
 
 
(2 intermediate revisions by the same user not shown)
Line 5: Line 5:
 
Quantum computation could be useful for difficult optimization problems with search spaces of super astronomical size. E.g.:
 
Quantum computation could be useful for difficult optimization problems with search spaces of super astronomical size. E.g.:
 
* Finding optimal arrangements of atoms in [[Kaehler bracket]]s
 
* Finding optimal arrangements of atoms in [[Kaehler bracket]]s
* Optimizing circurty routing of all the various subsystems of a [[gemstone metamaterial on-chip factories]].
+
* Optimizing circurty routing of [[Subsystems of gem-gum factories|all the various subsystems]] of a [[gemstone metamaterial on-chip factories]].
 +
 
 +
== Related ==
 +
 
 +
* [[Reversible computation]]
 +
* [[Purely functional programming]]
 +
 
 +
Optimization problems:
 +
 
 +
* [[Kaehler bracket]]
 +
* Circuit routing for the various [[subsystems of gem-gum factories]]
 +
 
 +
[[Category:Programming]]

Latest revision as of 09:39, 26 September 2021

This article is a stub. It needs to be expanded.

Quantum computation is very much NOT a necessity for the functioning of future gemstone metamaterial on-chip factories.

Quantum computation could be useful for difficult optimization problems with search spaces of super astronomical size. E.g.:

Related

Optimization problems: