Three standard objectives are state preparation, observable optimization and process implementation. All optimizations are over admissible control inputs and a specified final time .
For state preparation, steer an initial density operator to a target . An exact goal is , or one may minimize the squared Hilbert-Schmidt distance
For a pure target , maximizing is a useful alternative. The target must be physically attainable: Hamiltonian engineering alone preserves the initial spectrum of the density operator.
For an observable objective, choose a Hermitian operator and maximize its expected final value:
Population transfer is a special case with the projector onto the desired level or subspace; suppressing an unwanted population reverses the sign or minimizes this quantity.
For coherent process engineering, implement a target unitary operator on every input, rather than merely arranging one state transfer. If the propagator is , a phase-insensitive error is
The error vanishes precisely when : equality in the Hilbert-Schmidt inner product Cauchy-Schwarz inequality bound makes the two operators proportional. For an open-system process, the analogous objective compares the implemented quantum channel with the target channel. These objectives can be supplemented by pulse-energy, amplitude, bandwidth and duration constraints in quantum optimal control.
The target specifies the desired output; the controller selects a control input; an actuator realizes it on the system; and the sensor returns a measured output. The environment supplies additional interactions and disturbances. A simple loop is:
Figure 1.
Quantum control loop, showing the measurement record and measurement backaction
. Details.
For a quantum sensor, a measurement in quantum mechanics has statistical outcomes and generally changes the state through measurement backaction. For example, outcome of an instrument with operator has probability and conditional state
A single unknown quantum state cannot generally supply its complete instantaneous state vector to a controller. Noncommuting observables cannot be read simultaneously with arbitrary precision, and reliable quantum state tomography normally needs many reproducible preparations. A conditional state estimate can instead be updated from a continuous record, with its disturbance included in the model.
Quantum actuators change a Quantum Hamiltonian through applied electromagnetic fields, tunable interactions or couplings to auxiliary systems. A closed-system actuator implements unitary operators, so it preserves the spectrum and purity of a density operator; it cannot arbitrarily overwrite a state as a classical assignment operation could. Dissipative actuators or measurement in quantum measurements can change these invariants, but their dynamics must be accounted for.
The environment can entangle with the system, causing decoherence and dissipation when unobserved degrees of freedom are traced out. It is consequently part of the dynamical model, rather than just an additive classical disturbance. Conversely, Markovian reservoir engineering uses such coupling constructively to prepare and stabilize states.
In open-loop control the applied waveform is prescribed without using measurements from the current evolution. In closed-loop control it depends on the available measurement record or inferred state. Measurement-based quantum feedback is one realization of the latter; experimental adaptation across repeated preparations is another. The measurement record is classical information, but its production has quantum backaction.
Take a normalized environment quantum state
The Controlled-Z gate is symmetric between the two qubits, so it can be written with the environment as the controlling system:
Expanding the joint density operator after the interaction gives
In the partial trace, the two off-diagonal environment operators have trace zero, while each diagonal projector has trace one. Hence
Equivalently, the Kraus operators are and , and . This explicit Stinespring dilation describes the system's dephasing by discarding information in the environment. A fresh environment in this state at each storage interval also realizes the memoryless iteration used in part (a).
Independent applications of the phase-flip channel are a classical mixture of the eight physical Pauli Z gate error patterns. A specified weight- pattern has probability . The recovery from the preceding part succeeds on weight zero and one, and yields the logical Pauli X gate on weight two and three. There are three weight-two patterns and one weight-three pattern, so the logical failure probability is
Averaging the corrected branches gives the complete decoded quantum channel
In particular, the leading logical error is , rather than an error of first order in . For the stated range,
Thus the failure probability is smaller than the physical error probability. The decoded channel is a bit-flip channel; it is not , whose error operator would be . This distinction follows from the logical codeword exchange in the phase-flip repetition code.
Number the three data qubits from top to bottom. It suffices initially to follow a pure input ; linearity will extend the result to every density operator. The first two controlled-NOT gates create . The first layer of Hadamard gates then encodes this as
the three-qubit phase-flip repetition code. Let indicate whether a Pauli Z gate occurred on data qubit during storage. The next layer of Hadamard gates uses and gives
The two initially zero syndrome quantum ancillas receive the adjacent parities. In the diagram's top-to-bottom order, their error syndrome is
Both terms of the logical superposition have these same parities, so the syndrome is independent of . Measuring it reveals no logical-state information.
At the marked position of in the printed circuit, there has already been another layer of Hadamard gates on the data. There is also a layer immediately after . Thus a desired correction in the parity-extraction frame must be implemented as at the actual recovery location, since . Choose the recovery according to
The two patterns on each row share a syndrome because complementing all three bits does not change either parity. For a weight-zero or one error, the recovery removes the entire error in the parity-extraction frame. The remaining state is , and the two final controlled-NOT gates give .
For a weight-two or three error, minimum-weight recovery instead leaves all three bits flipped, giving . The final controlled-NOT gates send this to . Consequently, for every input density operator,
The logical failure is a Pauli X gate after decoding, even though the stored physical errors were Pauli Z gates: exchanges the two encoded codewords. This is the logical failure of the three-qubit phase-flip repetition code.
Since , the off-diagonal multiplier of the iterated phase-flip channel tends to zero. Thus
Let and be the computational basis measurement projectors. The nonselective projective measurement channel is
which is exactly the displayed limit. Its diagonal entries retain the original outcome probabilities; the measurement outcome is ignored and the coherences are erased. The limiting evolution is therefore the completely dephasing channel.
For nonnegative integers , assume the storage channel over successive intervals of length composes as . This is the memoryless interpretation of the specified storage law. In the computational basis, write the density operator as
Conjugation by the Pauli Z gate reverses the off-diagonal entries and leaves the diagonal entries unchanged, so
After applications of the phase-flip channel, the multiplier is . Comparing with the multiplier of a single phase-flip channel gives
For this gives the identity channel. Equivalently, composing two consecutive phase errors cancels them because , so their effective probability obeys . The same expression solves this recurrence. The iterated phase-flip channel formula presumes this composition law; specifying a channel at one time alone would not constrain a memory-bearing environment at later times.
Let for an integer , and put . Use the fixed phase-measurement angles and a fixed final computational basis measurement. Denote their outcomes by . The adaptive construction would instead use when and when .
For the printed measurement vectors,
Therefore and define the same unordered pair of rank-one linear projections; the labels are exchanged if and only if . In the branch , the outcome that would be called in the adaptive experiment is thus . In both branches,
The output correction from the preceding part becomes
If is even this reduces to ; if is odd an additional is included. This equatorial measurement relabeling at Clifford angles changes only the classical interpretation, not any physical measurement basis.
All four fixed single-qubit projective measurements act on different vertices, so their operators commute. They can be performed simultaneously, with the displayed classical correction applied afterward. The first angle may be arbitrary: it was never adaptive. Only the sign choice for the third angle needed to be replaced. Thus the simulation is nonadaptive for every .
Label the chain cluster state from top to bottom by , and let be the phase-measurement outcomes on the first three vertices, with raw computational basis outcome on vertex four. Repeated one-bit teleportation leaves the last qubit, up to global phase, in
This sequential description applies even though the whole graph state is prepared first: a later Controlled-Z gate acts only on unmeasured qubits and commutes with earlier single-qubit measurement operators. It can therefore be moved past those measurements for the purpose of calculating each conditional branch.
Take and , so . After the second measurement the logical state is
For binary , the identities proved above imply the Pauli-frame propagation along a measurement wire rule
where means equality up to global phase. Choose the third angle adaptively as . Then , and
Reading the target circuit in temporal order gives its premeasurement state
Consequently
The Pauli Z gate changes only phases in the computational basis, while the Pauli X gate exchanges its two measurement outcomes. Thus the explicit choices are
Indeed, for every earlier outcome branch,
Hence averaging over the earlier random outcomes leaves exactly the target probability distribution. This implements the desired measurement-based quantum computation without physically removing the final Pauli frame.
Write the normalized input quantum state as . The fresh quantum ancilla is , so the Controlled-Z gate creates
Applying the measurement bra to the first qubit leaves the unnormalized second-qubit vector
Since form an orthonormal basis,
Also , while the Pauli X gate fixes and changes the sign of . Dividing by the branch norm therefore gives
This is one-bit teleportation with the present positive-exponent measurement vectors; the transferred logical gate is .
Using the printed measurement-vector convention, the unitary operator is
Thus it is a phase gate followed by a Hadamard gate, with angle sign opposite to the parameter in the catalogued J gate. Its rows are the conjugate transposes of the orthonormal measurement vectors, so it is unitary. Right multiplication by the Pauli Z gate changes the sign of the second column, which is exactly the effect of left multiplication by the Pauli X gate, exchanging the two rows. Explicitly,
Similarly, right multiplication by the Pauli X gate exchanges columns, giving
Therefore the exact identities, retaining the global phase in the second one, are
These supply Pauli-frame propagation along a measurement wire.
List the known distinct strings in as , where , and use an -qubit index quantum ancilla. Apply Hadamard gates to that register to prepare
First, for each with , apply the available unitary operator that transposes and . The pairs are disjoint because they have distinct index labels. Skip a transposition when the two vectors coincide. This produces
Second, for each , transpose and . These pairs are disjoint because the data strings are distinct. No pair contains the term with , and no later transposition moves an earlier output. The final state is exactly
This clean subset superposition preparation uses at most of the given transpositions and Hadamard gates. Since , is polynomial in ; multiplying this count by the assumed polynomial size of each transposition gives a polynomial-size quantum circuit. The index quantum ancilla returns to zero, so the data register is a pure uniform superposition state, rather than a mixture obtained by discarding its index. The construction uses an available enumeration of the known subset; a membership oracle alone would not justify that enumeration.
For , induction using the Grover rotation angle gives
The quantum measurement in the computational basis therefore returns with probability . Since , the first angle interval attaining the required success is
The first successful Grover iterate is consequently
Indeed, this is the first integer at or above the lower endpoint requirement . The inequality also implies , so this iterate cannot overshoot the first success interval. Every smaller nonnegative integer lies before that interval and fails the threshold. Finally, for , so
For the singleton case , measuring the initial state already returns with certainty, and . For , the requested threshold is only , so zero iterations already suffice. These boundary cases agree with the search guarantee.
For , use the orthonormal basis from the preceding part. Both reflection operators preserve , because their reflected vectors belong to it. With and , their restricted matrices are
Multiplying in the specified order, including the overall minus sign, gives
Equivalently,
In particular, sends to . This proves the Grover rotation angle description with the signs appropriate to these reflection operators.
Write . For , the unmarked computational basis vectors in give the normalized vector
Its norm is one and , so these two vectors form an orthonormal basis for . Splitting the uniform superposition state into its marked and unmarked terms gives
The nonnegative coefficients select the specified angle in .
There is one degenerate boundary case: if , then and is one-dimensional. No vector in can complete to a two-element orthonormal basis. Thus the printed two-dimensional description needs . For the search itself is already solved, with and no query.
A classical query with known answer bit reveals exactly the one bit , since it returns . For the four promised Boolean functions, the value table is
Every possible first query splits the four alternatives into one class of size one and another of size three. On the branch with three remaining alternatives, a second binary answer can separate at most two classes. At least two alternatives therefore still agree on that branch, regardless of how the second query was chosen adaptively. This decision tree argument proves that a procedure guaranteed to identify every alternative needs at least three queries in the worst case.
For sufficiency, query . The three-bit answer strings for are respectively , which are all distinct. Hence the exact classical worst-case query requirement is three. Some individual branches can terminate sooner; the lower bound does not assert that every oracle requires three queries.
In the ordered computational basis , the first two qubits of have amplitudes , while those of have amplitudes . Both have the same normalized answer qubit . Their inner product is therefore
A common unitary operator preserves this nonzero inner product. To distinguish the alternatives with certainty using the prescribed quantum measurement in the computational basis, their first-register outcome supports would have to be disjoint: every outcome possible under one alternative must be impossible under the other. Vectors with disjoint computational basis supports have zero inner product, contradicting its preservation. Thus no such exists. This is also an instance of perfect discrimination of pure states requires orthogonality; allowing a more general measurement in quantum mechanics would not rescue this pair of states. The obstruction concerns these prepared oracle-output states, rather than every conceivable oracle-query procedure.
All four promised functions have . Use quadratic Boolean phase cancellation: apply a Controlled-Z gate to remove the phase , then apply the Walsh-Hadamard transform. With the rightmost gate acting first, choose
Because and the Controlled-Z gate commutes with the Pauli Z gates,
The quantum measurement in the computational basis consequently produces
Each answer occurs with probability one for its promised Boolean quantum oracle.
When , the first two qubits after the Boolean quantum oracle are . The Hadamard gate obeys for . Applying the Walsh-Hadamard transform therefore gives
Consequently the quantum measurement in the computational basis has the deterministic outcomes
These four distinct answers identify the four promised Boolean quantum oracles with one query and certainty. The constant term does not affect the measurement in quantum mechanics, because a global phase does not change its probabilities.
The answer qubit enters the Boolean quantum oracle in , because the Pauli X gate followed by the Hadamard gate maps to . Since , quantum phase kickback multiplies the component by and leaves the answer qubit unchanged. The two input qubits enter in the uniform quantum superposition . Thus
Equivalently, using the Controlled-Z gate and the Pauli Z gate,
Here the exponent in the phase may be evaluated as an ordinary integer, since its parity agrees with the exclusive or expression. In particular, contributes only a global phase.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact