CS代写 CS378, MA375T, PHY341

CS378, MA375T, PHY341
Homework 2
Homework 2
Introduction to Quantum Information Science Due Sunday, February 5 at 11:59 PM

Copyright By PowCoder代写 加微信 powcoder

1. More fun with matrices.
a) Give an example of a 2×2 unitary matrix where the diagonal entries are 0 but the
off-diagonal entries are nonzero.
b) Give an example for a 4×4 unitary matrix.
c) Is it possible to have a 3×3 unitary matrix with this condition? If no, prove it!
2. Single Qubit Quantum Circuits.
For the following circuits, calculate the output state before the measurement. Then
calculate the measurement probabilities in the specified basis. Here we use: 􏰅0 1􏰆 􏰅1 0􏰆
􏰅1 0􏰆 T = 0 eiπ/4
X=10; Z=0−1; Y=iXZ 1􏰅1 1􏰆 1􏰅1−1􏰆 􏰅10􏰆
H = √2 1 −1 ; Rπ/4 = √2 1 1 ; S = 0 i ; a) Measure in the {|0⟩ , |1⟩} basis:
|0⟩ H Z H S b) Measure in the {|+⟩ , |−⟩} basis:
|0⟩ Rπ/4 Z Y H c) Measure in the {|+⟩ , |−⟩} basis:
|+⟩ T H d) Measure in the {|i⟩ , |−i⟩} basis:
Due Sunday, February 5 at 11:59 PM

CS378, MA375T, PHY341 Homework 2
3. Miscellaneous.
a) Normalize the state |0⟩ + |+⟩.
b) We say a quantum state vector |ψ⟩ is an eigenvector or eigenstate of a matrix Λ if the following equation holds for some number λ:
Λ|ψ⟩ = λ|ψ⟩
λ is called the eigenvalue of |ψ⟩. Show that the state you normalized in part a) is an
eigenstate of the H gate. What is the eigenvalue?
c) What single-qubit states are reachable from |0⟩ using only H and S? Are there finitely
or infinitely many?
4. Distinguishability of states.
Say you are given a state |ψ⟩ that is either |0⟩ or |1⟩ but you don’t know which. You
can distinguish the two via a measurement in the {|0⟩ , |1⟩} basis.
a) But what if |ψ⟩ is either |0⟩ or |+⟩ (with equal probability)? Give the protocol that distinguishes the two states with the optimal failure probability. Calculate this failure probability.
b) What is the failure probability if you measure in the {|0⟩ , |1⟩} basis?
Due Sunday, February 5 at 11:59 PM Page 2

程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com