Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Mathematics

Using a Simplified Quantum Counter to Implement Quantum Circuits Based on Grover’s Algorithm to Tackle the Exact Cover Problem

Jehn‐Ruey Jiang, Yujie Wang

Published Dec 29, 2024• 10 citations
Publisher

Abstract

In this paper, we use a simplified quantum counter to implement Grover’s algorithm-based quantum circuits to tackle the NP-hard exact cover problem (ECP). The ECP seeks a subcollection of sets such that every element is covered by exactly one set. Leveraging Grover’s algorithm, our quantum circuits achieve a quadratic speedup, querying the oracle O(N) times, compared to O(N) for classical methods, where N=2n is the total number of unstructured input instances and n is the number of input (quantum) bits. For the whole quantum circuit, the simplified quantum counter saves (4mb−4m)⌊π/4N/M⌋ quantum gates and reduces the quantum circuit depth by (2mb)⌊π/4N/M⌋ compared to Heidari et al.’s design, where b=⌊logn⌋+1 is the number of counting qubits used in a counter. Experimental results obtained using IBM Qiskit packages confirm the effectiveness of our quantum circuits.

DOI
10.3390/math13010090

Related papers

Quantum Circuit Based on Grover’s Algorithm to Solve Exact Cover Problem

Jehn‐Ruey Jiang, Yujie Wang

In this paper, we propose a quantum circuit based on Grover’s algorithm to solve the exact cover problem (ECP), which is NP-hard. A novel controlled counter is designed and used to implement the ECP oracle to check if every element is covered by a set exactly once. If so, a feasible solution is found. The phase of the qubit state representing a feasible solution is flipped by calling the oracle, and the state’s amplitude is amplified through the diffusion operator o($\sqrt{2^{n}}$) times, where n is the number of sets given in the ECP. Thanks to Grover’s algorithm, the proposed quantum circuit achieves quadratic speedup compared with the classical algorithm that needs to call the oracle O($2^{n}$) times. To validate our approach, we execute the proposed quantum circuit using the IBM Quantum Lab service.

IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS)•Aug 1, 2023•11 citations

Novel Quantum Circuit Designs for the Oracle of Grover’s Algorithm to Solve the Vertex Cover Problem

Jehn‐Ruey Jiang, Wei-Han Yan

We propose new quantum circuit designs for the Grover oracle, i.e., the oracle of Grover’s algorithm, to solve the vertex cover problem (VCP) efficiently. Grover’s algorithm is an unstructured quantum search algorithm to search a target data item out of N data pieces by calling the oracle $\mathrm{O}(\sqrt{N})$ times. It represents a quadratic speedup compared to the classical unstructured data sequential search algorithm, which requires O(N) oracle calls. We are in the noisy intermediate-scale quantum (NISQ) era in which quantum computers have a limited number of qubits, short decoherence time, and low gate fidelity. It is thus desirable to design quantum circuits with three properties: (1) a reduced number of qubits, (2) shorter quantum depth, and (3) fewer gates. We created novel designs of a quantum counter and a quantum semaphore to be applied to the Grover oracle to have the three properties. Through the IBM Quantum Lab service, we executed Grover’s algorithm with the novel quantum circuit designs to solve the VCP to validate the design correctness.

IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE)•Oct 27, 2023•6 citations

Utilizing Novel Quantum Counters for Grover's Algorithm to Solve the Dominating Set Problem

Jehn‐Ruey Jiang, Qiao-Yi Lin

Grover's algorithm is a well-known unstructured quantum search algorithm run on quantum computers. It constructs an oracle and calls the oracle O($\sqrt N$) times to locate specific data out of N unsorted data. This represents a quadratic speedup compared to the classical unstructured data sequential search algorithm, which requires to call the oracle O(N) times. We are currently in the noisy intermediate-scale quantum (NISQ) era in which quantum computers have a limited number of qubits, short decoherence time, and low gate fidelity. It is thus desirable to design quantum components with three good properties: (i) a reduced number of qubits, (ii) shorter quantum depth, and (iii) fewer gates. This paper utilizes novel quantum counters with the above-mentioned three good properties to construct the oracle of Grover's algorithm to efficiently solve the dominating set problem (DSP), as defined below. For a given graph G=(V, E), a dominating set (DS) D is a subset of the vertex set V, such that every vertex is in D or has an adjacent vertex in D. The DSP is to decide for a given graph G and an integer k whether there exists a DS with size k. Algorithms solving the DSP have many applications. For example, they can be applied to check whether k routers suffice to connect all computers in a computer network. The DSP is an NP-complete problem, indicating that no classical algorithm exists to solve the DSP with polynomial time complexity in the worst case. Therefore, using quantum algorithms, such as Grover's algorithm, to exploit the potent computational capabilities of quantum computers to solve the DSP is highly promising. We execute the whole quantum circuit of Grover's algorithm using novel quantum counters through the IBM Quantum Lab service to validate that the circuit can solve the DSP efficiently and correctly.

arXiv:2312.09388•Dec 14, 2023•5 citations

A Simplified Quantum Approach Using Grover's Algorithm for Solving the Vertex Cover Problem

Mohamed Yassine Cherif, Wided Lejouad Chaari, Olfa Belkahla Driss

Quantum computing offers an accelerated mechanism for solving combinatorial optimization problems that could be hardly solvable with classical tools, in this context, this paper highlights the utility of quantum computing in solving NP-complete problems efficiently and shows up the importance of employing quantum algorithms achieving parallel calculation in the purpose of reducing the algorithmic complexity and simplifying the development of optimization applications. Within this publication, an optimized version of quantum circuit conception for developing the oracle of the Grover's search algorithm is introduced for solving the vertex cover problem, and it was also tested using the Qiskit library and applied to a set of instances to evaluate its performance.

IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)•Oct 22, 2024•1 citation

An Oracle Design for Grover’s Quantum Search Algorithm for Solving the Exact String Matching Problem

Jeffrey A. Aborot

Grover’s quantum search algorithm is a template for doing quantum search in unstructured search spaces. The details of the oracle in Grover’s algorithm is abstracted for the purpose of analyzing the bound on the number of queries the algorithm must make in order to find the target element of the search space. In order for Grover’s quantum search algorithm to be usable in a specific unstructured search problem, one must provide details on the inner workings of the oracle. Specifically, we present a high-level and basic design of the oracle using the quantum computing model specific to the exact string matching problem. We describe our design using the quantum circuit model of computing and show that the gate complexity of the circuit is linear with respect to the product of the length of the pattern and the size of the alphabet. We have suggested a quantum memory structure for storage and retrieval of the input text. The quantum circuit we presented requires scratch qubits linear to the product of the length of the pattern and the size of the alphabet to reduce the size of the scratch register without exponential increase in the count of elementary gates required for the computation.

Workshop on Computation: Theory and Practice (WCTP)•Dec 1, 2018•3 citations

Qubit-Efficient Quantum Circuit for the Minimum Vertex Cover Problem Using Grover's Algorithm

Krissada Sarawit, Kamonluk Suksen

The Minimum Vertex Cover (MVC) problem is a fundamental NP-hard combinatorial optimization problem with applications in network security, resource allocation, and scheduling. As quantum computing moves toward fault-tolerant operation, developing qubit-efficient algorithms remains a critical challenge. This paper presents three quantum circuit architectures for solving MVC and its weighted variant using Grover's search algorithm: a Dicke-state restricted search that uses Generalized Dicke State Preparation to filter the search space, an arithmetic-based binary counter using the Cuccaro comparator for edge validation, and a weighted arithmetic solver supporting heterogeneous vertex weights. Our results demonstrate that while Dicke-state preparation offers the fastest convergence in terms of Grover iterations with minimal qubit overhead when the optimal cover size$k^\star$is much smaller than the number of vertices$n$(i.e.,$k^\star \ll n$), which occurs in graphs with small vertex covers such as star graphs, the arithmetic-based approaches provide superior scaling for dense graphs by reducing edge validation from$O(m)$to$O(\log m)$ancilla qubits. The weighted arithmetic solver is the only architecture capable of handling heterogeneous vertex weights. We also introduce Skip-K, a classical optimization shared by all three architectures that exploits measurement outcomes to skip intermediate pivot values, reducing the number of Grover executions from$O(\sum _{i} w_{i})$to$O(\log |\mathcal {C}|) \subseteq O(n)$in expectation, where$\mathcal {C}$is the set of feasible covers, and to two executions in the best case. We analyze the trade-offs between qubit requirements and circuit depth across all three architectures, providing a roadmap for implementing these solvers on fault-tolerant quantum hardware.

IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 citations
In this paper, we use a simplified quantum counter to implement Grover’s algorithm-based quantum circuits to tackle the NP-hard exact cover problem (ECP). The ECP seeks a subcollection of sets such that every element is covered by exactly one set. Leveraging Grover’s algorithm, our quantum circuits achieve a quadratic speedup, querying the oracle O(N) times, compared to O(N) for classical methods, where N=2n is the total number of unstructured input instances and n is the number of input (quantum) bits. For the whole quantum circuit, the simplified quantum counter saves (4mb−4m)⌊π/4N/M⌋ quantum gates and reduces the quantum circuit depth by (2mb)⌊π/4N/M⌋ compared to Heidari et al.’s design, where b=⌊logn⌋+1 is the number of counting qubits used in a counter. Experimental results obtained using IBM Qiskit packages confirm the effectiveness of our quantum circuits.
In this paper, we propose a quantum circuit based on Grover’s algorithm to solve the exact cover problem (ECP), which is NP-hard. A novel controlled counter is designed and used to implement the ECP oracle to check if every element is covered by a set exactly once. If so, a feasible solution is found. The phase of the qubit state representing a feasible solution is flipped by calling the oracle, and the state’s amplitude is amplified through the diffusion operator o(2n\sqrt{2^{n}}2n​) times, where n is the number of sets given in the ECP. Thanks to Grover’s algorithm, the proposed quantum circuit achieves quadratic speedup compared with the classical algorithm that needs to call the oracle O(2n2^{n}2n) times. To validate our approach, we execute the proposed quantum circuit using the IBM Quantum Lab service.
We propose new quantum circuit designs for the Grover oracle, i.e., the oracle of Grover’s algorithm, to solve the vertex cover problem (VCP) efficiently. Grover’s algorithm is an unstructured quantum search algorithm to search a target data item out of N data pieces by calling the oracle O(N)\mathrm{O}(\sqrt{N})O(N​) times. It represents a quadratic speedup compared to the classical unstructured data sequential search algorithm, which requires O(N) oracle calls. We are in the noisy intermediate-scale quantum (NISQ) era in which quantum computers have a limited number of qubits, short decoherence time, and low gate fidelity. It is thus desirable to design quantum circuits with three properties: (1) a reduced number of qubits, (2) shorter quantum depth, and (3) fewer gates. We created novel designs of a quantum counter and a quantum semaphore to be applied to the Grover oracle to have the three properties. Through the IBM Quantum Lab service, we executed Grover’s algorithm with the novel quantum circuit designs to solve the VCP to validate the design correctness.
Grover's algorithm is a well-known unstructured quantum search algorithm run on quantum computers. It constructs an oracle and calls the oracle O(N\sqrt NN​) times to locate specific data out of N unsorted data. This represents a quadratic speedup compared to the classical unstructured data sequential search algorithm, which requires to call the oracle O(N) times. We are currently in the noisy intermediate-scale quantum (NISQ) era in which quantum computers have a limited number of qubits, short decoherence time, and low gate fidelity. It is thus desirable to design quantum components with three good properties: (i) a reduced number of qubits, (ii) shorter quantum depth, and (iii) fewer gates. This paper utilizes novel quantum counters with the above-mentioned three good properties to construct the oracle of Grover's algorithm to efficiently solve the dominating set problem (DSP), as defined below. For a given graph G=(V, E), a dominating set (DS) D is a subset of the vertex set V, such that every vertex is in D or has an adjacent vertex in D. The DSP is to decide for a given graph G and an integer k whether there exists a DS with size k. Algorithms solving the DSP have many applications. For example, they can be applied to check whether k routers suffice to connect all computers in a computer network. The DSP is an NP-complete problem, indicating that no classical algorithm exists to solve the DSP with polynomial time complexity in the worst case. Therefore, using quantum algorithms, such as Grover's algorithm, to exploit the potent computational capabilities of quantum computers to solve the DSP is highly promising. We execute the whole quantum circuit of Grover's algorithm using novel quantum counters through the IBM Quantum Lab service to validate that the circuit can solve the DSP efficiently and correctly.
Quantum computing offers an accelerated mechanism for solving combinatorial optimization problems that could be hardly solvable with classical tools, in this context, this paper highlights the utility of quantum computing in solving NP-complete problems efficiently and shows up the importance of employing quantum algorithms achieving parallel calculation in the purpose of reducing the algorithmic complexity and simplifying the development of optimization applications. Within this publication, an optimized version of quantum circuit conception for developing the oracle of the Grover's search algorithm is introduced for solving the vertex cover problem, and it was also tested using the Qiskit library and applied to a set of instances to evaluate its performance.
Grover’s quantum search algorithm is a template for doing quantum search in unstructured search spaces. The details of the oracle in Grover’s algorithm is abstracted for the purpose of analyzing the bound on the number of queries the algorithm must make in order to find the target element of the search space. In order for Grover’s quantum search algorithm to be usable in a specific unstructured search problem, one must provide details on the inner workings of the oracle. Specifically, we present a high-level and basic design of the oracle using the quantum computing model specific to the exact string matching problem. We describe our design using the quantum circuit model of computing and show that the gate complexity of the circuit is linear with respect to the product of the length of the pattern and the size of the alphabet. We have suggested a quantum memory structure for storage and retrieval of the input text. The quantum circuit we presented requires scratch qubits linear to the product of the length of the pattern and the size of the alphabet to reduce the size of the scratch register without exponential increase in the count of elementary gates required for the computation.
The Minimum Vertex Cover (MVC) problem is a fundamental NP-hard combinatorial optimization problem with applications in network security, resource allocation, and scheduling. As quantum computing moves toward fault-tolerant operation, developing qubit-efficient algorithms remains a critical challenge. This paper presents three quantum circuit architectures for solving MVC and its weighted variant using Grover's search algorithm: a Dicke-state restricted search that uses Generalized Dicke State Preparation to filter the search space, an arithmetic-based binary counter using the Cuccaro comparator for edge validation, and a weighted arithmetic solver supporting heterogeneous vertex weights. Our results demonstrate that while Dicke-state preparation offers the fastest convergence in terms of Grover iterations with minimal qubit overhead when the optimal cover sizek⋆k^\stark⋆is much smaller than the number of verticesnnn(i.e.,k⋆≪nk^\star \ll nk⋆≪n), which occurs in graphs with small vertex covers such as star graphs, the arithmetic-based approaches provide superior scaling for dense graphs by reducing edge validation fromO(m)O(m)O(m)toO(log⁡m)O(\log m)O(logm)ancilla qubits. The weighted arithmetic solver is the only architecture capable of handling heterogeneous vertex weights. We also introduce Skip-K, a classical optimization shared by all three architectures that exploits measurement outcomes to skip intermediate pivot values, reducing the number of Grover executions fromO(∑iwi)O(\sum _{i} w_{i})O(∑i​wi​)toO(log⁡∣C∣)⊆O(n)O(\log |\mathcal {C}|) \subseteq O(n)O(log∣C∣)⊆O(n)in expectation, whereC\mathcal {C}Cis the set of feasible covers, and to two executions in the best case. We analyze the trade-offs between qubit requirements and circuit depth across all three architectures, providing a roadmap for implementing these solvers on fault-tolerant quantum hardware.