Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better
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 experime...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
MDPI AG
2024-10-01
|
| Colección: | Entropy |
| Materias: | |
| Acceso en línea: | https://www.mdpi.com/1099-4300/26/10/875 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|