pith. machine review for the scientific record. sign in

arxiv: 2605.10768 · v1 · submitted 2026-05-11 · 🪐 quant-ph · cs.ET· cs.NA· cs.SE· math.NA

Recognition: 2 theorem links

· Lean Theorem

Unitaria: Quantum Linear Algebra via Block Encodings

Matthias Deiml , Oliver H\"uttenhofer , Ram Mosco , Jakob S. Kottmann , Daniel Peterseim
Authors on Pith no claims yet

Pith reviewed 2026-05-12 04:43 UTC · model grok-4.3

classification 🪐 quant-ph cs.ETcs.NAcs.SEmath.NA
keywords block encodingquantum linear algebraQuantum Singular Value Transformationquantum circuitsresource estimationPython librarycomposable interface
0
0 comments X

The pith

Unitaria provides a NumPy-style interface for composing block encodings of matrices and vectors into quantum circuits.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces Unitaria, a Python library that lets users define block encodings of matrices and vectors and combine them through standard linear algebra operations such as addition, multiplication, tensor products, and the Quantum Singular Value Transformation. These high-level definitions automatically produce the corresponding quantum circuits. A separate matrix-arithmetic evaluation path computes the same operations directly on classical representations, allowing verification of correctness and estimation of resources like gate counts and qubit numbers without any circuit execution or ancilla qubits. The library targets researchers who want to develop and test quantum linear algebra algorithms on classical computers before error-corrected hardware becomes available.

Core claim

Unitaria supplies a composable array-like interface through which users define block encodings, apply operations including addition, multiplication, tensor products and Quantum Singular Value Transformation, extract the resulting circuits automatically, and evaluate every step via classical matrix arithmetic to verify correctness and obtain resource estimates without ancilla qubits or quantum simulation.

What carries the argument

Composable array-like interface for block encodings of matrices and vectors that supports standard operations and Quantum Singular Value Transformation while maintaining a parallel classical matrix-arithmetic evaluation path.

If this is right

  • Quantum linear algebra algorithms can be constructed and modified using familiar high-level operations without manual low-level circuit design.
  • Correctness of composed encodings can be verified through classical matrix calculations that scale beyond the limits of state-vector simulation.
  • Gate counts, qubit counts, and normalization constants can be estimated directly from the classical path without running any circuit.
  • Researchers can prototype and analyze algorithms on classical hardware today rather than waiting for fault-tolerant quantum devices.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The classical verification path may allow systematic debugging of algorithm designs before any quantum hardware is involved.
  • High-level composition could reduce implementation errors that arise when translating mathematical specifications into explicit gate sequences.
  • Resource estimates obtained this way might guide hardware requirements for future experiments without requiring full quantum simulation.

Load-bearing premise

The library's implementation of block-encoding composition and the classical matrix-arithmetic path correctly preserves the mathematical properties required for the corresponding quantum algorithms to function as intended.

What would settle it

A mismatch between the matrix obtained from the classical evaluation path and the block extracted from the simulated output of the automatically generated circuit for any composed operation would show that the library fails to preserve the required properties.

Figures

Figures reproduced from arXiv: 2605.10768 by Daniel Peterseim, Jakob S. Kottmann, Matthias Deiml, Oliver H\"uttenhofer, Ram Mosco.

Figure 1
Figure 1. Figure 1: Computational graph for the implementation of addition 𝐴 + 𝐵 (2). be needed for defining new low-level block encodings or for manually optimizing the allocation of qubits. 3.2 Nodes Unitaria does not execute computations immediately, but rather collects operations into a computational graph. The computational graph for the decomposition of the addition (2) is, for example, displayed in [PITH_FULL_IMAGE:fi… view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper introduces Unitaria, a Python library providing a NumPy-like interface for defining block encodings of matrices and vectors, composing them via addition, multiplication, tensor products, and QSVT, automatically extracting quantum circuits, and offering a classical matrix-arithmetic evaluation path for verification, simulation, and resource estimation without ancilla qubits or circuit simulation. The library is open-source and aims to simplify quantum linear algebra algorithm development.

Significance. If the implementation is correct, the library would have substantial practical significance by lowering the barrier to entry for block-encoding-based quantum algorithms, enabling scalable classical verification and resource estimation beyond direct circuit simulation, and supporting algorithm development ahead of fault-tolerant hardware. The composable array-like interface and open-source release are notable strengths for the quantum computing community.

major comments (2)
  1. [Abstract] Abstract: the central claim that the matrix-arithmetic evaluation path 'exactly' reproduces the action of quantum block-encoding compositions (including subnormalization factors, block structure, and ancilla accounting) for operations such as addition, multiplication, tensor products, and QSVT is not supported by any explicit equivalence proof, derivation from first principles, or exhaustive test cases comparing classical outputs to circuit simulation results. This equivalence is load-bearing for both the verification and resource-estimation features.
  2. [Implementation and evaluation sections (inferred from abstract description)] The manuscript provides no section deriving the composition rules or proving that the classical path preserves the mathematical properties required for the corresponding quantum algorithms, leaving open the possibility of mismatches that would invalidate generated circuits and verification.
minor comments (1)
  1. [Abstract] The abstract mentions 'standard operations such as addition, multiplication, tensor products, and the Quantum Singular Value Transformation' but does not specify the exact normalization conventions or ancilla management used in the library interface.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their positive assessment of Unitaria's practical significance and for identifying the need to strengthen the justification of the classical matrix-arithmetic evaluation path. We agree that explicit derivations and verification evidence are essential and will revise the manuscript to address these points.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that the matrix-arithmetic evaluation path 'exactly' reproduces the action of quantum block-encoding compositions (including subnormalization factors, block structure, and ancilla accounting) for operations such as addition, multiplication, tensor products, and QSVT is not supported by any explicit equivalence proof, derivation from first principles, or exhaustive test cases comparing classical outputs to circuit simulation results. This equivalence is load-bearing for both the verification and resource-estimation features.

    Authors: We acknowledge that the submitted manuscript does not contain an explicit equivalence proof or a dedicated suite of cross-verification tests. The library implementation is constructed directly from the standard block-encoding definitions and composition rules in the literature. In the revised manuscript we will add a new section that derives the classical evaluation rules for addition, multiplication, tensor products, and QSVT from first principles, explicitly tracking subnormalization factors, block structure, and ancilla accounting. We will also include a set of small-scale test cases that compare the classical matrix-arithmetic outputs against direct circuit simulation results, thereby providing concrete evidence for the claimed equivalence. revision: yes

  2. Referee: [Implementation and evaluation sections (inferred from abstract description)] The manuscript provides no section deriving the composition rules or proving that the classical path preserves the mathematical properties required for the corresponding quantum algorithms, leaving open the possibility of mismatches that would invalidate generated circuits and verification.

    Authors: This observation is correct. The original submission emphasized the user-facing interface and capabilities rather than formal derivations. We will insert a dedicated section in the revised manuscript that states the composition rules, shows that the classical path preserves the necessary algebraic properties (including unitarity of the overall block encoding and correct normalization), and thereby removes the possibility of mismatches between the classical verification path and the generated quantum circuits. revision: yes

Circularity Check

0 steps flagged

No circularity: software library implementing known abstractions

full rationale

The manuscript introduces Unitaria, a Python library for composing block encodings via an array-like interface and extracting circuits, with a classical matrix-arithmetic verification path. No derivations, predictions, or first-principles results are claimed; the contribution is the implementation of established block-encoding operations (addition, multiplication, tensor products, QSVT). Claims about correctness are external to any self-referential loop and rest on code inspection, testing, and standard quantum information theory rather than fitted parameters or self-citations that reduce to the paper's own inputs. The absence of any load-bearing mathematical chain precludes circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work is a software implementation of existing block-encoding techniques rather than a derivation resting on new mathematical axioms or fitted parameters.

axioms (1)
  • domain assumption Block encodings of matrices can be composed via linear-algebra operations while remaining valid block encodings of the resulting matrix.
    This property is required for the library's addition, multiplication, and tensor-product operations to be correct.

pith-pipeline@v0.9.0 · 5542 in / 1238 out tokens · 42200 ms · 2026-05-12T04:43:04.792777+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    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, with a matrix-arithmetic evaluation path...

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    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.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

44 extracted references · 44 canonical work pages · 6 internal anchors

  1. [1]

    Quantum linear system solvers: A survey of algorithms and applications

    M. E. S. Morales et al. “Quantum Linear System Solvers: A Survey of Algorithms and Applications” (2025). arXiv:2411.02522

    work page arXiv 2025

  2. [2]

    Nonlinear quantum computing by amplified encodings

    M. Deiml and D. Peterseim. “Nonlinear quantum computing by amplified encodings” (2024). arXiv:2411.16435

    work page arXiv 2024

  3. [3]

    Non-Linear Transformations of Quantum Amplitudes: Exponential Improvement, Generalization, and Applications

    A. G. Rattew and P. Rebentrost. “Non-Linear Transformations of Quantum Amplitudes: Exponential Improvement, Generalization, and Applications” (2023). arXiv:2309.09839

    work page arXiv 2023

  4. [4]

    Quantum linear algebra is all you need for Transformer architectures

    N. Guo et al. “Quantum linear algebra is all you need for Transformer architectures” (2024). arXiv:2402.16714

    work page arXiv 2024

  5. [5]

    Exponential quantum advantage in processing massive classical data

    H. Zhao et al. “Exponential quantum advantage in processing massive classical data” (2026). arXiv:2604.07639

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  6. [6]

    Gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations

    N. Guseynov, X. Huang, and N. Liu. “Gate construction of block-encoding for Hamiltonians needed for simulating partial differential equations”. Phys. Rev. Research7, 033100 (2025). arXiv:2405.12855

    work page arXiv 2025

  7. [7]

    Efficient and explicit block encoding of finite difference discretizations of the laplacian

    A. Sturm and N. Schillo. “Efficient and Explicit Block Encoding of Finite Difference Dis- cretizations of the Laplacian” (2025). arXiv:2509.02429

    work page arXiv 2025

  8. [8]

    Quantum Realization of the Finite Element Method

    M. Deiml and D. Peterseim. “Quantum Realization of the Finite Element Method”. Math. Comp. (2025). arXiv:2403.19512

    work page arXiv 2025

  9. [9]

    Quantum Algorithms for Multiscale Partial Differential Equations

    J. Hu, S. Jin, and L. Zhang. “Quantum Algorithms for Multiscale Partial Differential Equations”. Multiscale Model. Simul.22, 1030–1067 (2024). arXiv:2304.06902

    work page arXiv 2024

  10. [10]

    Quantum Enhanced Numerical Homogeniza- tion

    L. Balazi, M. Deiml, and D. Peterseim. “Quantum Enhanced Numerical Homogeniza- tion” (2026). arXiv:2603.28521

    work page arXiv 2026

  11. [11]

    Towards quantum computational mechanics

    B. Liu, M. Ortiz, and F. Cirak. “Towards quantum computational mechanics”. Computer Methods in Applied Mechanics and Engineering432, 117403 (2024). arXiv:2312.03791. 14 M. DEIML, O. HÜTTENHOFER, R. MOSCO, J. S. KOTTMANN, AND D. PETERSEIM

    work page arXiv 2024

  12. [12]

    Preconditioned block encodings for quantum linear systems

    L. Lapworth and C. Sünderhauf. “Preconditioned block encodings for quantum linear systems”. Quantum Sci. Technol.10, 045064 (2025). arXiv:2502.20908

    work page arXiv 2025

  13. [13]

    De- termining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution

    M. Motta et al. “Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution”. Nat. Phys.16, 205–210 (2020). arXiv:1901.07653

    work page arXiv 2020

  14. [14]

    Fault-Tolerant Quantum Simulations of Chemistry in First Quantization

    Y. Su et al. “Fault-Tolerant Quantum Simulations of Chemistry in First Quantization”. PRX Quantum2, 040332 (2021). arXiv:2105.12767

    work page arXiv 2021

  15. [15]

    Reliably assessing the electronic structure of cytochrome P450 on today’s classical computers and tomorrow’s quantum computers

    J. J. Goings et al. “Reliably assessing the electronic structure of cytochrome P450 on today’s classical computers and tomorrow’s quantum computers”. Proc. Natl. Acad. Sci. U.S.A.119, e2203533119 (2022). arXiv:2202.01244

    work page arXiv 2022

  16. [16]

    Exact and efficient Lanczos method on a quantum computer

    W. Kirby, M. Motta, and A. Mezzacapo. “Exact and efficient Lanczos method on a quantum computer”. Quantum7, 1018 (2023). arXiv:2208.00567

    work page arXiv 2023

  17. [17]

    Quantum computing with Qiskit

    A. Javadi-Abhari et al. “Quantum computing with Qiskit” (2024). arXiv:2405.08810

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  18. [18]

    “Cirq”.https://zenodo.org/doi/10.5281/zenodo.4062499(2025)

    Cirq Developers. “Cirq”.https://zenodo.org/doi/10.5281/zenodo.4062499(2025)

    work page doi:10.5281/zenodo.4062499(2025 2025

  19. [19]

    PennyLane: Automatic differentiation of hybrid quantum-classical computations

    V. Bergholm et al. “PennyLane: Automatic differentiation of hybrid quantum-classical computations” (2022). arXiv:1811.04968

    work page internal anchor Pith review Pith/arXiv arXiv 2022

  20. [20]

    Seidel, S

    R. Seidel et al. “Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers” (2024). arXiv:2406.14792

    work page arXiv 2024

  21. [21]

    TEQUILA: A platform for rapid development of quantum algorithms

    J. S. Kottmann et al. “TEQUILA: A platform for rapid development of quantum algorithms”. Quantum Sci. Technol.6, 024009 (2021). arXiv:2011.03057

    work page arXiv 2021

  22. [22]

    Qulacs: A fast and versatile quantum circuit simulator for research purpose

    Y. Suzuki et al. “Qulacs: A fast and versatile quantum circuit simulator for research purpose”. Quantum5, 559 (2021). arXiv:2011.13524

    work page arXiv 2021

  23. [23]

    mlco2/codecarbon: v2.4.1,

    The CUDA-Q development team. “CUDA-Q”.https://zenodo.org/doi/10.5281/zenodo. 8092233(2025)

    work page doi:10.5281/zenodo 2025

  24. [24]

    Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface

    M. Petrič and R. Zander. “Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface” (2026). arXiv:2604.18276

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  25. [25]

    Expressing and Analyzing Quantum Algorithms with Qualtran

    M. P. Harrigan et al. “Expressing and Analyzing Quantum Algorithms with Qualtran” (2024). arXiv:2409.04643

    work page arXiv 2024

  26. [26]

    FABLE: Fast approximate quantum circuits for block- encodings

    D. Camps and R. V. Beeumen. “FABLE: Fast Approximate Quantum Circuits for Block- Encodings”. In 2022 IEEE Int. Conf. Quantum Comput. Eng. QCE. Pages 104–113. (2022). arXiv:2205.00081

    work page arXiv 2022

  27. [27]

    Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra

    C. Yuan. “Cobble: Compiling Block Encodings for Quantum Computational Linear Alge- bra” (2025). arXiv:2511.01736

    work page internal anchor Pith review arXiv 2025

  28. [28]

    Hamiltonian Simulation by Qubitization

    G. H. Low and I. L. Chuang. “Hamiltonian Simulation by Qubitization”. Quantum3, 163 (2019). arXiv:1610.06546

    work page Pith review arXiv 2019

  29. [29]

    The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation

    S. Chakraborty, A. Gilyén, and S. Jeffery. “The Power of Block-Encoded Matrix Powers: Improved Regression Techniques via Faster Hamiltonian Simulation”. LIPIcs Vol. 132 ICALP 2019132, 33:1–33:14 (2019). arXiv:1804.01973

    work page arXiv 2019

  30. [30]

    Optimal Hamiltonian Simulation by Quantum Signal Processing

    G. H. Low and I. L. Chuang. “Optimal Hamiltonian Simulation by Quantum Signal Processing”. Phys. Rev. Lett.118, 010501 (2017). arXiv:1606.02685

    work page Pith review arXiv 2017

  31. [31]

    Gilyén, Y

    A. Gilyén, Y. Su, G. H. Low, and N. Wiebe. “Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics”. In Proc. 51st Annu. ACM SIGACT Symp. Theory Comput. Pages 193–204. (2019). arXiv:1806.01838

    work page arXiv 2019

  32. [32]

    A Grand Unification of Quantum Algorithms

    J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang. “A Grand Unification of Quantum Algorithms”. PRX Quantum2, 040203 (2021). arXiv:2105.02859

    work page arXiv 2021

  33. [33]

    Simulating Hamiltonian Dynamics with a Truncated Taylor Series

    D. W. Berry et al. “Simulating Hamiltonian Dynamics with a Truncated Taylor Series”. Phys. Rev. Lett.114, 090502 (2015). arXiv:1412.4687. UNITARIA 15

    work page arXiv 2015

  34. [34]

    Grover , Date-Added =

    L. K. Grover. “Quantum Computers Can Search Rapidly by Using Almost Any Transforma- tion”. Phys. Rev. Lett.80, 4329–4332 (1998). arXiv:quant-ph/9712011

    work page arXiv 1998

  35. [35]

    Efficient phase-factor evaluation in quantum signal processing

    Y. Dong, X. Meng, K. B. Whaley, and L. Lin. “Efficient phase-factor evaluation in quantum signal processing”. Phys. Rev. A103, 042419 (2021). arXiv:2002.11649

    work page arXiv 2021

  36. [36]

    Quantum amplitude amplification and estimation.Contemporary Mathematics, 305:53–74, 2002

    G. Brassard, P. Høyer, M. Mosca, and A. Tapp. “Quantum amplitude amplification and esti- mation”. In Contemporary Mathematics. Volume 305, pages 53–74. American Mathematical Society, Providence, Rhode Island (2002). arXiv:quant-ph/0005055

    work page arXiv 2002

  37. [37]

    AQT - Alpine Quantum Technologies

    “AQT - Alpine Quantum Technologies”.https://www.aqt.eu/. (accessed 2026-04-30)

    work page 2026

  38. [38]

    Array programming with NumPy

    C. R. Harris et al. “Array programming with NumPy”. Nature585, 357–362 (2020). arXiv:2006.10256

    work page arXiv 2020

  39. [39]

    Virtanenet al., Nat

    P. Virtanen et al. “SciPy 1.0: Fundamental algorithms for scientific computing in Python”. Nat Methods17, 261–272 (2020). arXiv:1907.10121

    work page arXiv 2020

  40. [40]

    Constrained Optimal Polynomials for Quantum Linear System Solvers

    M. Deiml and D. Peterseim. “Constrained Optimal Polynomials for Quantum Linear System Solvers” (2026). arXiv:2604.20513

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  41. [41]

    Algorithms for Numerical Analysis in High Dimensions

    G. Beylkin and M. J. Mohlenkamp. “Algorithms for Numerical Analysis in High Dimensions”. SIAM J. Sci. Comput.26, 2133–2159 (2005)

    work page 2005

  42. [42]

    Block-encoding structured matrices for data input in quantum computing

    C. Sünderhauf, E. Campbell, and J. Camps. “Block-encoding structured matrices for data input in quantum computing”. Quantum8, 1226 (2024). arXiv:2302.10949

    work page arXiv 2024

  43. [43]

    An explicit ancilla-free quantum circuit construction for Gaussian convolutions

    O. Hüttenhofer and J. S. Kottmann. “An explicit ancilla-free quantum circuit construction for Gaussian convolutions”. In Inform. 2025. Page 1729. Potsdam (2025). Gesellschaft für Informatik e.V

    work page 2025

  44. [44]

    Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields

    M. Deiml and D. Peterseim. “Quantum Sampling and Moment Estimation for Transformed Gaussian Random Fields” (2025). arXiv:2508.13879

    work page arXiv 2025