HALOWERKQuantumwerk
error correction
Treats a caller-supplied odd-length bit word as a classical repetition code, majority-decodes one logical bit, and reports the corrected word and adjacent XOR syndrome. This narrow demonstration is not a surface-code simulation and does not model coherent quantum errors, measurements or fault-tolerant thresholds.
POST https://quantum.halowerk.com/v1/error-correctionEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| encoded_bits | string | Ja | Odd-length repetition-code word. |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"required": [
"encoded_bits"
],
"additionalProperties": false,
"properties": {
"encoded_bits": {
"type": "string",
"minLength": 3,
"maxLength": 99,
"pattern": "^[01]+$",
"description": "Odd-length repetition-code word."
}
}
}Veröffentlichtes Eingabebeispiel
{
"encoded_bits": "1110111"
}Ergebnis & Dokumentation
Veröffentlichtes Ergebnisschema anzeigen
{
"$ref": "https://quantum.halowerk.com/v1/error-correction/schema#/outputSchema"
}Veröffentlichtes Ergebnisbeispiel öffnen
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-01, 15:19 UTC.
Weitere Endpunkte dieses Hubs
- Quantumwerk0,002 USDC
annealer schedule
POSThttps://quantum.halowerk.com/v1/annealer-scheduleInterpolates a caller-supplied start and end temperature across a bounded number of steps using either a linear or geometric rule. It does not run an annealer, optimize a problem Hamiltonian or tune a schedule from hardware measurements.
- Quantumwerk0,004 USDC
circuit optimize
POSThttps://quantum.halowerk.com/v1/circuit-optimizeCancels adjacent identical self-inverse gates on identical ordered targets and folds adjacent RX, RY or RZ rotations on identical targets. It preserves only these local identities; it does not commute gates, model hardware topology, synthes
- Quantumwerk0,004 USDC
entanglement test
POSThttps://quantum.halowerk.com/v1/entanglement-testConverts ++, +−, −+ and −− counts into a correlation for each of AB, AB′, A′B and A′B′, then computes S = E(AB) + E(AB′) + E(A′B) − E(A′B′). A value above the classical bound in supplied data does not by itself demonstrate entanglement or c