Matrix Product Operators In The Age of Block Encoding

• URL: http://arxiv.org/abs/2606.19083v1
• Date: Wed, 17 Jun 2026 13:53:02 GMT
• Title: Matrix Product Operators In The Age of Block Encoding
• Abstract summary: We develop a block-encoding compiler that speeds up linear combination of unitaries Hamiltonian simulation programs by treating matrix product operators as compressed, virtual-path LCU programs.<n>Our algorithms show how classical pre-processing in terms of tensor network data structures opens new avenues to accelerate quantum algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We develop a block-encoding compiler that speeds up linear combination of unitaries Hamiltonian simulation programs by treating matrix product operators as compressed, virtual-path LCU programs. In showing how these new conditional PREP and SELECT stages are compiled in terms of a parent matrix product operator, we go beyond typical operator splitting product formulas and illustrate how tensor networks are a natural language and valid intermediate representation for quantum circuits. Our results are numerically verified for two important cases, namely, Heisenberg and perturbed Heisenberg-adjacent chain real-time evolution, and highlight polynomial speedups. Specifically, we highlight a polynomial speedup that avoids the $\mathcal{O}(N^K)$ Pauli-string growth when the compressed MPO bond dimension and path normalization remain mild. We quantify how MPO truncation error and bond-dimension budgets affect the compiled polynomial representation. Our algorithms show how classical pre-processing in terms of tensor network data structures opens new avenues to accelerate quantum algorithms.

Related papers

• A High-Performance Pauli-Algebra Framework for Large-Scale Quantum Simulations [17.193239183791277]
  We present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations.<n>The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations.<n>The resulting Julia/Ctexttt++ implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces.
  arXiv  Detail & Related papers  (2026-06-27T14:51:19Z)
• 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)
• Learning to Discover Iterative Spectral Algorithms [46.39331984989963]
  AutoSpec is a neural network framework for discovering iterative spectral algorithms for large-scale numerical linear algebra.<n>We apply AutoSpec to discovering algorithms for representative numerical linear algebra tasks.<n>On real-world solvers, the learned procedures deliver orders-of-magnitude improvements in accuracy and/or reductions in count.
  arXiv  Detail & Related papers  (2026-02-10T08:39:59Z)
• PRISM: Distribution-free Adaptive Computation of Matrix Functions for Accelerating Neural Network Training [47.80717552769429]
  We present PRISM (Polynomial-fitting and Randomized Iterative Sketching for Matrix functions), a framework for accelerating computing algorithms for matrix functions.<n> PRISM combines adaptive approximation with randomized sketching: at each iteration, it fits a surrogate to the current spectrum via a sketched least-squares problem.<n>Unlike prior methods, PRISM requires no explicit spectral bounds or singular value estimates; and it adapts automatically to the evolving spectrum.
  arXiv  Detail & Related papers  (2026-01-29T18:55:46Z)
• PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations [39.36424353588699]
  We introduce PauliEngine, a high-performance C++ framework that provides efficient primitives for Pauli string, commutators, symbolic phase tracking, and structural transformations.<n>PauliEngine supports both numerical and symbolic coefficients and is accessible through a Python interface.
  arXiv  Detail & Related papers  (2026-01-05T16:00:44Z)
• Quantum-Efficient Convolution through Sparse Matrix Encoding and Low-Depth Inner Product Circuits [0.0]
  We present a resource-efficient quantum algorithm that reformulates the convolution product as a structured matrix multiplication.<n>We construct a quantum framework wherein sparse input patches are prepared using optimized key-value QRAM state encoding.<n>Our architecture supports batched convolution across multiple filters using a generalized SWAP circuit.
  arXiv  Detail & Related papers  (2025-07-25T20:08:12Z)
• Overcoming the entanglement barrier with sampled tensor networks [0.0]
  We develop a new hybrid-Network/Monte-Carlo (TN-MC) algorithm that samples and evaluates expectation values of generic local operators.<n>The accurate contraction of wave function amplitudes is a consequence of the favorable scaling with time.<n>Our results show that, when computing expectation values of local operators, the entanglement barrier in one-dimensional Hamiltonian evolution can be bypassed.
  arXiv  Detail & Related papers  (2025-05-14T18:14:47Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product [0.6554326244334868]
  This paper introduces a new single-pass, randomized algorithm, called successive randomized compression (SRC)<n>The performance of the new algorithm is evaluated on synthetic problems and unitary time evolution problems for quantum spin systems.
  arXiv  Detail & Related papers  (2025-04-08T22:33:49Z)
• Optimal Symbolic Construction of Matrix Product Operators and Tree Tensor Network Operators [0.0]
  This research introduces an improved framework for constructing matrix product operators (MPOs) and tree tensor network operators (TTNOs)<n>A given (Hamiltonian) operator typically has a known symbolic "sum of operator strings" form that can be translated into a tensor network structure.
  arXiv  Detail & Related papers  (2025-02-25T20:33:30Z)
• PolySketchFormer: Fast Transformers via Sketching Polynomial Kernels [23.99075223506133]
  We show that attention with high degree can effectively replace softmax without sacrificing model quality. We present a block-based algorithm to apply causal masking efficiently. We validate PolySketchFormerAttention empirically by training language models capable of handling long contexts.
  arXiv  Detail & Related papers  (2023-10-02T21:39:04Z)
• Efficient quantum amplitude encoding of polynomial functions [0.0]
  We present and compare two efficient methods for encoding on real functions on $n$ qubits. First, we encode the linear function into the quantum registers with a swallow sequence multi-controlled gates. Second, we use this construction as a building block to achieve a block encoding of the amplitudes corresponding to the linear function.
  arXiv  Detail & Related papers  (2023-07-20T14:40:55Z)
• 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)
• Temporal Latent Bottleneck: Synthesis of Fast and Slow Processing Mechanisms in Sequence Learning [85.95599675484341]
  Recurrent neural networks have a strong inductive bias towards learning temporally compressed representations. Transformers have little inductive bias towards learning temporally compressed representations.
  arXiv  Detail & Related papers  (2022-05-30T00:12:33Z)
• 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)

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.