Spectral Gap or Gapless Undecidable

  • Thread starter Thread starter .Scott
  • Start date Start date
  • Tags Tags
    Gap
Click For Summary
SUMMARY

The discussion centers on the undecidability of the spectral gap problem in quantum many-body Hamiltonians, as established in a paper published in Nature. This problem is analogous to the Halting Problem, demonstrating that there is no universal algorithm capable of determining whether a given Hamiltonian has a spectral gap. Participants debate the implications of this undecidability, emphasizing that while experimental determination may be possible, theoretical analysis remains limited. The conversation also touches on the potential for creative mathematicians to devise case-specific solutions, despite the overarching undecidability.

PREREQUISITES
  • Understanding of quantum many-body Hamiltonians
  • Familiarity with the Halting Problem in computer science
  • Knowledge of Gödel's incompleteness theorems
  • Basic principles of undecidability in mathematics
NEXT STEPS
  • Study the implications of Gödel's incompleteness theorems on mathematical proofs
  • Explore the Halting Problem and its relevance to computational theory
  • Investigate specific examples of quantum materials and their spectral gap properties
  • Learn about algorithms for approximating solutions to undecidable problems
USEFUL FOR

Physicists, mathematicians, and computer scientists interested in the intersections of quantum mechanics, undecidability, and computational theory will benefit from this discussion.

  • #61
ddd123 said:
or that we can't compute it for all cases (i.e. we can find out creative solutions for specific cases but not a general solution)?
This.
ddd123 said:
I mean: what if we actually find the threshold for one of those specially constructed cases in the paper, by a mathematical intuition or by brute force?
The specially constructed cases correspond to an infinite set of problems, and they prove that no algorithm can solve all of them.
 
  • Like
Likes ddd123
Physics news on Phys.org
  • #63
That was commented on in an update to the Scott Aaronson post I linked:

Scott Aaronson said:
Update (Dec. 20): My colleague Seth Lloyd calls my attention to a PRL paper of his from 1993, which also discusses the construction of physical systems that are gapped if a given Turing machine halts and gapless if it runs forever. So this basic idea has been around for a while. As I explained in the post, the main contribution of the Cubitt et al. paper is just to get undecidability into “the sort of system physicists could plausibly care about” (or for which they could’ve plausibly hoped for an analytic solution): in this case, 2D translationally-invariant nearest-neighbor Hamiltonians with bounded local dimension.

Although I have to say I'm enjoying the 2016 paper you linked. I find Seth Lloyd entertaining to watch and read:

Seth Lloyd said:
References [2-3] belong to the medieval era of quantum information theory, pre-Shor and pre-arXiv: the contemporary reader may compare them to illuminated manuscripts. I now redescribe their results in contemporary language.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 26 ·
Replies
26
Views
5K
  • · Replies 96 ·
4
Replies
96
Views
8K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
6K