Skip to content

Results are limited to the current section : Qoolqit

Fundamentals

This section introduces the core concepts used throughout QoolQit, following the typical workflow: define a problem, embed it into hardware, then build, compile, and execute a quantum program.


The first part focuses on problem definition and embedding.

  • Problem definition: Problems are represented using graphs. The DataGraph class extends NetworkX with features for the Rydberg analog model, including:

    • node coordinates
    • distance-based methods
    • unit-disk graph logic
    • node and edge weights
  • Embedding: Once defined, a problem is mapped to hardware via the embedding interface. See the embedding pages for:

    • the standard embedding workflow
    • available built-in embedders

Advanced users can define custom embedders with custom inputs, outputs, and parameters.


Quantum programs, compilation, and execution

Section titled “Quantum programs, compilation, and execution”

The second part covers program construction, compilation, and execution.

The quantum program page details how create a quantum program from its basic components:

  • a Register — qubit positions
  • a Drive — drive Hamiltonian, as composed of Waveforms to specify the time-dependent qubit controls

Once defined, a quantum program must be compiled to a QoolQit Device, as described in the device amd compilation page. This step will encoding hardware constraints and units and generate an executable program.

Finally, see the execution page to:

  • run compiled programs on local/remote emulators or QPUs
  • retrieve and interpret results

Together, these pages define the full QoolQit workflow, from hardware-agnostic problem definition to compiled execution.