Related Experiment Video
Updated: Jun 9, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better
Ahmad Bennakhi1, Gregory T Byrd1, Paul Franzon1
1Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC 27695, USA.
Abstract:
This paper aims to outline the effectiveness of modern universal gate quantum computers when utilizing different configurations to solve the B-SAT (Boolean satisfiability) problem. The quantum computing experiments were performed using Grover's search algorithm to find a valid solution. The experiments were performed under different variations to demonstrate their effects on the results. Changing the number of shots, qubit mapping, and using a different quantum processor were all among the experimental variables. The study also branched into a dedicated experiment highlighting a peculiar behavior that IBM quantum processors exhibit when running circuits with a certain number of shots.
Related Concept Videos
Quantum Numbers
The Quantum-Mechanical Model of an Atom
Molecular Orbital Theory I
Solution Equilibrium and Saturation
Hybridization of Atomic Orbitals I
Hybridization of Atomic Orbitals II

