Faster matrix product state preparation by exploiting symmetry-induced block-sparsity

• URL: http://arxiv.org/abs/2605.28489v1
• Date: Wed, 27 May 2026 13:45:23 GMT
• Title: Faster matrix product state preparation by exploiting symmetry-induced block-sparsity
• Abstract summary: Matrix product states (MPS) serve as a key tool for studying quantum systems from chemistry and condensed-matter physics.<n>We reduce the cost of fault-tolerantly preparing block-sparse MPS within the standard ancilla-assisted linear-depth approach.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Matrix product states (MPS) serve as a key tool for studying quantum systems from chemistry and condensed-matter physics, making their preparation on quantum computers an important task in interfacing classical and quantum simulation. Many systems of interest have $U(1)$-symmetries induced by particle number and spin projection conservation, allowing to restrict the MPS tensors to be of block-sparse form, a property widely used in the implementation of classical algorithms such as the density matrix renormalization group. We reduce the cost of fault-tolerantly preparing block-sparse MPS within the standard ancilla-assisted linear-depth approach by implementing row and column permutations that transform the block-sparse matrices into block-diagonal form. These block-diagonal unitaries are then implemented via unitary synthesis, with the cost being determined by the size of the largest block. In this context, we modify the unitary synthesis approach of Berry et al. in order to reduce the Toffoli cost for real-valued unitaries by a factor of $\sqrt{2}$. In numerical benchmarks, we achieve Toffoli cost improvement factors of $10 - 30$ compared to the state-of-the-art for MPS of various molecular systems.

Related papers

• Explicit block encodings of rate matrices for simulating polymerization kinetics on quantum computers [0.0]
  We study block-encoding circuits for two kinetic models of living polymerization.<n>We prove that both implementations require only $O(log N)$ qubits in the matrix dimension $N$.<n>These results establish a concrete quantum circuit foundation for simulating polymerization kinetics on fault-tolerant quantum hardware.
  arXiv  Detail & Related papers  (2026-09-08T08:37:00Z)
• Improved Measurement Cost Scaling in the Nonorthogonal Quantum Eigensolver [1.6328866317851187]
  We study a bottleneck for the nonorthogonal quantum eigensolver (NOQE)<n>We show that, after overlap thresholding, the eigenvalue sensitivity is controlled by the condition number of the retained overlap matrix.<n>Experiments on hydrogen chains and rings suggest that, in practice, the measurement cost of structured NOQE instances can grow even more slowly than this linear bound.
  arXiv  Detail & Related papers  (2026-08-13T05:05:55Z)
• Fault tolerant computation of the static structure factor and finite size effects [43.936586633107396]
  We develop a quantum post-processing strategy for the leading two-body finite-size correction.<n>After one-body shell effects are reduced by twist averaging, the dominant residual error is controlled by long-wavelength density fluctuations.<n>We also introduce adaptive global and local binary search procedures for identifying the infrared fitting window used to reconstruct the two-body finite size error correction.
  arXiv  Detail & Related papers  (2026-06-26T05:31:08Z)
• Overcoming the Matrix-Product-State Encoding Barrier via DMRG-Guided Probabilistic Imaginary-Time Evolution [0.0]
  We propose a three-stage framework for ground-state preparation in quantum simulation.<n>The central-bond Schmidt rank of intermediate states during MPS encoding grows logistically with the number of layers.<n>We show that the framework avoids very deep encoding circuits and substantially suppresses the post-selection overhead intrinsic to PITE.
  arXiv  Detail & Related papers  (2026-05-28T16:05:46Z)
• High-Rate Quantized Matrix Multiplication II [29.75700570685703]
  We show how waterfilling can be used to improve practical LLM quantization algorithms (GPTQ)<n>A recent scheme (known as WaterSIC'') that only uses scalar INT quantizers is analyzed and its high-rate performance is shown to be basis free (i.e., characterized by the determinant of $_X$)
  arXiv  Detail & Related papers  (2026-05-13T16:47:25Z)
• Efficient Complex-Valued State Preparation on Bucket Brigade QRAM [47.72095699729477]
  Efficient quantum state preparation is a critical component in quantum algorithms that process large classical data.<n>We present two improvements within the same architecture-aware framework.
  arXiv  Detail & Related papers  (2026-04-28T13:43:29Z)
• Fault-tolerant simulation of the electronic structure using Projector Augmented-Waves and Bloch orbitals [43.936586633107396]
  We present the Bloch--UPAW framework that combines Bloch-orbital $k$-space structure with unitary projector-augmented-wave augmentation.<n>We derive a linear-combination-of-unitaries decomposition and a block-encoding circuit suitable for qubitization.<n>Asymptotically, the Toffoli cost scales as $mathcalO(N_k3)$ when refining the $k$-mesh and as $mathcalO(N_a3.5)$ when enlarging the supercell.
  arXiv  Detail & Related papers  (2026-04-13T23:46:58Z)
• Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
  We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
  arXiv  Detail & Related papers  (2026-02-11T07:24:33Z)
• High-Rate Quantized Matrix Multiplication: Theory and Practice [29.75700570685703]
  This work investigates the problem of quantized matrix multiplication (MatMul)<n>We consider two settings: 1) Generic MatMul, where both matrices must be quantized (weight+ quantization); and 2) weight-only quantization, where the second matrix is only known through covariance matrix $_X$ of its columns.
  arXiv  Detail & Related papers  (2026-01-23T21:32:44Z)
• Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things [0.6138671548064355]
  We present a novel framework for Linear Combination of Unitaries (LCU)-style decomposition tailored to structured sparse matrices.<n>LCU is a foundational primitive in both variational and fault-tolerant quantum algorithms.<n>We introduce the Sigma basis, a compact set of simple, non-unitary operators that can better capture sparsity and structure.
  arXiv  Detail & Related papers  (2025-07-04T17:05:07Z)
• Preconditioned Block Encodings for Quantum Linear Systems [0.0]
  Matrix preconditioning is a well-established classical technique to reduce $kappa$ by multiplying $A$ by a preconditioner $P$.<n>We consider four preconditioners and two encoding approaches for block encodings.<n>Their impact on subnormalisation factors and condition number $kappa$ are analysed using practical matrices from Computational Fluid Dynamics.
  arXiv  Detail & Related papers  (2025-02-28T10:08:14Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Riemannian block SPD coupling manifold and its application to optimal transport [40.23168342389821]
  We show that the OT problem can be viewed as an instance of a general symmetric positive definite (SPD) matrix-valued OT problem. The summation of row blocks and column blocks in the coupling matrix are constrained by the given block-SPD marginals.
  arXiv  Detail & Related papers  (2022-01-30T22:44:47Z)

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.