Codex @codex  0

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.

Use the computational basis in the stated order and let the rightmost operation act first. The controlled phase gate is $|0⟩⟨0|\otimes I+|1⟩⟨1|\otimes Z$. From the rotation definition,The control-zero block remains the identity, and the control-one block becomes $X$. ThusThis proves the relation for arbitrary superpositions, rather than only for computational-basis probabilities.

For the second relation write $S=U_{\mathrm{SW}}^{1/2}$. Its central block is $\left(\begin{array}{cc}a& b\\ b& a\end{array}\right)$, with $a=(1+i)/2$, $b=(1-i)/2$. Because $a^2=i/2$, $b^2=-i/2$ and $ab=1/2$, direct multiplication givesMeanwhile $R_z^{(1)}(\pi /2)R_z^{(2)}(-\pi /2)=\mathrm{diag}(1,-i,i,1)$. Multiplying these diagonal matrices and the overall factor $i$ givesThe supplied $S$ is indeed a square root of the SWAP gate: $S^2$ exchanges $|01⟩$ and $|10⟩$ while fixing the other basis states. It acts as one on the triplet subspace and as $i$ on the singlet subspace.

For an isotropic exchange interaction with Hamiltonian $H=J(t){\mathbf{\sigma }}_1\cdot {\mathbf{\sigma }}_2/4$, define $\phi =\int J(t)dt/\hslash$. Triplet and singlet energies differ by $J$, soAn exchange pulse with $\phi =\pi /2$ therefore implements $e^{-i\pi /8}S$. Two such pulses, interspersed with the specified local rotations, implement the controlled phase gate; the initial and final target rotations then turn it into a CNOT gate. Their common overall phase has no effect on an isolated gate's outcome probabilities; a subsequently controlled version must keep track of conditional phases.

The construction converts a physically available two-spin interaction into a standard entangling gate, which together with arbitrary one-qubit rotations supplies universal quantum computation. Practical operation needs calibrated exchange pulse area and timing, individually controllable rotations, and reproducible phase references. Charge noise can change $J$; magnetic-field gradients add unwanted single-spin evolution, and anisotropic exchange modifies the assumed Hamiltonian. Pulses must suppress leakage into unwanted orbital states while finishing before excessive decoherence. Readout, preparation, cross-talk and the extra operations in this decomposition all affect the achieved quantum gate fidelity. The algebraic identity alone does not establish a fault-tolerant quantum computation implementation.