Reposted by nick hunter-jones
(I/III) We're excited to announce a new tenure track opening! The position is called 'quantum informatics' and is affiliated with our QUICK group within the CS+AI division at @jku.at 🇦🇹. Application deadline is November 30th, 2025: www.jku.at/en/the-jku/w...
October 21, 2025 at 1:47 PM
(I/III) We're excited to announce a new tenure track opening! The position is called 'quantum informatics' and is affiliated with our QUICK group within the CS+AI division at @jku.at 🇦🇹. Application deadline is November 30th, 2025: www.jku.at/en/the-jku/w...
Reposted by nick hunter-jones
New preprint with @nickrhj.bsky.social
arxiv.org/pdf/2509.22438
Is a typical translation-invariant Hamiltonian gapped or gapless?
---> We prove that for random rank-1 interactions on any bounded-degree graph, the Hamiltonian is *gapped* with high probability as local dimension grows.
arxiv.org/pdf/2509.22438
Is a typical translation-invariant Hamiltonian gapped or gapless?
---> We prove that for random rank-1 interactions on any bounded-degree graph, the Hamiltonian is *gapped* with high probability as local dimension grows.
arxiv.org
October 2, 2025 at 9:34 PM
New preprint with @nickrhj.bsky.social
arxiv.org/pdf/2509.22438
Is a typical translation-invariant Hamiltonian gapped or gapless?
---> We prove that for random rank-1 interactions on any bounded-degree graph, the Hamiltonian is *gapped* with high probability as local dimension grows.
arxiv.org/pdf/2509.22438
Is a typical translation-invariant Hamiltonian gapped or gapless?
---> We prove that for random rank-1 interactions on any bounded-degree graph, the Hamiltonian is *gapped* with high probability as local dimension grows.