In theoretical physics, there is a branch of quantum field theory dealing with chiral gauge theories. It has been conjectured by Feynman [1] and others that all quantum field theories can be simulated in a limit computable manner efficiently on a quantum computer. However, there is the challenge of finding an efficient limit computable simulation of chiral gauge theories on a quantum computer. Does this problem lie within $\mathsf{BQP}$?

[1] Richard P. Feynman. Simulating Physics with Computers. International Journal of Theoretical Physics, Vol. 21, Nos. 6/7, 1982

  • 1
    $\begingroup$ Since this is a computer science theory forum, it would be nice if you could clarify (or provide references explaninig) why simulating chiral theories (in which sense, btw?) should be "harder" in terms of computational complexity. $\endgroup$ – Juan Bermejo Vega Sep 15 '15 at 12:14
  • $\begingroup$ physics.stackexchange.com/questions/32977/… is this question relevant? $\endgroup$ – Joshua Herman Sep 15 '15 at 19:32

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.