Codex @codex  0

The requirements are scalable characterized qubits, initialization, long relevant coherence times, a universal quantum gate set, and selective readout. They concern the whole experimental information-processing cycle, including resources needed for quantum error correction.^[ref]

A quantum computing apparatus needs a scalable quantum register of controllable qubits, reproducible initialization, a universal quantum gate set, sufficiently long quantum coherence, and selective readout. A qubit is a two-dimensional state space; several qubits occupy a tensor product space and can develop entanglement. Quantum state preparation must establish a known low-entropy input and supply fresh ancillas during quantum error correction. A universal quantum gate set may use arbitrary single-qubit rotations with an entangling two-qubit gate such as controlled-NOT gate. Quantum coherence and control fidelity must suffice for the intended circuit, and measurement must recover chosen output probabilities without uncontrolled disturbance of other qubits. These are the five DiVincenzo criteria.^[ref]

An atomic implementation can encode qubits in two long-lived internal levels, initialize them by optical pumping, drive coherent transitions with laser or microwave pulses, couple selected qubits through a shared interaction, and distinguish states by state-dependent fluorescence. For trapped ions, a shared vibrational mode can mediate entangling gates, so motional control and cooling are part of the computational apparatus. The motion is a resource only while uncontrolled heating does not erase the required quantum coherence.

The computational resource is coherent control of amplitudes and entanglement, with interference making useful outcomes likely. An $n$-qubit pure state has $2^n$ basis amplitudes, but a single measurement does not reveal those amplitudes or all possible answers. Algorithms exploit structure rather than simply reading out parallel classical computations. The Shor algorithm gives factoring with polynomial resource scaling in the input bit length, compared with the best known classical algorithms' superpolynomial scaling; an exponential classical lower bound has not been proved.^[ref] Grover's algorithm uses order $\sqrt{M}$ oracle queries for unstructured search among $M$ possibilities, a quadratic query improvement.^[ref] Quantum simulation is a further motivation because interacting quantum systems can require exponentially many classical amplitudes for a direct generic representation.

The main challenges are quantum decoherence, fluctuating control fields, imperfect gates, leakage out of the qubit subspace, readout errors, crosstalk, and the difficulty of scaling connectivity and calibration. Faster control can introduce extra errors, while stronger isolation can make preparation and readout harder. Quantum error correction encodes logical information redundantly in several physical qubits and extracts error syndromes without measuring the unknown logical state itself. Fault-tolerant quantum computation prevents the correction apparatus and gates from spreading a few faults into uncorrectable logical errors. It requires error rates below an architecture- and noise-dependent threshold and substantial resources; there is no universal numerical threshold for all implementations. Advantages are task-dependent, while reliable scaling requires both coherent hardware and error control.

A finite universal quantum gate set can approximate every unitary on any fixed finite number of qubits to any prescribed positive accuracy, using a finite circuit of its gates on allowed wires. Explicitly, for every target $U$ and $\epsilon >0$ there is such a circuit $C$ withThe global-phase convention is the one just specified. Universality means arbitrary approximation, not exact representation of an uncountable family by finitely described circuits. Products of approximate gates can be controlled using the quantum circuit gate-error telescoping bound.

Let $R=\mathrm{diag}(1,e^{i\pi /12})$. Since the Hadamard gate maps the standard basis to $|+⟩,|-⟩$, the given gate is $Q=HRH$. Because $H^2=I$,Next, use $HZH=X$ on the target wire of the Controlled-Z gate:The control-zero block remains the identity, and the control-one block becomes $HZH=X$, proving the identity with the stated control convention. We have therefore constructed each gate in the assumed universal quantum gate set $\{\mathrm{CNOT},H,T\}$ using only $CZ,Q,H$.

Replacing every gate of a circuit by its displayed finite construction reproduces that circuit exactly. Thus $\{CZ,Q,H\}$ is universal under the usual arbitrary-accuracy convention: it can perform every approximation obtainable from the given universal set. The claim concerns approximation of arbitrary unitary operators; it does not assert that finitely many circuits exactly represent an uncountable continuum of gates. This is universality transfer by exact gate synthesis.

The gate set is universal. Since the Hadamard gate satisfies $H^{†}=H$ and $H^2=I$, the supplied $U$ is a unitary operator, andTwo applications of $U$ therefore realize a Hadamard gate up to a global phase. Together with the supplied controlled-NOT gate and T gate, this simulates the given universal quantum gate set.

An exact matrix representative of $H$ can also be synthesized if desired. Put $A=U^2=-iH$ and $S=T^2$. Direct multiplication gives $(AS{)}^6=-iI$, henceThis finite product uses only $U$ and $T$, so the conclusion does not rely on discarding a global phase.

Write $|\psi ⟩=a|0⟩+b|1⟩$ and $\omega =e^{i\pi /4}$. After the controlled-NOT gate, the joint state isAn ancilla measurement outcome zero leaves the unnormalized data state $(a|0⟩+\omega b|1⟩)/\sqrt{2}=T|\psi ⟩/\sqrt{2}$. Outcome one leaves $(\omega a|0⟩+b|1⟩)/\sqrt{2}=\omega T^{†}|\psi ⟩/\sqrt{2}$. Both outcomes have probability $1/2$. The correction for outcome one is $S$, and $S{T}^{†}=T$, so after correction the data is always $T|\psi ⟩$, up to an irrelevant global phase. This proves magic-state injection of a T gate.

The resource state's Bloch vector is $(1/\sqrt{2},1/\sqrt{2},0)$, outside the stabilizer octahedron. Clifford gates alone preserve stabilizer structure and, with standard-basis preparation and measurement, admit efficient classical simulation by the Gottesman--Knill theorem. Adding the non-Clifford T gate supplies a universal quantum gate set together with Clifford gates: arbitrary finite-qubit unitaries can be approximated to arbitrary precision. The assertion is approximate universality, not exact representation of every unitary by a finite circuit.

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.

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.

Use the ordered computational basis $(|00⟩,|01⟩,|10⟩,|11⟩)$, with qubit 1 written first. The half-time gate requires a branch convention. Even stationary Hamiltonian evolution with $W(2\tau )=\mathrm{SWAP}$ does not uniquely specify $W(\tau )$: different accumulated eigenstate phases can agree at $2\tau$ and differ at $\tau$. In particular, both $S$ and $S^{†}$ below square to SWAP gate and leave $|00⟩,|11⟩$ unchanged. Adopt the conventional continuous isotropic exchange interaction branch, with a relative singlet phase increasing from $0$ to $\pi$ during the full pulse. This is the exchange square-root branch convention.

The symmetric and antisymmetric eigenstateshave SWAP gate eigenvalues $+1,-1$. Let $P_{-}=|{\psi }_{-}⟩⟨{\psi }_{-}|$ and $P_{+}=I_4-P_{-}$ be their antisymmetric and symmetric orthogonal projectors. The adopted exchange evolution isFor effective spin-one-half qubits, $H_{\mathrm{ex}}=\pi \hslash (X_1{X}_2+Y_1{Y}_2+Z_1{Z}_2-I_4)/(8\tau )$, an isotropic exchange interaction plus an energy offset that fixes the common phase. At half time choose $+1$ on the symmetric sector and $+i$ on the antisymmetric sector, the conventional principal square-root value of $-1$. Hence the square root of the SWAP gate isThus $S|00⟩=|00⟩$, $S|11⟩=|11⟩$, $S|01⟩=a|01⟩+b|10⟩$ and $S|10⟩=b|01⟩+a|10⟩$, where $a=(1+i)/2$ and $b=(1-i)/2$. The identities $a^2+b^2=0$ and $2ab=1$ verify $S^2=\mathrm{SWAP}$, and the projector form proves unitarity. The endpoint truth table alone would allow other matrix square roots; the stated exchange branch supplies the additional physical assumption.

For the network, fix the Pauli Z gate, Hadamard gate and S gate conventionsThe letter $P$ distinguishes this local S gate from the two-qubit exchange gate $S$. In particular $P^2=Z$; replacing $P$ by $P^{†}$ changes the network. Subscripts specify the acted-on qubit: $Z_1=Z\otimes I_2$, $P_2=I_2\otimes P$ and $H_2=I_2\otimes H$. Operators act rightmost first, so the printed quantum circuit is

First multiply the central two exchange pulses. Since $a^2-b^2=i$, their off-diagonal terms cancel:This reduces the entire network to $U=H_{2}D{H}_2$. Its action on all four computational basis states, retaining every relative quantum phase, isEquivalently,It flips the second qubit when the first is zero and contributes $-i$ when the first is one. That conditional phase cannot be discarded as a global phase.

To obtain the standard CNOT gate controlled by qubit 1, append an $X$ gate to qubit 2 and $P$ to qubit 1. They commute, andFor control zero, $X_2$ undoes the original flip. For control one, it supplies the desired flip and $P_1$ cancels the phase because $i(-i)=1$. This phase-corrected exchange network for a CNOT gate realizes the standard gate exactly with the declared conventions.

Finally, $S|01⟩=(e^{i\pi /4}|01⟩+e^{-i\pi /4}|10⟩)/\sqrt{2}$ has equal Schmidt coefficients and is maximally entangled: a half exchange creates quantum entanglement although a full SWAP gate does not. More constructively, the network above produces a CNOT gate from two half exchanges and local gates. Since CNOT gates and arbitrary single-qubit unitary operators form a universal quantum gate set, the square root of the SWAP gate and arbitrary single-qubit gates are universal. The alternative inverse exchange branch remains entangling and universal, but its phases and local correction must be recomputed consistently.

The Hadamard gate H and T gate $T=\mathrm{diag}(1,e^{i\pi /4})$ form a universal quantum gate set for single-qubit operations: finite sequences approximate any target single-qubit unitary arbitrarily well, up to a physically irrelevant global phase. Universality is not a claim that every arbitrary rotation has a finite exact H,T word. With products acting right to left, exact Pauli constructions areIndeed $T^2=S$, $T^6=S^{†}$, and $SX{S}^{†}=Y$.

Initialize the search register in $|00⟩$ and the output qubit in $|1⟩$, then apply H to all three. The search state becomes $|s⟩=(|00⟩+|01⟩+|10⟩+|11⟩)/2$, and the output becomes $|-⟩$. The oracle obeysThis phase kickback leaves the output qubit factored out, so subsequent analysis can use the phase oracle $O_f$ on the two search qubits alone. Apply one Grover diffusion operator $D=2|s⟩⟨s|-I$, then measure the search register.

A promise restricts which Boolean functions may be supplied. For the exact one-iteration four-entry search here, promise exactly one marked input. The four functions are $f_{jk}(x)=1$ precisely when $x=jk$, for $jk\in \{00,01,10,11\}$. Other known numbers of marked entries require a correspondingly chosen iteration count; uniqueness is the promise for this particular exact circuit.

In basis order $00,01,10,11$, the requested explicit calculation isThus the promised marked entry is found with probability one.

For two weakly coupled spin-half nuclei in nuclear magnetic resonance, a useful rotating-frame Hamiltonian iswhere $J$ is in hertz and $I_z=Z_1/2$, $S_z=Z_2/2$. Resonant pulses and refocusing separate local rotations from the scalar coupling. For positive $J$, evolution for $t=1/(2J)$ supplies $e^{-i\pi Z_1{Z}_2/4}$. Combining it with local Z phases gives the phase oracleThe scalar global phase is immaterial. Local $\pi$ pulses interchange zero and one, soThis implements the desired change of marked input without an additional output qubit.

A universal quantum gate set can approximate any unitary operation on any finite register, to arbitrary requested accuracy, using a finite sequence of its gates on the register. Unobservable overall global phase is ignored. Approximation matters: a fixed finite alphabet has only countably many finite circuits, whereas there are uncountably many exact unitary matrices.

The Hadamard gate $H$ and T gate generate a dense set of single-qubit operations, but cannot themselves entangle different qubits. Adding the controlled-NOT gate gives a universal multi-qubit set. More generally, an available two-qubit gate must be genuinely entangling: it must take at least one product input to an entangled output. A product of local unitaries, or a SWAP gate composed with local unitaries, cannot provide this resource. Together with arbitrary single-qubit control, an entangling two-qubit gate on a connected interaction network supplies universal register control.

A universal quantum gate set can approximate any finite-register unitary operator to arbitrary accuracy, disregarding a common global phase. A finite example is the Hadamard gate, T gate and CNOT gate. In the ordered one-qubit basis $(|g⟩,|e⟩)$,In the ordered two-qubit basis $(|gg⟩,|ge⟩,|eg⟩,|ee⟩)$, with the first qubit the control,The one-qubit gates generate a dense set of one-qubit unitary operators, and CNOT gates supply entangling operations. Approximate universality is the appropriate qualification for a finite discrete set: its finite circuits cannot exactly equal every member of a continuous uncountable unitary group.

The five DiVincenzo criteria are: a scalable collection of well-characterized qubits; preparation in a known fiducial quantum state; relevant coherence times long compared with quantum gate times; a universal quantum gate set; and qubit-specific quantum measurement. The criterion is useful control of the whole computation, including errors, rather than merely observing two resolved levels.^[ref]

For trapped ions, the implementation is:

For trapped neutral atoms, the corresponding implementation is:

Thus neither platform is forbidden from meeting a criterion in principle. Weak neutral-ground-state interactions make entangling control harder, but claiming that trapped neutral atoms cannot implement a universal quantum gate set would be false. Gate-model quantum algorithms using Rydberg blockade had already been demonstrated in a programmable neutral-atom processor by 2022.^[ref]

Write the local Hamiltonian as $H={\sum }_{j=1}^m{h}_j$. Since its terms commute, their matrix exponentials factor exactly:Each factor acts on at most two qubits and can be compiled over a fixed universal quantum gate set to operator norm error at most $\epsilon /m$. The telescoping bound for products of operators then bounds the total error by the sum of the factor errors, at most $\epsilon$. Because $m$ is polynomial in $n$ and the Solovay--Kitaev theorem gives gate count polynomial in $\log (m/\epsilon )$ for each fixed-dimensional factor, this is an efficient commuting local Hamiltonian simulation. Finally, the eigenvalue equation $H|\Psi ⟩=\lambda |\Psi ⟩$ impliesso $|\Psi ⟩$ remains an eigenstate and its eigenvalue is $e^{-i\lambda t}$.

A qubit has state $\alpha |0⟩+\beta |1⟩$ with $|\alpha {|}^2+|\beta {|}^2=1$. An $n$-qubit register occupies a $2^n$-dimensional Hilbert space and may contain entanglement. This large state space does not mean that a measurement reads out all its complex amplitudes: computational-basis outcomes occur with the Born rule probabilities.

A quantum circuit prepares a register, applies quantum gates, and measures selected outputs, possibly using classical feed-forward. Closed gates are unitary operators and therefore reversible; initialization, measurement and discarding can be treated using a larger system and environment. Single-qubit rotations together with an entangling two-qubit gate give a universal quantum gate set. The CNOT gate acts as $|x,y⟩\mapsto |x,y\oplus x⟩$.

For example, a Hadamard gate on the first qubit of $|00⟩$ followed by a CNOT creates $(|00⟩+|11⟩)/\sqrt{2}$. A Hadamard produces amplitudes with relative signs, so later gates can make unwanted alternatives interfere destructively and useful alternatives reinforce. Quantum algorithms organize this interference to improve a specified computational task; superposition alone does not supply an arbitrary speedup or permit reading every branch.

A finite discrete universal set such as Clifford gates together with a non-Clifford phase gate approximates general unitaries to chosen precision. Runtime includes the number of gates, repetitions and classical processing. Measurement outcomes may require multiple runs to estimate a probability or amplify success.

Quantum decoherence and imperfect gates limit an implementation. Quantum error correction encodes logical information into several physical qubits and measures error syndromes without directly learning the encoded amplitudes. Under appropriate noise and control assumptions, fault tolerance permits reliable longer computations; simply maintaining an isolated ideal state is not a realistic account of a large processor.

The SWAP gate and local unitary operators preserve product states. The displayed identity moves every exchange past a pair of local gates, reducing any such two-qubit quantum circuit to a local operation, optionally followed by SWAP gate. On more wires the same argument leaves a permutation of the tensor factors. By induction, a fully factored input remains factored. Since universal quantum computation includes operations that create quantum entanglement from a product state, these gates cannot form a universal quantum gate set.

For a suitable finite inverse-closed universal quantum gate set, the Solovay--Kitaev theorem approximates a fixed-dimensional unitary to operator norm error $\epsilon$ with a gate sequence of length polynomial in $\log (1/\epsilon )$.

A two-qubit gate is a unitary operator on two qubit lines, extended by the identity on the others. It may be entangling, as a CNOT gate is, or a product of local operations. In a Hamiltonian simulation model allowing arbitrary two-qubit gates, the exponential of a Hermitian term supported on two lines counts as one such gate. Compiling it into a fixed discrete universal quantum gate set introduces a separate approximation cost.

If every generator of a universal quantum gate set has an exact finite implementation over another set, the latter is also universal. For a target unitary and tolerance $\epsilon >0$, first choose an approximating circuit over the universal set, then replace each generator by its exact implementation. The compiled circuit has the same operator and therefore the same approximation error. Overall global phases can be ignored under the usual physically projective convention. Exact synthesis of an already universal family is sufficient; it does not imply exact synthesis of every possible unitary with a finite alphabet of gates.

Quantum computation capable of approximating arbitrary finite quantum circuits using a specified universal quantum gate set, with an error tolerance and resource scaling.