REVIEW 2 cited by
On physical problems that are slightly more difficult than QMA
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We introduce new complexity classes consisting of problems that are solvable with a small number of queries to a QMA oracle and use these complexity classes to quantify the complexity of several natural computational problems (for example, the complexity of estimating the spectral gap of a Hamiltonian).
Forward citations
Cited by 2 Pith papers
-
Universal Parent Hamiltonians for Adiabatic Warm Starts
A quantum algorithm framework that converts any circuit-prepared state into an initial Hamiltonian for adiabatic state preparation, with numerical evidence that same-phase MPS warm starts improve adiabatic gaps.
-
Optimal working point in digitized quantum annealing
For a fixed number of Trotter steps, linear-schedule digitized quantum annealing has an optimal total time proportional to the step count; longer times produce the maximally disordered state.
Discussion (0). Continue with ORCID to comment.