Quantum algorithms for biomolecular solutions of the satisfiability problem on a quantum machine
Related Experiment Video
Updated: Jul 1, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
Weng-Long Chang1, Ting-Ting Ren, Jun Luo
1Department of Computer Science and Information Engineering, National Kaohsiung University of Applied Sciences, Kaohsiung City 80778, Taiwan, ROC. changwl@cc.kuas.edu.tw
Abstract:
In this paper, we demonstrate that the logic computation performed by the DNA-based algorithm for solving general cases of the satisfiability problem can be implemented more efficiently by our proposed quantum algorithm on the quantum machine proposed by Deutsch. To test our theory, we carry out a three-quantum bit nuclear magnetic resonance experiment for solving the simplest satisfiability problem.
Related Concept Videos
Biot-Savart Law: Problem-Solving
Consider a mobile phone battery bank as a source of steady current, which flows through the wire connected between the two. What is the magnitude of the magnetic field created by this current at a field point P?
To estimate the magnitude of the total magnetic field, we first consider a small current element of length dl, at a distance r from the field point. Now the following...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
The Quantum-Mechanical Model of an Atom
Molecular Orbital Theory I
Reaction Quotient
Stability of Equilibrium Configuration: Problem Solving
Problem-solving in the context of the stability of equilibrium configuration...