Expressing and Analyzing Quantum Algorithms with Qualtran

TL;DR

Qualtran addresses the need for precise, reproducible tooling to analyze quantum algorithms intended for error‑corrected hardware. It introduces bloqs, a hierarchical, data‑driven representation of quantum programs, along with call graphs, gate/qubit counting, and tensor/classical simulation, to enable architecture‑agnostic cost analysis and automation of resource estimates. The framework ships with a substantive standard library of primitives (rotations, state preparation, block encodings, QSP/QSVT, QPE, etc.) and supports architecture‑aware physical cost models, demonstrated through Hamiltonian simulation, quantum chemistry, and cryptography case studies. By enabling explicit constructions, symbolic cost propagation, and open collaboration, Qualtran aims to accelerate reproducible, scalable quantum algorithm development and guide hardware‑roadmap decisions.

Abstract

Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and fallibility of quantum algorithm development. We present Qualtran, an open-source library for representing and analyzing quantum algorithms. Using appropriate abstractions and data structures, we can simulate and test algorithms, automatically generate information-rich diagrams, and tabulate resource requirements. Qualtran offers a standard library of algorithmic building blocks that are essential for modern cost-minimizing compilations. Its capabilities are showcased through the re-analysis of key algorithms in Hamiltonian simulation, chemistry, and cryptography. Architecture-independent resource counts output by Qualtran can be forwarded to our implementation of cost models to estimate physical costs like wall-clock time and number of physical qubits assuming a surface-code architecture. Qualtran provides a foundation for explicit constructions and reproducible analysis, fostering greater collaboration within the growing quantum algorithm development community.

Figures (17)

• Figure 1: A cartoon overview of a Qualtran workflow. Python code defines quantum subroutines and properties. The data structures encode quantum invariants. Routines are composed hierarchically, and Qualtran provides a library of useful quantum subroutines. Analysis protocols let the developer make meaningful statements about the correctness or cost of a quantum algorithm. Architecture-agnostic costs are translated to physical resource requirements like wall-clock time through standard models.
• Figure 2: The compute graph for a modular exponentiation subroutine. This graph is formed by composing modular multiplication bloqs and serves as the definition of a modular exponentiation bloq. Some notable features of the data structure are annotated.
• Figure 3: Demonstration of a code snippet instantiating a $\mathop{\mathrm{ZPow}}\nolimits(t)$ bloq achieved using a phase-gradient resource state specified to a $1.0\times 10^{-6}$ precision. The precision is used to dictate the size of the phase-gradient state shown on the right. This bloq has a Tofolli cost of ${b_\text{grad}} - 2$Gidney_2018Cody_Jones_2012.
• Figure 4: Example of using multiplexer to execute one ore more nested coherent for-loops. implements the interface defined by and uses the unary iteration circuit construction from Babbush2018Encoding. Note that this example is purely for an illustration of how to express coherent for-loops and implement multiplexed operations in Qualtran; for implementing QROMs see \ref{['sec:quantum_lookup_table']} for a variety of native bloqs that Qualtran provides.
• Figure 5: Examples of using Qualtran to analyze the cost of Quantum Lookup Tables.