Difference between revisions of "Quantum computation"
From apm
(very minimal basic page) |
m (added link to: Subsystems of gem-gum factories) |
||
| 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]]. |
Revision as of 11:29, 23 June 2021
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.:
- Finding optimal arrangements of atoms in Kaehler brackets
- Optimizing circurty routing of all the various subsystems of a gemstone metamaterial on-chip factories.
