H-LCU (Hierarchical Linear Combination of Unitaries) – Complete Report Script This repository contains a Python script that generates a complete visual report for the H-LCU decomposition of an arbitrary n‑qubit operator. The script is designed to run in Google Colab or Jupyter and produces: • A summary of the operator (dimension, norm, spectrum) • A table of active Pauli paths with their β coefficients • Validation plots comparing original and reconstructed matrices • Statistics of |β| distribution and level activation • A hierarchical Pauli tree diagram The script accompanies the research article: “Hierarchical Linear Combination of Unitaries as an Adaptive Construction Algorithm for Tree Tensor Network Operators” Authors: Luis José Mantilla Santa Cruz, Luis F. Faina, João Henrique de Souza Pereira (Under review) License: BSD 3-Clause "New" or "Revised" License
H-LCU (Hierarchical Linear Combination of Unitaries) – Complete Report Script This repository contains a Python script that generates a complete visual report for the H-LCU decomposition of an arbitrary n‑qubit operator. The script is designed to run in Google Colab or Jupyter and produces: • A summary of the operator (dimension, norm, spectrum) • A table of active Pauli paths with their β coefficients • Validation plots comparing original and reconstructed matrices • Statistics of |β| distribution and level activation • A hierarchical Pauli tree diagram The script accompanies the research article: “Hierarchical Linear Combination of Unitaries as an Adaptive Construction Algorithm for Tree Tensor Network Operators” Authors: Luis José Mantilla Santa Cruz, Luis F. Faina, João Henrique de Souza Pereira (Under review) License: BSD 3-Clause "New" or "Revised" License
Abstract Linear combination of unitaries (LCU) decompositions have become a key tool for encoding operators on quantum computers, enabling efficient implementations of arbitrary operators. In particular, LCU methods provide a way to encode the electronic structure Hamiltonian into quantum circuits. Over the years, various decomposition techniques have been developed for this purpose. Here, we introduce the Majorana tensor decomposition, a framework that unifies existing LCU approaches and introduces novel decompositions using low-rank tensor factorizations. We benchmark a range of decomposition techniques on small molecular systems and hydrogen chains of increasing sizes, evaluating their performance across different LCU methods.
Linear combination of unitaries (LCU) is a fundamental primitive in quantum algorithms, whose cost is typically governed by the most expensive unitary appearing in the combination. We develop a transducer-based LCU framework that reduces this worst-case dependence to a weighted average query complexity, when the constituent unitaries share access to a common set of primitive oracles.
Consider A=∑jcjUj, where cj>0 and each unitary Uj can be implemented using Cj primitive queries. Given an upper bound a≥∥A∥, our algorithm implements a block-encoding of A/α with rescaling factor α=O(a), using O(Cmax+Cλ/a) primitive queries, where λ=∑jcj, Cmax=maxjCj, and C=∑jcjCj/λ. By comparison, the standard LCU construction requires O(Cmaxλ/a) primitive queries. The improvement can therefore be substantial when costly unitaries have small weights and λ/a is large. As applications, we obtain improved block-encodings of sparse matrices, leading to quantum algorithms for sparse Hamiltonian simulation and quantum linear systems with near-optimal query complexity up to polylogarithmic factors in all relevant parameters.
Our main technique is the transducer framework developed by Belovs, Jeffery, and Yolcu [Quantum, 8:1444 (2024)]. Here we develop a complementary operator-level theory tailored to block-encodings. We identify the resolvent norm K as a key complexity measure for transducer implementation besides the existing catalyst complexity. We show that the transducer action can be converted into an ε-approximate block-encoding using only O(Klog(1/ε)) queries to the transducer, improving the precision dependence from polynomial to logarithmic.
Randomisation is widely used in quantum algorithms to reduce the number of quantum gates and ancillary qubits required. A range of randomised algorithms, including eigenstate property estimation by spectral filters, Hamiltonian simulation, and perturbative quantum simulation, though motivated and designed for different applications, share common features in the use of unitary decomposition and Hadamard-test-based implementation. In this work, we start by analysing the role of randomised linear-combination-of-unitaries (LCU) in quantum simulations, and present several quantum circuits that realise the randomised composite LCU. A caveat of randomisation, however, is that the resulting state cannot be deterministically prepared, which often takes an unphysical form UρV† with unitaries U and V. Therefore, randomised LCU algorithms are typically restricted to only estimating the expectation value of a single Pauli operator. To address this, we introduce a quantum instrument that can realise a non-completely-positive map, whose feature of frequent measurement and reset on the ancilla makes it particularly suitable in the fault-tolerant regime. We then show how to construct an unbiased estimator of the effective (unphysical) state UρV† and its generalisation. Moreover, we demonstrate how to effectively realise the state prepared by applying an operator that admits a composite LCU form. Our results reveal a natural connection between randomised LCU algorithms and shadow tomography, thereby allowing simultaneous estimation of many observables efficiently. As a concrete example, we construct the estimators and present the simulation complexity for three use cases of randomised LCU in Hamiltonian simulation and eigenstate preparation tasks.
We introduce a coefficient-decoupled matrix product operator (MPO) representation for Pauli-sum operators that separates reusable symbolic operator support from a tunable coefficient bridge across a fixed bipartition. This representation provides a direct interface to linear-combination-of-unitaries (LCU) circuits: the symbolic left/right dictionaries define a static \textsc{Select} oracle that is compiled once, while coefficient updates modify only a dynamic \textsc{Prep} oracle. As a proof of concept, we construct compact state-adapted Pauli pools by sampling Pauli strings from a pretrained matrix product state (MPS), pruning them to a fixed symbolic pool, optimizing only their coefficients, and transferring the resulting weights directly to the LCU interface. The resulting workflow provides a reusable classical-to-quantum compilation strategy in which the symbolic operator structure is compiled once, and subsequent updates are confined to a low-dimensional coefficient object.
Abstract. Compactly representing and efficently applying linear operators are fundamental ingredients in tensor network methods for simulating quantum many-body problems and solving high-dimensional problems in scientific computing. In this work, we study such representations for tree tensor networks, the so-called tree tensor network operators (TTNOs), paying particular attention to Hamiltonian operators that involve long-range pairwise interactions between particles. Generalizing the work by Lin, Tong, and others on matrix product operators, we establish a direct connection between the hierarchical low-rank structure of the interaction matrix and the TTNO property. This connection allows us to arrive at very compact TTNO representations by compressing the interaction matrix into a hierarchically semiseparable matrix. Numerical experiments for different quantum spin systems validate our results and highlight the potential advantages of TTNOs over matrix product operators.
TENSO is a versatile and powerful open-source software package for numerically exact simulations of the dynamics of quantum systems immersed in structured thermal environments. It is based on a tree tensor network decomposition of the hierarchical equations of motion (HEOM) that efficiently curbs its curse of dimensionality with bath complexity. As such, TENSO enables exact non-Markovian open quantum dynamics simulations even with complex environments typical of chemistry and quantum information science. TENSO allows for time-dependent drive in the system, and for non-commuting fluctuations. More generally, TENSO efficiently propagates the dynamics for any method with a generator of the dynamics that can be expressed in a sum-of-products form, including the HEOM and multi-layer multiconfigurational time-dependent Hartree methods. TENSO enables simulations using tensor trees and trains of arbitrary order, and implements three propagation strategies for the coupled master equations; two fixed-rank methods that require a constant memory footprint during the dynamics and one adaptive rank method with a variable memory footprint controlled by the target level of computational error. In contrast to the accompanying theory and algorithmic paper [J. Chem. Phys. 163, 104109 (2025)] the focus here is on the practical usage and applications of TENSO with underlying theoretical concepts introduced only as needed.