REVIEW 3 cited by
QMA-complete problems
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
In this paper we give an overview of the quantum computational complexity class QMA and a description of known QMA-complete problems to date. Such problems are believed to be difficult to solve, even with a quantum computer, but have the property that if a purported solution to the problem is given, a quantum computer would easily be able to verify whether it is correct. An attempt has been made to make this paper as self-contained as possible so that it can be accessible to computer scientists, physicists, mathematicians, and quantum chemists. Problems of interest to all of these professions can be found here.
Forward citations
Cited by 3 Pith papers
-
A quantum algorithm for Khovanov homology
A conditional quantum algorithm for estimating the Betti numbers of Khovanov homology, together with DQC1, BQP, and #P hardness results for harder approximation regimes.
-
Deciding Whether a C-Q Channel Preserves a Bit is QCMA-Complete
Deciding if a classical-quantum channel can exactly preserve a single bit is QCMA-complete, with optimal witnesses characterized as computational basis states (minimum) and |+>, |-> states (maximum).
-
Euclidean-Monte-Carlo-informed ground-state preparation for quantum simulation of scalar field theory
A classical pipeline turns Euclidean Monte Carlo correlation data into a variational ansatz and an efficient quantum circuit for the (1+1)D phi^4 ground state.
Discussion (0). Continue with ORCID to comment.