Multi-Target Density Matrix Renormalization Group X algorithm and its application to circuit quantum electrodynamics

• URL: http://arxiv.org/abs/2506.24109v1
• Date: Mon, 30 Jun 2025 17:55:20 GMT
• Title: Multi-Target Density Matrix Renormalization Group X algorithm and its application to circuit quantum electrodynamics
• Authors: Sofía González-García, Aaron Szasz, Alice Pagano, Dvir Kafri, Guifré Vidal, Agustin Di Paolo,
• Abstract summary: We employ a variant of the density matrix renormalization group (DMRG) algorithm, DMRG-X, to efficiently obtain localized eigenstates of a 2D transmon array.<n>We also introduce MTDMRG-X, a new algorithm that combines DMRG-X with multi-target DMRG to efficiently compute excited states even in regimes with strong eigenstate hybridization.
• Score: 0.023787965910387825
• License: http://creativecommons.org/licenses/by/4.0/
• 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 (QED)-based quantum processors. However, exact diagonalization of the device Hamiltonian is challenging for system sizes beyond tens of qubits. Here, we employ a variant of the density matrix renormalization group (DMRG) algorithm, DMRG-X, to efficiently obtain localized eigenstates of a 2D transmon array without the need to first compute lower-energy states. We also introduce MTDMRG-X, a new algorithm that combines DMRG-X with multi-target 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 multi-transmon Hamiltonian including qubits and couplers, and we discuss eigenstate localization. These developments facilitate the design and parameter optimization of large-scale superconducting quantum processors.

Related papers

• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm [0.0]
  We extend the Density-Matrix Renormalization Group (DMRG) algorithm for simulating quantum circuits to tree tensor networks (TTNs)<n>For the random circuits, we devise tree-like gate layouts that are suitable for TTN and show that TTN requires less memory than MPS for the simulations.<n>Our findings show that the DMRG algorithm with TTNs provides a promising framework for simulating quantum circuits.
  arXiv  Detail & Related papers  (2025-04-23T13:48:03Z)
• Wavefunction optimization at the complete basis set limit with Multiwavelets and DMRG [0.0]
  We develop an algorithm integrating DMRG within the multiwavelet-based multiresolution analysis (MRA)<n>We adopt a pre-existing Lagrangian optimization algorithm for orbitals represented in the MRA domain and improve its computational efficiency.<n>We apply our method to small systems such as H2, He, HeH2, BeH2 and N2.
  arXiv  Detail & Related papers  (2025-03-13T18:59:03Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Two dimensional quantum lattice models via mode optimized hybrid CPU-GPU density matrix renormalization group method [0.0]
  We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models. We demonstrate for the two dimensional spinless fermion model and for the Hubbard model on torus geometry that several orders of magnitude in computational time can be saved.
  arXiv  Detail & Related papers  (2023-11-23T17:07:47Z)
• Quantum circuit matrix product state ansatz for large-scale simulations of molecules [9.601481589619183]
  We propose to calculate the ground state energies of molecular systems by variationally optimizing quantum circuit MPS with a relatively small number of qubits. QCMPS simulation of a linear molecule with 50 orbitals can reach the chemical accuracy using only 6 qubits at a moderate circuit depth.
  arXiv  Detail & Related papers  (2023-01-16T11:43:43Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Efficient numerical simulation of complex Josephson quantum circuits [0.0]
  We present a new theoretical framework for approximate numerical simulation of Josephson quantum circuits. Simulations based on this framework provide access to a degree of complexity and circuit size heretofore inaccessible to quantitative analysis.
  arXiv  Detail & Related papers  (2020-10-28T12:43:25Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.