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

International Conference on Computational Intelligence and Security (CIS)

Granular Computing Model Based on Quantum Computing Theory

Jun Hu, Chun Guan

Published Nov 1, 2014• 5 citations
Publisher

Abstract

This paper firstly introduces quantum computing theory into the study of granular computing, then puts forward a new granular computing model based on quantum computing theory, which fully makes full use of the parallelism of quantum computing and layered characteristics of the granular computing. As Grover quantum algorithm has some shortcomings in the classical target number of solutions to solve more problems in the search space, this paper further puts forward an improved Grover quantum search algorithm, and experiment results show it is effective.

DOI
10.1109/cis.2014.55

Related papers

An Improved Grover Quantum Searching Algorithm

Lenan Wu

Grover quantum search algorithm access the unsorted database O (N~(1/2)) times,however,the probability of acquiring so- lutions usually falls with the increase of the number of solutions,the reason of which is analyzed and an improved algorithm based on en- larging searching space is proposed with a new parameter i to make the algorithm controllable in order to trade off between success proba- bility and iterative steps.Simulated experiments of the reciprocal problem showcase that this proposed algorithm can find solutions with higher probability than traditional Grover algorithm at the condition of equivalent iterative steps,and the success probability can even be increased if the iterative steps is unlimited.Thus,it can conclude that our proposed algorithm is more efficient and effective.The validity of the improved algorithm is manifested by experiment.

Signal Processing•Jan 1, 2009•2 citations

Research on Quantum Neural Computational Models

Guangjun Xie

Quantum neural computation is a new paradigm based on the combination of classical neural computation and quantum theory. In this paper, the emergence reasons and characteristics of quantum neural computation are discussed first, then some typical computational models are introduced in detail, at the same time, several solutions to existing problems in these models are put forward. Finally, other related questions are also discussed.

Journal of Circuits and Systems•Jan 1, 2002•5 citations

Improving quantum genetic optimization through granular computing

Giovanni Acampora, Autilia Vitiello

Abstract Quantum computers promise to revolutionize the world of computing thanks to some features of quantum mechanics that can enable massive parallelism in computation. This benefit may be particularly relevant in the design of evolutionary algorithms, where the quantum paradigm could support the exploration of multiple regions of the search space in a concurrent way. Although some efforts in this research field are ongoing, the potential of quantum computing is not yet fully expressed due to the limited number of qubits of current quantum processors. This limitation is even more acute when one wants to deal with continuous optimization problems, where the search space is potentially infinite. The goal of this paper is to address this limitation by introducing a hybrid and granular approach to quantum algorithm design, specifically designed for genetic optimization. This approach is defined as hybrid, because it uses a digital computer to evaluate fitness functions, and a quantum processor to evolve the genetic population; moreover, it uses granular computing to hierarchically reduce the size of the search space of a problem, so that good near-optimal solutions can be identified even on small quantum computers. As shown in the experiments, where IBM Q family processors are used, the usage of a granular computation scheme statistically enhances the performance of the state-of-the-art evolutionary algorithm implemented on quantum computers, when it is run to optimize well-known benchmark continuous functions.

Granular Computing•Oct 8, 2022•9 citations

Research on Parallel Quantum Key Search of Block Cipher

Ye Feng

Block cipher has some advantages such as fast,easy to achieve standardization and ease of hardware and software.It has the most extensive application in the computer communication and information system security.This article presents a parallel quantum key search model of block cipher,based on the combination of Grover search algorithm and classical parallel search ideas.Then we put forward the circuit design of corresponding quantum black-box of the typical block cipher.Finally we give a brief performance analysis.

Journal of Chinese Computer Systems•Jan 1, 2011•0 citations

Implementation of Grover's Algorithm based on Quantum Reservoir Computing

Shivani Mehta, Vidya Praveen Bhallamudi, Arige Sumanth +1 more

Quantum computing represents the leading edge of computational technology, leveraging the principles of quantum mechanics to execute targeted computations much faster than classical computers. In contrast to classical bits, which are limited to representing either 0 or 1, qubits, or quantum bits, exhibit the extraordinary property of superposition. This distinctive characteristic enables qubits to simultaneously occupy multiple states, empowering quantum computers to explore numerous potential solutions to a problem concurrently. This feature makes quantum computing particularly potent for specific tasks. Recent research endeavors have been sparked by the potential of advanced quantum computing technology, leading to the creation of simulations of quantum computers using classical hardware. Grover's quantum search algorithm serves as a notable illustration of quantum computing application, enabling quantum computers to conduct a database search within an unsorted array with a quadratic speedup in time efficiency compared to classical computers. This document presents the quantum Grover search algorithm and its application through 5-qubit quantum circuits, as well as a design framework to simplify the creation of an oracle for a greater number of qubits.

International Conference for Emerging Technology (INCET)•May 24, 2024•2 citations

An Improved Quantum Grover Algorithm

Baoyu Zheng

The algorithm proposed by Grover solves the unsorted database search problem with computation complexity of O(2~(1/2)n/m),where the size of database is N=2n and there is m target solutions.However,the successful probability of searching decreases rapidly,when the target solutions m is greater than N/4,And the algorithm is disabled when m is equal to N/2.This paper presents an improved Grover's algorithm,which can find the object with the successful probability at least 98.01% with one step when m is greater than N/4.

Journal of Nanjing University of Posts and Telecommunications•Jan 1, 2011•0 citations
This paper firstly introduces quantum computing theory into the study of granular computing, then puts forward a new granular computing model based on quantum computing theory, which fully makes full use of the parallelism of quantum computing and layered characteristics of the granular computing. As Grover quantum algorithm has some shortcomings in the classical target number of solutions to solve more problems in the search space, this paper further puts forward an improved Grover quantum search algorithm, and experiment results show it is effective.
Grover quantum search algorithm access the unsorted database O (N~(1/2)) times,however,the probability of acquiring so- lutions usually falls with the increase of the number of solutions,the reason of which is analyzed and an improved algorithm based on en- larging searching space is proposed with a new parameter i to make the algorithm controllable in order to trade off between success proba- bility and iterative steps.Simulated experiments of the reciprocal problem showcase that this proposed algorithm can find solutions with higher probability than traditional Grover algorithm at the condition of equivalent iterative steps,and the success probability can even be increased if the iterative steps is unlimited.Thus,it can conclude that our proposed algorithm is more efficient and effective.The validity of the improved algorithm is manifested by experiment.
Abstract Quantum computers promise to revolutionize the world of computing thanks to some features of quantum mechanics that can enable massive parallelism in computation. This benefit may be particularly relevant in the design of evolutionary algorithms, where the quantum paradigm could support the exploration of multiple regions of the search space in a concurrent way. Although some efforts in this research field are ongoing, the potential of quantum computing is not yet fully expressed due to the limited number of qubits of current quantum processors. This limitation is even more acute when one wants to deal with continuous optimization problems, where the search space is potentially infinite. The goal of this paper is to address this limitation by introducing a hybrid and granular approach to quantum algorithm design, specifically designed for genetic optimization. This approach is defined as hybrid, because it uses a digital computer to evaluate fitness functions, and a quantum processor to evolve the genetic population; moreover, it uses granular computing to hierarchically reduce the size of the search space of a problem, so that good near-optimal solutions can be identified even on small quantum computers. As shown in the experiments, where IBM Q family processors are used, the usage of a granular computation scheme statistically enhances the performance of the state-of-the-art evolutionary algorithm implemented on quantum computers, when it is run to optimize well-known benchmark continuous functions.
Block cipher has some advantages such as fast,easy to achieve standardization and ease of hardware and software.It has the most extensive application in the computer communication and information system security.This article presents a parallel quantum key search model of block cipher,based on the combination of Grover search algorithm and classical parallel search ideas.Then we put forward the circuit design of corresponding quantum black-box of the typical block cipher.Finally we give a brief performance analysis.
Quantum computing represents the leading edge of computational technology, leveraging the principles of quantum mechanics to execute targeted computations much faster than classical computers. In contrast to classical bits, which are limited to representing either 0 or 1, qubits, or quantum bits, exhibit the extraordinary property of superposition. This distinctive characteristic enables qubits to simultaneously occupy multiple states, empowering quantum computers to explore numerous potential solutions to a problem concurrently. This feature makes quantum computing particularly potent for specific tasks. Recent research endeavors have been sparked by the potential of advanced quantum computing technology, leading to the creation of simulations of quantum computers using classical hardware. Grover's quantum search algorithm serves as a notable illustration of quantum computing application, enabling quantum computers to conduct a database search within an unsorted array with a quadratic speedup in time efficiency compared to classical computers. This document presents the quantum Grover search algorithm and its application through 5-qubit quantum circuits, as well as a design framework to simplify the creation of an oracle for a greater number of qubits.
The algorithm proposed by Grover solves the unsorted database search problem with computation complexity of O(2~(1/2)n/m),where the size of database is N=2n and there is m target solutions.However,the successful probability of searching decreases rapidly,when the target solutions m is greater than N/4,And the algorithm is disabled when m is equal to N/2.This paper presents an improved Grover's algorithm,which can find the object with the successful probability at least 98.01% with one step when m is greater than N/4.