Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Charles Yuan

TL;DR
Cobble is a high-level programming language that compiles quantum linear algebra expressions into efficient quantum circuits, enabling faster quantum algorithms for simulation and regression tasks.
Contribution
Introduces Cobble, a language that simplifies programming with quantum block encodings and automates optimization for quantum linear algebra algorithms.
Findings
Achieves 2.6x to 25.4x speedups on benchmark kernels.
Provides analyses for time and space usage of quantum programs.
Uses state-of-the-art techniques like quantum singular value transformation.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
