Pith. sign in

REVIEW 1 cited by

Compilation strategies for quantum network programs using Qoala

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2505.06162 v1 pith:UNA253UM submitted 2025-05-09 quant-ph

Samuel Oslovich , Bart van der Vecht , Stephanie Wehner This is my paper · ORCID
classification quant-ph
keywords quantumnetworkcompilationstrategiescompilerexecutionprogramsqoala
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Execution of quantum network applications requires a software stack for nodes. Recently, the first designs and demonstrations have been proposed for such software stacks, including QNodeOS and its extension, Qoala. The latter enables compilation strategies previously not possible in QNodeOS. Here, we show how the extensions provided by Qoala can be used by a compiler to improve the performance of quantum network applications. We define new compilation strategies that allow the compiler to influence the scheduling and execution of quantum programs on a quantum network node. Through simulation, we demonstrate that our compilation strategies can reduce the execution time by up to 29.53% and increase the success probability by up to 25.12%. Our work highlights the potential of compiler optimizations for quantum network programs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Advanced Scheduling Strategies for Distributed Quantum Computing Jobs

    quant-ph 2026-02 conditional novelty 5.0 of 10

    Link-aware scheduling rules for distributed quantum computing jobs cut simulated batch makespan by about half versus FIFO/LIST, but the best-performing rule is a simple heuristic, not the trained RL agent.

Pith tools