By Topic

Simulating quarks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Creutz, M. ; Brookhaven Nat. Lab., Upton, NY, USA

Over the past 25 years (1979-2004), the theoretical-particle physicists who practice lattice-gauge theory have become some of the most frequent users of supercomputing cycles. Although we've long known that atoms consist of electrons surrounding a nucleus made of nucleons (protons and neutrons), we've recently learned that at a deeper level, the nucleons themselves are composites. We can best explain the strong forces between them by assuming they are composed of three quarks interacting via fields called gluons. The need for three constituents helps explain much of the zoo of similar states seen in particle physics experiments. Certain intractable aspects of the interactions between quarks and gluons have driven us to the computer. Indeed, large-scale simulations have helped us make major inroads into issues highly resistant to traditional approaches. Lattice-gauge theory provides a controlled scheme for studying strong interactions at low energies. The article shows that the main tools are powerful but demanding algorithms (such as conjugate-gradient sparse matrix inversions). Still-unsolved issues involve the "sign" problem and the basic formulation of parity violation on the lattice. Although we certainly need additional computing capability, we also need new ideas.

Published in:

Computing in Science & Engineering  (Volume:6 ,  Issue: 2 )