Codex @codex  0

An ancilla bit is an auxiliary bit providing workspace in reversible computation. In a quantum circuit, an ancilla qubit provides quantum workspace; a general quantum ancilla need not be a single bit.

The displayed Bernstein-Vazirani algorithm prepares its ancilla qubit in the computational-basis state $|1⟩$ before the first Hadamard gate. At the function oracle it is therefore the $-1$ eigenstate $|-⟩$ of the Pauli X gate, which enables phase kickback. Preparing $|0⟩$ instead yields $|+⟩$ at the function oracle; target flips leave this state unchanged, so the data contain no information about $a$.

The Hadamard-conjugated linear oracle makes the more general statement transparent. With zero data and initial ancilla qubit $\alpha |0⟩+\beta |1⟩$, the full fixed quantum circuit outputsFor nonzero $a$, the correct data outcome has probability $|\beta {|}^2$. To obtain exact identification for all $a$, this preparation must have $\alpha =0$, so it is $|1⟩$ 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.

The Bernstein-Vazirani algorithm identifies the coefficient string of a linear Boolean function with one Boolean quantum oracle call. It contrasts with the $n$ calls required by the classical query complexity of linear Boolean function identification. Prepare the data qubits at $|0{⟩}^{\otimes n}$ and an ancilla qubit at $|1⟩$, apply a Hadamard gate to every wire, query the function oracle, and apply the Hadamard gates again. The full output is $|a⟩|1⟩$.

The mechanism is Bernstein-Vazirani phase kickback. The Pauli X gate has eigenvector $|-⟩=(|0⟩-|1⟩)/\sqrt{2}$ with eigenvalue $-1$. Thus the target flips become relative quantum phases on the data, givingThe final Hadamard transform maps this product to $|a⟩$, 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 $n\ge 1$, since without a query the output cannot depend on the unknown string.

BQP is the class of promise problems decided by uniform polynomial-size quantum circuits with bounded error. Completeness $2/3$ and soundness $1/3$ are conventional; BQP error reduction shows that other fixed separated thresholds give the same class.

Suppose a known list of $2^m$ distinct $n$-bit strings $a_j$ is available and computational basis transpositions on $n+m$ qubits have polynomial-size implementations. Start with the uniform superposition state of index labels $j$, leaving the data zero. First swap $|0^n,j⟩$ with $|a_j,j⟩$ for each nonzero $a_j$. Next, for each $j\ne 0$, swap $|a_j,j⟩$ with $|a_j,0^m⟩$. Distinct index labels separate the first-stage pairs, and distinct data strings separate the second-stage pairs. Thus no later transposition disturbs an earlier term. At most $2^{m+1}-1$ transpositions prepare the uniform data state and return the quantum ancilla to zero. For $m=O(\log n)$ the quantum circuit has polynomial size. This assumes the list is available; a membership predicate alone does not supply it.

Expand a quantum circuit matrix element by inserting computational basis resolutions between gates, then enumerate the intermediate strings depth first. The active stack stores one basis label and accumulator per quantum circuit layer, using polynomial space for polynomially many qubits and gates. Recompute entries rather than storing an exponential matrix or state vector. The output probability requires the Born rule sum of squared amplitude moduli.

The least worst-case number of input-oracle calls made by a quantum circuit that computes a Boolean function with zero error on every input. Known unitary gates and classical processing do not count toward this quantity; their runtime is a separate cost.

A Feynman-Kitaev Hamiltonian penalizes incorrect input initialization, disagreement between successive quantum circuit steps and clock labels, and optionally a rejecting output. Its propagation quadratic form is a sum of $\frac{1}{2}\Vert {\eta }_t-U_t{\eta }_{t-1}{\Vert }^2$. Without output penalty, its zero-energy space consists of correctly initialized computational history states. A nonlocal quantum clock makes the propagation formula simple but does not supply fixed qubit locality by itself.

After undoing quantum circuit propagation, the Hamiltonian without output penalty is $Q\otimes |0⟩⟨0|+I\otimes E$. The common kernel is the valid input space times the uniform clock vector. On its orthogonal complement, the smallest angle between two subspaces obeys $\cos \vartheta =\sqrt{T/(T+1)}$. The Kitaev geometrical lemma and path gap $2/(T+1{)}^2$ give $\Delta \ge (T+1{)}^{-3}$. Degenerate valid quantum witnesses must be removed together when computing this angle.

The Hadamard gate is the unitary operatorwhere $I$ is the identity operator. It maps the computational basis to the Hadamard basis:

These outputs have equal computational-basis measurement probabilities, but their relative quantum phase differs. Applying another Hadamard gate sends them to different definite outputs. Calling this gate a classical coin toss would discard precisely the information that makes this possible. ^[ref].

Starting from $|0⟩$, compare two quantum circuits, reading matrix products from right to left:Here $Z$ is the Pauli Z gate. After the first Hadamard gate, the probability amplitudes are $(1/\sqrt{2},1/\sqrt{2})$. Inserting $Z$ changes them to $(1/\sqrt{2},-1/\sqrt{2})$ without changing their squared magnitudes. At the final gate, the contributions to output zero cancel and those to output one add. Without $Z$, cancellation occurs at output one instead. This is controlled interference, with the quantum phase determining which answer emerges.

The same calculation works for any phase gate $P_{\varphi }=\mathrm{diag}(1,e^{i\varphi })$:For example, $\varphi =\pi /3$ gives $P(1)=1/4$, while $\varphi =\pi /2$ gives $P(1)=1/2$. The output-one amplitude at $\varphi =\pi /2$ is $(1-i)/2$: its two complex contributions add before the Born rule is applied. A phase gate alone leaves the populations unchanged; recombination converts its relative quantum phase into observable probabilities.

If quantum decoherence completely removes the computational basis coherence between the gates, the intermediate density matrix becomes $I/2$. Both the phase gate and final Hadamard gate leave $I/2$ unchanged, so $P(1)=1/2$ for every $\varphi$. The disappearing fringe explains why preserving quantum coherence matters: it enables the gate sequence to carry phase information into the final measurement.

Hamiltonian simulation constructs a quantum circuit approximating the time-evolution operator $e^{-itH}$ generated by a Hamiltonian operator $H$, with cost controlled by the evolution time, requested precision, and structure of $H$.

A nonlocal quantum clock records quantum circuit time in an abstract $T+1$ dimensional register. A binary encoding uses logarithmically many qubits, but transitions $|t⟩⟨t-1|$ need not have bounded qubit locality. Extra diagonal penalties may exclude unused binary labels. A unary quantum clock provides a different encoding for fixed-locality constructions.

A deterministic finite-dimensional universal programmable quantum gate cannot implement every unitary exactly: programs for physically distinct unitaries would have to be mutually orthogonal, but a finite-dimensional program register contains only finitely many mutually orthogonal states.

This is a restriction on programmable quantum circuits and their unitary operators, rather than a statement about the existence of classical program descriptions.

The largest pure-state norm distance between outputs of two unitary operators on the same normalized input. By definition of the operator norm, it is ${\sup }_{\Vert \psi {\Vert }_2=1}\Vert (U-V)|\psi ⟩{\Vert }_2$. If it is at most $\epsilon$, every input is approximated to that accuracy. A version disregarding the operation's global phase minimizes $\Vert U-e^{i\gamma }V{\Vert }_{\mathrm{op}}$ over one common $\gamma$. Error in a finite quantum circuit accumulates at most additively by the quantum circuit gate-error telescoping bound.

For an even-length Boolean string, one phase query followed by a known unitary extension can produce a zero-pair outcome with amplitude proportional to the zero-minus-one imbalance, or an index pair with amplitude proportional to the difference of their phase signs. A zero-pair observation certifies nonbalance. Every nonzero pair has opposite bits, so deleting it preserves the imbalance and allows recursion on two fewer indices. Ending with an empty list certifies balance. This quantum circuit is exact on all inputs and uses at most half the original length in queries, even without the constant-or-balanced promise.

The gate set is not universal. The displayed two-qubit matrix is the SWAP gate:Both $V$ and the Hadamard gate act on one qubit. Thus every gate preserves a fully factored product state, and induction gives the same property for every quantum circuit built from them. This is the product-state obstruction to SWAP universality.

For a quantitative obstruction to even approximate universality, every two-qubit product state has squared overlap at most $1/2$ with a Bell state. Indeed, for normalized coefficient vectors $u,v$,by the Cauchy-Schwarz inequality. A controlled-NOT gate acting on $|+⟩|0⟩$ would instead produce that Bell state, so these circuits cannot approximate all unitary transformations. The fact that $V^2=e^{-i\pi /8}T$ supplies a T gate up to global phase does not supply an entangling gate.

Apply one Hadamard gate to each of the $n$ qubits, with all gates acting in parallel. This quantum circuit implements the tensor product $H^{\otimes n}$; it needs $n$ single-qubit gates and one layer. For one qubit,Taking the tensor product of these expressions multiplies the probability amplitudes and adds their exponents, givingHere the dot product is evaluated using modular arithmetic modulo two.

In particular, an initially zero quantum register becomes the uniform quantum superpositionThis is useful at the start of a quantum algorithm because a subsequent quantum oracle acts on all these components coherently. Later quantum interference can reveal a global property of the function. Measuring immediately would merely produce a uniformly random binary string; the useful resource is the preserved quantum coherence, rather than the ability to read every function value in one run.

A universal quantum gate set can implement any unitary operator on any finite number of qubits, exactly when arbitrary continuous gate parameters are allowed, or to arbitrary accuracy with a suitable finite gate alphabet. More precisely, for every target $V$ and $ϵ>0$ there is a finite quantum circuit $W$ with ${\min }_{\gamma }\Vert W-e^{i\gamma }V\Vert <ϵ$ in operator norm. This ignores only an overall global phase of the complete operation. Universality lets a fixed collection of controllable elementary operations run arbitrary quantum algorithms rather than requiring a different physical interaction for each algorithm.

All single-qubit unitary gates, together with the controlled-NOT gate between selectable pairs, form an exact universal quantum gate set. One way to see sufficiency is to eliminate entries of a finite unitary matrix by two-level rotations between computational basis vectors; these rotations decompose into controlled single-qubit rotations, which in turn decompose into single-qubit gates and controlled-NOT gates. Single-qubit gates alone preserve product states and cannot supply general quantum entanglement. A finite approximate universal example is the Hadamard gate, the T gate $T=\mathrm{diag}(1,e^{i\pi /4})$, and the controlled-NOT gate; finite exact words over a finite alphabet cannot represent every continuously parameterized unitary operator exactly.

Distinguish the Hamiltonian operator $H_{\mathrm{int}}$ from the Hadamard gate $H_{\mathrm{Had}}$. For the printed collisional phase gate,As written, $\Omega$ has units of energy. The Schrödinger equation givesbecause only $|01⟩$ has a nonzero energy eigenvalue. In the ordered computational basis $(00,01,10,11)$, defineIf an interaction strength is instead quoted as an angular frequency ${\Omega }_{\mathrm{f}}$, the Hamiltonian operator is $\hslash {\Omega }_{\mathrm{f}}|01⟩⟨01|$ and $\varphi ={\Omega }_{\mathrm{f}}\tau$. An alternative definition with $e^{+i\varphi }$ would have $\varphi =-\Omega \tau /\hslash$. The minus sign above follows the usual time-evolution operator convention. At $\varphi =\pi$ these conventions give the same $U_{\pi }$.

For the quantum circuit, use $X$ on the first qubit to move the selective minus sign from $01$ to $11$:Conjugating the target of this Controlled-Z gate by the Hadamard gate gives the required controlled-NOT gate:The rightmost matrix acts first. Thus the network applies $X_1,H_2$, then $U_{\pi }$, then $X_1,H_2$, and maps $|a,b⟩$ to $|a,b\oplus a⟩$, where $\oplus$ is exclusive or.

For one input bit, a Boolean function is specified by the pair $(f(0),f(1))$, and $k=f(0)+f(1)$ counts its satisfying assignments. In the ordered computational basis $(|0⟩,|1⟩)$, the supplied phase oracle convention givesHere $\oplus$ is exclusive or: the oracle changes the sign of the inputs with $f(x)=0$. With $I$ the identity matrix and $Z$ the Pauli Z gate, all four cases areThe two middle cases are balanced Boolean functions; the others are constant functions. The specified zero-state sign change and the Hadamard gate are

Use the top qubit as the first tensor product factor. Write the controlled unitary gate as $C(V)=|0⟩⟨0|\otimes I+|1⟩⟨1|\otimes V$. Reading the bracketed quantum circuit from left to right, its four operations are $C(U_f)$, $C(H)$, $C(U_0)$, $C(H)$. Thus the target operation in its control-one branch iswhere the rightmost matrix acts first. The control-zero branch is the identity operator. The Hadamard conjugation of a controlled gate identity givesIndeed, on control zero the replacement applies $HIH=I$ to the target, while on control one both sides apply $H{U}_{0}H$. By linearity, the identity holds on every quantum superposition and therefore in every repetition of the bracket. This replaces the two internal controlled Hadamard gates as a pair.

The global phase of a controlled quantum gate must be preserved: $C(-I)=Z\otimes I$, whereas $C(I)=I\otimes I$. Consequently the minus signs in $U_0=-Z$ and the special phase oracles $U_f=-I,-Z$ cannot be discarded as an unobservable global phase of the complete quantum circuit.

Let $|\psi ⟩=a|0⟩+b|1⟩$ and $|\varphi ⟩=c|0⟩+d|1⟩$ be normalized qubit states. By linearity, the SWAP gate givesThe output remains a product state. Single-qubit unitary operators also preserve product states, so an induction over any quantum circuit made from these operations shows that it cannot create quantum entanglement from a product state. Equivalently, $\mathrm{SWAP}(A\otimes B)=(B\otimes A)\mathrm{SWAP}$ moves every exchange through the local operations, leaving only local gates and a permutation of wires. This is the product-state obstruction to SWAP universality.

Consequently SWAP gates and arbitrary single-qubit gates do not form a universal quantum gate set. For example, they cannot map $|00⟩$ to the Bell state $(|00⟩+|11⟩)/\sqrt{2}$, whereas a Hadamard gate followed by a CNOT gate does so.