2020/12/28 by David H. Wei, Wei, David H.
Computer Science · Physics and Astronomy · #FOS: Physical sciences #General Physics (physics.gen-ph) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum many-body systems
paper · pdf · doi:10.48550/arxiv.2012.14523
openalex publication_date 2020/12/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is shown that a class of separately frustration-free (SFF) Hamiltonians can be Monte Carlo simulated efficiently on a classical computing machine, because such an SFF Hamiltonian corresponds to a Gibbs wavefunction whose nodal structure is efficiently computable by solving a small subsystem associated with a low-dimensional configuration subspace. It is further demonstrated that SFF Hamiltonians can be designed to implement universal ground state quantum computation. The two results combined have effectively solved the notorious sign problem in Monte Carlo simulations, and proved that all bounded-error quantum polynomial time algorithms admit bounded-error probabilistic polynomial time simulations.