Foundation lesson · do not skip this if you are new
A quantum algorithm is not given a NumPy array for free. Before discussing speedups, we must say how classical data, matrix entries, or a linear operator become quantum operations. State preparation, query oracles, and block encodings are three different access contracts.
Contract. Build a circuit P that creates the input quantum state you actually want to use.
Why it matters. Algorithms that start from amplitude-encoded data need this state before any later quantum subroutine can help. Preparation cost is therefore part of the end-to-end algorithm, not decorative preprocessing.
The Pauli-X and Hadamard cases show the smallest exact examples.
Contract. Ask a reversible black box for a matrix entry encoded in a work register.
Why it matters. Query-complexity theorems often count how many times the oracle is called, but a real fault-tolerant implementation must also build the arithmetic and memory circuit hidden inside that call.
The GHL Robin paper explicitly contrasts this model with its gate-level construction.
Contract. Embed a possibly non-unitary matrix A as the clean ancilla block of a larger unitary U_A.
Why it matters. Quantum hardware applies unitary gates. Block encoding is the interface that lets algorithms such as QSVT and Hamiltonian simulation manipulate a general structured matrix through a unitary circuit.
BE Case 1, the cubic diagonal family, and the Robin case all certify this contract.
How to read a quantum circuit
wireA horizontal wire is one qubit/register. Time flows from left to right.|0>A ket at the left fixes the input state of that wire.H, X, RYA box is a gate. Its matrix acts when the state reaches that box.controlA control dot means another gate acts only when the control condition is satisfied.daggerU† means the inverse/conjugate-transpose circuit; it often uncomputes temporary information.ancillaAn ancilla is workspace. A clean block-encoding proof normally requires selected ancillas to start and end in |0>.measurementMeasurement converts quantum amplitudes into classical outcomes; it is different from the coherent unitary part of the circuit.The H-plus-CNOT circuit above prepares the Bell state \((|00\rangle+|11\rangle)/\sqrt2\). The same visual grammar is used in the case studies; larger diagrams only add named registers and uncomputation.
“quantum state vectors are unit vectors with respect to the Euclidean norm.”Quantum circuitsIBM Quantum Learning / John Watrous
“The flow of information along the wires goes from left to right”Lecture Notes on Quantum Algorithms for Scientific ComputationLin Lin
“A more general input model, as will be discussed in this chapter, is called ‘block encoding’.”
New to quantum computing? Start here.
A classical program updates bits. In the circuit model used here, a quantum program applies reversible linear transformations to complex amplitude vectors and reads classical outcomes through measurement.
Textbook / teaching anchor
Standard textbook reference for quantum mechanics, qubits, gates, and the circuit model.
Textbook / teaching anchor
Circuit-first computer-science viewpoint on qubits and quantum information.
Textbook / teaching anchor
Beginner-friendly state-vector, measurement, multi-system, and circuit explanations.
Textbook / teaching anchor
Foundations, entanglement, circuits, algorithms, and error correction.
Guided reading
Learn the finite matrix and circuit conventions once. Then follow State Preparation or Block Encoding as a separate construction problem. The final chapters explain how ASPBE searches, verifies, exports, and reports both.
Reading map
A prepared state can supply a component to some block-encoding routes. The acceptance contracts remain distinct.
flowchart TB F["Shared foundations<br/>finite matrices, basis states, circuits"] F --> S1["State preparation"] S1 --> S2["State action and<br/>first-column certificates"] S2 --> S3["Prepared-state routes<br/>and reusable PREPARE components"] F --> B1["Block encoding"] B1 --> B2["Ancillas, register order,<br/>normalization and projection"] B2 --> B3["Composition, dilation,<br/>LCU and QSVT interfaces"] S3 -. "may supply a PREPARE component" .-> B3 S3 --> H["ASPBE search,<br/>verification and exports"] B3 --> H classDef shared fill:#f8f5ee,stroke:#826a32,color:#222222,stroke-width:1.5px; classDef state fill:#edf5f1,stroke:#2f7355,color:#18382b,stroke-width:1.5px; classDef block fill:#eef3f7,stroke:#49677d,color:#1f2e39,stroke-width:1.5px; classDef system fill:#ffffff,stroke:#64747a,color:#222222,stroke-width:1.25px; class F shared; class S1,S2,S3 state; class B1,B2,B3 block; class H system;