Isthmus: declared decisions, explicit refusal and sealed receipts as a portable layer over quantum runtimes

Abstract. Quantum software stacks are built to execute. Isthmus inverts that order for the class of questions that can be decided before execution. It is a sub-language, not a general language: every call declares its statistical hypotheses before any data exists, returns one of three verdicts (1, 0, REFUSED), stamps a refusal with a machine-readable code, and seals whatever it delivers inside a receipt chain. We describe the design, the implementation as a Python package of 19 modules with 18 declared refusal codes, and the evidence gathered for the 1.0.0 release: 77 unit tests, a 40,000-case fuzz campaign that found two real defects, and the same two circuits executed on three distinct IBM Quantum processors where every one of the six decisions was REFUSED rather than asserted. Resumo. O Isthmus inverte a ordem da execucao para a classe de perguntas que podem ser decididas antes de existir dado: cada chamada declara hipoteses estatisticas, devolve 1, 0 ou RECUSADO com codigo de recusa, e sela o que entrega numa cadeia de recibos. 77 testes, fuzz de 40 mil casos, tres QPUs reais, seis vereditos recusados.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24339928
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Isthmus: declared decisions, explicit refusal and sealed receipts as a portable layer over quantum runtimes

RAVI Quantum Solutions, Reggiz Uhlmann
2 links
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Isthmus: declared decisions, explicit refusal and sealed receipts as a portable layer over quantum runtimes

RAVI Quantum Solutions, Reggiz Uhlmann
preprint en

Abstract

Abstract. Quantum software stacks are built to execute. Isthmus inverts that order for the class of questions that can be decided before execution. It is a sub-language, not a general language: every call declares its statistical hypotheses before any data exists, returns one of three verdicts (1, 0, REFUSED), stamps a refusal with a machine-readable code, and seals whatever it delivers inside a receipt chain. We describe the design, the implementation as a Python package of 19 modules with 18 declared refusal codes, and the evidence gathered for the 1.0.0 release: 77 unit tests, a 40,000-case fuzz campaign that found two real defects, and the same two circuits executed on three distinct IBM Quantum processors where every one of the six decisions was REFUSED rather than asserted. Resumo. O Isthmus inverte a ordem da execucao para a classe de perguntas que podem ser decididas antes de existir dado: cada chamada declara hipoteses estatisticas, devolve 1, 0 ou RECUSADO com codigo de recusa, e sela o que entrega numa cadeia de recibos. 77 testes, fuzz de 40 mil casos, tres QPUs reais, seis vereditos recusados.

Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon