Do particles know their destination before setting out?

  • Context: Graduate 
  • Thread starter Thread starter p764rds
  • Start date Start date
  • Tags Tags
    Particles
Click For Summary
SUMMARY

The discussion centers on the complexities of calculating optimal paths for particles in a quantum context, particularly in relation to the traveling salesman problem. It highlights that the routing calculations become exponentially complex due to potential collisions among numerous particles, necessitating computational power beyond current capabilities. The concept of faster-than-light (FTL) quantum state communication is proposed as a theoretical solution to enhance routing efficiency. However, it is emphasized that particles interact through long-range fields, challenging the traditional view of particle collisions.

PREREQUISITES
  • Understanding of quantum mechanics and particle physics
  • Familiarity with the traveling salesman problem in computational theory
  • Knowledge of many-body physics and emergent phenomena
  • Basic principles of quantum state communication
NEXT STEPS
  • Research quantum mechanics and its implications on particle interactions
  • Explore advanced algorithms for solving the traveling salesman problem
  • Study many-body physics and its relevance to emergent phenomena
  • Investigate the concept of faster-than-light communication in quantum systems
USEFUL FOR

Physicists, computational theorists, and researchers interested in quantum mechanics, particle interactions, and optimization problems in physics.

p764rds
Messages
167
Reaction score
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?
 
Physics news on Phys.org
You may want to look into many-body physics. Such detailed knowledge is not necessary (or may not even be relevant) in various emergent phenomena. The many-body ground state doesn't care about such detailed in, say, arriving at superconductivity, for example.

Zz.
 
p764rds said:
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?

This view of particles moving like billiard balls and colliding from time to time is deeply mistaken. Quantum particles interact through long-range fields (at least in the EM-case). The particle always "know" about each other just like in the case of gravity.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 10 ·
Replies
10
Views
4K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K