A quantum algorithm estimates fidelity susceptibility in O~(1/epsilon) queries using a resolvent reformulation, achieving Heisenberg-limited precision.
Efficient algorithm for a quantum analogue of 2-SAT
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists n-qubit pure state such that its k-qubit reduced density matrices have support on prescribed subspaces. We present a classical algorithm solving quantum 2-SAT in a polynomial time. It generalizes the well-known algorithm for the classical 2-SAT. Besides, we show that for any k>=4 quantum k-SAT is complete in the complexity class QMA with one-sided error.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Heisenberg limited quantum algorithm for estimating the fidelity susceptibility
A quantum algorithm estimates fidelity susceptibility in O~(1/epsilon) queries using a resolvent reformulation, achieving Heisenberg-limited precision.