State
Discrete-gate circuit
Continuous rotations replaced by words in a finite gate set, to a stated precision. The count that matters here is the non-Clifford one, because that is what a fault-tolerant machine charges for.
A state is an object you can be holding, named once so that two routes reaching the same thing are drawn as reaching the same thing. It says nothing about how you got here or where you can go next — that is entirely in the processes below.
This is a kind of
Anything that asks for one of these will accept this, because it is narrower. The reverse does not hold.
- Abstract circuit
Arbitrary rotation angles, arbitrary two-qubit gates, and any qubit able to talk to any other. No machine runs this. Everything between here and hardware is the business of closing that gap and counting what it costs.
Narrower kinds of this
No state in the vocabulary is recorded as a narrower kind of this one.
Records that are this object
Nothing in the catalogue has been joined to this state. That is a gap in the join rather than a claim that no such object exists; the shelf on /repository lists what is joined and what is not, with the reason.
Work that arrives here
- Approximate a continuous rotation in a discrete gate set
Given a target single-qubit unitary — typically a z-rotation by an arbitrary angle — and a precision , produce a finite word over a fixed discrete gate set such as Clifford+T whose product is within of the target in a stated metric. The cost is charged in non-Clifford gates.
Work that starts here
No process asks for this by name. The ones below ask for something broader, and this is a kind of it — so they take it as it stands.
Also accepted where something broader is wanted
These ask for an object this one is a kind of. Narrowing composes in that direction and only that direction: handing on something broader than a process asks for would be a skipped conversion.
- Compile a circuit to a specific device
Turn a circuit written as arbitrary unitaries over abstract qubits into an executable instruction sequence for one machine's own gate set and connectivity graph. The result is functionally equivalent, or equivalent to within a stated approximation error.
- Satisfy the hardware connectivity constraint
Place logical qubits on physical ones and schedule connectivity-repair operations — usually SWAPs — so that every two-qubit gate acts on a coupled pair. The problem combines subgraph isomorphism with token swapping.
- Approximate a continuous rotation in a discrete gate set
Given a target single-qubit unitary — typically a z-rotation by an arbitrary angle — and a precision , produce a finite word over a fixed discrete gate set such as Clifford+T whose product is within of the target in a stated metric. The cost is charged in non-Clifford gates.