A fast solver that can find ground state solutions while providing information about the occupation of states in quantum annealing (QA) systems is very desirable. The path-integral Quantum Monte Carlo (QMC) as described by Martonak et al. is an interesting candidate due to having been modeled on physical quantum annealing [1]. While this implementation of QMC behaved similarly, it did not achieve the same levels of performance as reported by Martonak or Denchev [1][2]. Some interesting results were obtained simulating the final distributions of physical quantum annealing on quantum-dot cellular automata (QCA) circuits, but more work is needed on this front before it could become useful.