Search results
Results from the WOW.Com Content Network
The fact that the Pauli matrices, along with the identity matrix I, form an orthogonal basis for the Hilbert space of all 2 × 2 complex matrices , over , means that we can express any 2 × 2 complex matrix M as = + where c is a complex number, and a is a 3-component, complex vector.
Multi-qubit Pauli matrices can be written as products of single-qubit Paulis on disjoint qubits. Alternatively, when it is clear from context, the tensor product symbol can be omitted, i.e. unsubscripted Pauli matrices written consecutively represents tensor product rather than matrix product. For example:
The Pauli group is generated by the Pauli matrices, and like them it is named after Wolfgang Pauli. The Pauli group on n {\displaystyle n} qubits, G n {\displaystyle G_{n}} , is the group generated by the operators described above applied to each of n {\displaystyle n} qubits in the tensor product Hilbert space ( C 2 ) ⊗ n {\displaystyle ...
The Pauli matrices abide by the physicists' convention for Lie algebras. In that convention, Lie algebra elements are multiplied by i, the exponential map (below) is defined with an extra factor of i in the exponent and the structure constants remain the same, but the definition of them acquires a factor of i.
Evaluating the exponential for a given z-projection spin quantum number s gives a (2s + 1)-dimensional spin matrix. This can be used to define a spinor as a column vector of 2 s + 1 components which transforms to a rotated coordinate system according to the spin matrix at a fixed point in space.
The Hamiltonian of a spin-1/2 particle in a magnetic field can be written as [3] =, where denote the Pauli matrices, is the magnetic moment, and B is the magnetic field.
the matrix exponential reduces to a plain product of the exponentials of the two respective pieces. This is a formula often used in physics, as it amounts to the analog of Euler's formula for Pauli spin matrices, that is rotations of the doublet representation of the group SU(2).
Arbitrary Clifford group element can be generated as a circuit with no more than (/ ()) gates. [6] [7] Here, reference [6] reports an 11-stage decomposition -H-C-P-C-P-C-H-P-C-P-C-, where H, C, and P stand for computational stages using Hadamard, CNOT, and Phase gates, respectively, and reference [7] shows that the CNOT stage can be implemented using (/ ()) gates (stages -H- and -P ...