Unitaria: Quantum Linear Algebra via Block Encodings

• URL: http://arxiv.org/abs/2605.10768v1
• Date: Mon, 11 May 2026 16:00:15 GMT
• Title: Unitaria: Quantum Linear Algebra via Block Encodings
• Abstract summary: Unitaria is a Python library that implements quantum algorithms based on block encodings.<n>Unitaria provides a composable, array-like interface through which users can define block encodings of matrices and vectors.<n>A key feature is a matrix-arithmetic evaluation path in which every operation can be computed directly on encoded vectors and matrices.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce Unitaria, a Python library that brings the simplicity of classical linear algebra toolkits such as NumPy and SciPy to the implementation of quantum algorithms based on block encodings, a general-purpose abstraction in which a matrix is embedded as a sub-block of a larger unitary operator. Their implementation has so far required deep knowledge of low-level circuit construction, which Unitaria aims to eliminate. The library provides a composable, array-like interface through which users can define block encodings of matrices and vectors, combine them through standard operations such as addition, multiplication, tensor products, and the Quantum Singular Value Transformation, and extract the resulting quantum circuits automatically. A key feature is a matrix-arithmetic evaluation path in which every operation can be computed directly on encoded vectors and matrices without dependence on ancilla qubits or circuit simulation. This enables correctness verification and classical simulation that scale well beyond what state vector simulation permits and also allows resource estimation, including gate counts, qubit counts, and normalization constants, without executing any circuit. Together, these capabilities allow researchers to develop, verify, and analyze quantum linear algebra algorithms today, ahead of the availability of error-corrected hardware. Unitaria is open source and available at https://github.com/tequilahub/unitaria.

Related papers

• Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
  Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
  arXiv  Detail & Related papers  (2026-03-12T19:35:16Z)
• 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)
• Practical block encodings of matrix polynomials that can also be trivially controlled [0.01918316416632161]
  We present practical and explicit block encoding circuits implementing matrix transformations of a target matrix.<n>With standard approaches, block-encoding a degree-$d$ matrix requires a circuit depth scaling as $d$ times the depth for block-encoding the original matrix alone.<n>We show that the additional overhead required for encoding matrix-depth circuits can be reduced to scale linearly in $d$ with no dependence on system size or the cost of block encoding the original matrix.
  arXiv  Detail & Related papers  (2026-01-26T18:37:44Z)
• Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra [0.14504054468850666]
  Cobble is a language for programming with quantum computational linear algebra.<n>Cobble compiles to correct quantum circuits.<n>We evaluate Cobble on benchmark kernels for simulation, regression, search, and other applications.
  arXiv  Detail & Related papers  (2025-11-03T16:48:13Z)
• Determinant Estimation under Memory Constraints and Neural Scaling Laws [48.68885778257016]
  We derive a novel hierarchical algorithm for large-scale log-determinant calculation in memory-constrained settings.<n>We show that the ratio of pseudo-determinants satisfies a power-law relationship, allowing us to derive corresponding scaling laws.<n>This enables accurate estimation of NTK log-determinants from a tiny fraction of the full dataset.
  arXiv  Detail & Related papers  (2025-03-06T13:32:13Z)
• An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate [0.0]
  We present multiple explicit unitary implementations by using the square root of the non-unitary matrix.<n>In the appendix of the paper, we show that the circuits can be used to group set elements which can be integrated into different algorithmic schemes.
  arXiv  Detail & Related papers  (2024-12-21T07:26:30Z)
• Quantum algorithms for calculating determinant and inverse of matrix and solving linear algebraic systems [43.53835128052666]
  We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)times (N-1)$ matrix.<n>The basic idea is to encode each row of the matrix into a pure state of some quantum system.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• CoLA: Exploiting Compositional Structure for Automatic and Efficient Numerical Linear Algebra [62.37017125812101]
  We propose a simple but general framework for large-scale linear algebra problems in machine learning, named CoLA. By combining a linear operator abstraction with compositional dispatch rules, CoLA automatically constructs memory and runtime efficient numerical algorithms. We showcase its efficacy across a broad range of applications, including partial differential equations, Gaussian processes, equivariant model construction, and unsupervised learning.
  arXiv  Detail & Related papers  (2023-09-06T14:59:38Z)
• Semantic embedding for quantum algorithms [0.0]
  A need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT) We show that QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to soundness in quantum cryptography.
  arXiv  Detail & Related papers  (2023-04-27T17:55:40Z)
• Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices [4.2389474761558406]
  We show how efficient quantum circuits can be explicitly constructed for some well-structured matrices. We also provide implementations of these quantum circuits in sparse strategies.
  arXiv  Detail & Related papers  (2022-03-19T03:50:16Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)

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.