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

Theoretical and mathematical physics

Quantum Algorithms II

Masanori Ohya, Igor Vasil'evich Volovich

Published Jan 1, 2011• 0 citations
Publisher
DOI
10.1007/978-94-007-0171-7_13

Related papers

Type II quantum algorithms

Peter J. Love, Bruce M. Boghosian

arXiv:quant-ph/0506244•Physica A Statistical Mechanics and its Applications•Oct 28, 2005•25 citations

Quantum Algorithm III

Masanori Ohya, Igor Vasil'evich Volovich

Theoretical and mathematical physics•Jan 1, 2011•1 citation

Quantum Algorithms for Multiobjective Combinatorial Optimization

Gerardo G. Fogel

This thesis studies multiobjective optimization problems in the context of quantum computing. Quantum computing is a computational paradigm based on the laws of quantum physics as superposition, interference and entanglement. New quantum algorithms have emerged that proved to be more efficient than classical algorithms. Particularly, Grover’s search algorithm can find a specific element out of a set of N elements with complexity O(√N). Applications of Grover’s algorithm to optimization problems are currently being studied by other researchers, and in this thesis, a new adaptive search method based on Grover’s algorithm applied to several biobjective optimization problems is introduced. This new algorithm is compared against one of the most cited multiobjective optimization algorithms known as NSGA-II. Experimental evidence suggests that the quantum optimization method proposed in this work is at least as effective as NSGA-II in average, considering an equal number of executions. The proposed quantum algorithm, however, only requires approximately the square root of the number of evaluations executed by NSGA-II. Also, two different types of oracles with regard to the proposed algorithm were considered and the experimental results have shown that one of this oracles has requiered less iterations for similar performance.

•Jan 1, 2017•0 citations

On quantum algorithms

Richard Cleve, ARTUR K. EKERT, Leah Henderson +2 more

Complexity•Sep 1, 1998•28 citations

Achieving quantum advantage in a search for a violations of the Goldbach conjecture, with driven atoms in tailored potentials

Oleksandr V. Marchukov, Andrea Trombettoni, Giuseppe Mussardo +1 more

The famous Goldbach conjecture states that any even natural number N N greater than 2 2 can be written as the sum of two prime numbers p^{\text{(I)}} p (I) and p^{\text{(II)}} p (II) . In this article we propose a quantum analogue device that solves the following problem: given a small prime p^{\text{(I)}} p (I) , identify a member N N of a \mathcal{N} 𝒩 -strong set even numbers for which N-p^{\text{(I)}} N − p (I) is also a prime. A table of suitable large primes p^{\text{(II)}} p (II) is assumed to be known a priori. The device realizes the Grover quantum search protocol and as such ensures a \sqrt{\mathcal{N}} 𝒩 quantum advantage. Our numerical example involves a set of 51 even numbers just above the highest even classical-numerically explored so far [T. O. e Silva, S. Herzog, and S. Pardi, Mathematics of Computation 83, 2033 (2013)]. For a given small prime number p^{\text{(I)}}=223 p (I) = 223 , it took our quantum algorithm 5 steps to identify the number N=4× 10^{18}+14 N = 4 × 10 18 + 14 as featuring a Goldbach partition involving 223 223 and another prime, namely p^{\text{(II)}}=4× 10^{18}-239 p (II) = 4 × 10 18 − 239 . Currently, our algorithm limits the number of evens to be tested simultaneously to \mathcal{N} \sim \ln(N) <

arXiv:2404.00517•SciPost Physics Core•Oct 28, 2025•1 citation

Can quantum computing surpass classical algorithms in optimizing building performance? A benchmark study with 15,000 simulations

Haidar Hosamo, Vagelis Plevris, Dimitrios Kraniotis +1 more

• Quantum and classical algorithms are benchmarked for building performance optimization. • A surrogate model is trained on 15,000 IDA ICE simulations for prediction. • NSGA-II achieves the best trade-offs between energy use and thermal comfort. • Quantum methods deliver faster results but with reduced solution quality. • Quantum computing shows potential for future real-time building optimization. Optimizing building performance is essential for enhancing energy efficiency and occupant comfort. This study evaluates the applicability of quantum computing–based optimization methods in the Architecture, Engineering, and Construction (AEC) industry by comparing the Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) with classical multi-objective optimization algorithms, namely Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO). A dataset of 15,000 building simulations was used to train an Extreme Gradient Boosting (XGBoost) model for predicting total energy consumption (kWh/m 2 /year) and Predicted Percentage of Dissatisfied (PPD) occupants. These predictions were then used in the optimization phase. NSGA-II produced the best trade-offs, achieving energy consumption between 17.84 and 19.84 kWh/m 2 /year and PPD below 5.2 %, with strong diversity and convergence. QAOA executed faster (0.54 min) than NSGA-II (18.9 min) but resulted in higher energy values (31.85–55.62 kWh/m 2 /year) and weaker solution quality. Quantum Annealing completed in 0.37 min but returned clustered solutions near 45.88 kWh/m 2 /year. While the current limitations of quantum methods constrain their effectiveness, the findings indicate their potential as fast solvers in future building performance optimization workflows, particularly as hardware and algorithmic capabilities mature.

Energy and Buildings•Jul 16, 2025•3 citations
This thesis studies multiobjective optimization problems in the context of quantum computing. Quantum computing is a computational paradigm based on the laws of quantum physics as superposition, interference and entanglement. New quantum algorithms have emerged that proved to be more efficient than classical algorithms. Particularly, Grover’s search algorithm can find a specific element out of a set of N elements with complexity O(√N). Applications of Grover’s algorithm to optimization problems are currently being studied by other researchers, and in this thesis, a new adaptive search method based on Grover’s algorithm applied to several biobjective optimization problems is introduced. This new algorithm is compared against one of the most cited multiobjective optimization algorithms known as NSGA-II. Experimental evidence suggests that the quantum optimization method proposed in this work is at least as effective as NSGA-II in average, considering an equal number of executions. The proposed quantum algorithm, however, only requires approximately the square root of the number of evaluations executed by NSGA-II. Also, two different types of oracles with regard to the proposed algorithm were considered and the experimental results have shown that one of this oracles has requiered less iterations for similar performance.
The famous Goldbach conjecture states that any even natural number N N greater than 2 2 can be written as the sum of two prime numbers p^{\text{(I)}} p (I) and p^{\text{(II)}} p (II) . In this article we propose a quantum analogue device that solves the following problem: given a small prime p^{\text{(I)}} p (I) , identify a member N N of a \mathcal{N} 𝒩 -strong set even numbers for which N-p^{\text{(I)}} N − p (I) is also a prime. A table of suitable large primes p^{\text{(II)}} p (II) is assumed to be known a priori. The device realizes the Grover quantum search protocol and as such ensures a \sqrt{\mathcal{N}} 𝒩 quantum advantage. Our numerical example involves a set of 51 even numbers just above the highest even classical-numerically explored so far [T. O. e Silva, S. Herzog, and S. Pardi, Mathematics of Computation 83, 2033 (2013)]. For a given small prime number p^{\text{(I)}}=223 p (I) = 223 , it took our quantum algorithm 5 steps to identify the number N=4× 10^{18}+14 N = 4 × 10 18 + 14 as featuring a Goldbach partition involving 223 223 and another prime, namely p^{\text{(II)}}=4× 10^{18}-239 p (II) = 4 × 10 18 − 239 . Currently, our algorithm limits the number of evens to be tested simultaneously to \mathcal{N} \sim \ln(N) <
• Quantum and classical algorithms are benchmarked for building performance optimization. • A surrogate model is trained on 15,000 IDA ICE simulations for prediction. • NSGA-II achieves the best trade-offs between energy use and thermal comfort. • Quantum methods deliver faster results but with reduced solution quality. • Quantum computing shows potential for future real-time building optimization. Optimizing building performance is essential for enhancing energy efficiency and occupant comfort. This study evaluates the applicability of quantum computing–based optimization methods in the Architecture, Engineering, and Construction (AEC) industry by comparing the Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing (QA) with classical multi-objective optimization algorithms, namely Non-dominated Sorting Genetic Algorithm II (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO). A dataset of 15,000 building simulations was used to train an Extreme Gradient Boosting (XGBoost) model for predicting total energy consumption (kWh/m 2 /year) and Predicted Percentage of Dissatisfied (PPD) occupants. These predictions were then used in the optimization phase. NSGA-II produced the best trade-offs, achieving energy consumption between 17.84 and 19.84 kWh/m 2 /year and PPD below 5.2 %, with strong diversity and convergence. QAOA executed faster (0.54 min) than NSGA-II (18.9 min) but resulted in higher energy values (31.85–55.62 kWh/m 2 /year) and weaker solution quality. Quantum Annealing completed in 0.37 min but returned clustered solutions near 45.88 kWh/m 2 /year. While the current limitations of quantum methods constrain their effectiveness, the findings indicate their potential as fast solvers in future building performance optimization workflows, particularly as hardware and algorithmic capabilities mature.