Quanta Abstractions

The Algorithm That Lets Particle Physicists Count Higher Than Two

Through his encyclopedic study of the electron, an obscure figure named Stefano Laporta found a handle on the subatomic world’s fearsome complexity. His algorithm has swept the field. The post The Algorithm That Lets Particle Physicists Count Higher Than Two first appeared on Quanta Magazine

Thomas Gehrmann remembers the deluge of mathematical expressions that came cascading down his computer screen one day 20 years ago. He was trying to calculate the odds that three jets of elementary particles would erupt from two particles smashing together. It was the type of bread-and-butter calculation physicists often do to check whether their theories match the results of experiments.

Source

Originally published in Quanta Abstractions.

More from Quanta

Quanta1 min read
Scientists Find a Fast Way to Describe Quantum Systems
After years of false starts, a team of computer scientists has found a way to efficiently deduce the Hamiltonian of a physical system at any constant temperature. The post Scientists Find a Fast Way to Describe Quantum Systems first appear
Quanta1 min readMathematics
Researchers Approach New Speed Limit for Seminal Problem
Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it. The post Researchers Approach New Speed Limit for Seminal Problem first appeared on Quanta Maga
Quanta1 min read
Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award
The prolific researcher found deep connections between randomness and computation and spent a career influencing cryptographers, complexity researchers and more. The post Avi Wigderson, Complexity Theory Pioneer, Wins Turing Award first ap

Related