Algorithms Library Overview
quantum_debugger.algorithms is a library of genuine, gate-based quantum
algorithms on the state-vector simulator. Every routine is verified against its
known outcome (exact amplitudes, exact factoring, exact eigenvalues, or a matching
analytic curve). This page indexes the whole library; each entry links to a worked
example in the Algorithms guide.
from quantum_debugger.algorithms import grover_search, shor_factor, trotter_evolve
Search & oracle algorithms
Function |
What it does |
|---|---|
|
Grover unstructured search |
|
Find an input satisfying an arbitrary boolean predicate (SAT) |
|
Durr-Hoyer adaptive minimization of a cost function |
|
Grover for any state prep |
|
Recover a hidden bit-string in one query |
|
Deutsch’s algorithm: constant vs balanced 1-bit function (1 query) |
|
Constant vs balanced (n-bit) |
|
Hidden XOR-mask (period) finding |
Fourier, phase estimation & factoring
Function |
What it does |
|---|---|
|
Quantum Fourier transform |
|
QPE on the phase gate |
|
Single-ancilla (Kitaev) QPE |
|
QPE for arbitrary operators (spectroscopy) |
|
Shor’s algorithm (period finding + factoring) |
|
Count marked states / estimate amplitude |
Simulation & chemistry
Function |
What it does |
|---|---|
|
Trotter-Suzuki Hamiltonian simulation |
|
Build a Hamiltonian from Pauli strings |
|
Hardware-efficient VQE ground-state solver |
|
Ready-made spin Hamiltonians |
|
Quantum linear-systems solver |
|
Discrete-time coined quantum walk |
Optimization
Function |
What it does |
|---|---|
|
QAOA MaxCut solver + exact reference |
|
Grover adaptive minimization |
Error correction & benchmarking
Function |
What it does |
|---|---|
|
Stabilizer QEC codes |
|
Logical error rate vs the QEC threshold |
|
Average gate fidelity |
Circuit synthesis & arithmetic
Function |
What it does |
|---|---|
|
Single-qubit / controlled-U decomposition |
|
Two-qubit Cartan (KAK) decomposition |
|
Multi-controlled gate synthesis |
|
Draper QFT adder (constant / two-register) |
|
QFT subtractor and comparator |
Entanglement, protocols & foundations
Function |
What it does |
|---|---|
|
Canonical entangled-state preparation |
|
Communication protocols |
|
Estimate the overlap of two states |
|
Bell inequality + nonlocal game |
|
GHZ metrology |
|
BB84 quantum key distribution |
Quantum Singular Value Transformation (QSVT) & Modern Primitives
Function |
What it does |
|---|---|
|
Quantum Signal Processing (1-qubit designable polynomials) |
|
Unitary block encoding of arbitrary matrices |
|
Qubitization walk realizing matrix Chebyshev polynomials |
|
Linear Combination of Unitaries (PREPARE / SELECT) |
|
Quantum Singular Value Transformation (eigenvalue-wise polynomial) |
|
Real-time unitary simulation and smooth Chebyshev matrix functions |
|
Quantum linear systems solver ($A x = b$) via polynomial inversion |
|
Matrix sign function and spectral cut projections |
|
Fractional/negative matrix powers and matrix exponentials |
|
Low-energy ground state filtering and thermal states |
|
Kernel Polynomial Method (KPM) moment estimation and DOS |
|
Interval eigenvalue counting and trace estimation |
|
Grover amplitude amplification as scalar QSVT |
See the QSVT Guide for detailed theory and examples.