Skip to Content

Math Foundation

2019-09-05·Quantum Computation

Linear Algebra

  • Vector: ∣ψ⟩|\psi\rangle
  • Row vector: ⟨ψ∣=(∣ψ⟩‾)T\langle\psi|=(\overline{|\psi\rangle})^T
  • Inner product: ⟨ψ∣φ⟩=∑iu‾ivi\langle\psi|\varphi\rangle=\sum_i\overline{u}_iv_i
    • ⟨φ∣A∣ψ⟩\langle\varphi|A|\psi\rangle: Inner product between ∣φ⟩|\varphi\rangle and A∣ψ⟩A|\psi\rangle
    • ∥ψ∥=⟨ψ∣ψ⟩\lVert\psi\rVert=\sqrt{\langle\psi|\psi\rangle}
  • Tensor product: A=(aij),B=(bij),A⊗B=(c(i1,i2),(j1,j2))A=(a_{ij}),B=(b_{ij}),A\otimes B=(c_{(i_1,i_2),(j_1,j_2)})
    • H⊗n=H⊗H⊗⋯⊗HH^{\otimes n}=H\otimes H\otimes \cdots \otimes H
  • ∣ψ⟩∣φ⟩=∣ψ⟩⊗∣φ⟩=∣ψφ⟩=∣ψ,φ⟩|\psi\rangle|\varphi\rangle=|\psi\rangle\otimes|\varphi\rangle=|\psi\varphi\rangle=|\psi,\varphi\rangle
    • ∣0n⟩=∣00⋯0⟩|0^n\rangle=|00\cdots0\rangle
    • (A⊗B)(C⊗D)=(AC)⊗(BD)(A\otimes B)(C \otimes D)=(AC)\otimes(BD)
  • M†=M‾TM^\dagger=\overline{M}^T
  • Unitary matrix UU: U†U=IU^\dagger U=I
  • Hermitian matrix: H=U†DUH=U^\dagger DU, UU is unitary and DD is a real diagonal matrix(eigenvalues of HH)
  • Positive semidefinite: HH is Hermitina and its eigenvalues are nonnegative
  • orthonormal basis {∣v1⟩,⋯ ,∣vd⟩}\{|v_1\rangle,\cdots,|v_d\rangle\}
    • Completeness relation: ∑i∣vi⟩⟨vi∣=I\sum_i|v_i\rangle\langle v_i|=I
    • Computational basis in Cd\mathbb{C}^d: ∣i⟩=(0,⋯ ,1,0,⋯ ,0)T|i\rangle=(0,\cdots,1,0,\cdots,0)^T
  • noraml operator: MM†=M†MMM^\dagger=M^\dagger M
    • Spectral/Eigenvalue decomposition: M=∑i=1dλi∣vi⟩⟨vi∣=UΛU∗M=\sum_{i=1}^d\lambda_i|v_i\rangle\langle v_i|=U\Lambda U^*
      • MM is Hermitian iff λi\lambda_i are reals
      • MM is a projector if MM is Hermitian and M2=MM^2=M/λi∈{0,1}\lambda_i\in\{0,1\}
    • f:Cd→C,f(M)=∑i=1df(λi)∣vi⟩⟨vi∣f:\mathbb{C}^d\rightarrow\mathbb{C},f(M)=\sum_{i=1}^df(\lambda_i)|v_i\rangle\langle v_i|
    • Tr(A)=∑iAii=∑i⟨i∣A∣i⟩Tr(A)=\sum_i A_{ii}=\sum_i \langle i|A|i\rangle
      • Tr(AB)=Tr(BA)Tr(AB)=Tr(BA)
      • Tr(M)=∑iλiTr(M)=\sum_{i}\lambda_i

Fourier Transform

  • ∀v∈CN\forall v\in\mathbb{C}^N view it as v:{0,1,⋯ ,N−1}→C,v(i)=viv:\{0,1,\cdots,N-1\}\rightarrow\mathbb{C},v(i)=v_i
  • Inner product: ⟨u,v⟩=∑iu(i)‾v(i)\langle u,v\rangle=\sum_i\overline{u(i)}v(i)
  • orthonormal basis (χj)0≤j≤N−1,χj(k)=1NωNjk,ωN=e2πiN(\chi_j)_{0\leq j\leq N-1},\chi_j(k)=\frac{1}{\sqrt{N}}\omega_N^{jk},\omega_N=e^{\frac{2\pi i}{N}}
    • ∀v∈CN,v=∑j=0Nv^(j)χj\forall v\in\mathbb{C}^N,v=\sum_{j=0}^N\hat v(j)\chi_j
  • FN=1N(χj(k))N×N=1N(χ1,⋯ ,χN)F_N=\frac{1}{\sqrt{N}}(\chi_j(k))_{N\times N}=\frac{1}{\sqrt{N}}(\chi_1,\cdots,\chi_N)
    • Unitary and Symmetric
  • Fourier Transform
    • naïve way O(N2)O(N^2) steps
    • v^=FNv\hat v=F_N v
    • v=FN†,v(j)=∑kv^(N−k)χj(k)v = F_N^\dagger, v(j)=\sum_k\hat v(N-k)\chi_j(k)
    • F2=HF_2=H
  • Convolution: cl=(a∗b)l=1N∑j=0N−1ajb(l−j) mod Nc_l=(a*b)_l=\frac{1}{\sqrt{N}}\sum_{j=0}^{N-1}a_jb_{(l-j)\bmod N}
    • (a∗b^)l=a^l⋅b^l(\widehat{a*b})_l=\hat a_l\cdot \hat b_l
  • Fast Fourier Transform: T(N)=2T(N2)+O(N)⇒T(N)=O(Nlog⁡N)T(N)=2T(\frac{N}{2})+O(N)\Rightarrow T(N)=O(N\log N)
    • v^j=12(v^even j+ωNjv^odd j)\hat v_j=\frac{1}{\sqrt{2}}(\hat v_{\text{even } j}+\omega_N^j\hat v_{\text{odd } j})
  • Multiplying two polynomials: p(x)=∑j=0dajxj,q(x)=∑k=0dbkxkp(x)=\sum_{j=0}^d a_jx^j,q(x)=\sum_{k=0}^d b_kx^k
    • Naïve Alg: O(d2)O(d^2)
    • FFT: O(dlog⁡d)O(d\log d)
      • O(dlog⁡d)O(d\log d): a^,b^\hat a,\hat b
      • O(d)O(d): a∗b^\widehat{a*b}
      • O(dlog⁡d)O(d\log d): a∗ba*b
  • Quantum Fourier transform N=2nN=2^n
    • FN∣k⟩=1N∑j=0N−1e2πijk/N∣j⟩F_N|k\rangle=\frac{1}{\sqrt{N}}\sum_{j=0}^{N-1}e^{2\pi ijk/N}|j\rangle
    • FN∣k1k2⋯kn⟩=⨂l=1n12(∣0⟩+e2πik/2l∣1⟩)=⨂l=1n12(∣0⟩+e2πi0.kn−l+1⋯kn∣1⟩)F_N|k_1k_2\cdots k_n\rangle=\bigotimes_{l=1}^n\frac{1}{\sqrt{2}}(|0\rangle+e^{2\pi ik/2^l}|1\rangle)=\bigotimes_{l=1}^n\frac{1}{\sqrt{2}}(|0\rangle+e^{2\pi i0.k_{n-l+1}\cdots k_n}|1\rangle)
    • FN∣0n⟩=H⊗n∣0n⟩F_N|0^n\rangle=H^{\otimes n}|0^n\rangle
  • 经典与量子的区别
    • v^=FNv\hat v=F_N v
    • ∣v^⟩=FN∣v⟩|\hat v\rangle=F_N|v\rangle
      • 不考虑量子态的制作时间
      • 无法全部读出 ∣v^⟩|\hat v\rangle

Number Theory and Group Theory

  • Zn={0,⋯ ,n−1},Zn∗={x∈Zn:gcd⁡(x,n)=1}Z_n=\{0,\cdots,n-1\},Z_n^*=\{x\in Z_n:\gcd(x,n)=1\}
  • ZpαZ_{p^\alpha} is cyclic if pp is an odd prime and α\alpha is a positive integer
  • Continued fractions: x=[a0,a1,⋯ ],[a0,⋯ ,an]=pnqnx=[a_0,a_1,\cdots],[a_0,\cdots,a_n]=\frac{p_n}{q_n}, then ∣x−pnqn∣≤1qn2|x-\frac{p_n}{q_n}|\leq\frac{1}{q_n^2}
    • p0=a0,p1=a1a0+1,pn=anpn−1+pn−2p_0=a_0,p_1=a_1a_0+1,p_n=a_np_{n-1}+p_{n-2}
    • q0=1,q1=a1,qn=anqn−1+qn−2q_0=1,q_1=a_1,q_n=a_nq_{n-1}+q_{n-2}
  • homomorphism: ρ:G→H\rho:G\rightarrow H is a homomorphism if ρ(g⋅h)=ρ(g)⋅ρ(h),∀g,h∈G\rho(g\cdot h)=\rho(g)\cdot\rho(h),\forall g,h\in G
  • ωN=e2πiN\omega_N=e^{\frac{2\pi i}{N}}
  • representation: homomorphism ρ:G→GL(n,C)\rho: G\rightarrow GL(n,\mathbb{C}), the character χρ(g)=Tr(ρ(g))\chi_\rho(g)=\text{Tr}(\rho(g))
  • Basi theorem: find Abelian group is isomorphic to ZN1×⋯×ZNt\mathbb{Z}_{N_1}\times\cdots\times\mathbb{Z_{N_t}}
  • Represention of ZN\mathbb{Z}_{N}: {χk}0≤k≤N−1,χk(j)=ωNjk\{\chi_k\}_{0\leq k\leq N-1},\chi_k(j)=\omega_N^{jk}
  • Represention of ZN1×⋯×ZNt\mathbb{Z}_{N_1}\times\cdots\times\mathbb{Z_{N_t}}: {χk1⋯χkt}0≤ki≤Ni−1\{\chi_{k1}\cdots\chi_{k_t}\}_{0\leq k_i\leq N_i-1}
  • dual group: G^={all characters of G}\hat G=\{\text{all characters of } G\}
  • ∣χ⟩=1N∑j=0N−1χ(j)∣j⟩|\chi\rangle =\frac{1}{\sqrt{N}}\sum_{j=0}^{N-1}\chi(j)|j\rangle
  • FN∣k⟩=∣χk⟩F_N|k\rangle=|\chi_k\rangle