State
Circuit for e^{-iHt}
Time evolution under a Hamiltonian, approximated to a stated error, with the query or gate count and the norm parameter the count is measured against. It is a circuit, not an answer — something still has to run it on a state and read the result.
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
- Evolution circuit, input in hand
An evolution circuit together with the preparation routine for the input it acts on. The pair is still a circuit — its error and its count are unchanged — and it is also the routine that makes the evolved state: run it and the state is in hand, control and invert it and an estimation readout can call the whole simulation as a subroutine.
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
- Simulate Hamiltonian evolution
Implement to error given some access model for . It is an application in its own right and also the engine inside phase estimation and several linear-system solvers.
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.