Monte Carlo Quantum Computing
arXiv:2012.14523
Abstract
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.
119 pages, 6 figures; broadened the notion of a strongly frustration-free Hamiltonian to a more general concept of separately frustration-free (SFF) Hamiltonian
References in corpus (7)
- Quantum algorithm for solving linear systems of equations
- Quantum Simulations of Classical Annealing Processes
- Simulation of Many-Body Hamiltonians using Perturbation Theory with Bounded-Strength Interactions
- Structure of fermion nodes and nodal cells
- A 2 rebit gate universal for quantum computing
- Fermionic quantum criticality and the fractal nodal surface
- Fermion nodes and nodal cells of noninteracting and interacting fermions