Suppress the fixed individual quantum numbers . In the coupled basis, ordered on both rows and columns as , the total-spin eigenvalues give
Here the first three entries form the triplet state sector and the last is the singlet state. For the product basis, use
The first term has diagonal entries . Each nonzero exchange term flips to or back, with coefficient . With rows and columns ordered as ,
The change of basis is made explicit by and , with . The resulting eigenvalues reproduce the diagonal coupled matrix.
The unperturbed level is degenerate. The useful point is that a central perturbation is already diagonal within its usual orbital eigenbasis:
Angular orthogonality removes the possible mixing of and , and also the mixing of different magnetic sublevels. Therefore the matrix required by degenerate perturbation theory needs no further diagonalization: its diagonal entries are precisely the expectation values above. It would be incorrect to justify the calculation by claiming that the unperturbed spectrum was nondegenerate.
For the energy needs only . For a nonzero central confinement term the energy generally needs , but remains independent of . The magnetic quantum number is still needed to specify an individual orbital eigenstate, rather than just its energy.
A density operator is a positive self-adjoint trace-class operator with . A finite expectation is . It represents a pure state exactly when for a unit vector, equivalently or .
For a finite-dimensional spectral decomposition , introduce an auxiliary space with orthonormal vectors and use the enlarged space . Define
Then and . This purification shows that subsystem mixedness can arise from entanglement with an unobserved environment even when the total state is pure. Subsystem measurements alone cannot distinguish these two descriptions.
A nonzero pure bipartite vector is entangled when it cannot be written as a tensor product of two vectors; equivalently its Schmidt rank exceeds one. For mixed bipartite states, entanglement means absence of a convex decomposition into product density operators.
For the nonorthogonal expansion in the question, the unnormalized reduced operator is
Indeed . Positivity follows because , and . Thus is a density operator; if is already normalized, . The Gram factors cannot be dropped merely because the vectors are called bases. For unnormalized , physical expectations likewise divide its raw quadratic form by .
For the Schmidt decomposition diagonalize in an orthonormal basis with its positive eigenvalues . Expand with . The reduced matrix gives . Therefore are orthonormal and
Zero-eigenvalue components vanish because their squared norms are zero. This proves the decomposition for an arbitrary nonzero vector; the zero vector uses the empty sum. For a unit vector .
In the numerical example the coefficient matrix in the two product bases is . Taking the first-subsystem trace yields
The vector is in its nullspace, so rank is at most two; its leading minor has determinant one, so . This is the rank of and the Schmidt rank, proving entanglement. The displayed source ket has norm squared , and the displayed reduced matrix has trace . The physical density operator is ; its nonzero eigenvalues are , since . The raw matrix is correct for the unnormalized quadratic form actually printed.
Put and , with nonnegative integer so the register exists. The geometric sum satisfies
Consequently the matrix with entries has . This proves unitarity and
For a binary output string , expansion of the printed tensor product gives coefficient
Thus the printed product is exactly . It is a correct product decomposition of a Fourier phase state, but the printed recovery identity has inconsistent signs:
by the square of the quantum Fourier transform. To recover instead, use , replacing every product phase by its complex conjugate. Equivalently one may reverse the sign in the definition of . The discrepancy is visible for by taking concentrated at : the printed expression returns the basis vector at . The recovery display also uses as the summation variable on its right while its summand uses ; that dummy variable should be .
For factorization first check . Successive residues are
The first return is . Its half power is , which is neither nor modulo . Therefore
In Shor's algorithm prepare a uniform exponent register of size , conveniently , and reversibly compute into a second register. Measuring that second register, or tracing it out, leaves periodic exponent correlations of period . Conditional on one measured residue, the first register is a superposition over an arithmetic progression of exponents separated by . The quantum Fourier transform converts this periodic structure into peaks near . Continued fractions recover ; when is coprime to , its denominator is . Verify by modular exponentiation and repeat when the reduced denominator is insufficient. For this example is suitable, and useful peaks include those near and . Either transform sign gives the same period information, so the source's inverse-sign error does not invalidate the order-finding mechanism.
The Part C inverse-transform display also prints as its summation index while the summand uses ; that sum must be over , as in the corrected inverse above.
Use an expansion for the eigenstate continuing the nondegenerate level, with intermediate normalization :
Insert these expressions into the eigenvalue equation. At first order,
Taking the inner product with eliminates the left side by self-adjointness. Thus
For , projection onto instead gives
At second order, projecting the eigenvalue equation onto gives . Expand in the orthonormal energy basis and use self-adjointness of :
Nondegeneracy ensures the denominators for this level do not vanish; convergence and validity of the expansion are among the assumed perturbation-theory hypotheses.
For the cosine perturbation of the ground level in a one-dimensional box, write . The product-to-sum identity gives
so, with the given common normalization of the sine eigenfunctions,
The diagonal matrix element is , and the only nonzero off-diagonal matrix element out of the ground state is . Let . Since , the ground energy is
The second-order term is negative, as expected for a nondegenerate ground level: every excited-quantum state denominator is negative. The first-order shift is also negative for positive , because the ground-quantum state density is largest near the center, where this perturbing potential is negative.
Use the Dirac notation convention that the inner product is linear in the ket. Orthonormality of the computational basis gives
The finite geometric sum satisfies if in , and zero otherwise: in the second case it equals . Therefore
There are such orthonormal vectors in an -dimensional space, so they form a basis. The inverse expansion is verified by the same sum:
This is the unitary discrete Fourier transform and its inverse.
For the basis-copying isometry, the images are orthonormal, so is a linear isometry, with . Its matrix elements give
Applying the definition of the adjoint operator, the coefficient of in is exactly this expression. Thus
Equivalently . The adjoint of basis copying acts as pointwise multiplication of coefficient functions.
For the Fourier transform of a basis-copying isometry, the normalization matters:
Hence . Taking adjoint matrix elements, or expanding both output factors in the inverse Fourier basis, yields
The printed formula is missing the factor . There are mutually orthogonal terms in its sum, so without that factor its right side has norm , whereas its left side has norm one because is an isometry. The formula above is the normalized identity consistent with all the preceding definitions. For the distinction disappears, but the no-cloning assertion is substantive for .
The normalized output is not . Its coefficient matrix pairs every Fourier label with ; tracing out either factor gives . Thus it is a maximally entangled state, while two clones of a pure Fourier quantum state would have pure reduced quantum states. A copier for the computational basis therefore does not copy the Fourier basis.
More generally, suppose a linear isometry with a fixed blank input could clone every normalized quantum state. Its restriction to would define a linear map with on every computational basis quantum state. Linearity forces , which has just been shown to fail on Fourier quantum states. This proves the no-cloning theorem in the pure-quantum state isometric setting.
The inner-product proof makes the obstruction independent of the chosen basis. If an isometry cloned two quantum states with overlap , preservation of inner products would give , or, allowing irrelevant output phases, . Distinct nonorthogonal rays have , which is impossible. Even allowing an output environment does not help: unitary evolution would give , the same contradiction. Arbitrary unknown quantum states cannot be cloned, although any fixed orthonormal basis can be copied and a one-dimensional quantum state space is trivial.
Write and . The canonical commutation relations for the creation and annihilation operators give
For example, . The expression for from part (b), with distinct modes reordered, then yields
Thus is an invariant subspace, and the matrix of in the ordered orthonormal basis is
Its characteristic polynomial is , giving the eigenvalues and normalized eigenstates
Indeed, and by the assumed orthonormality. Both eigenstates remain in the eigenspace.
In the ordered orthonormal basis , the Hamiltonian operator has matrix
where is a Pauli matrix. Its symmetric and antisymmetric eigenvectors give
The energy eigenstates are normalized and orthogonal; each energy eigenvalue is nondegenerate. Their full stationary states are and . Since they form an orthonormal basis, the general solution to the Time-dependent Schrödinger equation is
For a normalized quantum state, ; the constants are determined by its initial inner products with .
Diagonalizing the matrix gives the normalized eigenvectors
with eigenvalues , respectively. The first projective measurement prepares up to global phase, regardless of the earlier state, conditional on obtaining .
The unitary time evolution under gives, with ,
The probability amplitudes for the second projective measurement are
The Born rule therefore gives the general spin-one transverse measurement after axial precession:
At the specified times , , so
For even , the result is certainly ; for odd , it is certainly . Although zero belongs to the spectrum of the observable, it never occurs at these times. Indeed, for even the evolved vector is , while for odd it is , where the minus sign is a global phase.
Taking the transpose gives , so is a symmetric matrix. For , has the standard normal distribution, whereas has the normal distribution . Distinct upper-triangular entries depend on disjoint sets of the original independent random variables, so they remain independent.
Consequently the joint probability density function, relative to , is
Here because is a symmetric matrix. This is the Gaussian orthogonal ensemble, with off-diagonal variance one and diagonal variance two; the rescaled matrix has the corresponding off-diagonal variance.
We will also use its entry covariance. Expanding in the independent entries of , for which , gives
The symbols are Kronecker deltas. This formula includes the diagonal case, where the two terms both contribute.
The spectral theorem for real symmetric matrices identifies the sum of the th powers of the eigenvalues with the trace of the th matrix power. Therefore the moment of the empirical spectral measure is
For odd , every summand has zero expectation by part (a)(ii), so for every .
For the second moment, use . There are diagonal entries with variance two and ordered off-diagonal entries with variance one. Their means vanish, giving
Hence .
First , so the spectral theorem for real symmetric matrices gives real eigenvalues and an orthonormal basis of eigenvectors. Moreover, for every real vector ,
Thus is a positive semidefinite matrix. For any nonzero eigenvector with eigenvalue ,
This matrix is a scaled example of the Wishart distribution.
Let be the -by- evaluation matrix . The kernel evaluation matrix is the Gram matrix , so multiplicativity of the determinant gives
Because the polynomials are monic of consecutive degrees, their coefficient matrix relative to is a triangular matrix with unit diagonal. It has determinant one, so the Vandermonde determinant invariance under monic basis change gives
Squaring removes the ordering sign. Thus the Gaussian unitary ensemble joint probability density function has precisely the kernel form
No orthogonality of the polynomials is needed for this step.
The matrix is invertible almost surely. Indeed, successively sampled Gaussian columns have probability zero of lying in the proper linear subspace spanned by the previous columns. Thus the diagonal signs used above exist with probability one. Equivalently, apply the Gram-Schmidt process to the columns, always dividing each residual by its positive Euclidean norm; this produces directly.
To prove uniformity, fix . Each column of has density proportional to , so orthogonal transformations preserve its probability distribution. Column independence therefore gives .
The QR decomposition with positive diagonal is unique: if , then is both an orthogonal matrix and an upper triangular matrix, hence diagonal with entries . Its diagonal entries are positive, so it is the identity. It follows that the orthogonal factor of is . Therefore
By uniqueness of normalized Haar measure on the compact group , the returned matrix has exactly the required probability distribution. Reflection invariance gives each determinant sign probability , so the algorithm samples both components of the orthogonal group. The positive-diagonal correction is essential when a numerical QR decomposition chooses its own signs.
The exact orders printed in the question are inconsistent. The source PDF says that the orders of group elements are , respectively, and also imposes . Multiplying this relation by and using gives . Since also holds, subtracting gives , contradicting the stated order of a group element . Thus
The natural abelian group presentation interpretation is to impose the relations and , with no further relations, without requiring the orders of the images of the generators to stay . Under this interpretation the calculation is as follows. Since follows from , the mixed relation gives . Consequently , and together with this gives . Conversely, , , and imply every original relation. Eliminating leaves two independent cyclic groups:
To verify that these relations force no further identifications, map to in . All defining relations hold, and the inverse group homomorphism sends the two standard generators to . These group homomorphisms are mutually inverse. The divisibility condition gives the requested invariant factors of a finitely generated module over . In this presented group, actually have orders .
Equivalently, the relation matrix
has nonzero Smith normal form entries , with the trivial factor omitted. The displayed direct sum of modules is the answer to the presentation interpretation; the inconsistency of the literal exact-order formulation remains.
Let be nonzero. If the columns were linearly dependent over the rational numbers, then for some . Applying once more would give
so . Since , this forces , impossible in . Thus the two columns are linearly independent, and the square matrix
is an invertible matrix.
The nonconstant invariant factors of a linear operator satisfy . By part (a)(i), is an irreducible polynomial, so every must equal . Their polynomial degrees sum to , giving .
The companion matrix of , in the basis of , is
Therefore, for each fixed even , every such has rational canonical form
There are no such matrices when is odd. This is an instance of the rational canonical form with irreducible minimal polynomial principle; equality of minimal polynomials alone does not determine rational canonical form in general.
Regard as a matrix over the rational numbers. Part (a)(ii), with , gives its characteristic polynomial . Therefore, writing for the imaginary unit,
The matrix is not zero: otherwise would have noninteger diagonal entries. It consequently has rank of a matrix one over the fraction field of the Gaussian integers.
By part (b)(i), is a euclidean domain, hence a principal ideal domain, so apply Smith normal form. There exist such that
Indeed, invertible multiplication preserves rank of a matrix, so exactly one diagonal entry is nonzero. For , multiplication on the right gives . Since is an invertible matrix,
The Smith normal form supplies a kernel basis lemma ensures that the null vector is a column of an invertible matrix over ; an arbitrary nonzero solution over would not itself establish that requirement.
Over a principal ideal domain , an -by- matrix is in Smith normal form if all entries off the main diagonal vanish and its nonzero diagonal entries occur first and satisfy
All remaining diagonal entries are zero. The zero matrix is allowed, with . For an arbitrary matrix , the Smith normal form theorem gives invertible matrices and with
where the right side is interpreted as a rectangular diagonal matrix when necessary. The are determined up to multiplication by units. Positivity can be required over , but is not a condition over the Gaussian integers.
Each entry of the matrix from part (b)(iii) has unique real and imaginary integer coefficients. Write
It already belongs to the general linear group . Expanding the relation from part (b)(iii) gives
The real and imaginary parts must both vanish, so
These are the required identities, with .