SAT, Gadgets, Max2XOR, and Quantum Annealers
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911873921712128 |
|---|---|
| author | Ansótegui, Carlos Levy, Jordi |
| author_facet | Ansótegui, Carlos Levy, Jordi |
| contents | Quantum Annealers are basically quantum computers that with high probability can optimize certain quadratic functions on Boolean variables in constant time. These functions are basically the Hamiltonian of Ising models that reach the ground energy state, with a high probability, after an annealing process. They have been proposed as a way to solve SAT.
These Hamiltonians can be seen as Max2XOR problems, i.e. as the problem of finding an assignment that maximizes the number of XOR clauses of at most 2 variables that are satisfied. In this paper, we present several gadgets to reduce SAT to Max2XOR. We show how they can be used to translate SAT instances to initial configurations of a quantum annealer. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_00182 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | SAT, Gadgets, Max2XOR, and Quantum Annealers Ansótegui, Carlos Levy, Jordi Quantum Physics Computational Complexity Logic in Computer Science Quantum Annealers are basically quantum computers that with high probability can optimize certain quadratic functions on Boolean variables in constant time. These functions are basically the Hamiltonian of Ising models that reach the ground energy state, with a high probability, after an annealing process. They have been proposed as a way to solve SAT. These Hamiltonians can be seen as Max2XOR problems, i.e. as the problem of finding an assignment that maximizes the number of XOR clauses of at most 2 variables that are satisfied. In this paper, we present several gadgets to reduce SAT to Max2XOR. We show how they can be used to translate SAT instances to initial configurations of a quantum annealer. |
| title | SAT, Gadgets, Max2XOR, and Quantum Annealers |
| topic | Quantum Physics Computational Complexity Logic in Computer Science |
| url | https://arxiv.org/abs/2403.00182 |