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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
MDPI AG
2024-10-01
|
| coleção: | Entropy |
| Assuntos: | |
| Acesso em linha: | https://www.mdpi.com/1099-4300/26/10/875 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|