Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1006.2478 · Physical Review B

Anyonic entanglement renormalization

Robert König, Ersen Bilgin

Published Sep 21, 2010• 36 citations
arXivHTMLPDF

Abstract

We introduce a family of variational ansatz states for chains of anyons which optimally exploits the structure of the anyonic Hilbert space. This ansatz is the natural analog of the multiscale entanglement renormalization ansatz for spin chains. In particular, it has the same interpretation as a coarse-graining procedure and is expected to accurately describe critical systems with algebraically decaying correlations. We numerically investigate the validity of this ansatz using the anyonic golden chain and its relatives as a testbed. This demonstrates the power of entanglement renormalization in a setting with non-Abelian exchange statistics, extending previous work on qudits, bosons, and fermions in two dimensions.

DOI
10.1103/physrevb.82.125118

Related papers

Fermionic multiscale entanglement renormalization ansatz

Philippe Corboz, Guifré Vidal

In a recent contribution [P. Corboz, G. Evenbly, F. Verstraete, and G. Vidal, arXiv:0904.4151 (unpublished)] entanglement renormalization was generalized to fermionic lattice systems in two spatial dimensions. Entanglement renormalization is a real-space coarse-graining transformation for lattice systems that produces a variational ansatz, the multiscale entanglement renormalization ansatz (MERA), for the ground states of local Hamiltonians. In this paper we describe in detail the fermionic version of the MERA formalism and algorithm. Starting from the bosonic MERA, which can be regarded both as a quantum circuit or in relation to a coarse-graining transformation, we indicate how the scheme needs to be modified to simulate fermions. To confirm the validity of the approach, we present benchmark results for free and interacting fermions on a square lattice with sizes between $6\ifmmode\times\else\texttimes\fi{}6$ and $162\ifmmode\times\else\texttimes\fi{}162$ and with periodic boundary conditions. The present formulation of the approach applies to generic tensor network algorithms.

arXiv:0907.3184•Physical Review B•Oct 29, 2009•174 citations

Simulation of anyons with tensor network algorithms

Robert N. C. Pfeifer, Philippe Corboz, Oliver Buerschaper +3 more

Interacting systems of anyons pose a unique challenge to condensed-matter simulations due to their nontrivial exchange statistics. These systems are of great interest as they have the potential for robust universal quantum computation but numerical tools for studying them are as yet limited. We show how existing tensor network algorithms may be adapted for use with systems of anyons and demonstrate this process for the one-dimensional multiscale entanglement renormalization ansatz (MERA). We apply the MERA to infinite chains of interacting Fibonacci anyons, computing their scaling dimensions and local scaling operators. The scaling dimensions obtained are seen to be in agreement with conformal field theory. The techniques developed are applicable to any tensor network algorithm, and the ability to adapt these ans\"atze for use on anyonic systems opens the door for numerical simulation of large systems of free and interacting anyons in one and two dimensions.

arXiv:1006.3532•Physical Review B•Sep 29, 2010•59 citations

Finite density matrix renormalization group algorithm for anyonic systems

Robert N. C. Pfeifer, Sukhwinder Singh

The numerical study of anyonic systems is known to be highly challenging due to their nonbosonic, nonfermionic particle-exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is known about their collective behavior as a result. Meanwhile, the density matrix renormalization group (DMRG) algorithm is an exceptionally powerful numerical technique for calculating the ground state of a low-dimensional lattice Hamiltonian, and has been applied to the study of bosonic, fermionic, and group-symmetric systems. The recent development of a tensor network formulation for anyonic systems opened up the possibility of studying these systems using algorithms such as DMRG, though this has proved challenging in terms of both programming complexity and computational cost. This paper presents the implementation of DMRG for finite anyonic systems, including a detailed scheme for the implementation of anyonic tensors with optimal scaling of computational cost. The anyonic DMRG algorithm is demonstrated by calculating the ground-state energy of the ``golden chain,'' which has become the benchmark system for the numerical study of anyons and is shown to produce results comparable to those of the anyonic time-evolving block decimation algorithm and superior to the variationally optimized anyonic multiscale renormalization ansatz, at far lesser computational cost.

arXiv:1505.00100•Physical Review B•Sep 16, 2015•12 citations

Variational Quantum Simulation of Anyonic Chains

Ananda Roy

Anyonic chains provide lattice realizations of a rich set of quantum field theories in two space-time dimensions. The latter play a central role in the investigation of generalized symmetries, renormalization group flows and numerous exotic phases of strongly-correlated systems. Here, a variational quantum simulation scheme is presented for the analysis of those anyonic chains which can be mapped to the restricted solid-on-solid~(RSOS) models of Andrews, Baxter and Forrester. An~$L_R$ site RSOS model associated with a Dynkin diagram containing~$p$ nodes is realized with~$L_R\lceil\ln_2 p\rceil$ qubits, where~$\lceil x\rceil$ is the smallest integer~$\geq x$. The scheme is benchmarked by realizing the ground states of RSOS Hamiltonians in the~$A_p$ family for~$4\leq p\leq8$ using a variational quantum-classical algorithm. The latter is based on the Euler-Cartan circuit ansatz. Topological symmetry operators are analyzed for the RSOS models at the quantum-critical points. Measurement of observables acting on~$\lceil\ln_2 p\rceil$ qubits is shown to capture the anyonic nature of the Hilbert space. The described quantum simulation scheme provides a systematic approach to give rise to a large family of quantum field theories which have largely eluded physical realizations.

arXiv:2412.17781•Dec 23, 2024•7 citations

Typical entanglement in anyon chains: Page curves beyond Lie group symmetries

Yale Yauk, Lucas Hackl, Alexander Hahn

We study bipartite entanglement statistics in one-dimensional anyon chains, whose Hilbert spaces are constrained by fusion rules of unitary pre-modular categories. Our setup generalizes previous frameworks on symmetry-resolved entanglement entropy for non-abelian Lie group symmetries to the setting of quantum groups. We derive analytical expressions for the average anyonic entanglement entropy and its variance. Surprisingly, despite the constrained Hilbert space structure, the large $L$ expansion has no universal $O(\sqrt{L})$ or $O(1)$ symmetry-type corrections except for a subleading topological correction term that produces a Page curve asymmetry. We further show that the variance decays exponentially with system size, establishing the typicality. Numerical simulations of the integrable and quantum-chaotic golden chain Hamiltonian show that chaotic mid-spectrum eigenstates match the Haar-random predictions, supporting the use of eigenstate entanglement as a diagnostic of quantum chaos. Our results establish the anyonic Page curve as an appropriate chaotic benchmark in topological many-body systems and connect anyonic entanglement to Page-type universality in quantum many-body physics.

quant-pharXiv:2603.25789•PRX Quantum•Mar 30, 2026•1 citation

Entanglement renormalization for disordered systems

Andrew M. Goldsborough, Glen Evenbly

Tensor network states have proven to be powerful tools for investigating quantum many-body systems. Here, the authors propose a tensor network method, based on an adaptation of entanglement renormalization, for investigating strongly disordered systems. The method makes use of the strong disorder renormalization group to determine the order in which lattice sites are coarse grained, which sets the overall structure of the corresponding tensor network ansatz, before optimization using variational energy minimization. This approach leads to a new class of efficiently contractible tensor network ansatz for 1D systems, which may be understood as a generalization of the multiscale entanglement renormalization ansatz for disordered systems.

arXiv:1708.07652•Physical review. B./Physical review. B•Oct 24, 2017•20 citations
We introduce a family of variational ansatz states for chains of anyons which optimally exploits the structure of the anyonic Hilbert space. This ansatz is the natural analog of the multiscale entanglement renormalization ansatz for spin chains. In particular, it has the same interpretation as a coarse-graining procedure and is expected to accurately describe critical systems with algebraically decaying correlations. We numerically investigate the validity of this ansatz using the anyonic golden chain and its relatives as a testbed. This demonstrates the power of entanglement renormalization in a setting with non-Abelian exchange statistics, extending previous work on qudits, bosons, and fermions in two dimensions.
In a recent contribution [P. Corboz, G. Evenbly, F. Verstraete, and G. Vidal, arXiv:0904.4151 (unpublished)] entanglement renormalization was generalized to fermionic lattice systems in two spatial dimensions. Entanglement renormalization is a real-space coarse-graining transformation for lattice systems that produces a variational ansatz, the multiscale entanglement renormalization ansatz (MERA), for the ground states of local Hamiltonians. In this paper we describe in detail the fermionic version of the MERA formalism and algorithm. Starting from the bosonic MERA, which can be regarded both as a quantum circuit or in relation to a coarse-graining transformation, we indicate how the scheme needs to be modified to simulate fermions. To confirm the validity of the approach, we present benchmark results for free and interacting fermions on a square lattice with sizes between $6\ifmmode\times\else\texttimes\fi{}6$ and $162\ifmmode\times\else\texttimes\fi{}162$ and with periodic boundary conditions. The present formulation of the approach applies to generic tensor network algorithms.
Interacting systems of anyons pose a unique challenge to condensed-matter simulations due to their nontrivial exchange statistics. These systems are of great interest as they have the potential for robust universal quantum computation but numerical tools for studying them are as yet limited. We show how existing tensor network algorithms may be adapted for use with systems of anyons and demonstrate this process for the one-dimensional multiscale entanglement renormalization ansatz (MERA). We apply the MERA to infinite chains of interacting Fibonacci anyons, computing their scaling dimensions and local scaling operators. The scaling dimensions obtained are seen to be in agreement with conformal field theory. The techniques developed are applicable to any tensor network algorithm, and the ability to adapt these ans\"atze for use on anyonic systems opens the door for numerical simulation of large systems of free and interacting anyons in one and two dimensions.
The numerical study of anyonic systems is known to be highly challenging due to their nonbosonic, nonfermionic particle-exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is known about their collective behavior as a result. Meanwhile, the density matrix renormalization group (DMRG) algorithm is an exceptionally powerful numerical technique for calculating the ground state of a low-dimensional lattice Hamiltonian, and has been applied to the study of bosonic, fermionic, and group-symmetric systems. The recent development of a tensor network formulation for anyonic systems opened up the possibility of studying these systems using algorithms such as DMRG, though this has proved challenging in terms of both programming complexity and computational cost. This paper presents the implementation of DMRG for finite anyonic systems, including a detailed scheme for the implementation of anyonic tensors with optimal scaling of computational cost. The anyonic DMRG algorithm is demonstrated by calculating the ground-state energy of the ``golden chain,'' which has become the benchmark system for the numerical study of anyons and is shown to produce results comparable to those of the anyonic time-evolving block decimation algorithm and superior to the variationally optimized anyonic multiscale renormalization ansatz, at far lesser computational cost.
Anyonic chains provide lattice realizations of a rich set of quantum field theories in two space-time dimensions. The latter play a central role in the investigation of generalized symmetries, renormalization group flows and numerous exotic phases of strongly-correlated systems. Here, a variational quantum simulation scheme is presented for the analysis of those anyonic chains which can be mapped to the restricted solid-on-solid~(RSOS) models of Andrews, Baxter and Forrester. An~LRL_RLR​ site RSOS model associated with a Dynkin diagram containing~ppp nodes is realized with~LR⌈ln⁡2p⌉L_R\lceil\ln_2 p\rceilLR​⌈ln2​p⌉ qubits, where~⌈x⌉\lceil x\rceil⌈x⌉ is the smallest integer~≥x\geq x≥x. The scheme is benchmarked by realizing the ground states of RSOS Hamiltonians in the~ApA_pAp​ family for~4≤p≤84\leq p\leq84≤p≤8 using a variational quantum-classical algorithm. The latter is based on the Euler-Cartan circuit ansatz. Topological symmetry operators are analyzed for the RSOS models at the quantum-critical points. Measurement of observables acting on~⌈ln⁡2p⌉\lceil\ln_2 p\rceil⌈ln2​p⌉ qubits is shown to capture the anyonic nature of the Hilbert space. The described quantum simulation scheme provides a systematic approach to give rise to a large family of quantum field theories which have largely eluded physical realizations.
We study bipartite entanglement statistics in one-dimensional anyon chains, whose Hilbert spaces are constrained by fusion rules of unitary pre-modular categories. Our setup generalizes previous frameworks on symmetry-resolved entanglement entropy for non-abelian Lie group symmetries to the setting of quantum groups. We derive analytical expressions for the average anyonic entanglement entropy and its variance. Surprisingly, despite the constrained Hilbert space structure, the large LLL expansion has no universal O(L)O(\sqrt{L})O(L​) or O(1)O(1)O(1) symmetry-type corrections except for a subleading topological correction term that produces a Page curve asymmetry. We further show that the variance decays exponentially with system size, establishing the typicality. Numerical simulations of the integrable and quantum-chaotic golden chain Hamiltonian show that chaotic mid-spectrum eigenstates match the Haar-random predictions, supporting the use of eigenstate entanglement as a diagnostic of quantum chaos. Our results establish the anyonic Page curve as an appropriate chaotic benchmark in topological many-body systems and connect anyonic entanglement to Page-type universality in quantum many-body physics.
Tensor network states have proven to be powerful tools for investigating quantum many-body systems. Here, the authors propose a tensor network method, based on an adaptation of entanglement renormalization, for investigating strongly disordered systems. The method makes use of the strong disorder renormalization group to determine the order in which lattice sites are coarse grained, which sets the overall structure of the corresponding tensor network ansatz, before optimization using variational energy minimization. This approach leads to a new class of efficiently contractible tensor network ansatz for 1D systems, which may be understood as a generalization of the multiscale entanglement renormalization ansatz for disordered systems.