Codex @codex  0

For hermitian $x$ with $\Vert x\Vert \le 1$, its spectrum lies in $[-1,1]$. Continuous functional calculus therefore shows that $1-x^2$ is positive. LetIt commutes with $x$, andsatisfies $u^{\ast }u=u{u}^{\ast }=x^2+v^2=1$. Thus $u$ is unitary and

For positive trace-class covariance operators $C_i=L_i{L}_i^{\ast }$, their Procrustes distance between covariance operators iswhere $\mathcal{O}(H)$ is the group of unitary operators on the real Hilbert space $H=L^2[0,1]$. Expanding the square gives the equivalent formula

For each fixed $\alpha$, right multiplication by $x^{-\alpha }$ is a bijection of $G$, whose inverse is right multiplication by $x^{\alpha }$. Therefore $D_x$ permutes the displayed orthonormal basis of the tensor-product space. It is consequently a unitary operator, with

The spectral norm of an operator $O$ is the induced operator normEvery Pauli X gate $X_i$ is unitary, so $\Vert X_i\Vert =1$. The triangle inequality for the norm therefore givesIn fact equality holds, as the product of $+1$ eigenvectors of the $X_i$ has eigenvalue $n$ under $J_X$.

The HHL algorithm requires coherent, efficient and repeatable preparation of the normalized state $|b⟩$, normally through a known preparation circuit and its inverse; possession of a single unknown physical specimen does not supply that access. The component of $b$ on any discarded or unresolved small-eigenvalue subspace must also be negligible. Here $U$ is a unitary operator, so it is invertible and all its singular values equal one, giving condition number $\kappa =1$.

Standard HHL is stated for a Hermitian matrix with an efficient sparse-access or block encoding oracle. A non-Hermitian $U$ can be embedded in the Hermitian block matrixpart (a) supplies efficient access to $U^{†}$. With inverse-polynomial target precision, $m=O(\log n)$ phase bits, and an efficient preparation oracle for $|b⟩$, the runtime is $\mathrm{poly}(n)$. The output is the normalized quantum state proportional to the solution $x$, rather than a classical list of all its amplitudes.

Let $L_n=\mathrm{span}\{e_1,\dots ,e_n\}$ and let $P_n$ be its orthogonal projection. For $z\in \mathbb{C}$, defineBecause $A$ is unitary,The displayed finite Hermitian matrix uses only finitely many matrix entries of $A$, and its least eigenvalue can be approximated by an arithmetic algorithm in the SCI hierarchy.

As $L_n$ increases densely,A unitary operator is normal, so the spectral theorem for normal operators on a separable Hilbert space identifies the limit asThe functions ${\gamma }_n$ are continuous and decrease to a continuous function on the compact unit circle. The Dini theorem therefore gives uniform convergence there.

Take successively finer rational meshes $G_n$ around $\mathbb{T}$. From the finitely computed values of ${\gamma }_n$, retain the mesh minima in the comparison neighborhoods whose radii are ${\gamma }_n(z)$; equivalently, use the standard local-minimum construction for a decreasing approximation to a distance function. Call the resulting finite set ${\Gamma }_n(A)$. Uniform convergence and the shrinking mesh implyin Hausdorff distance. Every operation at stage $n$ is finite and arithmetic, so $({\Gamma }_n)$ is the required one-limit sequence.

There is no finite-stage certificate that the whole output has the correct Hausdorff error: the convergence of ${\gamma }_n$ has no uniform computable rate over all unitary operators, and unseen matrix entries can still reveal a missing spectral component. A small computed residual can certify that an individual output point lies near the spectrum, but it cannot verify that ${\Gamma }_n(A)$ covers all of $\mathrm{Sp}(A)$. Thus the full finite-stage output is not verifiable without additional information.

Since $\gcd (x,N)=1$, multiplication by $x$ modulo $N$ is a bijection of ${\mathbb{Z}}_N$, with inverse multiplication by the modular inverse $x^{-1}$. Hence $U_x$ permutes the standard orthonormal basis. It preserves all inner products and satisfiesso $U_x$ is a unitary operator.

The number operator $N$ is self-adjoint. Alsoafter $\mathbf{q}\mapsto -\mathbf{q}$. Thus both exponents are anti-Hermitian and ${\mathcal{P}}_1,{\mathcal{P}}_2$ are unitary. Their product obeysand likewise for creation operators. Both generators annihilate the vacuum, so the product leaves it invariant. Substitution in the free-field mode expansion yieldsHence $\mathcal{P}={\mathcal{P}}_1{\mathcal{P}}_2$ implements parity with intrinsic parity ${\gamma }_p$.

A Pauli gate applies a Pauli matrix as a unitary operator to a qubit. The Pauli X gate, Pauli Y gate and Pauli Z gate are common correction operations in quantum teleportation.

Choose eigenphase representatives $0\le {\varphi }_j<1$ for a unitary operator $U$ and a positive integer $M$. Its positive-phase fractional power acts on each eigenstate by $e^{2\pi i{\varphi }_j/M}$. This branch uses arguments in $[0,2\pi )$ and can differ from the usual complex principal branch using $(-\pi ,\pi ]$. For exactly dyadic phases, exact quantum phase estimation stores each label in a coherent phase register; bitwise phase gates multiply it by the required phase, and inverse phase estimation removes the labels. Keeping the phase register unmeasured preserves arbitrary eigenstate superpositions and resets the ancilla qubits. With only controlled-$U$ and controlled-$U^{-1}$ primitives, the direct method uses $2(2^n-1)$ oracle calls for $n$ exact phase bits.

Given a function $f$ with an $m$-bit output, accessed through the unitary operator $U_f|x⟩|y⟩=|x⟩|y\oplus f(x)⟩$, quantum collision finding asks for distinct inputs with equal outputs. Here $\oplus$ is bitwise exclusive or on the $m$-bit answer quantum register. The distinctness requirement excludes the uninformative pair $(x,x)$. For a two-to-one function on $N$ inputs, Grover search algorithm methods yield a cube-root quantum query complexity, despite a square-root cost for finding a partner of just one preselected input.

Let a Hermitian operator $A$ have dyadic eigenvalues ${\lambda }_j=c_j/2^t$ in $[0,1)$ for known $t$, with controlled access to the unitary operator $U=e^{2\pi iA}$. This interval ensures that different eigenvalues have different eigenphases; exact representability alone would not exclude phase aliasing, as $0$ and $1$ both give phase zero. Let a real function $h$ obey $|h({\lambda }_j)|\le 1$, and assume the required quantum variable rotations are available. Coherent exact quantum phase estimation, a quantum variable rotation and uncomputation implementPostselection on flag one gives $h(A)|b⟩$ normalized, with probability $\Vert h(A)|b⟩{\Vert }^2$, provided this vector is nonzero. Erasing the eigenvalue label by uncomputation is essential to preserve coherence between different eigenvectors. On this dyadic spectrum, $U^{2^t}=I$ gives $U^{-1}=U^{2^t-1}$, so reversing the phase-estimation gates is possible using forward controlled-$U$ calls. The choice $h(\lambda )=\lambda$ multiplies by $A$; a scaled reciprocal gives the different filter used in the HHL algorithm.

For an $n$-level qudit and primitive root of unity $\omega$, these unitary operators obey $X^n=Z^n=I$ and $ZX=\omega XZ$. The inverse of $X^s{Z}^{-r}$ is $Z^r{X}^{-s}$, with the order reversed. These operators implement the receiver corrections in qudit teleportation.

For a real squeezing parameter $\gamma$, the single-mode squeeze operator isIts exponent is skew-adjoint, so $S(\gamma )$ is a unitary operator, and it implements the Bogoliubov transformation

An eigenstate with phase $\varphi$ becomes an eigenstate with phase $n\varphi$ under the tensor product of $n$ copies of the unitary operator. A promise $0\le \varphi <1/n$ prevents modulo-one aliasing. For $n=2^s$ and dyadic $\varphi =x/2^m$, exact quantum phase estimation then needs $m-s$ phase bits and $2^{m-s}-1$ queries to a supplied joint controlled oracle. This is a saving in joint-oracle calls, not in the total number of individual oracle invocations needed to build that joint operation.

The time-evolution operator maps an initial quantum state to its state at a later time. For a time-independent Hamiltonian operator $H$, it is the unitary operator $U(t)=e^{-iHt/\hslash }$.

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.

Unitary conjugation maps an operator $A$ to $UA{U}^{†}$ for a unitary operator $U$. It preserves eigenvalues, operator norms, and algebraic relations such as products and adjoints.

A linear isometry from a subspace of a finite-dimensional Hilbert space into the same ambient space extends to a unitary operator. Complete an orthonormal basis of the input subspace and its isometric image to full orthonormal bases, then map the first to the second. The equal complement dimensions make this possible. Orthogonality of the specified image columns, not normalization alone, is essential. In an infinite-dimensional space arbitrary isometries need not be surjective; the finite-dimensional same-space hypothesis cannot be dropped.