Hacker News new | ask | show | jobs
by atty 1406 days ago
I apologize I am actually running out the door at this point, so I can’t reply in a ton of detail (I’ll try to remember to do so later)

But the point to remember is that these aren’t normal algebraic equations, they’re based on the quantum operators, right? And so we can always do symbolic math on them, but to get numeric results, they have to be instantiated at some point. The operators exist at every point in space, and some of the operators can be approximated on a lattice discretization, but some of them cease to be well defined as soon as there is any distance between the operators (so they require true real numbers, not floating point numbers - ergo, infinite memory).

One point that i think is missing is that there’s a bit of a difference between numerical solutions to QFT equations (like the calculation of g-2 referenced in the paper) and lattice calculations in that in general those numerical calculations are giving averaged quantities. We couldn’t, for instance, take that average quantity and use it instead of the dynamically fluctuating quantity in a lattice simulation. We could run a lattice simulation and estimate the value of g-2 from the lattice to see how well our discretization -> continuum extrapolation worked. But we couldn’t go backwards from the numerical solution to the lattice, so to speak.