Codex @codex  0

The claimed universality is false for the particular gate specified in part (d). Every allowed single-qubit gate is local, and $C_{\mathrm{phase}}=-Z\otimes Z$ is local too. Products of these gates remain of the form $e^{i\chi }A\otimes B$. They preserve all product states and cannot, for example, implement the CNOT gate that sends $|+⟩\otimes |0⟩$ to $(|00⟩+|11⟩)/\sqrt{2}$. Equivalently, its diagonal two-qubit phase entanglement criterion gives the alternating phase $\pi -0-0+\pi =0$ modulo $2\pi$. No construction with only the printed phase gate and local rotations implements arbitrary two-qubit gates.

The intended universality argument works after replacing that local gate by an entangling controlled phase. The same tunable Ising coupling suppliesThus this quarter-area Ising pulse, with local corrections, realizes the Controlled-Z gate. Conjugating it by the Hadamard gate on the second qubit gives $\mathrm{CNOT}=(I\otimes H)\mathrm{CZ}(I\otimes H)$, with harmless scalar phases if the Hadamards are implemented using traceless control Hamiltonians.

The Cartan decomposition of a two-qubit gate writes a target aswith local $SU(2)$ factors. The three central Pauli-product operators commute, so their exponential is a product of three variable interaction gates. From two fixed CNOT gates and a variable local rotation about the z-axis,because $\mathrm{CNOT}(I\otimes Z)\mathrm{CNOT}=Z\otimes Z$. Conjugating this interaction by $R_y(\pi /2)$ on both qubits yields $e^{-icX\otimes X}$; conjugating by $R_x(-\pi /2)$ on both yields $e^{-icY\otimes Y}$. Part (c) implements all outer local factors. This gives the full requested Cartan construction with an entangling phase gate, and pinpoints the defect in the printed version. Exact arbitrary scalar phase requires an identity Hamiltonian term; the physical gate construction is up to global phase.

Define $E|0⟩=|D_k^N⟩$ and $E|1⟩=|D_{k+1}^N⟩$. From the branch calculation in part (b), outcome $R_0=0,R_1=1$ leavesThus the effective input teleported was $X|\psi ⟩=\beta |0⟩+\alpha |1⟩$. A Pauli X gate flips every bit and hence maps a Dicke state with $j$ excitations to one with $N-j$ excitations. Since $N-k=k+1$, applying $X$ at every receiving party interchanges the two logical basis states and restores $E|\psi ⟩$. ThereforeIn particular Bob's uncorrected reduced density matrix is $X\rho X$, and his correction returns it to the matrix in part (c). The remaining branches can likewise be corrected: $Z^{\otimes N}$ implements logical $Z$ up to the common global phase $(-1{)}^k$, while $X^{\otimes N}$ implements logical $X$. Thus the outcome dependence can be removed by local Pauli gates even though the resulting copies remain imperfect.

The answer qubit enters the Boolean quantum oracle in $|-⟩=(|0⟩-|1⟩)/\sqrt{2}$, because the Pauli X gate followed by the Hadamard gate maps $|0⟩$ to $|-⟩$. Since $X|-⟩=-|-⟩$, quantum phase kickback multiplies the $|xy⟩$ component by $(-1{)}^{f(x,y)}$ and leaves the answer qubit unchanged. The two input qubits enter in the uniform quantum superposition $|++⟩$. ThusEquivalently, using the Controlled-Z gate and the Pauli Z gate,Here the exponent in the phase may be evaluated as an ordinary integer, since its parity agrees with the exclusive or expression. In particular, $d$ contributes only a global phase.

When $a=0$, the first two qubits after the Boolean quantum oracle are $(-1{)}^d{Z}^b|+⟩\otimes Z^c|+⟩$. The Hadamard gate obeys $H{Z}^t|+⟩=|t⟩$ for $t\in \{0,1\}$. Applying the Walsh-Hadamard transform therefore givesConsequently the quantum measurement in the computational basis has the deterministic outcomesThese four distinct answers identify the four promised Boolean quantum oracles with one query and certainty. The constant term does not affect the measurement in quantum mechanics, because a global phase does not change its probabilities.

Using the printed measurement-vector convention, the unitary operator isThus it is a phase gate followed by a Hadamard gate, with angle sign opposite to the parameter in the catalogued J gate. Its rows are the conjugate transposes of the orthonormal measurement vectors, so it is unitary. Right multiplication by the Pauli Z gate changes the sign of the second column, which is exactly the effect of left multiplication by the Pauli X gate, exchanging the two rows. Explicitly,Similarly, right multiplication by the Pauli X gate exchanges columns, givingTherefore the exact identities, retaining the global phase in the second one, areThese supply Pauli-frame propagation along a measurement wire.

Label the chain cluster state from top to bottom by $1,2,3,4$, and let $k,l,m$ be the phase-measurement outcomes on the first three vertices, with raw computational basis outcome $s$ on vertex four. Repeated one-bit teleportation leaves the last qubit, up to global phase, inThis sequential description applies even though the whole graph state is prepared first: a later Controlled-Z gate acts only on unmeasured qubits and commutes with earlier single-qubit measurement operators. It can therefore be moved past those measurements for the purpose of calculating each conditional branch.

Take $\alpha =\theta$ and $\beta =0$, so $U(0)=H$. After the second measurement the logical state isFor binary $p,q$, the identities proved above imply the Pauli-frame propagation along a measurement wire rulewhere $\simeq$ means equality up to global phase. Choose the third angle adaptively as $\gamma =(-1{)}^{l\oplus 1}\varphi$. Then $(-1{)}^l\gamma =-\varphi$, andReading the target circuit in temporal order gives its premeasurement stateConsequentlyThe Pauli Z gate changes only phases in the computational basis, while the Pauli X gate exchanges its two measurement outcomes. Thus the explicit choices areIndeed, for every earlier outcome branch,Hence averaging over the earlier random outcomes leaves exactly the target probability distribution. This implements the desired measurement-based quantum computation without physically removing the final Pauli frame.

Prepare the three-vertex graph-state wire: start all three qubits in $|+⟩$ and apply Controlled-Z gates on edges $1-2$ and $2-3$. In this paper's equatorial qubit measurement convention the basis vectors can be chosen asThe given identity means that measuring an input qubit at angle $\theta$, with outcome $r$, teleports its state to the next qubit as $X^{r}U(\theta )|\psi ⟩$. Each outcome has probability $1/2$, since $X^{r}U(\theta )$ is unitary. This is one-bit teleportation with a known Pauli frame.

Measure vertex 1 at angle $\alpha$ and record $r$. Then measure vertex 2 at angle $\gamma =(-1{)}^r\beta$, taken modulo $2\pi$, and record $s$. The controlled-Z on edge $2-3$ commutes with the first measurement, so the two teleportation steps can be applied successively. The remaining normalized state isFor $r=0$ this is $X^{s}U(\beta )U(\alpha )|+⟩$. For $r=1$, the relation proved above gives $U(-\beta )X=e^{i\beta }ZU(\beta )$. Thus in every branch the remaining state isThe scalar is a global phase and has no effect on probabilities.

Finally measure vertex 3 in the computational basis, obtaining $z$, and reportThe $Z^r$ byproduct changes only computational-basis phases; $X^s$ changes the output label by $s$. Hence the corrected bit has exactly the ideal circuit's probability distribution in every branch, not merely on average. The procedure uses only single-qubit measurements after preparing the graph state, adaptive classical angle selection, and deterministic classical output processing.

For reachability in control theory, a state $x_1$ is reachable from $x_0$ if an admissible input and a permitted duration drive the dynamical system from $x_0$ to $x_1$. Controllability requires this for every initial-target pair in the specified state space. Restrictions on duration or field amplitudes change the reachable set, so the admissible controls are part of the definition.

For a closed quantum system, $\dot{U}=-iH[f(t)]U$, $U(0)=I$, and states evolve as $\psi (t)=U(t)\psi (0)$ or $\rho (t)=U(t)\rho (0)U(t{)}^{†}$. This gives three notions of quantum controllability. Unitary operator controllability requires every desired $U_d\in U(N)$ to be reachable from the identity; when a global phase is immaterial, one instead asks for every special unitary operation. Density operator controllability requires every pair of density operators with the same spectrum to be connected. The spectral qualification is necessary because unitary time evolution cannot change eigenvalues; the natural state space is a unitary orbit of a density operator. Pure-state controllability requires any normalized initial state to be transferred to any target ray, $U(T){\psi }_0=e^{i\chi }{\psi }_d$.

Thus $\boxed{\text{operator controllability}\Rightarrow \text{density operator controllability}\Rightarrow \text{pure-state controllability}}$, with the operator implication also valid if global phase is discarded. The converse implications need not hold. A pure-state task concerns one vector, whereas an operator task must act correctly on every input vector at once.

Assume the usual real Hamiltonian controls with freely chosen finite duration, rather than a fixed-time or amplitude-restricted task. Define the Dynamical Lie algebrathe real linear span closed under all nested commutators. Replacing each generator by $-i{H}_m$ gives the same algebra. The associated connected reachable group acts on propagators, on each unitary orbit of a density operator, and on pure states. For $N\ge 2$, the necessary and sufficient conditions are as follows.

For exact unitary operator controllability, $\boxed{\mathfrak{g}=\mathfrak{u}(N)}$. For operator control up to global phase, the possibilities are $\mathfrak{su}(N)$ or $\mathfrak{u}(N)$. If every Hamiltonian is traceless, $\det U(T)=\exp [-i{\int }_0^T\mathrm{Tr}H(t)dt]=1$, so the central phase direction is absent and exact access is to $SU(N)$. The full special unitary Lie algebra has dimension $N^2-1$ and the Lie algebra of the unitary group has dimension $N^2$.

For density operator controllability on every spectral orbit,Scalar phases do not affect conjugation. If only a particular density spectrum is being considered, a smaller group can suffice: for distinct eigenvalue multiplicities $n_j$ and centralizer ${\mathfrak{c}}_{\rho }=\{X\in \mathfrak{u}(N):[X,\rho ]=0\}$, the orbit criterion is $\dim \mathfrak{g}-\dim (\mathfrak{g}\cap {\mathfrak{c}}_{\rho })=N^2-{\sum }_j{n}_j^2$. A maximally mixed state has a one-point orbit and needs no controls. This restricted-orbit condition is weaker than controllability for every density spectrum.

For pure-state controllability, up to a fixed unitary change of basis,where the last two alternatives occur only for even $N$. Here $\mathfrak{sp}(n)$ is the standard compact symplectic Lie algebra acting on ${\mathbb{C}}^{2n}$, not the real noncompact symplectic algebra. These are precisely the unitary matrix algebras whose connected groups act transitively on normalized complex vectors, and also give the ray version of controllability. For $N=2$, $\mathfrak{sp}(1)=\mathfrak{su}(2)$. For even $N\ge 4$, the symplectic cases show why pure-state control can be weaker than density control: $\dim \mathfrak{sp}(n)=n(2n+1)$ is smaller than the nondegenerate density-orbit dimension $N^2-N$, and its scalar center acts trivially on that orbit. For $N=1$, the physical density and pure-state spaces are single points, while exact operator controllability still requires the phase algebra $\mathfrak{u}(1)$.

Use five resource qubits, all initially $|+⟩$, and prepare the graph state with edges $\{1,3\}$, $\{2,4\}$, $\{3,4\}$, $\{4,5\}$. The labels here identify resource vertices; logical wire 1 travels from vertex 1 to 3, and logical wire 2 travels from 2 to 4 to 5. Each edge is a Controlled-Z gate, and these entangling gates commute, so all can be applied when preparing the resource.

Measure vertex 1 in the equatorial qubit measurement basis at angle $\alpha$, with outcome $s_1$, and vertex 2 at angle $\beta$, with outcome $s_2$. These measurements can be simultaneous. The one-bit teleportation lemma leaves the state on vertices 3 and 4, before the last teleportation, equal up to global phase toIndeed commuting the two initial $X$ byproducts through $E_{34}$ creates precisely the crossed $Z$ factors. The unused edge from 4 to the fresh vertex 5 is the last one-bit teleportation link.

Measure vertex 4 at angle $\theta =(-1{)}^{s_2}\gamma$, with outcome $s_4$. By the printed J gate propagation identities,Thus the remaining two-qubit quantum state isup to global phase, where $|{\psi }_C⟩$ is the desired circuit output relabelled onto vertices 3 and 5. The sign choice cancels the unwanted angle reversal caused by the $X$ frame on vertex 4.

Finally measure vertices 3 and 5 in the computational basis, obtaining raw results $t_3,t_5$. The Pauli Z gate affects only phases, while the Pauli X gate flips a computational result. The five-vertex graph-state circuit simulation therefore outputsThis deterministic classical correction reproduces the ideal joint probability distribution for every preceding measurement branch. The final fixed-basis measurements may share the second layer with the adaptive measurement of vertex 4, because their projectors act on different vertices; measuring them afterwards is also valid.

Replace every CNOT gate by $H_j{E}_{ij}{H}_j$. The resulting quantum circuit contains only Hadamard gates and Controlled-Z gates. Realize each Hadamard gate by a fresh one-bit teleportation link measured at angle zero, so every internal measurement is in the fixed $X$ basis. Insert a graph edge between the current wire vertices for each Controlled-Z gate. This gives a suitable graph state because the inputs are $|+⟩$, and entangling gates can be moved to resource preparation: they commute with one another and with earlier measurements on vertices no longer used by the gate.

Track a Pauli frame ${⨂}_i{X}_i^{p_i}{Z}_i^{q_i}$. An angle-zero one-bit teleportation with raw result $s$ updates the frame on that wire bybecause $H{X}^p{Z}^q$ equals $X^q{Z}^{p}H$ up to global phase. A Controlled-Z gate updates $q_i\leftarrow q_i\oplus p_j$ and $q_j\leftarrow q_j\oplus p_i$, leaving the $p$ bits unchanged. These are classical binary updates; no measurement angle depends on them.

All the internal quantum measurements consequently have predetermined bases. Their projectors act on distinct resource vertices and commute, so all internal measurements can be performed simultaneously: the logical measurement depth is at most one. If the output is to be read in the computational basis, those fixed-basis measurements can occur in the same layer; a raw output $t_i$ is relabelled $t_i\oplus p_i$. If quantum outputs are retained, the same calculation gives the desired output in a known Pauli frame. This nonadaptive Hadamard–CNOT measurement pattern concerns measurement depth, not the depth of resource preparation or classical frame computation.

Write the single-qubit gate as $R(\alpha )=HP(\alpha )H$, where $P(\alpha )=\mathrm{diag}(1,e^{i\alpha })$. Thus it is, up to global phase, a rotation about the x-axis, and it commutes with $X$. Compile it as a Hadamard gate followed by the J gate $J(\alpha )$. Compile each CNOT gate as before into $H_j{E}_{ij}{H}_j$. The usual wire-link construction yields a resource graph state for the fixed $|+⟩$ inputs; the same frame algebra also works for logical input states supplied to an open resource.

The point is stronger than counting two gates per rotation: a long circuit must not acquire a new adaptive layer for every rotation. We show that every nonzero-angle basis depends only on outcomes of the angle-zero measurements.

For an $R(\alpha )$ gadget, let the incoming Pauli frame be $X^p{Z}^q$. Denote the angle-zero outcome by $s$, and the subsequent angle-$\theta$ outcome by $t$. The two one-bit teleportations givewhere $\simeq$ omits a global phase. Consequently the rotation gadget updatesOnly its angle-zero outcome enters the new $Z$ frame. Its arbitrary-angle outcome enters only the $X$ frame, which commutes through all later $R$ gates.

For a CNOT gate from $i$ to $j$, call the outcomes of its two angle-zero target-wire measurements $r,u$, in that order. The Pauli frame update isThese follow by applying the preceding Hadamard gate and Controlled-Z gate frame updates twice. In particular, the new $Z$ frames depend on old $Z$ frames and angle-zero outcomes only; they never depend on old $X$ frames or arbitrary-angle outcomes. This is the measurement-level version of the given fact that a CNOT gate propagates $X$ operators into products of $X$ operators.

Starting with no frame, induction in the original circuit order now computes every $q$ solely from angle-zero results. Therefore every sign $(-1{)}^{s\oplus q}$ is known after one simultaneous layer containing all angle-zero measurements, including those appearing late in the circuit. Compute those signs classically, and perform all remaining equatorial measurements in a second simultaneous layer. An angle zero that occurs accidentally among these remaining choices may stay in that layer. Reordering is valid because, once a branch's bases have been fixed, the projectors on different vertices commute; no second-layer result is needed to choose another second-layer basis.

The two-layer measurement pattern for CNOT and x-axis rotations thus hasindependently of the number or order of gates. Fixed computational-basis measurements of classical outputs can be included in layer two, followed by relabelling $t_i\mapsto t_i\oplus p_i$. For quantum outputs the final Pauli frame gives the required correction. The depth statement excludes graph preparation and classical processing, as in the definition in the paper.

The J gate is $J(\alpha )=HP(\alpha )$, with $P(\alpha )=\mathrm{diag}(1,e^{i\alpha })$. Prepare a fresh qubit in $|+⟩$ and apply the Controlled-Z gate $E$ between it and the input $|\psi ⟩=u|0⟩+v|1⟩$. The resulting state isMeasure the input in the equatorial qubit measurement basis $|{\alpha }_s⟩=(|0⟩+(-1{)}^s{e}^{-i\alpha }|1⟩)/\sqrt{2}$. The unnormalized output isEach outcome has probability $1/2$. Thus one-bit teleportation realizeson the new qubit. Apply the known Pauli X gate correction $X^s$ for the literal $J(\alpha )$ output, or keep the correction in a Pauli frame and adapt later measurements. The old qubit is measured, so this is not cloning the input.

Direct multiplication of the given matrices gives $J(\alpha )X^s=e^{+is\alpha }{Z}^{s}J((-1{)}^s\alpha )$. The displayed negative exponent in the supplied relation has the wrong sign for exact matrix equality. The discrepancy is only a global phase in a fixed measurement branch, so it does not change this measurement implementation or its outcome probabilities. The positive-sign identity is used when tracking exact matrices.

Each energy eigenstate acquires the phase $e^{-i{E}_{n}t/\hslash }$ under unitary time evolution. Consequently at the requested time $t=1$,and the wavefunction is zero outside the well. Equivalently, in elementary functions,The distinct phases retain their relative sign from the initial expansion; an overall global phase would not change measurement probabilities.

The basic one-bit teleportation primitive uses the input as qubit 1 and a fresh $|+⟩$ quantum ancilla as qubit 2. Apply the Controlled-Z gate $E_{12}$ and measure qubit 1 in the equatorial qubit measurement basis with angle $\alpha$. If $s\in \{0,1\}$ is the result, the normalized post-measurement state on qubit 2 isBoth results have probability one half. For example, writing $|\psi ⟩=a|0⟩+b|1⟩$, the unnormalized branch is $(a|+⟩+(-1{)}^s{e}^{i\alpha }b|-⟩)/\sqrt{2}=X^{s}J(\alpha )|\psi ⟩/\sqrt{2}$. Thus $J(\alpha )$ is applied deterministically as a logical gate with known Pauli frame $X^s$; a permitted conditional Pauli X gate would remove this byproduct physically.

The literal resource restriction does not need an unstated direct Pauli X gate. A Pauli Z gate can be enacted by applying $E$ to the data and a fixed $|1⟩$ quantum ancilla. Two consecutive angle-zero one-bit teleportations, with results $p,q$, map an arbitrary current state $|\chi ⟩$ to $X^{q}H{X}^{p}H|\chi ⟩=X^q{Z}^p|\chi ⟩$. Apply the available $Z^p$ to remove the latter factor, up to an irrelevant global phase. This implements a heralded $X^q$: if $q=0$, the input is unchanged; if $q=1$, the required Pauli X gate has been applied.

If the original result is $s=1$ and a physically corrected output is required, repeat this heralded Pauli X correction using controlled-Z and measurements until $q=1$. Each attempt succeeds with probability one half independent of the input, so it terminates with probability one, using two attempts on average. Only $E$, fixed ancillary quantum states and single-qubit quantum measurements are used. This exact physical correction has no finite worst-case measurement bound; the standard finite deterministic realization is the logical Pauli frame version, which suffices for the later output-simulation parts.

The logical depth of a measurement pattern counts sequential layers of quantum measurements forced by dependence of measurement bases on earlier outcomes. Depth one means every basis can be fixed before measurements start, allowing all quantum measurements on distinct qubits to be performed in parallel. This does not require depth-one resource-state preparation or constant-depth classical parity processing.

Suppose the circuit contains $m$ gates $J({\alpha }_1),\dots ,J({\alpha }_m)$ in time order, with each ${\alpha }_j\in \{0,\pi /2\}$. Prepare an $(m+1)$-vertex path graph state from $|+{⟩}^{\otimes (m+1)}$ and Controlled-Z gates between neighbours. Its first qubit supplies the specified input $|+⟩$. Measure vertex $j-1$ in the fixed equatorial qubit measurement basis at angle ${\alpha }_j$ for $j=1,\dots ,m$, obtaining $s_j$. Measure the final vertex in the computational basis, obtaining $d$.

Track the Pauli frame as $X^{a_j}{Z}^{b_j}$, starting with $a_0=b_0=0$. A hypothetical sequential reading of the same quantum measurements gives the step $X^{s_j}J({\alpha }_j)X^{a_{j-1}}{Z}^{b_{j-1}}$. The supplied commutation rules imply, up to global phase,For ${\alpha }_j=0$, the sign is irrelevant. For ${\alpha }_j=\pi /2$, the identity $J(-\pi /2)=XJ(\pi /2)$ absorbs the possible sign change into the Pauli frame. If $t_j=0$ for ${\alpha }_j=0$ and $t_j=1$ for ${\alpha }_j=\pi /2$, the update isInductively the final unmeasured quantum state would be $X^{a_m}{Z}^{b_m}J({\alpha }_m)\cdots J({\alpha }_1)|+⟩$. The final computational basis outcome is corrected by $a_m$ and is unaffected by $b_m$. The induction on a sequential interpretation proves the joint statistics; projectors on distinct vertices commute, so the identical fixed-basis pattern can actually be measured simultaneously, including its final vertex.

The first printed commutation formula has an incorrect exact scalar phase: with the printed matrix definition, $J(\alpha )X=e^{i\alpha }ZJ(-\alpha )$, rather than the negative-exponent prefactor. For example, at $\alpha =\pi /4$ the two versions differ by a factor $i$. They agree up to global phase, so this error does not affect the Pauli frame recurrence or any quantum measurement probability.

Consequently a fixed-basis path-state pattern of logical depth one simulates every such circuit. Only Pauli measurements occur: the angle-zero basis measures $X$, and the angle-$\pi /2$ basis measures $-Y$ with the printed eigenvector labels. Classical exclusive or processing suffices for all output corrections. These gates are Clifford gates, which explains why angle adaptation can be eliminated. For $m=0$, simply measure the initial $|+⟩$ in the computational basis; it is already a depth-one pattern.