Alexander Jahn

Alexander Jahn

@physicistalex.bsky.social

Assistant Professor/Junior Research Group leader at APCTP in Pohang, South Korea. Working in the borderlands between quantum information, many-body physics, high-energy theory, and gravity.

441 followers280 following141 posts

Per popular request, I've extended the application deadline for both postdoc positions to *Aug 19*.

Alexander Jahn@physicistalex.bsky.social

Big news: I'll be moving to APCTP in Pohang, South Korea, starting a new group in October! I'll be hiring two postdocs on a range of topics from high-energy to quantum information theory, collaborating across the Asia-Pacific region and beyond. Deadline Aug 12. More: www.apctp.org/bbs/board.ph...

View full thread

But if we wait longer, our overlapping exterior basis becomes more and more overcomplete, allowing us to recover the interior with a simpler circuit! That is, the complexity barrier between interior and exterior modes is gradually, and very slowly, broken down.

Our work only introduces a very simple model without locality or an explicit decoding/recovery circuit, showing the basic consistency between overlapping qubits and black hole evaporation. So there are many more details to explore and check in future work!

View full thread
View full thread

In our universe, black holes are probably the closest we can get to testing quantum-gravitational effects. If they are truly described by quantum gravity, we expect that their Hawking radiation gradually reveals information about their interior!

Naively, overlapping qubits don't help here: An old black hole should have lots of overlap between the many qubits describing the interior, but not necessarily between interior and exterior - so no information leaks.

Gave a talk at the University of Vienna today, in a room once used by the great logician Kurt Gödel! However, my treatment of the subject - holographic fault tolerance - remains incomplete.

This week, we're in beautiful Kraków for a conference on tensor networks and all their applications. My PhD students Dimitris and Lev already gave amazing talks about discrete-holographic boundary symmetries and von Neumann algebras in holographic codes!

Alexander Jahn reposted

Very happy to have this paper with @jenseisert.bsky.social and his PhD student Shozab Qasim out on the @arxiv.bsky.social! It achieves something that, until recently, I thought to be impossible: To use random tensor networks to study holographic *dynamics*.

Jens Eisert@jenseisert.bsky.social

Random #tensornetworks provide a powerful framework for probing and understanding complex quantum systems, especially in regimes where conventional tools fail. Here, we rigorously investigate dynamical properties of holographic toy models. scirate.com/arxiv/2508.1...

View full thread

Very happy to have this paper with @jenseisert.bsky.social and his PhD student Shozab Qasim out on the @arxiv.bsky.social! It achieves something that, until recently, I thought to be impossible: To use random tensor networks to study holographic *dynamics*.

Jens Eisert@jenseisert.bsky.social

Random #tensornetworks provide a powerful framework for probing and understanding complex quantum systems, especially in regimes where conventional tools fail. Here, we rigorously investigate dynamical properties of holographic toy models. scirate.com/arxiv/2508.1...

View full thread

For the condensed-matter theorists among you, our work also leads to an interesting conjecture: RTNs on different geometries describe different phases of entanglement scaling. We show that D_eff follows a sharp hierarchy between area- and volume-law phases.

Very happy to have this paper with @jenseisert.bsky.social and his PhD student Shozab Qasim out on the @arxiv.bsky.social! It achieves something that, until recently, I thought to be impossible: To use random tensor networks to study holographic *dynamics*.

Jens Eisert@jenseisert.bsky.social

Random #tensornetworks provide a powerful framework for probing and understanding complex quantum systems, especially in regimes where conventional tools fail. Here, we rigorously investigate dynamical properties of holographic toy models. scirate.com/arxiv/2508.1...

View full thread

This brings us to holography: For holographic RTNs, we can now compute the minimum effective dimension D_eff that describes late-time dynamics! From the geometry and bond dimension of the RTN alone, we can determine how complex its dynamics must be.

And surprisingly, the result matches gravitational degree-of-freedom counting in holography: If we "fuse" tensors together, i.e., replace part of the bulk geometry by a "black hole", D_eff always *increases*. Just as in gravity, where a black hole is the highest-entropy state!

Very happy to have this paper with @jenseisert.bsky.social and his PhD student Shozab Qasim out on the @arxiv.bsky.social! It achieves something that, until recently, I thought to be impossible: To use random tensor networks to study holographic *dynamics*.

Jens Eisert@jenseisert.bsky.social

Random #tensornetworks provide a powerful framework for probing and understanding complex quantum systems, especially in regimes where conventional tools fail. Here, we rigorously investigate dynamical properties of holographic toy models. scirate.com/arxiv/2508.1...

View full thread

Very happy to have this paper with @jenseisert.bsky.social and his PhD student Shozab Qasim out on the @arxiv.bsky.social! It achieves something that, until recently, I thought to be impossible: To use random tensor networks to study holographic *dynamics*.

Jens Eisert@jenseisert.bsky.social

Random #tensornetworks provide a powerful framework for probing and understanding complex quantum systems, especially in regimes where conventional tools fail. Here, we rigorously investigate dynamical properties of holographic toy models. scirate.com/arxiv/2508.1...

View full thread

In our paper, we bring in ideas from quantum statistical mechanics to show that the opposite is true: Thanks to the randomness in RTNs, we can probe late-time dynamics without knowing the explicit Hamiltonian! The key concept that enables this is called *equilibration*.

Here's how it works: In a quantum system, expectation values of observables fluctuate. At late times, even a pure state will *equilibrate*, meaning that local expectation values will fluctuate within a fixed window. This happens for all Hamiltonians H with "non-degenerate gaps".

Very happy to have this paper with @jenseisert.bsky.social and his PhD student Shozab Qasim out on the @arxiv.bsky.social! It achieves something that, until recently, I thought to be impossible: To use random tensor networks to study holographic *dynamics*.

Jens Eisert@jenseisert.bsky.social

Random #tensornetworks provide a powerful framework for probing and understanding complex quantum systems, especially in regimes where conventional tools fail. Here, we rigorously investigate dynamical properties of holographic toy models. scirate.com/arxiv/2508.1...

View full thread

This sparked hundreds of follow-up papers - many of which refined the original proposal - but there was one limitation: Random tensor networks (RTNs) produce an *ensemble* of states, with every random sample looking quite different locally.

That makes choosing a Hamiltonian that performs time evolution on the boundary difficult: Any choice, e.g. motivated from AdS/CFT arguments, would time-evolve different RTN samples differently. Thus, it seemed that randomness made time evolution impossible to describe!

Very happy to have this paper with @jenseisert.bsky.social and his PhD student Shozab Qasim out on the @arxiv.bsky.social! It achieves something that, until recently, I thought to be impossible: To use random tensor networks to study holographic *dynamics*.

Jens Eisert@jenseisert.bsky.social

Random #tensornetworks provide a powerful framework for probing and understanding complex quantum systems, especially in regimes where conventional tools fail. Here, we rigorously investigate dynamical properties of holographic toy models. scirate.com/arxiv/2508.1...

A second Quantum paper within three weeks! We show how to construct a class of qubit "Evenbly codes" - toy models of holography at finite N - which turn out to be highly tunable subsystem codes that can be made resilient against different types of quantum noise. Why "Far from Perfect"? Well...

Quantum [Unofficial]@quantum-journal.org.web.brid.gy

quantum-journal.orgFar from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly CodesQuantum 9, 1826 (2025). https://doi.org/10.22331/q-2025-08-08-1826 We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic $\\{p,q\\}$ geometry with even $q\geq 4$, yielding an infinitely large class of subsystem codes. We construct an example for a $\\{5,4\\}$ manifold and describe strategies of logical gauge fixing that lead to different rates $k/n$ and distances $d$, which we calculate analytically, finding distances which range from $d=2$ to $d \sim n^{2/3}$. Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with $k/n = 0.125$, finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
View full thread

A second Quantum paper within three weeks! We show how to construct a class of qubit "Evenbly codes" - toy models of holography at finite N - which turn out to be highly tunable subsystem codes that can be made resilient against different types of quantum noise. Why "Far from Perfect"? Well...

Quantum [Unofficial]@quantum-journal.org.web.brid.gy

quantum-journal.orgFar from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly CodesQuantum 9, 1826 (2025). https://doi.org/10.22331/q-2025-08-08-1826 We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic $\\{p,q\\}$ geometry with even $q\geq 4$, yielding an infinitely large class of subsystem codes. We construct an example for a $\\{5,4\\}$ manifold and describe strategies of logical gauge fixing that lead to different rates $k/n$ and distances $d$, which we calculate analytically, finding distances which range from $d=2$ to $d \sim n^{2/3}$. Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with $k/n = 0.125$, finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
View full thread

Does that mean that holographic codes are the future of quantum computing? We don't know yet, because real quantum errors are very complicated, and every quantum hardware is different. But at least in simple models, our codes behave as well as state-of-the-art ones!

A second Quantum paper within three weeks! We show how to construct a class of qubit "Evenbly codes" - toy models of holography at finite N - which turn out to be highly tunable subsystem codes that can be made resilient against different types of quantum noise. Why "Far from Perfect"? Well...

Quantum [Unofficial]@quantum-journal.org.web.brid.gy

quantum-journal.orgFar from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly CodesQuantum 9, 1826 (2025). https://doi.org/10.22331/q-2025-08-08-1826 We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic $\\{p,q\\}$ geometry with even $q\geq 4$, yielding an infinitely large class of subsystem codes. We construct an example for a $\\{5,4\\}$ manifold and describe strategies of logical gauge fixing that lead to different rates $k/n$ and distances $d$, which we calculate analytically, finding distances which range from $d=2$ to $d \sim n^{2/3}$. Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with $k/n = 0.125$, finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
View full thread

These codes should be easier to run on a quantum device, but are they actually any good? That's what we find out in our paper! Turns out that they form *subsystem codes* in which your bulk states can be (partially) gauge-fixed, protecting the remaining qubits against errors.

A second Quantum paper within three weeks! We show how to construct a class of qubit "Evenbly codes" - toy models of holography at finite N - which turn out to be highly tunable subsystem codes that can be made resilient against different types of quantum noise. Why "Far from Perfect"? Well...

Quantum [Unofficial]@quantum-journal.org.web.brid.gy

quantum-journal.orgFar from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly CodesQuantum 9, 1826 (2025). https://doi.org/10.22331/q-2025-08-08-1826 We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic $\\{p,q\\}$ geometry with even $q\geq 4$, yielding an infinitely large class of subsystem codes. We construct an example for a $\\{5,4\\}$ manifold and describe strategies of logical gauge fixing that lead to different rates $k/n$ and distances $d$, which we calculate analytically, finding distances which range from $d=2$ to $d \sim n^{2/3}$. Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with $k/n = 0.125$, finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
View full thread

That gives you a number of neat holography features, but rather impractical codes: Building code states with a lot of entanglement is hard! Plus, describing the *quantum* gravity regime of holography ("finite N") should give you less entangled states. So we want less-than-perfect tensors.

A second Quantum paper within three weeks! We show how to construct a class of qubit "Evenbly codes" - toy models of holography at finite N - which turn out to be highly tunable subsystem codes that can be made resilient against different types of quantum noise. Why "Far from Perfect"? Well...

Quantum [Unofficial]@quantum-journal.org.web.brid.gy

quantum-journal.orgFar from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly CodesQuantum 9, 1826 (2025). https://doi.org/10.22331/q-2025-08-08-1826 We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic $\\{p,q\\}$ geometry with even $q\geq 4$, yielding an infinitely large class of subsystem codes. We construct an example for a $\\{5,4\\}$ manifold and describe strategies of logical gauge fixing that lead to different rates $k/n$ and distances $d$, which we calculate analytically, finding distances which range from $d=2$ to $d \sim n^{2/3}$. Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with $k/n = 0.125$, finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.