Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better
Abstract
This paper examines the effectiveness of modern universal gate quantum computers in solving the Boolean Satisfiability (B-SAT) problem using Grover's Search algorithm. Experiments were conducted with varying configurations, including the number of shots, qubit mapping, and different quantum processors, to assess their impact on the results. The study also includes an experiment that highlights a unique behavior observed in IBM quantum processors when running circuits with a specific number of shots.
Read the paper
Related studies
- In silico toxicology protocols
- QM7-X, a comprehensive dataset of quantum-mechanical properties spanning the chemical space of small organic molecules
- Quantum Informed Machine-Learning Potentials for Molecular Dynamics Simulations of CO2's Chemisorption and Diffusion in Mg-MOF-74
- In-silico strategies in nano-drug design: Bridging nanomaterials and pharmacological applications
- mRNA codon optimization with quantum computers
- The computational power of the human brain
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.