Solving Segment Display Problems Using Quantum Grover's Search Algorithm

Quantum Physics arXiv:2512.19969 (quant-ph) [Submitted on 23 Dec 2025] Title:Solving Segment Display Problems Using Quantum Grover's Search Algorithm Authors:Shanyan Chen, Ali Al-Bayaty, Xiaoyu Song, Marek Perkowski View a PDF of the paper titled Solving Segment Display Problems Using Quantum Grover's Search Algorithm, by Shanyan Chen and 3 other authors View PDF Abstract: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. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2512.19969 [quant-ph] (or arXiv:2512.19969v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2512.19969 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Shanyan Chen [view email] [v1] Tue, 23 Dec 2025 01:32:28 UTC (1,628 KB) Full-text links: Access Paper: View a PDF of the paper titled Solving Segment Display Problems Using Quantum Grover's Search Algorithm, by Shanyan Chen and 3 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2025-12 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)