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 Multimedia

Quantum Search Algorithms in Science and Engineering

P WilliamsColin

Published Mar 1, 1996• 0 citations
Publisher

Abstract

Search is one of the most pervasive problem-solving techniques in computer science. Search-based problem solvers work by enumerating and examining the candidate solutions to some computational prob...
DOI
10.5555/614650.615646

Related papers

Quantum Problem Solvers

I. S. Osborne

Applied Physics Quantum computers, when they become available, will harness the power of quantum mechanics to perform calculations and searches, outperforming classical computers at certain tasks. The development of quantum computers is two-pronged: Both hardware and software must be devised. The focus in the software realm is on which problems can be solved and how to do so. Solving a set of linear equations is a generic and important problem in many fields of science, engineering, and mathematics. On a classical computer the computational cost of extracting a solution grows linearly with the size of the system. Harrow et al. have developed a quantum algorithm that will solve the problem much more rapidly (scaling as the logarithm of the system size), requiring exponentially less time. Now we wait for the machinery to arrive. Phys. Rev. Lett. 103 , 150502 (2009).

Science•Oct 29, 2009•0 citations

Quantum search algorithms in science and engineering

Colin P. Williams

The kinds of search algorithms that can run on quantum computers are qualitatively different from those that run on classical computers. As this article shows, quantum searches are thus vastly more efficient on certain kinds of problems.

Computing in Science & Engineering•Jan 1, 2001•14 citations

Pragmatic quantum computing for science and engineering

Apostolos Syropoulos

Based on an idea by Richard Feynman, quantum computing is a relatively new technological innovation that promises to very quickly solve problems that one usually encounters in Science and Engineering (i.e., optimization and numerical problems). Currently, there are no full-blown quantum computers; nevertheless, researchers are working on quantum technology, if one is allowed. to say so, propose new ideas, solve old technological problems, implement new hardware design principles, etc., and all these Developments are quite encouraging for the future of quantum computing. Given these facts, it makes sense to propose the use of quantum technology for the solution of common and not-so-common problems encountered in Science and Technology today.

AIP conference proceedings•Jan 1, 2024•0 citations

Quantum search algorithms

Michael A. Nielsen, Isaac L. Chuang

One of the most cited books in physics of all time, Quantum Computation and Quantum Information remains the best textbook in this exciting field of science. This 10th anniversary edition includes an introduction from the authors setting the work in context. This comprehensive textbook describes such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error-correction. Quantum mechanics and computer science are introduced before moving on to describe what a quantum computer is, how it can be used to solve problems faster than 'classical' computers and its real-world implementation. It concludes with an in-depth treatment of quantum information. Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.

Cambridge University Press eBooks•Jun 5, 2012•1 citation

OPTIMIZING GLOBAL SEARCH PROBLEMS USING GROVER'S QUANTUM ALGORITHM

Sh. A. Toirov, A.A.Seytnazarova, T.E.Xudoyqulov

The study examines the use of Grover's quantum algorithm to optimize global search problems, demonstrating its quadratic speedup over classical methods for improved efficiency. The research tackles practical challenges, including quantum noise, scalability, and resource constraints, by proposing innovative solutions. The techniques developed integrate quantum search principles into large-scale optimization tasks across diverse fields. This work lays a foundational framework for applying quantum algorithms to solve complex scientific and industrial problems.

MANAGEMENT AND ECONOMICS SCIENTIFIC RESEARCH JOURNAL•May 21, 2026•0 citations

Quantum variational PDE solver with machine learning

Jaewoo Joo, H. Moon

To solve nonlinear partial differential equations (PDEs) is one of the most common but important tasks in not only basic sciences but also many practical industries. We here propose a quantum variational (QuVa) PDE solver with the aid of machine learning (ML) schemes to synergise two emerging technologies in mathematically hard problems. The core quantum processing in this solver is to calculate efficiently the expectation value of specially designed quantum operators. For a large quantum system, we only obtain data from measurements of few control qubits to avoid the exponential cost in the measurements of the whole quantum system and optimise a pathway to find possible solution sets of the desired PDEs using ML techniques. As an example, a few different types of the second-order DEs are examined with randomly chosen samples and a regression method is implemented to chase the best candidates of solution functions with another trial samples. We demonstrated that a three-qubit system successfully follows the pattern of analytical solutions of three different DEs with high fidelity since the variational solutions are given by a necessary condition to obtain the exact solution of the DEs. Thus, we believe that final solution candidate sets are efficiently extracted from the QuVa PDE solver with the support of ML techniques and this algorithm could be beneficial to search for the solutions of complex mathematical problems as well as to find good ansatzs for eigenstates in large quantum systems (e.g., for quantum chemistry).

arXiv:2109.09216•Sep 19, 2021•4 citations
Applied Physics Quantum computers, when they become available, will harness the power of quantum mechanics to perform calculations and searches, outperforming classical computers at certain tasks. The development of quantum computers is two-pronged: Both hardware and software must be devised. The focus in the software realm is on which problems can be solved and how to do so. Solving a set of linear equations is a generic and important problem in many fields of science, engineering, and mathematics. On a classical computer the computational cost of extracting a solution grows linearly with the size of the system. Harrow et al. have developed a quantum algorithm that will solve the problem much more rapidly (scaling as the logarithm of the system size), requiring exponentially less time. Now we wait for the machinery to arrive. Phys. Rev. Lett. 103 , 150502 (2009).
Based on an idea by Richard Feynman, quantum computing is a relatively new technological innovation that promises to very quickly solve problems that one usually encounters in Science and Engineering (i.e., optimization and numerical problems). Currently, there are no full-blown quantum computers; nevertheless, researchers are working on quantum technology, if one is allowed. to say so, propose new ideas, solve old technological problems, implement new hardware design principles, etc., and all these Developments are quite encouraging for the future of quantum computing. Given these facts, it makes sense to propose the use of quantum technology for the solution of common and not-so-common problems encountered in Science and Technology today.
One of the most cited books in physics of all time, Quantum Computation and Quantum Information remains the best textbook in this exciting field of science. This 10th anniversary edition includes an introduction from the authors setting the work in context. This comprehensive textbook describes such remarkable effects as fast quantum algorithms, quantum teleportation, quantum cryptography and quantum error-correction. Quantum mechanics and computer science are introduced before moving on to describe what a quantum computer is, how it can be used to solve problems faster than 'classical' computers and its real-world implementation. It concludes with an in-depth treatment of quantum information. Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.
The study examines the use of Grover's quantum algorithm to optimize global search problems, demonstrating its quadratic speedup over classical methods for improved efficiency. The research tackles practical challenges, including quantum noise, scalability, and resource constraints, by proposing innovative solutions. The techniques developed integrate quantum search principles into large-scale optimization tasks across diverse fields. This work lays a foundational framework for applying quantum algorithms to solve complex scientific and industrial problems.
To solve nonlinear partial differential equations (PDEs) is one of the most common but important tasks in not only basic sciences but also many practical industries. We here propose a quantum variational (QuVa) PDE solver with the aid of machine learning (ML) schemes to synergise two emerging technologies in mathematically hard problems. The core quantum processing in this solver is to calculate efficiently the expectation value of specially designed quantum operators. For a large quantum system, we only obtain data from measurements of few control qubits to avoid the exponential cost in the measurements of the whole quantum system and optimise a pathway to find possible solution sets of the desired PDEs using ML techniques. As an example, a few different types of the second-order DEs are examined with randomly chosen samples and a regression method is implemented to chase the best candidates of solution functions with another trial samples. We demonstrated that a three-qubit system successfully follows the pattern of analytical solutions of three different DEs with high fidelity since the variational solutions are given by a necessary condition to obtain the exact solution of the DEs. Thus, we believe that final solution candidate sets are efficiently extracted from the QuVa PDE solver with the support of ML techniques and this algorithm could be beneficial to search for the solutions of complex mathematical problems as well as to find good ansatzs for eigenstates in large quantum systems (e.g., for quantum chemistry).