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:2506.24109 · Physical Review Applied

Multitarget DMRG-X algorithm and its application to circuit quantum electrodynamics

Sofía González-García, Aaron Szasz, Alice Pagano, Dvir Kafri, Guifré Vidal, Agustín Di Paolo

Published May 21, 2026• 6 citations
arXivHTMLPDF

Abstract

Obtaining accurate representations of the eigenstates of an array of coupled superconducting qubits is a crucial step in the design of circuit quantum electrodynamics- (circuit-QED) based quantum processors. However, exact diagonalization of the device Hamiltonian is challenging for system sizes beyond tens of qubits. Here, we employ a tensor network method based on a variant of the density matrix renormalization group (DMRG) algorithm, DMRG-X, to efficiently obtain localized eigenstates of a two-dimensional transmon array without the need to first compute lower-energy states. We also introduce MTDMRG-X, a new algorithm that combines DMRG-X with multitarget DMRG to efficiently compute excited states even in regimes with strong eigenstate hybridization. We showcase the use of these methods for the analysis of long-range couplings in a multitransmon Hamiltonian including qubits and couplers, and we discuss eigenstate localization. These developments facilitate the design and parameter optimization of large-scale superconducting quantum processors.

DOI
10.1103/qz9v-p4j5

Related papers

Obtaining highly excited eigenstates of the localized XX chain via DMRG-X

Trithep Devakul, Vedika Khemani, Frank Pollmann +2 more

We benchmark a variant of the recently introduced density matrix renormalization group (DMRG)-X algorithm against exact results for the localized random field XX chain. We find that the eigenstates obtained via DMRG-X exhibit a highly accurate l-bit description for system sizes much bigger than the direct, many-body, exact diagonalization in the spin variables is able to access. We take advantage of the underlying free fermion description of the XX model to accurately test the strengths and limitations of this algorithm for large system sizes. We discuss the theoretical constraints on the performance of the algorithm from the entanglement properties of the eigenstates, and its actual performance at different values of disorder. A small but significant improvement to the algorithm is also presented, which helps significantly with convergence. We find that, at high entanglement, DMRG-X shows a bias towards eigenstates with low entanglement, but can be improved with increased bond dimension. This result suggests that one must be careful when applying the algorithm for interacting many-body localized spin models near a transition.This article is part of the themed issue 'Breakdown of ergodicity in quantum systems: from solids to synthetic matter'.

arXiv:1702.07721•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 30, 2017•30 citations

Tensor-network simulation of strongly coupled multi-fluxonium circuits

Christian Hensel, Andrés N. Cáliz, Pau Torrente +2 more

Designing a superconducting quantum processor rests on predicting the low-lying spectrum of its coupled circuit. The Hilbert-space dimension of the circuit's lumped-element model grows exponentially with the number of circuit nodes. The usual methods split the circuit into subsystems, but that split is hard to choose when the elements are strongly coupled. We present a tensor-network method that chooses no subsystems and whose memory and run time per solve are set by the number of modes and two truncations, the Fock cutoff of each normal mode and the bond dimension of a matrix product state (MPS), not by the Hilbert-space dimension. From the capacitance matrix, the inverse-inductance matrix and the junction list alone, the linear circuit is diagonalized into normal modes. Each junction cosine is then a sum of two products of single-mode operators, so the complete lumped-element Hamiltonian is a matrix product operator (MPO) of small bond dimension with one site per mode, solved by the density matrix renormalization group (DMRG). The normal modes make the method generic, and the tensor network makes it affordable. For two fluxonia joined by a tunable coupler, the method agrees with exact diagonalization of the same truncated space to within 1 MHz. Our circuit of three fluxonia joined by two couplers has 11 normal modes and a truncated space of $10^9$ states, out of reach of exact diagonalization in dense or sparse storage. At a bond dimension of 32, its lowest eight levels are converged to within 1 MHz in both truncations, and each state is stored in a small fraction of the numbers a dense vector needs. One solve at that bond dimension takes 81 min and 1.3 GB of memory on one CPU node.

arXiv:2611.05627•Nov 3, 2026•0 citations

Accurate determination of low-energy eigenspectra with multitarget matrix product states

Xuan Li, Zongsheng Zhou, Guanglei Xu +5 more

Determining the low-energy eigenspectra of quantum many-body systems is a long-standing challenge in physics. In this paper, we solve this problem by introducing two algorithms to determine low-energy eigenstates based on a compact matrix product state (MPS) representation of multiple targeted eigenstates. The first algorithm utilizes a canonicalization approach that takes advantage of the imaginary-time evolution of multitarget MPSs, offering faster convergence and ease of implementation. The second algorithm employs a variational approach that optimizes local tensors on the Grassmann manifold, capable of achieving higher accuracy. These algorithms can be used independently or combined to enhance convergence speed and accuracy. We apply them to the transverse-field Ising model and demonstrate that the calculated low-energy eigenspectra agree remarkably well with the exact solution. Moreover, the eigenenergies exhibit uniform convergence in gapped phases, suggesting that the low-energy excited eigenstates have nearly the same level of accuracy as the ground state. Our results highlight the accuracy and versatility of multitarget MPS-based algorithms for determining low-energy eigenspectra and their potential applications in quantum many-body physics.

arXiv:2305.15868•Physical review. B./Physical review. B•Jan 9, 2024•7 citations

Efficient variational diagonalization of fully many-body localized Hamiltonians

Frank Pollmann, Vedika Khemani, J. I. Cirac +1 more

The phenomenon of many-body localization generalizes Anderson localization to interacting systems. Understanding this conceptually novel phenomenon requires a study of many-body eigenstates at finite energy densities. This is a very challenging task since the most efficient numerical methods such as, e.g., the density matrix renormalization group method, can only access the ground state and low lying excitations. In this work, the authors introduce a unitary tensor network based variational method that approximately finds all many-body eigenstates of fully localized Hamiltonians and scales polynomially with system size. The usefulness of their approach is demonstrated by considering the Heisenberg chain in a strongly disordered magnetic field.

arXiv:1506.07179•Physical review. B./Physical review. B•Jul 28, 2016•91 citations

Density-matrix renormalization group: a pedagogical introduction

Gonçalo Catarina, Bruno Murta

Abstract The physical properties of a quantum many-body system can, in principle, be determined by diagonalizing the respective Hamiltonian, but the dimensions of its matrix representation scale exponentially with the number of degrees of freedom. Hence, only small systems that are described through simple models can be tackled via exact diagonalization. To overcome this limitation, numerical methods based on the renormalization group paradigm that restrict the quantum many-body problem to a manageable subspace of the exponentially large full Hilbert space have been put forth. A striking example is the density-matrix renormalization group (DMRG), which has become the reference numerical method to obtain the low-energy properties of one-dimensional quantum systems with short-range interactions. Here, we provide a pedagogical introduction to DMRG, presenting both its original formulation and its modern tensor-network-based version. This colloquium sets itself apart from previous contributions in two ways. First, didactic code implementations are provided to bridge the gap between conceptual and practical understanding. Second, a concise and self-contained introduction to the tensor-network methods employed in the modern version of DMRG is given, thus allowing the reader to effortlessly cross the deep chasm between the two formulations of DMRG without having to explore the broad literature on tensor networks. We expect this pedagogical review to find wide readership among students and researchers who are taking their first steps in numerical simulations via DMRG. Graphic abstract

arXiv:2304.13395•The European Physical Journal B•Aug 1, 2023•36 citations

Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians

Brenden Roberts, Thomas Vidick, Olexei I. Motrunich

The success of polynomial-time tensor network methods for computing ground states of certain quantum local Hamiltonians has recently been given a sound theoretical basis by Arad et al. [Math. Phys. 356, 65 (2017)]. The convergence proof, however, relies on ``rigorous renormalization group'' (RRG) techniques which differ fundamentally from existing algorithms. We introduce a practical adaptation of the RRG procedure which, while no longer theoretically guaranteed to converge, finds matrix product state ansatz approximations to the ground spaces and low-lying excited spectra of local Hamiltonians in realistic situations. In contrast to other schemes, RRG does not utilize variational methods on tensor networks. Rather, it operates on subsets of the system Hilbert space by constructing approximations to the global ground space in a treelike manner. We evaluate the algorithm numerically, finding similar performance to density matrix renormalization group (DMRG) in the case of a gapped nondegenerate Hamiltonian. Even in challenging situations of criticality, large ground-state degeneracy, or long-range entanglement, RRG remains able to identify candidate states having large overlap with ground and low-energy eigenstates, outperforming DMRG in some cases.

arXiv:1703.01994•Physical review. B./Physical review. B•Dec 18, 2017•16 citations
Obtaining accurate representations of the eigenstates of an array of coupled superconducting qubits is a crucial step in the design of circuit quantum electrodynamics- (circuit-QED) based quantum processors. However, exact diagonalization of the device Hamiltonian is challenging for system sizes beyond tens of qubits. Here, we employ a tensor network method based on a variant of the density matrix renormalization group (DMRG) algorithm, DMRG-X, to efficiently obtain localized eigenstates of a two-dimensional transmon array without the need to first compute lower-energy states. We also introduce MTDMRG-X, a new algorithm that combines DMRG-X with multitarget DMRG to efficiently compute excited states even in regimes with strong eigenstate hybridization. We showcase the use of these methods for the analysis of long-range couplings in a multitransmon Hamiltonian including qubits and couplers, and we discuss eigenstate localization. These developments facilitate the design and parameter optimization of large-scale superconducting quantum processors.
We benchmark a variant of the recently introduced density matrix renormalization group (DMRG)-X algorithm against exact results for the localized random field XX chain. We find that the eigenstates obtained via DMRG-X exhibit a highly accurate l-bit description for system sizes much bigger than the direct, many-body, exact diagonalization in the spin variables is able to access. We take advantage of the underlying free fermion description of the XX model to accurately test the strengths and limitations of this algorithm for large system sizes. We discuss the theoretical constraints on the performance of the algorithm from the entanglement properties of the eigenstates, and its actual performance at different values of disorder. A small but significant improvement to the algorithm is also presented, which helps significantly with convergence. We find that, at high entanglement, DMRG-X shows a bias towards eigenstates with low entanglement, but can be improved with increased bond dimension. This result suggests that one must be careful when applying the algorithm for interacting many-body localized spin models near a transition.This article is part of the themed issue 'Breakdown of ergodicity in quantum systems: from solids to synthetic matter'.
Designing a superconducting quantum processor rests on predicting the low-lying spectrum of its coupled circuit. The Hilbert-space dimension of the circuit's lumped-element model grows exponentially with the number of circuit nodes. The usual methods split the circuit into subsystems, but that split is hard to choose when the elements are strongly coupled. We present a tensor-network method that chooses no subsystems and whose memory and run time per solve are set by the number of modes and two truncations, the Fock cutoff of each normal mode and the bond dimension of a matrix product state (MPS), not by the Hilbert-space dimension. From the capacitance matrix, the inverse-inductance matrix and the junction list alone, the linear circuit is diagonalized into normal modes. Each junction cosine is then a sum of two products of single-mode operators, so the complete lumped-element Hamiltonian is a matrix product operator (MPO) of small bond dimension with one site per mode, solved by the density matrix renormalization group (DMRG). The normal modes make the method generic, and the tensor network makes it affordable. For two fluxonia joined by a tunable coupler, the method agrees with exact diagonalization of the same truncated space to within 1 MHz. Our circuit of three fluxonia joined by two couplers has 11 normal modes and a truncated space of 10910^9109 states, out of reach of exact diagonalization in dense or sparse storage. At a bond dimension of 32, its lowest eight levels are converged to within 1 MHz in both truncations, and each state is stored in a small fraction of the numbers a dense vector needs. One solve at that bond dimension takes 81 min and 1.3 GB of memory on one CPU node.
Determining the low-energy eigenspectra of quantum many-body systems is a long-standing challenge in physics. In this paper, we solve this problem by introducing two algorithms to determine low-energy eigenstates based on a compact matrix product state (MPS) representation of multiple targeted eigenstates. The first algorithm utilizes a canonicalization approach that takes advantage of the imaginary-time evolution of multitarget MPSs, offering faster convergence and ease of implementation. The second algorithm employs a variational approach that optimizes local tensors on the Grassmann manifold, capable of achieving higher accuracy. These algorithms can be used independently or combined to enhance convergence speed and accuracy. We apply them to the transverse-field Ising model and demonstrate that the calculated low-energy eigenspectra agree remarkably well with the exact solution. Moreover, the eigenenergies exhibit uniform convergence in gapped phases, suggesting that the low-energy excited eigenstates have nearly the same level of accuracy as the ground state. Our results highlight the accuracy and versatility of multitarget MPS-based algorithms for determining low-energy eigenspectra and their potential applications in quantum many-body physics.
The phenomenon of many-body localization generalizes Anderson localization to interacting systems. Understanding this conceptually novel phenomenon requires a study of many-body eigenstates at finite energy densities. This is a very challenging task since the most efficient numerical methods such as, e.g., the density matrix renormalization group method, can only access the ground state and low lying excitations. In this work, the authors introduce a unitary tensor network based variational method that approximately finds all many-body eigenstates of fully localized Hamiltonians and scales polynomially with system size. The usefulness of their approach is demonstrated by considering the Heisenberg chain in a strongly disordered magnetic field.
Abstract The physical properties of a quantum many-body system can, in principle, be determined by diagonalizing the respective Hamiltonian, but the dimensions of its matrix representation scale exponentially with the number of degrees of freedom. Hence, only small systems that are described through simple models can be tackled via exact diagonalization. To overcome this limitation, numerical methods based on the renormalization group paradigm that restrict the quantum many-body problem to a manageable subspace of the exponentially large full Hilbert space have been put forth. A striking example is the density-matrix renormalization group (DMRG), which has become the reference numerical method to obtain the low-energy properties of one-dimensional quantum systems with short-range interactions. Here, we provide a pedagogical introduction to DMRG, presenting both its original formulation and its modern tensor-network-based version. This colloquium sets itself apart from previous contributions in two ways. First, didactic code implementations are provided to bridge the gap between conceptual and practical understanding. Second, a concise and self-contained introduction to the tensor-network methods employed in the modern version of DMRG is given, thus allowing the reader to effortlessly cross the deep chasm between the two formulations of DMRG without having to explore the broad literature on tensor networks. We expect this pedagogical review to find wide readership among students and researchers who are taking their first steps in numerical simulations via DMRG. Graphic abstract
The success of polynomial-time tensor network methods for computing ground states of certain quantum local Hamiltonians has recently been given a sound theoretical basis by Arad et al. [Math. Phys. 356, 65 (2017)]. The convergence proof, however, relies on ``rigorous renormalization group'' (RRG) techniques which differ fundamentally from existing algorithms. We introduce a practical adaptation of the RRG procedure which, while no longer theoretically guaranteed to converge, finds matrix product state ansatz approximations to the ground spaces and low-lying excited spectra of local Hamiltonians in realistic situations. In contrast to other schemes, RRG does not utilize variational methods on tensor networks. Rather, it operates on subsets of the system Hilbert space by constructing approximations to the global ground space in a treelike manner. We evaluate the algorithm numerically, finding similar performance to density matrix renormalization group (DMRG) in the case of a gapped nondegenerate Hamiltonian. Even in challenging situations of criticality, large ground-state degeneracy, or long-range entanglement, RRG remains able to identify candidate states having large overlap with ground and low-energy eigenstates, outperforming DMRG in some cases.