On computational complexity of some quantum models with bosons

Alexander Yu. Vlasov

Published 2015-08-17Version 1

Expressions with permanents in quantum processes with bosons deserved recently certain attention. A difference between couple relevant models is discussed in presented work. An oscillator model has certain resemblance with matchgate circuits also known as "fermionic linear optics" and effectively simulated on classical computer. The possibility of effective classical computations of average particle numbers in single-mode measurement for bosonic linear optical networks is shown using the analogy.