CUDA-Q Algorithms
A primitive-first, fault-tolerant-quantum-computing (FTQC) algorithms library built on CUDA-Q: block encodings, qubitization, QSVT, Trotterization, double factorization, fermion-to-qubit transforms, and state preparation — composed from small, reusable device kernels.
Getting Started
User Guide
Examples
- Getting-started walkthrough
- Quickstart: block-encode a Hamiltonian and walk it
- Hamiltonian simulation, two independent ways
- From a molecule to its ground-state energy
- Double factorization and the BlockEncoding protocol
- State preparation and injection
- Bring your own block encoding
- Solve a linear system with QSVT
- Quantum phase estimation with three energy oracles
- Combine block encodings: Fermi-Hubbard with T in momentum space
- Sparse matrix inversion for heat diffusion
- Preprocessing examples
- Block-encoding examples
- Circuit primitive examples
- State-preparation examples
- Chemistry-primitive examples
- Hamiltonian-simulation examples
Reference
- Conventions and Reference
- Qubit ordering: qubit 0 is least significant
- Pauli words
- Spin orbitals: interleaved
- Fermionic integral tensors
- Jordan-Wigner ladder operators
- Block encodings
- Sparse-access encodings
- Qubitization walk
- QSVT
- Reflection gate vs reflection observable
- Simulation targets and tolerances
- BLAS threading and C-DF reproducibility
- Hermiticity
- Python API Reference