The Geometry of Clifford Algorithms: Bernstein-Vazirani as Classical Computation in a Rotated Basis

Abstract

The Bernstein-Vazirani (BV) algorithm is frequently taught as a canonical example of quantum parallelism, yet the standard interference-based explanation often obscures its underlying simplicity. We present a geometric reframing in which the Hadamard gate "wrapping" acts as a global basis rotation rather than a generator of computational complexity. This perspective reveals that the algorithm is effectively a classical linear computation over GF(2) performed in the conjugate Fourier basis, with the apparent parallelism arising from coordinate transformation. Building on Mermin's earlier pedagogical shortcut, which presented a 'classical' circuit equivalent but stopped short of explicitly labeling it as such, we elevate this to a formal geometric framework. In the extension, we distinguish between globally rotated circuits--which we reveal as classical linear computations--and topologically twisted circuits that generate quantum entanglement. We introduce a pedagogical taxonomy distinguishing (1) pure computational-basis circuits, (2) globally rotated circuits (exemplified by Bernstein-Vazirani), and (3) topologically twisted circuits involving non-aligned subsystem bases. This framework allows viewing the Gottesman-Knill theorem from a new angle, extends students' understanding of phase kickback and the 'Ricochet Property'. Furthermore, it provides a more intuitive starting point for explaining Bell-pair extensions through concrete circuit derivations and Qiskit simulations suitable for undergraduate quantum information courses. The outlook explores how this geometric view paves the way for understanding entanglement as topological twists.

Figures (11)

• Figure 1: The "Classical" view of the Bernstein-Vazirani circuit. When viewed in the COMPUTATIONAL basis, the oracle acts simply as a set of CNOT gates controlled by the ancilla ($q_8$), effectively writing the secret string directly onto the data wires. The barriers clearly delimit the oracle operation from the initialization and measurement steps. The "Canonical" Fourier basis view (Hadamard gates wrapper) is currently hidden in the CNOT gates.
• Figure 2: Intermediate geometric transformation. We replace the CNOT gates (from Fig. \ref{['fig:classical_view']}) with their Clifford equivalent: a Phase-Controlled ($CZ$) gate sandwiched by Hadamards on the target qubits. Physically, we have rotated the data qubits from the bit-flip axis ($X$) to the phase-flip axis ($Z$), enabling the interaction to be described as a phase query.
• Figure 3: Structural rearrangement. We slide the inner Hadamard gates to the boundaries of the oracle block (marked by barriers). This visual grouping highlights the "Hadamard Sandwich" structure: the central component is a pure Phase Oracle ($CZ$), and the surrounding Hadamards serve as the coordinate transformations that rotate the basis.
• Figure 4: The Global Rotation (Standard BV Circuit). By completing the Hadamard layers on all oracle qubits (using $I=HH$), we arrive at the phase-representation of the Bernstein-Vazirani algorithm. Here, the oracle is defined in the $Z$-basis (Phase Oracle) and the Hadamard gates act as the global basis change. This derivation demonstrates that the "Quantum" circuit is merely the "Classical" circuit (Fig. \ref{['fig:classical_view']}) viewed from the Fourier basis.
• Figure 5: The Phase Kickback Construction. Here we expand the internal structure of the Phase Oracle. By decomposing the $CZ$ gates into $CNOT$ gates sandwiched by Hadamards on the target (ancilla), we recover the standard experimental implementation of Bernstein-Vazirani. The ancilla is effectively prepared in the $|-\rangle$ state (via the $X$ and $H$ gates), causing the bit-flips triggered by the CNOTs to "kick back" a phase of $-1$ to the control qubits.