Feynman's algorithm

From HandWiki

Feynman's algorithm is an algorithm that is used to simulate the operations of a quantum computer on a classical computer. It is based on the Path integral formulation of quantum mechanics, which was formulated by Richard Feynman.[1]

Overview

An n qubit quantum computer takes in a quantum circuit U that contains m gates and an input state |0⟩n. It then outputs a string of bits x∈{0,1}n with probability P(xm)=|⟨xm|U|0⟩n|2.

In Schrödinger's algorithm, P(xm) is calculated straightforwardly via matrix multiplication. That is, P(xm)=|⟨xm|UmUm−1Um−2Um−3,...,U1|0⟩n|2. The quantum state of the system can be tracked throughout its evolution.[2]

In Feynman's path algorithm, P(xm) is calculated by summing up the contributions of (2n)m−1 histories. That is, P(xm)=|⟨xm|U|0⟩n|2=|∑x1,x2,x3,...,xm−1∈{0,1}n∏j=1m⟨xj|Uj|xj−1⟩|2. [3]

Schrödinger's takes less time to run compared to Feynman's while Feynman's takes more time and less space. More precisely, Schrödinger's takes ∼m2n time and ∼2n space while Feynman's takes ∼4m time and ∼m+n space.[4]

Example

Consider the problem of creating a Bell state. What is the probability that the resulting measurement will be 00?

Since the quantum circuit that generates a Bell state is the H (Hadamard gate) gate followed by the CNOT gate, the unitary for this circuit is (H⊗I)×CNOT. In that case, P(00)=|⟨00|(H⊗I)×CNOT|00⟩|2=12 using Schrödinger's algorithm. So probability resulting measurement will be 00 is 12.

Using Feynman's algorithm, the Bell state circuit contains (22)2−1=4 histories: 00,01,10,11 . So |∑00,01,10,11∏j=12⟨xj|Uj|xj−1⟩|2 = |⟨00|H⊗I|00⟩×⟨00|CNOT|00⟩ + ⟨01|H⊗I|00⟩×⟨00|CNOT|01⟩ + ⟨10|H⊗I|00⟩×⟨00|CNOT|10⟩ + ⟨11|H⊗I|00⟩×⟨00|CNOT|11⟩|2=|12+0+0+0|2=12.

See also

References

  1. ↑ Ethan Bernstein and Umesh Vazirani (1997). "Quantum Complexity Theory". SIAM Journal on Computing 26 (5): 1411–1473. doi:10.1137/S0097539796300921. 
  2. ↑ Raedt, K. De; Michielsen, K.; Raedt, H. De; Trieu, B.; Lippert, Th.; Watanabe, H.; Ito, N. (2006). "Massively parallel quantum computer simulator". Comput. Phys. Commun. 176 (2): 121–136. doi:10.1016/j.cpc.2006.08.007. 
  3. ↑ Rudiak-Gould, Ben (2006). The sum-over-histories formulation of quantum computing. Bibcode: 2006quant.ph..7151R. 
  4. ↑ Aaronson, Scott; Chen, Lijie (2016). "Complexity-Theoretic Foundations of Quantum Supremacy Experiments". Proceedings of the 32nd Computational Complexity Conference. Leibniz International Proceedings in Informatics (LIPIcs) 79: 1–67. doi:10.4230/LIPIcs.CCC.2017.22. ISBN 9783959770408.