- #1
p764rds
- 167
- 0
Lets assume we want to calculate a path for a particle for a best path
scenario from one place to another.
Particle A can collide with nearby particles B or C - depending on where B and C are,
but B and C may collide with D or E and, again D or E may collide with particles F,G,H,I,J,K,L,M.
But particles F,G,H,I,J,K,L,M may collide with...
The routing calculation is a polynomial nightmare even for a large computer,
- would need one bigger than the universe etc etc.
If the quantum states of the particles involved in collisions knew their destinations before setting off
(by FTL quantum state communication), would that help in solving this polynomial traveling salesman problem?
scenario from one place to another.
Particle A can collide with nearby particles B or C - depending on where B and C are,
but B and C may collide with D or E and, again D or E may collide with particles F,G,H,I,J,K,L,M.
But particles F,G,H,I,J,K,L,M may collide with...
The routing calculation is a polynomial nightmare even for a large computer,
- would need one bigger than the universe etc etc.
If the quantum states of the particles involved in collisions knew their destinations before setting off
(by FTL quantum state communication), would that help in solving this polynomial traveling salesman problem?