Quantumwerk
circuit coupling swap routing
Return a deterministic shortest-path SWAP routing plan for supplied logical two-qubit interactions.
POST https://quantum.halowerk.com/v1/circuit-coupling-swap-routingInputs
| Field | Type | Required | Description |
|---|---|---|---|
| qubits | integer | Yes | |
| coupling | array | Yes | |
| interactions | array | Yes |
Show full input schema
{
"type": "object",
"properties": {
"qubits": {
"type": "integer",
"minimum": 2,
"maximum": 32
},
"coupling": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"maxItems": 2,
"minItems": 2
},
"maxItems": 128,
"minItems": 0
},
"interactions": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"maxItems": 2,
"minItems": 2
},
"maxItems": 128,
"minItems": 0
}
},
"required": [
"qubits",
"coupling",
"interactions"
],
"additionalProperties": false
}Published input example
{
"qubits": 3,
"coupling": [
[
0,
1
],
[
1,
2
]
],
"interactions": [
[
0,
2
]
]
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-18 UTC.
More endpoints in this hub
- 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.005 USDC
circuit count register bit map
POSThttps://quantum.halowerk.com/v1/circuit-count-register-bit-mapReturn per-register marginal count histograms after explicit bit-order and register-bit mapping.
- Quantumwerk0.005 USDC
circuit independent error budget
POSThttps://quantum.halowerk.com/v1/circuit-independent-error-budgetReturn independent-operation success probability, expected fault count and a union-bound failure estimate.