Feynmans of geometry: computable trans. amps. by K+Le+P algorithm

In summary: LaTeX2eIn summary, Kisielowski, Lewandowski, and Puchta have developed a systematic algorithm for calculating transition amplitudes between quantum states of geometry. Their approach involves using operator spin network diagrams, which are analogous to Feynman diagrams, to construct corresponding spin foams. This framework is compatible with Loop Quantum Gravity and allows for the calculation of amplitudes without the need for explicit visualization. The diagram operators and amplitudes are self-contained and can accommodate various versions of spin foam models. This approach has been found to be useful in applications such as Rovelli's surface amplitudes and the canonical transition amplitudes.
  • #1
marcus
Science Advisor
Gold Member
Dearly Missed
24,775
792
Kisielowski Lewandowski Puchta have made a significant advance in calculating the transition amplitudes between quantum states of geometry.

They have found a systematic algorithm that enumerates the (generalized) spinfoam-like histories by which one state evolves into another.

And in this case the amplitude of each history is conveniently accessible. Each history that one enumerates more or less "comes with" its probability amplitude.

This looks to me like a systematic combinatorial algorithm that can be PROGRAMMED, which is one reason it's potentially important.

In the September 2011 seminar discussion Laurent Freidel objected that the algorithm does not offer any advantage in the case where one restricts to spinfoams which are dual to triangulations of a 4d manifold. (The vertices at most 5-valent etc.)

But Frank Hellmann (AEI) countered by observing that one HAS to consider more general spinfoams because they, for example, arise naturally in the simplest applications to cosmology. He and co-workers have been studying the "hourglass" spinfoam picture of the cosmological bounce and have found they have to go to cases which are not based on triangulations He reported that they had found the Warsaw algorithm a big help.

Our two sources on this are the paper http://arxiv.org/abs/1107.5185 and the online recorded seminar talk by Puchta.
 
Last edited:
Physics news on Phys.org
  • #2
I think a lot depends on whether this Feynman diagram approach to geometry quantum dynamics turns out to work (and provides an efficient computer algorithm), so I will copy the links and source summary to make looking it over convenient:
Here's Puchta's recorded seminar slides and audio:
http://relativity.phys.lsu.edu/ilqgs/puchta092011.pdf
http://relativity.phys.lsu.edu/ilqgs/puchta092011.wav
The Feynman Diagrammatics for the Spinfoam Models
It's especially good because it has a lot of question, comment, and discussion by Ashtekar, Freidel, Hellmann, even at one or two points Lewandowski, and of course Puchta.
Listening to the talk makes the paper quite a lot easier to understand. At several points where Ashtekar senses the audience isn't getting it, he asks Puchta to back up 2 or 3 slides and take it again slowly. This is very new stuff.

The new algorithm involves new unfamiliar graph manipulations. They are good because systematic and programmable (combinatorial) steps not requiring geometric intuition. But the geometric motivation is not always immediately clear. Personally my hunch is that this is an indication of depth, non-triviality.

I tend to think of the paper by the initials of the authors Kisielowski Lewandowski Puchta. That sounds nice because it reminds me of the Russian word kleb for bread. Think of dynamic spacetime geometry as the "bread" of reality :biggrin:.

Here is the abstract for the "KLeP" paper
http://arxiv.org/abs/1107.5185
Feynman diagrammatic approach to spin foams
Marcin Kisielowski, Jerzy Lewandowski, Jacek Puchta
(Submitted on 26 Jul 2011)
"The Spin Foams for People Without the 3d/4d Imagination" could be an alternative title of our work. We derive spin foams from operator spin network diagrams} we introduce. Our diagrams are the spin network analogy of the Feynman diagrams. Their framework is compatible with the framework of Loop Quantum Gravity. For every operator spin network diagram we construct a corresponding operator spin foam. Admitting all the spin networks of LQG and all possible diagrams leads to a clearly defined large class of operator spin foams. In this way our framework provides a proposal for a class of 2-cell complexes that should be used in the spin foam theories of LQG. Within this class, our diagrams are just equivalent to the spin foams. The advantage, however, in the diagram framework is, that it is self contained, all the amplitudes can be calculated directly from the diagrams without explicit visualization of the corresponding spin foams. The spin network diagram operators and amplitudes are consistently defined on their own. Each diagram encodes all the combinatorial information. We illustrate applications of our diagrams: we introduce a diagram definition of Rovelli's surface amplitudes as well as of the canonical transition amplitudes. Importantly, our operator spin network diagrams are defined in a sufficiently general way to accommodate all the versions of the EPRL or the FK model, as well as other possible models. The diagrams are also compatible with the structure of the LQG Hamiltonian operators, which is an additional advantage. Finally, a scheme for a complete definition of a spin foam theory by declaring a set of interaction vertices emerges from the examples presented at the end of the paper.
36 pages, 23 figures
 
Last edited:

1. What is the Feynman's algorithm for geometry?

The Feynman's algorithm for geometry is a computational method developed by physicist Richard Feynman for solving geometric problems using transfinite numbers. It involves breaking down complex geometric shapes into simpler ones and using a set of rules to solve them.

2. How does the K+Le+P algorithm work in the Feynman's algorithm?

The K+Le+P algorithm is a key component of the Feynman's algorithm. It stands for "Knuth's Law, Leibniz' Expansion, and Pappus' Theorem". These principles are used to simplify geometric shapes and make them easier to solve using transfinite numbers.

3. Can the Feynman's algorithm be used for all types of geometry problems?

The Feynman's algorithm is primarily used for Euclidean geometry problems, but it can also be applied to other types of geometry such as projective geometry. However, it may not be suitable for all types of geometry problems and may require modifications or additional principles for solving them.

4. How is the Feynman's algorithm different from traditional methods of solving geometry problems?

The Feynman's algorithm differs from traditional methods of solving geometry problems in that it uses transfinite numbers, which are numbers that lie beyond the realm of real and complex numbers. It also relies on a set of rules and principles, such as the K+Le+P algorithm, rather than traditional geometric theorems and proofs.

5. What are the potential applications of the Feynman's algorithm in the field of geometry?

The Feynman's algorithm has potential applications in fields such as computer graphics, computer-aided design, and physics simulations. It can also be used for solving complex geometric problems that are difficult to solve using traditional methods, and for exploring new possibilities in geometry with the use of transfinite numbers.

Similar threads

  • Beyond the Standard Models
Replies
20
Views
7K
  • Beyond the Standard Models
Replies
6
Views
3K
  • Beyond the Standard Models
Replies
24
Views
7K
Replies
49
Views
14K
  • Beyond the Standard Models
Replies
2
Views
2K
Replies
1
Views
2K
  • Beyond the Standard Models
Replies
2
Views
2K
  • Beyond the Standard Models
Replies
2
Views
3K
Replies
1
Views
1K
  • STEM Academic Advising
Replies
13
Views
2K
Back
Top