A parallel fixed-point quantum search algorithm solves SAT by independently processing CNF clauses via entanglement, reducing circuit depth and supporting distributed execution on NISQ devices.
Quantum advantage and noise reduction in distributed quantum computing.Physical Review A, 104(5):052404, 2021
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A parallel and distributed fixed-point quantum search algorithm for solving SAT problems
A parallel fixed-point quantum search algorithm solves SAT by independently processing CNF clauses via entanglement, reducing circuit depth and supporting distributed execution on NISQ devices.