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.

An ancilla qubit is a two-dimensional quantum ancilla. It is the quantum version of an ancilla bit; an auxiliary quantum register can contain several such qubits.

The $m$-qubit bit-flip repetition code stores one logical qubit in $|0_L⟩=|0{⟩}^{\otimes m}$ and $|1_L⟩=|1{⟩}^{\otimes m}$. Its stabilizer generators are $Z_j{Z}_{j+1}$ for $j=1,\dots ,m-1$, and its logical operators are $\overline{X}=X_1\cdots X_m$ and $\overline{Z}=Z_1$. Interchanging the Pauli X gate and Pauli Z gate gives the phase-flip repetition code. For odd $m$, majority-vote decoding of a repetition code corrects up to $(m-1)/2$ physical Pauli X gate errors, assuming ideal operations and a noise family containing only these bit flips.

For $m=3$, prepare two quantum ancillas in $|00⟩$ and apply controlled-NOT gates from the input qubit to each of them. By linearity, encoding sendsThis does not produce $(\alpha |0⟩+\beta |1⟩{)}^{\otimes 3}$, which would contain cross terms. For example, encoding $|+⟩=(|0⟩+|1⟩)/\sqrt{2}$ produces $(|000⟩+|111⟩)/\sqrt{2}$, whereas three independent copies would have eight equal computational basis amplitudes. The encoding creates quantum entanglement when both coefficients are nonzero and respects the no-cloning theorem.

The three-qubit bit-flip syndrome table corrects the family $\{I,X_1,X_2,X_3\}$ and its entire linear span, as specified by the Knill--Laflamme condition. It cannot correct arbitrary errors on one physical qubit: the phase flipcommutes with both checks and acts as logical $\overline{Z}$. In particular, it takes the encoded $|+⟩$ to the orthogonal encoded $|-⟩$ with error syndrome $00$. Thus its full quantum code distance is one, despite correcting one error of the restricted Pauli X gate type. The Shor code, Steane code and five-qubit error correcting code provide protection against arbitrary one-qubit errors.

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.

Encode $u|0⟩+v|1⟩$ as $u|000⟩+v|111⟩$. Four controlled-NOT gates copy the displayed two data parities into initially zero quantum ancillas. No logical amplitude is measured. The error syndromes $00,01,10,11$ correspond respectively to no bit flip and bit flips on data qubits $1,2,3$. Conditional Toffoli gates, with temporary Pauli X gates implementing zero-valued controls, undo the indicated error. Inverse encoding yields the original logical state and a separate syndrome state. A phase flip has zero bit-flip syndrome and remains as a logical phase error; this three-qubit code is not a general single-qubit-error code.

For the transposition map $\Theta :M_d\to M_d$, the induced trace norm is $\Vert \Theta {\Vert }_1=1$, while stabilization givesThus an entangled quantum ancilla can amplify the distinguishability witnessed by transposition by a factor of $d$.

Two angle-zero one-bit teleportations with outcomes $p,q$ implement $X^{q}H{X}^{p}H=X^q{Z}^p$ on an arbitrary input, up to global phase. A Controlled-Z gate with a fixed $|1⟩$ quantum ancilla implements $Z$, so $Z^p$ removes the known $Z$ factor. The result is $X^q$ up to phase. With probability one half the desired Pauli X gate is applied; otherwise the input is unchanged. Repeating until $q=1$ gives an exact heralded correction with two attempts on average and almost-sure termination. It has no finite worst-case measurement count. A Pauli frame avoids this repeat-until-success procedure when only logical action or classical output statistics are required.

On a positive eigenvalue label $\lambda$ and a clean quantum ancilla, the HHL algorithm applies a quantum variable rotation with angle ${\theta }_{\lambda }=\arcsin (c/\lambda )$, where $0<c\le {\lambda }_{\min }$:Uncomputation of the eigenvalue register followed by conditioning on flag one multiplies each input eigenvector amplitude by $c/\lambda$. If $|b⟩$ is normalized, the success probability is $c^2\Vert A^{-1}|b⟩{\Vert }^2$. Choosing $c={\lambda }_{\max }/\kappa$ from a valid condition number bound gives success probability at least $1/{\kappa }^2$.

Apply a Controlled-Z gate to input $a|0⟩+b|1⟩$ and a fresh $|+⟩$ quantum ancilla. Measuring the input in the equatorial qubit measurement basis at angle $\alpha$, with outcome $s$, leaves the unnormalized outputEach branch has probability $1/2$, independently of the input. The logical output is $J(\alpha )|\psi ⟩$ with known Pauli frame $X^s$; the input qubit has been measured, so this does not clone it.

For the Kraus operators of the measurement in quantum mechanics, the Born rule givesThe density matrix $A_i\rho A_i^{†}$ is the unnormalized state of that outcome. It is positive, its trace is $p_i$, and completeness gives ${\sum }_i{p}_i=\mathrm{Tr}\rho =1$. There is no conditional state to assign to an event with $p_i=0$.

For a projective measurement, each $P_i$ is an orthogonal projection, satisfying $P_i=P_i^{†}=P_i^2$. Completeness becomes ${\sum }_i{P}_i=I$. Fix $v$ in the range of $P_j$. ThenSince $P_{j}v=v$, the $j$th summand already equals $\Vert v{\Vert }^2$. All other summands are nonnegative, so $P_{i}v=0$ for $i\ne j$. Consequently $P_i{P}_j=0$, and taking adjoints also gives $P_j{P}_i=0$. This proves the stronger completeness forces orthogonality of measurement projections:

For the unitary dilation of a measurement instrument, take a quantum ancilla with orthonormal states $|0⟩,|1⟩,\dots ,|n⟩$, initially in $|0⟩$. DefineThe completeness equation impliesso $V$ is an isometry. Its action on the input subspace can be extended to a unitary operator $U$ on the enlarged system:Choose orthonormal bases in the two complementary subspaces and map one to the other. Their dimensions agree; the extra unused quantum ancilla level also ensures this extension is possible for an infinite-dimensional system. After the coupling, the joint density matrix is

Now perform a projective measurement on the larger system, withThese are pairwise orthogonal and sum to the full identity. The unused $|0⟩$ level has zero weight in $\Omega$, so merging it into outcome one adds no probability. For every $i$,Its trace is $p_i$, and taking the partial trace over the quantum ancilla after normalization gives exactly ${\rho }_i$. Hence unitary coupling to an quantum ancilla, a projective measurement, and discarding the quantum ancilla reproduce both the probabilities and the conditional states of the general measurement. This is the instrument version of a Stinespring dilation, rather than a construction reproducing only the outcome probabilities.

An oracle can recognize a solution without disclosing it in advance. If an efficiently evaluable or black-box predicate has the promised unique marked input, write $f(x)=1$ exactly for that input. A Boolean quantum oracle computes this predicate reversibly asIts diagonal projector on the search register is ${\sum }_{x}f(x)|x⟩⟨x|=|w⟩⟨w|$. To implement a selectable phase, compute $f(x)$ into a zero quantum ancilla, apply a known phase to its $1$ component, and uncompute. The search register then undergoesThis requires evaluation access to the predicate, not classical knowledge of which input passes it. The $P_{\psi }$ term is known from the Hadamard transform. With Hamiltonian-oracle access, or by controlled short-time simulations of the two terms, their sum can realize continuous-time quantum search.

The unknown projector is supplied through an oracle or a physically encoded recognition rule. It cannot be manufactured for an arbitrary hidden $w$ with no such input-dependent resource. The oracle assumption and the fixed energy scale $\Delta$ are essential when interpreting the square-root search time as a computational advantage.

The first two CNOT gates encode $u|0⟩+v|1⟩$ asthe three-qubit bit-flip repetition code. In the printed detection circuit the first quantum ancilla records $q_3\oplus q_2$ and the second records $q_2\oplus q_1$. Both start in $|0⟩$. For an incoming bit-error pattern $e=(e_1,e_2,e_3)$, the two logical basis branches give the same error syndromeAdding $111$ to a computational string leaves both parities unchanged, so the ancillas acquire no information about $u$ or $v$. The joint state after extraction isThe syndrome measurement therefore preserves the unknown logical amplitudes. For zero or one bit flip the corrections areEach indicated correction squares to the identity and restores the encoded state. The order of the two ancilla labels matters: the printed first ancilla is the $q_2,q_3$ parity, not the $q_1,q_2$ parity. This is coherent syndrome extraction for the three-qubit repetition code with the circuit's specific parity choices.

For later use, an error pattern and its complement have the same syndrome. Minimum-weight recovery corrects patterns of weight zero or one. Patterns of weight two or three instead leave $X_1{X}_2{X}_3$, the logical bit flip that exchanges the two codewords. The code protects against the stated bit-flip channel, not arbitrary single-qubit phase errors.

List the known distinct strings in $A$ as $a_0,\dots ,a_{N-1}$, where $N=2^m$, and use an $m$-qubit index quantum ancilla. Apply Hadamard gates to that register to prepareFirst, for each $j$ with $a_j\ne 0^n$, apply the available unitary operator that transposes $|0^n,j⟩$ and $|a_j,j⟩$. The pairs are disjoint because they have distinct index labels. Skip a transposition when the two vectors coincide. This producesSecond, for each $j\ne 0$, transpose $|a_j,j⟩$ and $|a_j,0^m⟩$. These pairs are disjoint because the data strings $a_j$ are distinct. No pair contains the term with $j=0$, and no later transposition moves an earlier output. The final state is exactlyThis clean subset superposition preparation uses at most $N+(N-1)=2N-1$ of the given transpositions and $m$ Hadamard gates. Since $m=O({\log }_{2}n)$, $N$ is polynomial in $n$; 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.

Write the normalized input quantum state as $|\psi ⟩=a|0⟩+b|1⟩$. The fresh quantum ancilla is $|+⟩$, so the Controlled-Z gate createsApplying the measurement bra $⟨v_k(\theta )|$ to the first qubit leaves the unnormalized second-qubit vectorSince $|+⟩,|-⟩$ form an orthonormal basis,Also $U(\theta )|\psi ⟩=a|+⟩+e^{-i\theta }b|-⟩$, while the Pauli X gate fixes $|+⟩$ and changes the sign of $|-⟩$. Dividing by the branch norm therefore givesThis is one-bit teleportation with the present positive-exponent measurement vectors; the transferred logical gate is $U(\theta )=J(-\theta )$.

Number the three data qubits from top to bottom. It suffices initially to follow a pure input $|\psi ⟩=a|0⟩+b|1⟩$; linearity will extend the result to every density operator. The first two controlled-NOT gates create $a|000⟩+b|111⟩$. The first layer of Hadamard gates then encodes this asthe three-qubit phase-flip repetition code. Let $e_i$ indicate whether a Pauli Z gate occurred on data qubit $i$ during storage. The next layer of Hadamard gates uses $HZH=X$ and givesThe two initially zero syndrome quantum ancillas receive the adjacent parities. In the diagram's top-to-bottom order, their error syndrome isBoth terms of the logical superposition have these same parities, so the syndrome is independent of $a,b$. Measuring it reveals no logical-state information.

At the marked position of $R$ in the printed circuit, there has already been another layer of Hadamard gates on the data. There is also a layer immediately after $R$. Thus a desired correction $X_i$ in the parity-extraction frame must be implemented as $R=Z_i$ at the actual recovery location, since $H^{\otimes 3}{Z}_i{H}^{\otimes 3}=X_i$. Choose the recovery according toThe 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 $a|000⟩+b|111⟩$, and the two final controlled-NOT gates give $|\psi ⟩|00⟩$.

For a weight-two or three error, minimum-weight recovery instead leaves all three bits flipped, giving $a|111⟩+b|000⟩$. The final controlled-NOT gates send this to $(a|1⟩+b|0⟩)|00⟩=X|\psi ⟩|00⟩$. 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: $Z_1{Z}_2{Z}_3$ exchanges the two encoded codewords. This is the logical failure of the three-qubit phase-flip repetition code.