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

Tensor-network representation of excitations in Josephson-junction arrays

Anonymous, Joachim Cohen, Alexandru Petrescu

Published Jul 27, 2026• 1 citation
arXivHTMLPDF

Abstract

We present a nonperturbative tensor-network approach to the excitation spectra of superconducting circuits based on Josephson junction arrays. These arrays provide the large lumped inductances required for qubit designs, yet their intrinsically many-body nature is typically reduced to effective single-mode descriptions. Perturbative treatments attempt to include the collective array modes neglected in these approximations, but a fully nonperturbative analysis is challenging due to the many-body structure and the collective character of these modes. We overcome this difficulty using the DMRG-X algorithm, which extends tensor-network methods to excited states. Our key advance is a construction of trial states from the linearized mode structure, enabling direct computation of excitations, even in degenerate manifolds, which was previously inaccessible. Our results reveal significant deviations from, and allow us to improve upon, previous perturbative treatments in the regime of low array junction impedance.

DOI
10.1103/tpym-dxkx

Related papers

Symmetries and Collective Excitations in Large Superconducting Circuits

David Ferguson, Andrew Houck, Jens Koch

In this work, we present theoretical tools suitable for quantitative modeling of large superconducting circuits that include one-dimensional Josephson-junction arrays.The large number of low-energy degrees of freedom and the peculiar interactions between them induced by flux quantization present a considerable challenge to the detailed modeling of such circuits.For the concrete example of the fluxonium device, we show how to address this challenge.Starting from the complete degrees of freedom of the circuit, we employ the relevant collective modes and circuit symmetries to obtain a systematic approximation scheme.Important circuit symmetries include approximate invariance under the symmetric group and lead to considerable simplifications of the theory.Selection rules restrict the possible coupling among different collective modes and help explain the remarkable accuracy of previous simplified models.Using this strategy, we obtain new predictions for the energy spectrum of the fluxonium device that can be tested with current experimental technology.

arXiv:1208.5747•Physical Review X•Jan 17, 2013•33 citations

Lattice field theory for superconducting circuits

Joshua Lin, Max Hays, Stephen Sorokanich +3 more

Large superconducting quantum circuits have a number of important applications in quantum computing. Accurately predicting the performance of these devices from first principles is challenging, as it requires solving the many-body Schrödinger equation. This work introduces a new, general ab-initio method for analyzing large quantum circuits based on lattice field theory, a tool commonly applied in nuclear and particle physics. This method is competitive with state-of-the-art techniques such as tensor networks, but avoids introducing systematic errors due to truncation of the infinite-dimensional Hilbert space associated with superconducting phases. The approach is applied to fluxonium, a specific many-component superconducting qubit with favorable qualities for quantum computation. A systematic study of the influence of impedance on fluxonium is conducted that parallels previous experimental studies, and ground capacitance effects are explored. The qubit frequency and charge noise dephasing rate are extracted from statistical analyses of charge noise, where thousands of instantiations of charge disorder in the Josephson junction array of a fixed fluxonium qubit are explicitly averaged over at the microscopic level. This is difficult to achieve with any other existing method.

quant-pharXiv:2512.05851•Dec 8, 2025•3 citations

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

Sofía González-García, Aaron Szasz, Alice Pagano +3 more

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.

arXiv:2506.24109•Physical Review Applied•May 21, 2026•6 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

A multilevel tensor network compression technique for simulating Lindblad dynamics in superconducting circuits

Adrien Moulinas, Xavier Waintal

Designing superconducting quantum hardware requires simulation tools that can account for various deviations from ideal scenarios. This, in turn, requires approaches that automatically detect certain structures and leverage them to make the computation affordable. Here, we develop a tensor network based technique to simulate the Lindblad dynamics of a few interacting bosonic modes with a focus on superconducting quantum circuits. The technique detects and takes advantage of two very common situations: (i) the density matrix being pure or not far from pure and (ii) the entanglement between different modes being moderate (typically qubit-like). However, (iii) the occupation of the modes can be arbitrarily high (making naïve truncations inefficient). To leverage these features, we use three different nested levels of tensor network compression: (i) we work with a global purification of the density matrix, (ii) we compress the connection between different modes to account for the moderate entanglement and (iii) we use a quantics representation of the Fock occupation number. We showcase the technique for the simulation of large cat qubits as well as for the ionization of transmon qubits, demonstrating orders-of-magnitude speed-up with respect to brute force approaches. In the latter example, it brings the simulation, previously reported on a large supercomputing infrastructure, to laptop level. The favorable scaling with system size should bring genuine computer assisted design of these systems within scope.

quant-pharXiv:2605.27515•May 28, 2026•0 citations

Efficient modeling of superconducting quantum circuits with tensor networks

Agustín Di Paolo, Thomas E. Baker, Alexandre Foley +2 more

Abstract We use a tensor network method to compute the low-energy excitations of a large-scale fluxonium qubit up to a desired accuracy. We employ this numerical technique to estimate the pure-dephasing coherence time of the fluxonium qubit due to charge noise and coherent quantum phase slips from first principles, finding an agreement with previously obtained experimental results. By developing an accurate single-mode theory that captures the details of the fluxonium device, we benchmark the results obtained with the tensor network for circuits spanning a Hilbert space as large as 15180. Our algorithm is directly applicable to the wide variety of circuit-QED systems and may be a useful tool for scaling up superconducting quantum technologies.

arXiv:1912.01018•npj Quantum Information•Jan 27, 2021•42 citations
We present a nonperturbative tensor-network approach to the excitation spectra of superconducting circuits based on Josephson junction arrays. These arrays provide the large lumped inductances required for qubit designs, yet their intrinsically many-body nature is typically reduced to effective single-mode descriptions. Perturbative treatments attempt to include the collective array modes neglected in these approximations, but a fully nonperturbative analysis is challenging due to the many-body structure and the collective character of these modes. We overcome this difficulty using the DMRG-X algorithm, which extends tensor-network methods to excited states. Our key advance is a construction of trial states from the linearized mode structure, enabling direct computation of excitations, even in degenerate manifolds, which was previously inaccessible. Our results reveal significant deviations from, and allow us to improve upon, previous perturbative treatments in the regime of low array junction impedance.
In this work, we present theoretical tools suitable for quantitative modeling of large superconducting circuits that include one-dimensional Josephson-junction arrays.The large number of low-energy degrees of freedom and the peculiar interactions between them induced by flux quantization present a considerable challenge to the detailed modeling of such circuits.For the concrete example of the fluxonium device, we show how to address this challenge.Starting from the complete degrees of freedom of the circuit, we employ the relevant collective modes and circuit symmetries to obtain a systematic approximation scheme.Important circuit symmetries include approximate invariance under the symmetric group and lead to considerable simplifications of the theory.Selection rules restrict the possible coupling among different collective modes and help explain the remarkable accuracy of previous simplified models.Using this strategy, we obtain new predictions for the energy spectrum of the fluxonium device that can be tested with current experimental technology.
Large superconducting quantum circuits have a number of important applications in quantum computing. Accurately predicting the performance of these devices from first principles is challenging, as it requires solving the many-body Schrödinger equation. This work introduces a new, general ab-initio method for analyzing large quantum circuits based on lattice field theory, a tool commonly applied in nuclear and particle physics. This method is competitive with state-of-the-art techniques such as tensor networks, but avoids introducing systematic errors due to truncation of the infinite-dimensional Hilbert space associated with superconducting phases. The approach is applied to fluxonium, a specific many-component superconducting qubit with favorable qualities for quantum computation. A systematic study of the influence of impedance on fluxonium is conducted that parallels previous experimental studies, and ground capacitance effects are explored. The qubit frequency and charge noise dephasing rate are extracted from statistical analyses of charge noise, where thousands of instantiations of charge disorder in the Josephson junction array of a fixed fluxonium qubit are explicitly averaged over at the microscopic level. This is difficult to achieve with any other existing method.
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.
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.
Designing superconducting quantum hardware requires simulation tools that can account for various deviations from ideal scenarios. This, in turn, requires approaches that automatically detect certain structures and leverage them to make the computation affordable. Here, we develop a tensor network based technique to simulate the Lindblad dynamics of a few interacting bosonic modes with a focus on superconducting quantum circuits. The technique detects and takes advantage of two very common situations: (i) the density matrix being pure or not far from pure and (ii) the entanglement between different modes being moderate (typically qubit-like). However, (iii) the occupation of the modes can be arbitrarily high (making naïve truncations inefficient). To leverage these features, we use three different nested levels of tensor network compression: (i) we work with a global purification of the density matrix, (ii) we compress the connection between different modes to account for the moderate entanglement and (iii) we use a quantics representation of the Fock occupation number. We showcase the technique for the simulation of large cat qubits as well as for the ionization of transmon qubits, demonstrating orders-of-magnitude speed-up with respect to brute force approaches. In the latter example, it brings the simulation, previously reported on a large supercomputing infrastructure, to laptop level. The favorable scaling with system size should bring genuine computer assisted design of these systems within scope.
Abstract We use a tensor network method to compute the low-energy excitations of a large-scale fluxonium qubit up to a desired accuracy. We employ this numerical technique to estimate the pure-dephasing coherence time of the fluxonium qubit due to charge noise and coherent quantum phase slips from first principles, finding an agreement with previously obtained experimental results. By developing an accurate single-mode theory that captures the details of the fluxonium device, we benchmark the results obtained with the tensor network for circuits spanning a Hilbert space as large as 15180. Our algorithm is directly applicable to the wide variety of circuit-QED systems and may be a useful tool for scaling up superconducting quantum technologies.