A parallel quantum algorithm for the satisfiability problem

DOI10.1088/0253-6102/49/3/22MaRDI QIDQ4577344zbMATH OpenOpenAlexFDO

Authors Wen-Zhang Liu, Gui-Lu Long, Jing-Fu Zhang

Publication date 3 August 2018

Published in Communications in Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ddf2c7161a1701bb1300e4881467eb424b3acfb0

zbMATH Keywords

long algorithmquantum search algorithmsatisfiability problem

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1285153
• Efficient algorithm for a quantum analogue of 2-SAT
• Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
• Three ``quantum algorithms to solve 3-SAT
• Classical and quantum satisfiability

Cited in

(15)

• Quantum algorithm design: techniques and applications
• Efficient quantum algorithm for the parity problem of a certain function
• Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
• scientific article; zbMATH DE number 1583866 (Why is no real title available?)
• Efficient algorithm for a quantum analogue of 2-SAT
• scientific article; zbMATH DE number 1285153 (Why is no real title available?)
• scientific article; zbMATH DE number 1462669 (Why is no real title available?)
• Linear-Time Algorithm for Quantum 2SAT
• The parallel quantum algorithm for the class of optimization
• scientific article; zbMATH DE number 6789292 (Why is no real title available?)
• Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
• Classical and quantum satisfiability
• Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers
• Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
• Three ``quantum algorithms to solve 3-SAT

This page was built for publication: A parallel quantum algorithm for the satisfiability problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577344)