oracq

English · 简体中文

oracq organizes quantum algorithms in Python and compiles them to a saveable, composable register-level intermediate representation (RIR). Algorithms may depend on oracle placeholders that are not implemented yet; once concrete implementations are supplied, the same description exports to OriginIR-ext or runs on PySparQ (see backends and export for details).

If this is your first encounter with the project, start with the core concepts and then follow a tutorial. If you are implementing or reviewing algorithms, the full manuals explain interfaces, input preconditions, composition rules, and backend limitations. The API reference is generated directly from the current source.

Manuals

• Complete documentation
• Algorithm catalog
• Specification reference
• API Reference

Tutorials

• Tutorials
  • Your first register program
  • Replacing an algorithm’s oracle
  • From a paper’s access model to implementation comparison
  • Search for an element and estimate the success probability
  • Supplying your own Hamiltonian decomposition
  • Swapping QODE methods for the same linear problem
  • Generating QHAM input from a PDE expression
  • Composing PDE inputs and solve instances
  • Composing linear ODE inputs and solve instances
  • Scientific computing workflows: input models, solvers, and reproduction
  • Running and modifying the algorithm gallery

Development

• Development
  • Development and acceptance
  • Architecture paradigm and interface conventions
  • Framework survey notes (stage 1)
  • Writing documentation
  • Translation Glossary (Chinese → English)
  • Repository reorganization and the algorithm expansion panel
  • Algorithm research workflow improvements
  • Acceptance record for this version
  • Quantum algorithm implementation validation plan (review draft)
  • Validation coverage matrix
  • Quantum algorithm coverage workboard

The project currently provides assembly paths ranging from oracle queries, search, estimation, and Hamiltonian evolution to QLSS, QODE, QFVM, and QHAM. Maturity varies per implementation; check applicability and validation status before choosing an algorithm. The Chinese mirror of this site lives under zh/.