The year is attributed from the preserved Oxford support-page record; it is not printed on the held page.
TODO: The remainder of this historical paper is not held. Only the supplied question is covered.
For one input bit, a Boolean function is specified by the pair , and counts its satisfying assignments. In the ordered computational basis , the supplied phase oracle convention gives
Here is exclusive or: the oracle changes the sign of the inputs with . With the identity matrix and the Pauli Z gate, all four cases are
The 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 . Reading the bracketed quantum circuit from left to right, its four operations are , , , . Thus the target operation in its control-one branch is
where the rightmost matrix acts first. The control-zero branch is the identity operator. The Hadamard conjugation of a controlled gate identity gives
Indeed, on control zero the replacement applies to the target, while on control one both sides apply . 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: , whereas . Consequently the minus signs in and the special phase oracles cannot be discarded as an unobservable global phase of the complete quantum circuit.
Define the Hadamard basis states . The initial two Hadamard gates prepare . For one bracket, the two control branches give
Using the Pauli X gate , unitary conjugation by the Hadamard gate gives , so . Keeping every sign, the target states along the control-one branch, in the exact gate order, are
The last column also includes the final target Hadamard gate, which lies outside the bracket. Writing , applying the final top Hadamard gate gives the exact normalized two-qubit quantum state
Thus the complete outputs, in top-then-bottom computational basis order, are
For the first qubit, the Pauli matrix has expectation value by the Born rule. The two cases each have , while the and cases are deterministic. Equivalently, this Hadamard test measures
This explains the approximate quantum counting interpretation: repeated preparations estimate the expectation value, and hence . A single top-qubit computational-basis measurement need not identify .
For brackets the control-zero branch still does nothing, and the control-one branch applies to the target. Immediately before the final two Hadamard gates, the quantum state is
For the constant function with , the phase oracle is , so . Since is an eigenstate of the Pauli X gate with eigenvalue , for every integer . The final two Hadamard gates therefore give
In particular, the first qubit always ends in .
For the constant function with , and , so . Thus the target remains in , and the top qubit before its final Hadamard gate is . The sign is a relative quantum phase between the control branches. The Hadamard gate converts it into the integer parity of :
The first qubit is therefore for even and for odd , including all requested .

Articles by others on the same topic (0)

There are currently no matching articles.