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

IEEE Long Island Systems, Applications and Technology Conference (LISAT)

Quantum min / max algorithms based on qubits {00, 11}

Ammar Odeh, Eman Abdelfattah

Published May 1, 2017• 0 citations
Publisher

Abstract

Quantum algorithms have gained a lot of consideration especially for the need to find out the extreme values like minimum or maximum. This paper introduces novel quantum algorithms to figure out the minimum and the maximum numbers among a set of positive integer numbers by employing some of the quantum features such as superposition, entanglement, and probability. The proposed algorithms utilize qubits properties to accelerate the searching process.

DOI
10.1109/lisat.2017.8001972

Related papers

Quantum sort algorithm based on entanglement qubits {00, 11}

Ammar Odeh, Eman Abdelfattah

Quantum algorithms have gained a lot of consideration especially for the need of searching unsorted database in a faster way rather than using the classical search mechanisms. This paper introduces a new quantum sort algorithm by employing the quantum features to expedite the searching process in conventional environments. The proposed efficient sorting algorithm emphasizes entanglement qubits property to sort N positive integers.

IEEE Long Island Systems, Applications and Technology Conference (LISAT)•Apr 1, 2016•7 citations

An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits

Yanhu Chen, Shijie Wei, Xiong Gao +3 more

Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential searching algorithm (QESA), which is based on Grover algorithm, is not a sure-success algorithm. Meanwhile, quantum circuits encounter the gate decomposition problem due to variation of the scale of data. In this paper, we propose an optimized quantum algorithm for searching maximum and minimum, based on DHA and the optimal quantum exact search algorithm. Furthermore, we provide the corresponding quantum circuits, together with three equivalent simplifications. In circumstances when we can exactly estimate the ratio of the number of solutions M and the searched space N, our method can improve the successful probability close to 100%. Furthermore, compared with DHA, our algorithm shows an advantage in complexity with large databases and in the gate complexity of constructing oracles. Experiments have been executed on an IBM superconducting processor with two qubits, and a practical problem of finding the minimum from Titanic passengers' age was numerically simulated. Both showed that our optimized maximum or minimum performs more efficiently compared with DHA. Our algorithm can serve as an important subroutine in various quantum algorithms which involves searching maximum or minimum.

arXiv:1908.07943•Aug 21, 2019•11 citations

Quantum algorithms for finding extrema with unary predicates

Man Hon Chan

We study the problem of finding the maximum or the minimum of a given set S = {x₀, X₁, ... X n₋₁}, each element X i drawn from some finite universe [Unary] of real numbers. We assume that the inputs are abstracted within an oracle O where we can only gain information through unary comparisons in the form "Is Xi greater than, equal to, or less than some constant k?" Classically, this problem is solved optimally with a runtime of Θ(n +lg|U|). In the setting of Quantum Computing, we show that at least Ω(√n+lg|U|) queries are required to solve the problem even with bounded error. Combining variants of the Grover's search [1, 2] algorithm and the optimal classical unary extrema finding algorithm, we have derived a series of new quantum algorithms, some running in time as fast as O(√n lg*n+lg|U|). This shows that quantum computers can accelerate the speed in the unary comparison model asymptotically. Inspecting our tools, we find convincing arguments that our lower bound is most probably tight, but we may need an entirely new approach to solve the problem optimally. The technique used in our algorithm can also be extended to solve variations of quantum statistics problems. For instance, our result can be directly extended to approximation of extrema of real numbers, similar to that of [3]. Moreover, we can also solve the quantum k-select problem optimally in time O(√kn) with constant success probability. We hope that our ideas and tools will prove to be useful in other areas.

•Jan 1, 2011•0 citations

Exploiting Quantum Entanglement and Quantum Superposition for Nature-Inspired Optimization

Massimo Panella

Nature-inspired optimization relies on the observation of the efficacy of natural mechanisms for achieving optimal results in the case of processes of vital importance. What is imitated in this case belong to the macroscopic world. However, nature operates with the same efficacy also at the microscopic level, where the laws governing it are those of quantum mechanics. Hence, it is quite reasonable to investigate at this level the possibility of obtaining efficacious optimization algorithms. In the present chapter, a quantum algorithm is proposed for solving a basic problem related to optimization: the determination of the maximum (minimum) in a set of positive integers. The suggested algorithm solves the said problem by an exhaustive procedure based on a suitable nonlinear quantum operator. An example illustrates the details of the algorithm. © 2011 by Nova Science Publishers, Inc. All rights reserved.

•Jan 1, 2012•0 citations

Asymptotic Quantum Search and a Quantum Algorithm for Calculation of a Lower Bound of the Probability of Finding a Diophantine Equation That Accepts Integer Solutions

Rubens Viana Ramos, Juliana Loureiro de Oliveira

Several mathematical problems can be modeled as a search in a database. An example is the problem of finding the minimum of a function. Quantum algorithms for solving this problem have been proposed and all of them use the quantum search algorithm as a subroutine and several intermediate measurements are realized. In this work, it is proposed a new quantum algorithm for finding the minimum of a function in which quantum search is not used as a subroutine and only one measurement is needed. This is also named asymptotic quantum search. As an example, we propose a quantum algorithm based on asymptotic quantum search and quantum counting able to calculate a lower bound of the probability of finding a Diophantine equation with integer solution.

arXiv:0809.1538•Sep 9, 2008•0 citations

The Quantum Approach Leading from Evolutionary to Exhaustive Optimization

Massimo Panella, Giuseppe Martinelli

What bio-inspired algorithms mimic are natural mechanisms governing the macroscopic world for optimizing actual performances that are of vital importance. Neural and neurofuzzy networks, genetic, swarm-intelligence and other evolutionary algorithms are well-known results of this imitation. A completely different situation characterizes the microscopic world governed by quantum mechanics. All the possible solutions exist simultaneously in superposition and the problem is to extract the optimal one. In this case, basic mechanisms of quantum mechanics, i.e., superposition and entanglement, are necessary to mimic nature. Following the latter approach, in this paper a quantum architecture was proposed for determining the maximum/minimum in a set of positive integers which is a basic problem related to optimization. The proposed architecture is based on a suitable nonlinear quantum operator and it solves the said problem by an exhaustive search. This was illustrated in detail in the case of a typical NP-complete problem. © 2012 Asian Network for Scientific Information.

Journal of Applied Sciences•Sep 15, 2012•2 citations
Quantum algorithms have gained a lot of consideration especially for the need to find out the extreme values like minimum or maximum. This paper introduces novel quantum algorithms to figure out the minimum and the maximum numbers among a set of positive integer numbers by employing some of the quantum features such as superposition, entanglement, and probability. The proposed algorithms utilize qubits properties to accelerate the searching process.
Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential searching algorithm (QESA), which is based on Grover algorithm, is not a sure-success algorithm. Meanwhile, quantum circuits encounter the gate decomposition problem due to variation of the scale of data. In this paper, we propose an optimized quantum algorithm for searching maximum and minimum, based on DHA and the optimal quantum exact search algorithm. Furthermore, we provide the corresponding quantum circuits, together with three equivalent simplifications. In circumstances when we can exactly estimate the ratio of the number of solutions M and the searched space N, our method can improve the successful probability close to 100%. Furthermore, compared with DHA, our algorithm shows an advantage in complexity with large databases and in the gate complexity of constructing oracles. Experiments have been executed on an IBM superconducting processor with two qubits, and a practical problem of finding the minimum from Titanic passengers' age was numerically simulated. Both showed that our optimized maximum or minimum performs more efficiently compared with DHA. Our algorithm can serve as an important subroutine in various quantum algorithms which involves searching maximum or minimum.
We study the problem of finding the maximum or the minimum of a given set S = {x₀, X₁, ... X n₋₁}, each element X i drawn from some finite universe [Unary] of real numbers. We assume that the inputs are abstracted within an oracle O where we can only gain information through unary comparisons in the form "Is Xi greater than, equal to, or less than some constant k?" Classically, this problem is solved optimally with a runtime of Θ(n +lg|U|). In the setting of Quantum Computing, we show that at least Ω(√n+lg|U|) queries are required to solve the problem even with bounded error. Combining variants of the Grover's search [1, 2] algorithm and the optimal classical unary extrema finding algorithm, we have derived a series of new quantum algorithms, some running in time as fast as O(√n lg*n+lg|U|). This shows that quantum computers can accelerate the speed in the unary comparison model asymptotically. Inspecting our tools, we find convincing arguments that our lower bound is most probably tight, but we may need an entirely new approach to solve the problem optimally. The technique used in our algorithm can also be extended to solve variations of quantum statistics problems. For instance, our result can be directly extended to approximation of extrema of real numbers, similar to that of [3]. Moreover, we can also solve the quantum k-select problem optimally in time O(√kn) with constant success probability. We hope that our ideas and tools will prove to be useful in other areas.
Nature-inspired optimization relies on the observation of the efficacy of natural mechanisms for achieving optimal results in the case of processes of vital importance. What is imitated in this case belong to the macroscopic world. However, nature operates with the same efficacy also at the microscopic level, where the laws governing it are those of quantum mechanics. Hence, it is quite reasonable to investigate at this level the possibility of obtaining efficacious optimization algorithms. In the present chapter, a quantum algorithm is proposed for solving a basic problem related to optimization: the determination of the maximum (minimum) in a set of positive integers. The suggested algorithm solves the said problem by an exhaustive procedure based on a suitable nonlinear quantum operator. An example illustrates the details of the algorithm. © 2011 by Nova Science Publishers, Inc. All rights reserved.
Several mathematical problems can be modeled as a search in a database. An example is the problem of finding the minimum of a function. Quantum algorithms for solving this problem have been proposed and all of them use the quantum search algorithm as a subroutine and several intermediate measurements are realized. In this work, it is proposed a new quantum algorithm for finding the minimum of a function in which quantum search is not used as a subroutine and only one measurement is needed. This is also named asymptotic quantum search. As an example, we propose a quantum algorithm based on asymptotic quantum search and quantum counting able to calculate a lower bound of the probability of finding a Diophantine equation with integer solution.
What bio-inspired algorithms mimic are natural mechanisms governing the macroscopic world for optimizing actual performances that are of vital importance. Neural and neurofuzzy networks, genetic, swarm-intelligence and other evolutionary algorithms are well-known results of this imitation. A completely different situation characterizes the microscopic world governed by quantum mechanics. All the possible solutions exist simultaneously in superposition and the problem is to extract the optimal one. In this case, basic mechanisms of quantum mechanics, i.e., superposition and entanglement, are necessary to mimic nature. Following the latter approach, in this paper a quantum architecture was proposed for determining the maximum/minimum in a set of positive integers which is a basic problem related to optimization. The proposed architecture is based on a suitable nonlinear quantum operator and it solves the said problem by an exhaustive search. This was illustrated in detail in the case of a typical NP-complete problem. © 2012 Asian Network for Scientific Information.