Solving Segment Display Problems Using Quantum Grover's Search Algorithm
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909974475571200 |
|---|---|
| author | Chen, Shanyan Al-Bayaty, Ali Song, Xiaoyu Perkowski, Marek |
| author_facet | Chen, Shanyan Al-Bayaty, Ali Song, Xiaoyu Perkowski, Marek |
| contents | This paper introduces a new Boolean-based methodology for constructing Segment Display Problems (SDPs) in the quantum domain and solving them using Grover's quantum search algorithm. In the classical domain, the SDPs are typically solved using various techniques, such as human deduction, heuristic search, and methods for solving Boolean satisfiability (SAT) and constraint satisfaction problems (CSPs) that are based on different problem design models. In this paper, our newly introduced methodology proposes a quantum-based approach for solving such SDPs, by building their quantum oracle using binary reversible circuits and our previously proposed step-decreasing structures shaped operators (Stesso). To demonstrate the usability of this proposed method, we experimentally solve an SDP instance of the matchstick problem using Grover's algorithm with a noisy simulated quantum computer implemented in Qiskit. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_19969 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Solving Segment Display Problems Using Quantum Grover's Search Algorithm Chen, Shanyan Al-Bayaty, Ali Song, Xiaoyu Perkowski, Marek Quantum Physics This paper introduces a new Boolean-based methodology for constructing Segment Display Problems (SDPs) in the quantum domain and solving them using Grover's quantum search algorithm. In the classical domain, the SDPs are typically solved using various techniques, such as human deduction, heuristic search, and methods for solving Boolean satisfiability (SAT) and constraint satisfaction problems (CSPs) that are based on different problem design models. In this paper, our newly introduced methodology proposes a quantum-based approach for solving such SDPs, by building their quantum oracle using binary reversible circuits and our previously proposed step-decreasing structures shaped operators (Stesso). To demonstrate the usability of this proposed method, we experimentally solve an SDP instance of the matchstick problem using Grover's algorithm with a noisy simulated quantum computer implemented in Qiskit. |
| title | Solving Segment Display Problems Using Quantum Grover's Search Algorithm |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.19969 |