REVIEW 3 cited by
Fast Amplification of 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
Fast Amplification of QMA
read the original abstract
Given a verifier circuit for a problem in QMA, we show how to exponentially amplify the gap between its acceptance probabilities in the `yes' and `no' cases, with a method that is quadratically faster than the procedure given by Marriott and Watrous. Our construction is natively quantum, based on the analogy of a product of two reflections and a quantum walk. Second, in some special cases we show how to amplify the acceptance probability for good witnesses to 1, making a step towards the proof that QMA with one-sided error is equal to QMA. Finally, we simplify the filter-state method to search for QMA witnesses by Poulin and Wocjan.
Forward citations
Cited by 3 Pith papers
-
A shortcut to an optimal quantum linear system solver
The paper gives a QLSS with query complexity (1+O(ε))κ ln(2√2/ε) using one kernel reflection when ||x|| is known, or O(κ log(1/ε)) overall, with explicit bound 56κ + 1.05κ ln(1/ε).
-
Quantum Algorithms for Simulating Nuclear Effective Field Theories
Resource estimates for quantum simulation of pionless and pionful nuclear lattice EFTs, including time evolution and energy estimation, with new error bounds from symmetries and locality yielding orders-of-magnitude i...
-
Numerical Experiments with Parameter Setting of Trotterized Quantum Phase Estimation for Quantum Hamiltonian Ground State Computation
On a 3-qubit Heisenberg spin glass, Trotterized QPE samples the ground-state-energy phase at a rate fixed by initial-state overlap times the textbook QPE success probability, saturating at surprisingly high Trotter error.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.