RECORD
Monte Carlo Quantum Computing
General Physics · Submitted 28 Dec 2020
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim 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.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | 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. | result 0.85 | 0.81 | 0.18 | asserted 1.00 |
| s1 | It is further demonstrated that SFF Hamiltonians can be designed to implement universal ground state quantum computation. | result 0.78 | 0.86 | 0.16 | asserted 1.00 |
| s2 | 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. | interpretation 0.94 | 0.82 | 0.82 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original 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.
Human review
How the literature uses it
1 arXiv paper cite this in 20 sentences
Papers citing it · 17 sentences without a confident label
Builds on it 1 paper
-
Finally, it is useful to note that the analyses, algorithms, and methods presented supra can be extended straightforwardly to physical and computational systems over a discrete or continuous-discrete product configuration space [ref] , only that the nodal restriction or path rectification may need to invoke the so-called lever rule [ref] using efficiently solved nodal structures of FFIs or their associated Gibbs kernels.
A Solution to the Sign Problem Using a Sum of Controlled Few-Fermions · Introduction · 0.89
Uses its method or tool 1 paper
-
In order to ensure a warm start, it is helpful to employ a sequence of SFF Hamiltonians $H(t)=∑_k = 1^KH_k(t)$, $t∈[0,1]$, which evolves adiabatically from an easily solvable $H(0)$ having $|Φ$ as its unique ground state to $H(1)=H$, the target Hamiltonian, such that the Feynman stack associated with the nested sequence of FFIs ${{H_k(t/m)}_k ∈ [1,K]}_t ∈ [1,m]$ projects $|Φ$ at the start into $|Ψ=ψ_0(H(1))$ in the middle [ref] .
A Solution to the Sign Problem Using a Sum of Controlled Few-Fermions · Introduction · 0.86
What it cites · 9 sentences without a confident label
Uses the method or tool of 1 paper
-
The second strategy takes advantage of the well developed methods of quantum error correction, either employing techniques known as subsystem-, operator-, or Hamiltonian-encoding [ref] that suppress qubit errors using energy penalties, or more fundamentally and systematically, building the Feynman-Kitaev construct from a quantum circuit ${U_L(t)}_t=1^T$ that has quantum error correction and fault tolerance via concatenated encoding [ref] built in as being explained previously in this section.
Fault Tolerant Quantum Computation with Constant Error · Universal Quantum Circuits Using Bi-Fermion Rebits · 0.87
Cites as background 1 paper
-
There is also the class MQA (Merlin Quantum Arthur [ref] ), alternatively known as QCMA (Quantum Classical Merlin Arthur [ref] ), which represents a subset of QMA by restricting the proof message from Merlin to Arthur to be a string of classical bits.
Quantum NP - A Survey · Universal Quantum Circuits Using Bi-Fermion Rebits · 0.84
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.