Speaker: Prof. Akimasa Miyake (Univ. of New Mexico)
Time & Date: 3:00pm, March 26
Place: CELC seminar room (404, 4F)
Title: Quantum computation and simulation, and classical simulation thereof

Abstract: Potential quantum advantage in computation and simulation is of great
interest to scientists, while for now its evidences are rather
scattered as quantum algorithms solving specific problems. In this
talk, I would like to advocate such an approach that quantum
entanglement is indeed a way to characterize generally the complexity
of quantum computation and simulation, despite some (old and new)
misconceptions about its roles. I highlight a restricted set of
quantum logical gate operations related to non-interacting fermionic
time evolutions, called quantum matchgates, in order to observe a
subtle difference between quantum computation and classical simulation
thereof in this setting. It is demonstrated that the computational
complexity of quantum matchgate circuits is evaluated by
"concentrating necessary entanglement and compressing optimally the
width of quantum circuits."

Contact: Akinori Kawachi