Subroutines from C/C++
Construct callable quantum subroutines from C/C++ functions.
Manage complex reversible logic
The burden of reversible logic
Many quantum algorithms rely on classical computation performed on data in superposition—but implementing these operations with reversible quantum gates is extremely complex.
Seamless classical integration
Triple Alpha lets developers bring classical code directly into their quantum programs, automatically compiling C and C++ functions into partial quantum circuits. This automation removes the need to hand-design reversible logic, allowing developers to focus on algorithm design and error correction instead of low-level gate construction.
Partial circuit compilation
Generate partial quantum circuits automatically from C/C++ files. Triple Alpha’s compiler supports a wide subset of C/C++ code, translating functions into Helium-compatible quantum subroutines. Developers simply provide their C/C++ files along with a configuration file (.c2q) that defines the entry point to the classical code as well as optimisation settings. Triple Alpha’s compiler then produces a partial circuit, balancing performance trade-offs and resource efficiency.
Easy integration
Bring C/C++ functions into Helium programs as callable quantum subroutines. Once compiled, a subroutine can be added to a Helium program with a single line of code and used just like a native function. This seamless integration makes it easy to embed familiar classical logic directly within quantum programs.
Explore our technology
Programming languages
Write code at a level that suits your use case and expertise. Triple Alpha’s languages enable higher-level, BASIC-like programming as well as precise, assembly-like control—all within a single development environment.
Code portability
Write hardware-agnostic code and compile it for a specific quantum machine. Triple Alpha automatically optimises programs for the target processor, delivering performant portable code.
Turing completeness
Develop with fully expressive languages. Triple Alpha’s Turing-complete languages unlock true computational freedom, removing limitations of static circuits.