Quantum computation: Difference between revisions
Jump to navigation
Jump to search
m added link to: Subsystems of gem-gum factories |
added related section |
||
| Line 6: | Line 6: | ||
* Finding optimal arrangements of atoms in [[Kaehler bracket]]s | * Finding optimal arrangements of atoms in [[Kaehler bracket]]s | ||
* Optimizing circurty routing of [[Subsystems of gem-gum factories|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]] | |||
Revision as of 17:06, 24 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.
Related
Optimization problems:
- Kaehler bracket
- Circuit routing for the various subsystems of gem-gum factories