pith. sign in

arxiv: 2511.01736 · v2 · pith:CPXEMLP7new · submitted 2025-11-03 · 💻 cs.PL · quant-ph

Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra

Charles Yuan This is my paper

Pith reviewed 2026-05-18 01:49 UTC · model grok-4.3

classification 💻 cs.PL quant-ph
keywords block encodingsquantum linear algebraquantum circuitscompilerquantum singular value transformationquantum algorithmsprogramming languages
0
0 comments X

The pith

Cobble lets developers write high-level expressions for block encodings that compile automatically to correct and efficient quantum circuits.

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

Quantum algorithms for linear algebra must express matrix operations as circuits rather than storing data directly, and conventional optimizations often fail under the quantum cost model. Cobble addresses this by letting programmers manipulate block encodings, the quantum representations of matrices, through simple notation instead of manual circuit construction. The system analyzes time and space costs and applies optimizations that incorporate state-of-the-art methods to lower overhead. Evaluation on kernels for simulation, regression, search, and related tasks shows the resulting circuits run between 2.6 and 25.4 times faster than unoptimized versions. A sympathetic reader would care because the automation could let more people build quantum linear algebra programs without needing deep expertise in circuit design.

Core claim

Cobble is a language for programming with quantum computational linear algebra. It enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits. Cobble features analyses that compute the time and space usage of programs, as well as optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation. Evaluation on benchmark kernels for simulation, regression, search, and other applications shows 2.6x-25.4x speedups compared to the unoptimized baseline.

What carries the argument

high-level notation for block encodings together with the compilation process that includes cost analyses and optimizations such as quantum singular value transformation

If this is right

  • Developers can implement quantum linear algebra algorithms with reduced manual effort on circuit details.
  • Built-in analyses make resource consumption predictable before execution on quantum hardware.
  • Automatic application of advanced techniques reduces overhead that would otherwise arise from manual optimization.
  • Kernels in simulation, regression, and search achieve substantial speedups relative to unoptimized baselines.

Where Pith is reading between the lines

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

  • The same abstraction pattern could be applied to other quantum primitives that currently require intricate circuit construction.
  • Integration with existing quantum programming environments might enable hybrid classical-quantum workflows.
  • Scaling the approach to larger matrices and more complex algorithms would test whether the speedups persist.
  • Wider use could shift focus in quantum software development from low-level circuit tuning to algorithmic intent.

Load-bearing premise

High-level notation for block encodings can be compiled into quantum circuits that remain semantically correct and measurably more efficient than hand-written versions across the tested domains.

What would settle it

A benchmark matrix operation where a Cobble-generated circuit produces an incorrect result or consumes more qubits or gates than an equivalent hand-optimized circuit.

Figures

Figures reproduced from arXiv: 2511.01736 by Charles Yuan.

Figure 1
Figure 1. Figure 1: Initial quantum circuit that Cobble produces for the system in Equation [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Final optimized circuit that Cobble produces for Equation [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Initial quantum circuit that Cobble produces for the loss function in Equation [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Intermediate circuit that Cobble produces for Equation [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Final optimized circuit that Cobble produces for Equation [PITH_FULL_IMAGE:figures/full_fig_p008_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Type system of the core language of Cobble. The side condition in [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Compilation semantics of the core language of Cobble. [PITH_FULL_IMAGE:figures/full_fig_p010_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Typing rules to check hermiticity and symbolic polynomials. Conditions in [PITH_FULL_IMAGE:figures/full_fig_p011_8.png] view at source ↗
Figure 10
Figure 10. Figure 10: Selection of additional rewrites that enable and complement sum and polynomial fusion. [PITH_FULL_IMAGE:figures/full_fig_p014_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Comparison of circuits across benchmarks and optimizers. Each bar shows a normalized fraction of [PITH_FULL_IMAGE:figures/full_fig_p018_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Compile time taken by Cobble using the pyQSP external solver. The standard error of the mean is less than 0.001 seconds throughout. Benchmarks. For this research question, we imple￾mented a family of programs that block-encode the Chebyshev polynomials 𝑇𝑛 (𝑋), which are straight￾forward to scale, for 2 ≤ 𝑛 ≤ 30. We executed the Cobble compiler on each program with all optimiza￾tions enabled and with pyQSP… view at source ↗
read the original abstract

Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware realization. But these algorithms execute in a model that cannot efficiently store matrices in memory like a classical algorithm does, instead requiring developers to implement complex expressions for matrix arithmetic in terms of correct and efficient quantum circuits. Among the challenges for the developer is navigating a cost model in which conventional optimizations for linear algebra, such as subexpression reuse, can be inapplicable or unprofitable. In this work, we present Cobble, a language for programming with quantum computational linear algebra. Cobble enables developers to express and manipulate the quantum representations of matrices, known as block encodings, using high-level notation that automatically compiles to correct quantum circuits. Cobble features analyses that compute the time and space usage of programs, as well as optimizations that reduce overhead and generate efficient circuits using state-of-the-art techniques such as the quantum singular value transformation. We evaluate Cobble on benchmark kernels for simulation, regression, search, and other applications, showing 2.6x-25.4x speedups on these benchmarks compared to the unoptimized baseline.

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

1 major / 1 minor

Summary. The paper presents Cobble, a language for programming quantum computational linear algebra via high-level expressions over block encodings of matrices. These expressions are automatically compiled to correct quantum circuits, with built-in analyses for time and space costs and optimizations that incorporate state-of-the-art methods such as quantum singular value transformation (QSVT). On benchmarks drawn from simulation, regression, search, and related domains, the system reports 2.6x–25.4x speedups relative to an unoptimized internal baseline.

Significance. A sound implementation of Cobble would constitute a useful engineering contribution to quantum programming languages by raising the level of abstraction for block-encoding constructions while preserving the ability to apply modern circuit optimizations. The work directly addresses the practical difficulty of manually constructing efficient quantum linear-algebra circuits, which is a recognized bottleneck in the field.

major comments (1)
  1. [Abstract / Evaluation] Abstract and Evaluation section: the reported 2.6x–25.4x speedups are measured exclusively against the unoptimized Cobble baseline. Because the central claim is that the compiler’s analyses and optimizations (including QSVT) “generate efficient circuits,” a direct comparison against hand-written expert circuits that apply the same SOTA techniques is required; the present baseline comparison does not establish that the generated circuits are competitive with manual implementations.
minor comments (1)
  1. [Abstract] The abstract refers to “state-of-the-art techniques such as the quantum singular value transformation” without enumerating the full set of optimizations or indicating where they are described in the text.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their constructive feedback and positive assessment of the significance of our work. We respond to the major comment below.

read point-by-point responses

  1. Referee: [Abstract / Evaluation] Abstract and Evaluation section: the reported 2.6x–25.4x speedups are measured exclusively against the unoptimized Cobble baseline. Because the central claim is that the compiler’s analyses and optimizations (including QSVT) “generate efficient circuits,” a direct comparison against hand-written expert circuits that apply the same SOTA techniques is required; the present baseline comparison does not establish that the generated circuits are competitive with manual implementations.

    Authors: We agree that a comparison against hand-written expert circuits applying the same SOTA techniques would provide stronger evidence that the generated circuits are competitive with manual implementations. Our current evaluation isolates the benefit of Cobble's analyses and optimizations (including automatic incorporation of QSVT) by comparing optimized and unoptimized versions of the same high-level programs; this demonstrates the practical value of the compiler in automating complex circuit constructions that would otherwise be error-prone to implement by hand. We acknowledge that this does not directly establish competitiveness with the best possible manual circuits. We will revise the evaluation section and abstract to clarify the scope of the claims, explicitly discuss this limitation of the baseline, and note that direct expert comparisons are an important direction for future work. revision: partial

Circularity Check

0 steps flagged

No circularity: empirical speedups measured against unoptimized baseline

full rationale

The paper presents a compiler for block encodings with analyses, optimizations including QSVT, and benchmark results. The 2.6x-25.4x speedups are reported as direct runtime measurements on kernels versus the system's own unoptimized baseline. This is standard empirical evaluation and does not reduce any claimed result to a definition, fit, or self-citation by construction. No mathematical derivation chain, uniqueness theorem, or ansatz is invoked that collapses to the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper builds on the established quantum circuit model and block-encoding framework from prior quantum algorithms work without introducing new fitted parameters or invented physical entities.

axioms (1)
  • domain assumption Quantum algorithms execute in a model that cannot efficiently store matrices in memory and instead requires block encodings expressed as quantum circuits.
    Invoked in the opening problem statement to motivate the need for a high-level language.

pith-pipeline@v0.9.0 · 5726 in / 1255 out tokens · 34337 ms · 2026-05-18T01:49:38.213842+00:00 · methodology

discussion (0)

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

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Compilation Framework for Quantum Simulation of Non-unitary Dynamics

    quant-ph 2026-05 unverdicted novelty 7.0

    A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.

  2. Linear-Time T-Gate Optimization via Random Abstraction

    cs.PL 2026-05 conditional novelty 7.0

    A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.

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

    quant-ph 2026-04 unverdicted novelty 6.0

    The Eclipse Qrisp BlockEncoding interface provides high-level programming abstractions for block-encodings, enabling easier implementation of quantum algorithms such as QSVT, matrix inversion, and Hamiltonian simulation.

  4. Unitaria: Quantum Linear Algebra via Block Encodings

    quant-ph 2026-05 accept novelty 4.0

    Unitaria is a new open-source Python library that provides a high-level, composable interface for block encodings in quantum computing, enabling automatic circuit generation and classical simulation-based verification.

Reference graph

Works this paper leans on

68 extracted references · 68 canonical work pages · cited by 4 Pith papers · 6 internal anchors

  1. [1]

    TensorFlow: A system for large-scale machine learning

    TensorFlow: a system for large-scale machine learning. InUSENIX Conference on Operating Systems Design and Implementation. doi:10.48550/arXiv.1605.08695 Austin J. Adams, Sharjeel Khan, Arjun S. Bhamra, Ryan R. Abusaada, Jeffrey S. Young, and Thomas M. Conte

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1605.08695

  2. [2]

    arXiv:2404.12603 [quant-ph] doi:10.48550/arXiv.2404.12603 Matthew Amy, Dmitri Maslov, and Michele Mosca

    Qwerty: A Basis-Oriented Quantum Programming Language. arXiv:2404.12603 [quant-ph] doi:10.48550/arXiv.2404.12603 Matthew Amy, Dmitri Maslov, and Michele Mosca

    work page doi:10.48550/arxiv.2404.12603

  3. [3]

    doi:10.1109/TCAD.2014.2341953 E

    Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning.IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems33, 10 (2014). doi:10.1109/TCAD.2014.2341953 E. Anderson, Z. Bai, Jack Dongarra, A. Greenbaum, A. McKenney, J. Du Croz, S. Hammarling, James Demmel, C. Bischof, and D. Sorensen

    work page doi:10.1109/tcad.2014.2341953 2014

  4. [4]

    InACM/IEEE Conference on Supercomputing

    LAPACK: a portable linear algebra library for high-performance computers. InACM/IEEE Conference on Supercomputing. doi:10.1109/SUPERC.1990.129995 Hartwig Anzt, Terry Cojean, Goran Flegar, Fritz Göbel, Thomas Grützmacher, Pratik Nayak, Tobias Ribizel, Yuhsiang Mike Tsai, and Enrique S. Quintana-Ortí

    work page doi:10.1109/superc.1990.129995 1990

  5. [5]

    Ginkgo: A Modern Linear Operator Algebra Framework for High Performance Computing.ACM Trans. Math. Software48, 1 (2022). doi:10.1145/3480935 Ryan Babbush, Craig Gidney, Dominic W. Berry, Nathan Wiebe, Jarrod R. McClean, Alexandru Paler, Austin G. Fowler, and Hartmut Neven

    work page doi:10.1145/3480935 2022

  6. [6]

    Babbush, C

    Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity.Physical Review X8, 4 (2018). doi:10.1103/PhysRevX.8.041015 Ville Bergholm, Josh Izaac, Maria Schuld, Christian Gogolin, Shahnawaz Ahmed, Vishnu Ajith, M. Sohaib Alam, Guillermo Alonso-Linaje, B. AkashNarayanan, Ali Asadi, Juan Miguel Arrazola, Utkarsh Azad, Sam Banning, Carsten Blan...

    work page doi:10.1103/physrevx.8.041015 2018

  7. [7]

    PennyLane: Automatic differentiation of hybrid quantum-classical computations

    PennyLane: Automatic differentiation of hybrid quantum-classical computations. arXiv:1811.04968 [quant-ph] doi:10.48550/arXiv.1811.04968 Dominic W. Berry

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1811.04968

  8. [8]

    2014 , month =

    High-order quantum algorithm for solving linear differential equations.Journal of Physics A: Mathematical and Theoretical47 (2014). doi:10.1088/1751-8113/47/10/105301 Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma

    work page doi:10.1088/1751-8113/47/10/105301 2014

  9. [9]

    and Childs, Andrew M

    Exponential improvement in precision for simulating sparse Hamiltonians. InACM Symposium on Theory of Computing. doi:10.1145/2591796.2591854 Benjamin Bichsel, Maximilian Baader, Timon Gehr, and Martin Vechev

    work page doi:10.1145/2591796.2591854

  10. [10]

    Reactive Probabilistic Programming , booktitle =

    Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics. InACM SIGPLAN Conference on Programming Language Design and Implementation. doi:10.1145/3385412.3386007 L. Susan Blackford, Antoine Petitet, Roldan Pozo, Karin Remington, R. Clint Whaley, James Demmel, Jack Dongarra, Iain Duff, Sven Hammarling, Greg Henry, et al

    work page doi:10.1145/3385412.3386007

  11. [11]

    An updated set of basic linear algebra subprograms (BLAS).ACM Trans. Math. Software28, 2 (2002). doi:10.1145/567806.567807 Daan Camps, Lin Lin, Roel Van Beeumen, and Chao Yang

    work page doi:10.1145/567806.567807 2002

  12. [12]

    Explicit quantum circuits for block encodings of certain sparse matrices.SIAM J

    Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices.SIAM J. Matrix Anal. Appl.45, 1 (2024). doi:10.1137/22M1484298 Daan Camps and Roel Van Beeumen

    work page doi:10.1137/22m1484298 2024

  13. [13]

    Variational quantum pulse learning,

    FABLE: Fast Approximate Quantum Circuits for Block-Encodings. InIEEE International Conference on Quantum Computing and Engineering. doi:10.1109/qce53715.2022.00029 Alba Cervera-Lierta

    work page doi:10.1109/qce53715.2022.00029 2022

  14. [14]

    Quantum Computing in the NISQ era and beyond,

    Exact Ising model simulation on a quantum computer.Quantum2 (2018). doi:10.22331/q-2018- 12-21-114 Shantanav Chakraborty, Aditya Morolia, and Anurudh Peduri

    work page doi:10.22331/q-2018- 2018

  15. [15]

    doi:10.22331/q-2023-04-27-988 Rui Chao, Dawei Ding, András Gilyén, Cupjin Huang, and Mario Szegedy

    Quantum Regularized Least Squares.Quantum7 (2023). doi:10.22331/q-2023-04-27-988 Rui Chao, Dawei Ding, András Gilyén, Cupjin Huang, and Mario Szegedy

    work page doi:10.22331/q-2023-04-27-988 2023

  16. [16]

    Finding Angles for Quantum Signal Processing with Machine Precision. (2020). arXiv:2003.02831 [quant-ph] doi:10.48550/arXiv.2003.02831 Tianqi Chen, Thierry Moreau, Ziheng Jiang, Lianmin Zheng, Eddie Yan, Meghan Cowan, Haichen Shen, Leyuan Wang, Yuwei Hu, Luis Ceze, Carlos Guestrin, and Arvind Krishnamurthy

    work page doi:10.48550/arxiv.2003.02831 2020

  17. [17]

    Quantum algorithm for systems of linear equations with exponentially improved dependence on precision

    Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision.SIAM J. Comput.46, 6 (2017). doi:10.1137/16m1087072 Andrew M. Childs and Nathan Wiebe

    work page Pith review doi:10.1137/16m1087072 2017

  18. [18]

    Quantum Information and Computation12 (2012)

    Hamiltonian Simulation Using Linear Combinations of Unitary Operations. Quantum Information and Computation12 (2012). doi:10.26421/qic12.11-12 Bob Coecke and Ross Duncan

    work page doi:10.26421/qic12.11-12 2012

  19. [19]

    New Journal of Physics 13(4), p

    Interacting quantum observables: categorical algebra and diagrammatics.New Journal of Physics13, 4 (2011). doi:10.1088/1367-2630/13/4/043016 Andrew W. Cross, Lev S. Bishop, John A. Smolin, and Jay M. Gambetta

    work page doi:10.1088/1367-2630/13/4/043016 2011

  20. [20]

    Open Quantum Assembly Language

    Open Quantum Assembly Language. arXiv:1707.03429 [quant-ph] doi:10.48550/arXiv.1707.03429 Alexander M. Dalzell, Sam McArdle, Mario Berta, Przemyslaw Bienias, Chi-Fang Chen, András Gilyén, Connor T. Hann, Michael J. Kastoryano, Emil T. Khabiboulline, Aleksander Kubica, Grant Salton, Samson Wang, and Fernando G. S. L. Brandão. 2025.Quantum Algorithms: A Sur...

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.1707.03429 2025

  21. [21]

    Birgitta and Lin, Lin , year=

    Efficient phase-factor evaluation in quantum signal processing.Physical Review A103, 4 (2021). doi:10.1103/physreva.103.042419 Ping Fan, Ri-Gui Zhou, Wen Wen Hu, and NaiHuan Jing

    work page doi:10.1103/physreva.103.042419 2021

  22. [22]

    doi:10.1007/s11128-018-2129-x Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser

    Quantum image edge extraction based on Laplacian operator and zero-cross method.Quantum Information Processing18 (2019). doi:10.1007/s11128-018-2129-x Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser

    work page doi:10.1007/s11128-018-2129-x 2019

  23. [23]

    Quantum Computation by Adiabatic Evolution

    Quantum Computation by Adiabatic Evolution. arXiv:quant-ph/0001106 [quant-ph] doi:10.48550/arXiv.quant-ph/0001106 Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.quant-ph/0001106

  24. [24]

    Surface codes: Towards practical large-scale quantum computation

    Surface codes: Towards practical large-scale quantum computation.Physical Review A86, 3 (2012). doi:10.1103/PhysRevA.86.032324 M. Frigo and S.G. Johnson

    work page doi:10.1103/physreva.86.032324 2012

  25. [25]

    A comprehensive survey on transfer learning.Proceedings of the IEEE, 109(1):43–76, 2021

    The Design and Implementation of FFTW3.Proc. IEEE93, 2 (2005). doi:10.1109/JPROC. 2004.840301 Roy Frostig, Matthew Johnson, and Chris Leary

    work page doi:10.1109/jproc 2005

  26. [26]

    Quantum singular value transformation and beyond,

    Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. InACM Symposium on Theory of Computing. doi:10.1145/ 3313276.3316366 Johnnie Gray

    work page arXiv

  27. [27]

    Gray, quimb: A Python package for quantum information and many-body calculations , J

    quimb: A python package for quantum information and many-body calculations.Journal of Open Source Software3, 29 (2018). doi:10.21105/joss.00819 Gaël Guennebaud, Benoît Jacob, et al

    work page doi:10.21105/joss.00819 2018

  28. [28]

    Harrigan, Tanuj Khattar, Charles Yuan, Anurudh Peduri, Noureldin Yosri, Fionn D

    Expressing and Analyzing Quantum Algorithms with Qualtran. arXiv:2409.04643 [quant-ph] doi:10.48550/arXiv.2409.04643 Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd

    work page doi:10.48550/arxiv.2409.04643

  29. [29]

    Harrow, Avinatan Hassidim, and Seth Lloyd

    Quantum Algorithm for Linear Systems of Equations.Physical Review Letters103, 15 (2009). doi:10.1103/PhysRevLett.103.150502 Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, and Michael Hicks

    work page doi:10.1103/physrevlett.103.150502 2009

  30. [30]

    A Verified Optimizer for

    A Verified Optimizer for Quantum Circuits. InACM SIGPLAN Symposium on Principles of Programming Languages. doi:10.1145/3434318 Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, and Jarrod R. McClean

    work page doi:10.1145/3434318

  31. [31]

    doi:10.1126/science.abn7293 Keli Huang and Jens Palsberg

    Quantum advantage in learning from experiments.Science 376, 6598 (2022). doi:10.1126/science.abn7293 Keli Huang and Jens Palsberg

    work page doi:10.1126/science.abn7293 2022

  32. [32]

    InACM SIGPLAN Conference on Programming Language Design and Implementation

    Compiling Conditional Quantum Gates without Using Helper Qubits. InACM SIGPLAN Conference on Programming Language Design and Implementation. doi:10.1145/3656436 Qifan Huang, Li Zhou, Wang Fang, Mengyu Zhao, and Mingsheng Ying

    work page doi:10.1145/3656436

  33. [33]

    The Annals of Mathematical Statis- tics 35(1), 73–101 (1964) https://doi.org/10.121 4/aoms/1177703732

    Robust Estimation of a Location Parameter.The Annals of Mathematical Statistics35, 1 (1964). doi:10.1214/aoms/1177703732 Shih-Han Hung, Kesha Hietala, Shaopeng Zhu, Mingsheng Ying, Michael Hicks, and Xiaodi Wu

    work page doi:10.1214/aoms/1177703732 1964

  34. [34]

    InACM SIGPLAN Symposium on Principles of Programming Languages

    Quantitative robustness analysis of quantum programs. InACM SIGPLAN Symposium on Principles of Programming Languages. doi:10.1145/3290344 Ali Javadi-Abhari, Matthew Treinish, Kevin Krsulich, Christopher J. Wood, Jake Lishman, Julien Gacon, Simon Martiel, Paul D. Nation, Lev S. Bishop, Andrew W. Cross, Blake R. Johnson, and Jay M. Gambetta

    work page doi:10.1145/3290344

  35. [35]

    Quantum computing with Qiskit

    Quantum computing with Qiskit. arXiv:2405.08810 [quant-ph] doi:10.48550/arXiv.2405.08810 Yuta Kikuchi, Conor Mc Keever, Luuk Coopmans, Michael Lubasch, and Marcello Benedetti

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2405.08810

  36. [36]

    doi:10.1038/s41534-023-00762-0 Fredrik Kjolstad, Shoaib Kamil, Stephen Chou, David Lugato, and Saman Amarasinghe

    Realization of quantum signal processing on a noisy quantum computer.npj Quantum Information9 (2023). doi:10.1038/s41534-023-00762-0 Fredrik Kjolstad, Shoaib Kamil, Stephen Chou, David Lugato, and Saman Amarasinghe

    work page doi:10.1038/s41534-023-00762-0 2023

  37. [37]

    ACM Program

    The tensor algebra compiler. InACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. doi:10.1145/3133901 Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra 23 Haoya Li, Hongkang Ni, and Lexing Ying

    work page doi:10.1145/3133901

  38. [38]

    Quantum7 (2023)

    On efficient quantum block encoding of pseudo-differential operators. Quantum7 (2023). doi:10.22331/q-2023-06-02-1031 Lin Lin

    work page doi:10.22331/q-2023-06-02-1031 2023

  39. [39]

    arXiv preprint , year =

    Lecture Notes on Quantum Algorithms for Scientific Computation. arXiv:2201.08309 [quant-ph] doi:10.48550/ arXiv.2201.08309 Guang Hao Low and Isaac L. Chuang

    work page arXiv

  40. [40]

    Ostaszewski, E

    Hamiltonian Simulation by Qubitization.Quantum3 (2019). doi:10.22331/q- 2019-07-12-163 Guang Hao Low, Vadym Kliuchnikov, and Luke Schaeffer

    work page doi:10.22331/q- 2019

  41. [41]

    doi:10.22331/q-2024-06-17-1375 John M

    Trading T gates for dirty qubits in state preparation and unitary synthesis.Quantum8 (2024). doi:10.22331/q-2024-06-17-1375 John M. Martyn, Zane M. Rossi, Andrew K. Tan, and Isaac L. Chuang

    work page doi:10.22331/q-2024-06-17-1375 2024

  42. [42]

    A Grand Unification of Quantum Algorithms

    Grand Unification of Quantum Algorithms. PRX Quantum2, 4 (2021). doi:10.1103/prxquantum.2.040203 Danial Motlagh and Nathan Wiebe

    work page doi:10.1103/prxquantum.2.040203 2021

  43. [43]

    doi:10.1103/ PRXQuantum.5.020368 Yunseong Nam, Neil J

    Generalized Quantum Signal Processing.PRX Quantum5 (2024). doi:10.1103/ PRXQuantum.5.020368 Yunseong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs, and Dmitri Maslov

    work page 2024

  44. [44]

    doi:10.1038/s41534-018-0072-4 Martina Nibbi and Christian B

    Automated optimization of large quantum circuits with continuous parameters.npj Quantum Information4, 1 (2018). doi:10.1038/s41534-018-0072-4 Martina Nibbi and Christian B. Mendl

    work page doi:10.1038/s41534-018-0072-4 2018

  45. [45]

    PyTorch: An Imperative Style, High-Performance Deep Learning Library

    Block encoding of matrix product operators.Physical Review A110, 4 (2024). doi:10.1103/physreva.110.042427 Michael A. Nielsen and Isaac L. Chuang. 2010.Quantum Computation and Quantum Information(10th ed.). Cambridge University Press, New York. doi:10.1017/CBO9780511976667 Kevin Obenland, Justin Elenewski, Kaitlyn Morrell, Benjamin Rempfer, Parker Kuklins...

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.110.042427 2024

  46. [46]

    IEEE93, 2 (2005)

    SPIRAL: Code Generation for DSP Transforms.Proc. IEEE93, 2 (2005). doi:10.1109/JPROC.2004.840306 QuiZX Developers

    work page doi:10.1109/jproc.2004.840306 2005

  47. [47]

    doi:10.1103/physreva.96.062323 Amit Sabne

    Analysis of a parametrically driven exchange-type gate and a two-photon excitation gate between superconducting qubits.Physical Review A96, 6 (2017). doi:10.1103/physreva.96.062323 Amit Sabne

    work page doi:10.1103/physreva.96.062323 2017

  48. [48]

    doi:10.1007/s11128-016-1495-5 Ritvik Sharma and Sara Achour

    Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2D target.Quantum Information Processing16 (2017). doi:10.1007/s11128-016-1495-5 Ritvik Sharma and Sara Achour

    work page doi:10.1007/s11128-016-1495-5 2017

  49. [49]

    InACM SIGPLAN Conference on Programming Language Design and Implementation

    Optimizing Ancilla-Based Quantum Circuits with SPARE. InACM SIGPLAN Conference on Programming Language Design and Implementation. doi:10.1145/3729253 Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan

    work page doi:10.1145/3729253

  50. [50]

    T|ket〉: A retargetable compiler for nisq devices,

    t|ket〉: a retargetable compiler for NISQ devices.Quantum Science and Technology6, 1 (2020). doi:10.1088/2058-9565/ab8e92 Krysta M. Svore, Martin Roetteler, Alan Geller, Matthias Troyer, John Azariah, Christopher Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, and Andres Paz

    work page doi:10.1088/2058-9565/ab8e92 2020

  51. [51]

    Q#: Enabling scalable quantum computing and development with a high-level dsl,

    Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. InReal World Domain Specific Languages Workshop. doi:10.1145/3183895.3183901 Christoph Sünderhauf

    work page doi:10.1145/3183895.3183901

  52. [52]

    Generalized quantum singular value transformation

    Generalized Quantum Singular Value Transformation. arXiv:2312.00723 [quant-ph] doi:10. 48550/arXiv.2312.00723 Christoph Sünderhauf, Earl Campbell, and Joan Camps

    work page arXiv

  53. [53]

    2024 , month =

    Block-encoding structured matrices for data input in quantum computing.Quantum8 (2024). doi:10.22331/q-2024-01-11-1226 Christoph Sünderhauf, Zalán Németh, Adnaan Walayat, Andrew Patterson, and Bjorn K. Berntson

    work page doi:10.22331/q-2024-01-11-1226 2024

  54. [54]

    Matrix inversion polynomials for the quantum singular value transformation

    Matrix inversion polynomials for the quantum singular value transformation. arXiv:2507.15537 [quant-ph] doi:10.48550/arXiv.2507.15537 Ewin Tang

    work page doi:10.48550/arxiv.2507.15537

  55. [55]

    A quantum-inspired classical algorithm for recommendation systems , isbn =

    A quantum-inspired classical algorithm for recommendation systems. InACM Symposium on Theory of Computing. doi:10.1145/3313276.3316310 Ross Tate, Michael Stepp, Zachary Tatlock, and Sorin Lerner

    work page doi:10.1145/3313276.3316310

  56. [56]

    Logical Methods in Computer Science7, 1 (2011)

    Equality Saturation: A New Approach to Optimization. Logical Methods in Computer Science7, 1 (2011). doi:10.2168/LMCS-7(1:10)2011 24 Charles Yuan Stanimire Tomov, Jack Dongarra, and Marc Baboulin

    work page doi:10.2168/lmcs-7(1:10)2011 2011

  57. [57]

    doi:10.1016/j.parco.2009.12.005 Wim van Dam, Mariia Mykhailova, and Mathias Soeken

    Towards dense linear algebra for hybrid GPU accelerated manycore systems.Parallel Comput.36, 5-6 (2010). doi:10.1016/j.parco.2009.12.005 Wim van Dam, Mariia Mykhailova, and Mathias Soeken

    work page doi:10.1016/j.parco.2009.12.005 2010

  58. [58]

    LeBlond, R

    Using Azure Quantum Resource Estimator for Assessing Performance of Fault Tolerant Quantum Computation. InWorkshops of the International Conference on High Performance Computing, Network, Storage, and Analysis. doi:10.1145/3624062.3624211 Field G. Van Zee, Ernie Chan, Robert A. van de Geijn, Enrique S. Quintana-Ortí, and Gregorio Quintana-Ortí

    work page doi:10.1145/3624062.3624211

  59. [59]

    doi:10.1109/MCSE

    The libflame Library for Dense Matrix Computations.Computing in Science & Engineering11, 6 (2009). doi:10.1109/MCSE. 2009.207 Matan Vax, Peleg Emanuel, Eyal Cornfeld, Israel Reichental, Ori Opher, Ori Roth, Tal Michaeli, Lior Preminger, Lior Gazit, Amir Naveh, and Yehuda Naveh

    work page doi:10.1109/mcse 2009

  60. [60]

    arXiv:2502.19368 [quant-ph] doi:10.48550/arXiv.2502.19368 Finn Voichick, Liyi Li, Robert Rand, and Michael Hicks

    Qmod: Expressive High-Level Quantum Modeling. arXiv:2502.19368 [quant-ph] doi:10.48550/arXiv.2502.19368 Finn Voichick, Liyi Li, Robert Rand, and Michael Hicks

    work page doi:10.48550/arxiv.2502.19368

  61. [61]

    InACM SIGPLAN Symposium on Principles of Programming Languages

    Qunity: A Unified Language for Quantum and Classical Computing. InACM SIGPLAN Symposium on Principles of Programming Languages. doi:10.1145/3571225 R. Clint Whaley and Jack Dongarra

    work page doi:10.1145/3571225

  62. [62]

    InACM/IEEE Conference on Supercomputing

    Automatically tuned linear algebra software. InACM/IEEE Conference on Supercomputing. doi:10.1109/SC.1998.10004 Amanda Xu, Abtin Molavi, Lauren Pick, Swamit Tannu, and Aws Albarghouthi

    work page doi:10.1109/sc.1998.10004 1998

  63. [63]

    InACM SIGPLAN Conference on Programming Language Design and Implementation

    Synthesizing Quantum-Circuit Optimizers. InACM SIGPLAN Conference on Programming Language Design and Implementation. doi:10.1145/3591254 Amanda Xu, Abtin Molavi, Swamit Tannu, and Aws Albarghouthi. 2025b. Optimizing Quantum Circuits, Fast and Slow. In ACM International Conference on Architectural Support for Programming Languages and Operating Systems. do...

    work page doi:10.1145/3591254

  64. [64]

    Quartz: superoptimization of quantum circuits

    Quartz: Superoptimization of Quantum Circuits. InACM SIGPLAN Conference on Programming Language Design and Implementation. doi:10.1145/3519939.3523433 Yingte Xu, Gilles Barthe, and Li Zhou. 2025a. Automating Equational Proofs in Dirac Notation. InACM SIGPLAN Symposium on Principles of Programming Languages. doi:10.1145/3704878 Chao-Hua Yu, Fei Gao, and Qi...

    work page doi:10.1145/3519939.3523433

  65. [65]

    doi:10.1109/TKDE.2019.2937491 Charles Yuan and Michael Carbin

    An Improved Quantum Algorithm for Ridge Regression.IEEE Transactions on Knowledge & Data Engineering33, 03 (2021). doi:10.1109/TKDE.2019.2937491 Charles Yuan and Michael Carbin

    work page doi:10.1109/tkde.2019.2937491 2021

  66. [66]

    InACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications

    Tower: Data Structures in Quantum Superposition. InACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. doi:10.1145/3563297 Charles Yuan, Agnes Villanyi, and Michael Carbin

    work page doi:10.1145/3563297

  67. [67]

    InACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications

    Quantum Control Machine: The Limits of Control Flow in Quantum Programming. InACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. doi:10.1145/3649811 Zhicheng Zhang and Mingsheng Ying

    work page doi:10.1145/3649811

  68. [68]

    InACM SIGPLAN Conference on Programming Language Design and Implementation

    Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs. InACM SIGPLAN Conference on Programming Language Design and Implementation. doi:10.1145/3729283

    work page doi:10.1145/3729283