Ancilla-assisted Pauli measurement Created 2026-09-28 Updated 2026-11-05
Prepare an ancilla in , use it to control a Hermitian Pauli operator , apply a Hadamard gate, and measure the ancilla. Outcome applies the projector to the data register.
The displayed Bernstein-Vazirani algorithm prepares its ancilla qubit in the computational-basis state before the first Hadamard gate. At the function oracle it is therefore the eigenstate of the Pauli X gate, which enables phase kickback. Preparing instead yields at the function oracle; target flips leave this state unchanged, so the data contain no information about .
The Hadamard-conjugated linear oracle makes the more general statement transparent. With zero data and initial ancilla qubit , the full fixed quantum circuit outputsFor nonzero , the correct data outcome has probability . To obtain exact identification for all , this preparation must have , so it is up to global phase. This is a condition on the prescribed preparation circuit: any alternative quantum state preparation that supplies at the function oracle is equivalent.
Backward Pauli updates for Hadamard and phase gates Created 2026-10-06 Updated 2026-11-05
For the binary phase representation of a Pauli string, these local rules implement for the Hadamard gate and the phase gate . In particular , so the phase update differs in sign from forward conjugation. Use the old input bits, and reduce modulo four.
Balanced Hadamard interaction-free measurement Created 2026-10-25 Updated 2026-11-05
With two Hadamard gates as mixers, an unobstructed zero-phase arm gives only port 0 for upper-port incidence. An ideal absorber in arm 1 acts on the intermediate superposition . It absorbs with probability ; its no-absorption branch is the unnormalized state . Recombination gives amplitude at each surviving output, so the dark-port success probability is . The result assumes a calibrated transparent alternative and an ideal absorber; a dark-port event alone does not establish those apparatus assumptions.
Bell-basis conversion circuit Created 2026-10-07 Updated 2026-11-05
Apply a Hadamard gate to the first qubit, then a controlled-NOT gate from the first to the second. This maps a computational-basis state to the Bell state with phase bit and parity bit . Its inverse uses the same gates in reverse order because each gate is self-inverse but they do not commute. Applying the forward sequence twice is not generally a decoding operation.
Bell-state measurement 2026-11-05
A Bell-state measurement distinguishes the four two-qubit Bell states. Ideally its four measurement operators are the rank-one orthogonal projectors onto , , and . It measures joint parity and relative-phase information, rather than the two qubits separately in one local basis.
A circuit realization applies a CNOT gate with the first qubit as control, then a Hadamard gate to that qubit, followed by computational-basis measurements of both. These gates map the Bell basis to four distinct computational-basis states. A complete result therefore carries two classical bits and supplies the correction label in ideal quantum teleportation. A restricted experimental analyzer may distinguish fewer than all four outcomes.
Bernstein-Vazirani algorithm 2026-10-24
The Bernstein-Vazirani algorithm identifies the coefficient string of a linear Boolean function with one Boolean quantum oracle call. It contrasts with the calls required by the classical query complexity of linear Boolean function identification. Prepare the data qubits at and an ancilla qubit at , apply a Hadamard gate to every wire, query the function oracle, and apply the Hadamard gates again. The full output is .
The mechanism is Bernstein-Vazirani phase kickback. The Pauli X gate has eigenvector with eigenvalue . Thus the target flips become relative quantum phases on the data, givingThe final Hadamard transform maps this product to , so computational-basis measurement recovers every coefficient with certainty. The ancilla preparation for the Bernstein-Vazirani algorithm ensures the required minus sign, and the Hadamard-conjugated linear oracle gives an exact quantum circuit interpretation. One query is optimal for , since without a query the output cannot depend on the unknown string.
Born rule Created 2026-09-24 Updated 2026-10-18
The Born rule connects a quantum state to measurement probabilities. Let be a complete orthonormal basis, finite or countably infinite, for a Hilbert space, and letAn ideal measurement distinguishing these basis vectors returns label with probabilityThis assignment is a physical measurement rule. Its compatibility with total probability one follows from orthonormality and normalization:The probabilities are the squared moduli, not the amplitudes themselves or the squares . [ref].
If the basis is an eigenbasis of an observable, the reported numerical value is its eigenvalue. Several vectors can share one eigenvalue; the probability of that value is then the sum over the corresponding basis labels. More generally, a projective measurement with orthogonal projections assignsfor a pure state and a general density matrix , respectively. This also covers mixed states and degenerate eigenspaces. The Born rule determines outcome statistics; the ideal conditional state change is specified separately by the Lüders rule. See projective measurement for that formulation and its assumptions. [ref]
https://quantum.cloud.ibm.com/learning/en/courses/general-formulation-of-quantum-information/general-measurements/formulations-of-measurements. Watrous, IBM Quantum Learning, Mathematical formulations of measurements, Projective measurements
.For a worked example, take the normalized qubit quantum stateThe squared moduli add to . A computational-basis measurement, equivalently a measurement of the Pauli matrix, hasThese probabilities do not depend on the relative quantum phase . Now choose the Hadamard basiswhose vectors are eigenstates of the Pauli matrix, also used by the Pauli X gate. The new probability amplitudes and probabilities areBoth probabilities are nonnegative and their sum is one. The relative quantum phase becomes visible because the two probability amplitudes add before their squared modulus is taken:
- At , and .
- At , .
- At , and .
The same qubit preparation has phase-independent Z probabilities and phase-sensitive X probabilities
. Details. A Hadamard gate followed by a computational-basis measurement realizes these statistics, since , respectively. Compare the two bases using fresh, identically prepared copies: a preceding measurement may change the state. The quantum superposition section shows why replacing the preparation by the mixed state keeps the statistics but gives for every .
The usefulness of the Born rule is this conversion from linear algebra to experimental predictions: calculate overlaps in the basis actually measured, then take squared moduli. Its appealing geometry is that changing basis redistributes probability while preserving total squared norm. The same rule relates an energy eigenstate expansion to an energy measurement and a position wavefunction to a probability density.
Born's 1926 paper on quantum scattering interpreted the outgoing-wave coefficients in terms of the probabilities of collision outcomes; a corrective footnote specified proportionality to the square of the amplitude. This is a historical scattering formulation, rather than the general density matrix formula above. [ref]
Zur Quantenmechanik der Stoßvorgänge by Max Born. Born, Zur Quantenmechanik der Stoßvorgänge, Zeitschrift für Physik 37, 863–867, 1926
; [ref]https://www.neo-classical-physics.info/uploads/3/0/6/5/3065888/born_-_qm_for_collisions_i.pdf. English translation of Born's paper, p. 3 and footnote 1
. Controlled-Z gate Created 2026-09-29 Updated 2026-11-05
The Controlled-Z gate is . Conjugating the target of a controlled-NOT gate by Hadamard gates turns controlled-NOT into controlled-Z.
Deutsch algorithm Created 2026-10-14 Updated 2026-11-05
The one-input Deutsch algorithm determines whether a Boolean function is constant or balanced using one Boolean quantum oracle call. Initialize the input qubit in and the answer qubit in . Quantum phase kickback changes the input to . A Hadamard gate and computational-basis measurement therefore return the parity with certainty.
Deutsch algorithm with pure dephasing Created 2026-10-14 Updated 2026-11-05
If the input qubit of the Deutsch algorithm acquires conditional environment states with overlap between its two Hadamard gates, its fixed zero-for-constant, one-for-balanced rule succeeds with probability . A known phase can be compensated before the last Hadamard gate, raising the success probability to . An orthogonal pair of environment states gives and destroys all information in the input qubit about the answer; unit overlap modulus preserves coherence up to a known phase.
Dicke-resource telecloning Created 2026-10-14 Updated 2026-10-20
For odd , a symmetric quantum teleportation resource can encode an unknown qubit into . Begin with , apply a controlled-NOT gate from the input to the sender's resource qubit, apply a Pauli X gate to that resource qubit and a Hadamard gate to the input, and measure those two qubits. The four unnormalized remaining vectors are , , and . Each outcome has probability . Since interchanges and , and acts as logical up to the common phase , local Pauli corrections make the output independent of the result. The one-qubit reduction of Dicke-state superpositions givesFor this distributes imperfect copies, as required by the no-cloning theorem. For it reduces to exact quantum teleportation.
Dyadic quantum Fourier transform circuit 2026-10-14
In most-significant-bit-first order, let and . On a computational-basis state, process wire with a Hadamard gate, then controlled phase gates controlled by unprocessed wire for each . Wire becomes . Reversing the final wire order yields the positive-exponent quantum Fourier transform. There are Hadamard gates and controlled phase gates. Physical reversal costs swap operators, each expressible as three controlled-NOT gates, themselves implemented with Hadamard gates and a Controlled-Z gate. Thus the entire construction uses gates from the specified family.
Entanglement-assisted nondemolition parity measurement Created 2026-10-07 Updated 2026-11-05
Share a Bell state meter pair, apply local system-to-meter CNOT gates, and measure each meter in the computational basis. The parity of the local meter records measures system while preserving all coherence within either parity sector. The complete tuple of local records has Kraus operator . Each local record is uniform, and the nonlocal result requires local operations and classical communication to compare records. A local Hadamard gate conjugation supplies the corresponding measurement.
Fast Hadamard transform Created 2026-10-20 Updated 2026-11-05
The fast Hadamard transform computes multiplication by a tensor power of the two-by-two Hadamard matrix using repeated pairwise sums and differences. For input amplitudes, one stage replaces each selected pair by , with factors of when using the unitary convention.
There are stages, each requiring order arithmetic operations, giving order classical work instead of a generic dense matrix multiplication. A quantum circuit implements the corresponding unitary with one Hadamard gate on each of qubits. This compact circuit description does not imply that all resulting amplitudes can be read out in one measurement; the output statistics still follow the Born rule.
GHZ-assisted quantum teleportation 2026-10-25
Share a GHZ state on and let the unknown input be . Alice applies CNOT from to , then a Hadamard gate to , and measures computationally, giving . Charlie measures in the Hadamard basis, giving . Bob's conditional state isup to a global phase. Alice's two bits and Charlie's one bit therefore specify Bob's inverse correction .
To prove the phase rule, write . After Alice's result, is . Taking Charlie's Hadamard basis partial inner product multiplies its second term relative to its first by . The remaining common phase is , which is physically irrelevant. All eight result triples have probability . Charlie's record localizes a known-phase Bell pair, allowing the standard Bell-basis teleportation identity to complete the transfer.
GHZ preparation with Hadamard and controlled-Z gates Created 2026-10-06 Updated 2026-11-05
For , apply a Hadamard gate to one qubit, then controlled-NOTs from it to all others. Replacing each controlled-NOT gate by a target Hadamard, a Controlled-Z gate, and another target Hadamard uses allowed gates. Each one-qubit reduced state is , proving entanglement across each qubit-versus-rest bipartition.
Global phase of a controlled quantum gate 2026-10-24
Multiplying a target unitary operator by changes the controlled operation by a relative quantum phase on its control-one branch. Substitution in proves the displayed identity. In particular, rather than the identity operator. Preparing the control at and applying a final Hadamard gate distinguishes from with certainty, independently of the target quantum state. The global phase of an uncontrolled quantum gate is unobservable, but a specified controlled unitary gate provides a branch relative to which that phase can be measured.
Hadamard basis Created 2026-09-24 Updated 2026-11-05
The Hadamard basis is an orthonormal basis of one qubit consisting of the two eigenstates of the Pauli X gate.
The two states have the same computational-basis measurement probabilities, but opposite relative signs. A Hadamard gate maps them to and , so applying it before a computational-basis measurement distinguishes the states. Relative phase is therefore physically accessible even when one chosen measurement has identical outcome probabilities. [ref]
Qiskit quantum gate documentation by IBM. IBM Quantum, HGate: interchange of computational and plus/minus bases
Hadamard-conjugated linear oracle 2026-10-24
Let be the Boolean quantum oracle for a linear Boolean function, and put . The CNOT gates implement , where the data wires control the ancilla qubit. CNOT control reversal in the Hadamard basis and imply the exact unitary operator identityHere on strings is bitwise exclusive or. To conjugate a product, insert between its factors; each factor reverses its control and target, and the unused Hadamard gates cancel. The global phase is exactly . In particular, the identity holds on arbitrary quantum superpositions, not only on the initialized inputs of the Bernstein-Vazirani algorithm.
