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

Bulletin of the European Association for Theoretical Computer Science

An invitation to quantum computing

Andreas R. Blass, Yuri G. Gurevich

Published Sep 26, 2018• 2 citations
OpenAlex

Abstract

When a computer scientist attempts to understand quantum computing, he may stumble over the physics that seems to be a prerequisite. As a result, the attempt may be abandoned. This little pedagogical essay is aimed to help with this problem. We present the specific example of Grover’s search algorithm, but we put computation first and postpone physics.

Related papers

Models of quantum search algorithms. Introduction for IT students – pedagogical examples

Иванцова О. В., Nikita Ryabov, V. Korenkov +1 more

This article is one of a series of articles on quantum algorithms. The article discusses quantum oracle models and Grover's computational algorithm for search problems in an unstructured database.

System Analysis in Science and Education•Jan 1, 2020•0 citations

Quantum Algorithms

Ted G. Lewis

This essay was written for computer scientists seeking to understand quantum computing from an algorithmic point of view. It sacrifices rigorous physics so anyone with a computer science background can understand it. Note that it is about algorithms, not machines. This is intentional.

Ubiquity•Mar 1, 2024•0 citations

Beyond Factorization and Search

Lov K. Grover

Recent theoretical developments have driven the search for computers based on the unusual rules of quantum mechanics. In his Perspective, Grover reviews the progress in theoretical quantum computing, with particular focus on search algorithms and applications to difficult computational problems.

Science•Aug 7, 1998•11 citations

Investigating an amplitude amplification-based optimization algorithm for model predictive control

Kip Nieman, Helen Durand, Saahil Patel +2 more

The potential for greater algorithmic efficiency for some problems on quantum computers compared to classical computers is appealing in many fields including, for example, the process systems engineering field. While quantum algorithms have been studied for a variety of applications related to optimization, molecular modeling, and machine learning, there remain many applications in process systems engineering, including process control, where it is not clear how quantum computing algorithms would be beneficial. One idea for attempting to understand when a quantum algorithm might provide benefits for control is to start with algorithms that would be expected to benefit “similar” problems (e.g., optimization problems) and to see if controllers can be implemented within those algorithmic frameworks. Therefore, in this work, we study the use of a quantum computing algorithm related to Grover’s algorithm, which is an amplitude amplification strategy that can search an unordered list with improved efficiency compared to a classical algorithm for the task. It has been extended to perform a search for optimal paths over a graph. Given its potential utility for search and optimization, this is an example of an algorithm where we might wonder if it could be adjusted or used to provide speed-ups for large control problems if the controller could function within this algorithmic framework. This work provides the first steps toward attempting to address this question by investigating how optimization-based control problems would fit into this framework. A process described by ẋ=x+u is considered as a test case. The modified Grover’s algorithm requires the optimization problem to be mapped into quantum gates. We discuss ideas for attempting to represent an optimization-based controller known as model predictive control (MPC) in the modified Grover’s algorithm framework. We test how various parameters of the control and quantum algorithm designs, including fundamental parameters in MPC such as the number of sampling periods and length of the sampling periods, impact the success of using the quantum algorithm for the MPC. We provide analyses regarding why the results are what they are to give perspective on how quantum computing algorithms work and intersect with engineering problems.

Digital Chemical Engineering•Nov 23, 2023•9 citations

Explaining Grover’s algorithm with a colony of ants: a pedagogical model for making quantum technology comprehensible

Merel A. Schalkers, Kamiel Dankers, Michael Wimmer +1 more

Abstract The rapid growth of quantum technologies requires an increasing number of physicists, computer scientists, and engineers who can work on these technologies. For educating these professionals, quantum mechanics should stop being perceived as incomprehensible. In this paper we contribute to this change by presenting a pedagogical model for explaining Grover’s search algorithm, a prominent quantum algorithm. This model visualizes the three main steps of Grover’s algorithm and, in addition to explaining the algorithm itself, introduces three key principles of quantum mechanics: superposition, interference, and state collapse at measurement. The pedagogical model, visualized by a video, is called the ant colony maze model. It represents the search problems as finding the exit of a maze, and visualizes Grover’s search algorithm as a strategy by which a colony of ants finds that exit.

arXiv:2405.00014•Physics Education•Mar 6, 2024•9 citations

Quantum vs classical computation: a proposal opening a new perspective

Angelo Bassi, G. C. Ghirardi

We develop a classical model of computation (the S model) which captures some important features of quantum computation, and which allows to design fast algorithms for solving specific problems. In particular, we show that Deutsch's problem can be trated within the S model of computation in the same way as within quantum computation; also Grover's search problem of an unsorted database finds a surprisingly fast solution. The correct understanding of these results put into a new perspective the relationship between quantum and classical computation.

arXiv:quant-ph/0304074•Apr 10, 2003•0 citations
When a computer scientist attempts to understand quantum computing, he may stumble over the physics that seems to be a prerequisite. As a result, the attempt may be abandoned. This little pedagogical essay is aimed to help with this problem. We present the specific example of Grover’s search algorithm, but we put computation first and postpone physics.
The potential for greater algorithmic efficiency for some problems on quantum computers compared to classical computers is appealing in many fields including, for example, the process systems engineering field. While quantum algorithms have been studied for a variety of applications related to optimization, molecular modeling, and machine learning, there remain many applications in process systems engineering, including process control, where it is not clear how quantum computing algorithms would be beneficial. One idea for attempting to understand when a quantum algorithm might provide benefits for control is to start with algorithms that would be expected to benefit “similar” problems (e.g., optimization problems) and to see if controllers can be implemented within those algorithmic frameworks. Therefore, in this work, we study the use of a quantum computing algorithm related to Grover’s algorithm, which is an amplitude amplification strategy that can search an unordered list with improved efficiency compared to a classical algorithm for the task. It has been extended to perform a search for optimal paths over a graph. Given its potential utility for search and optimization, this is an example of an algorithm where we might wonder if it could be adjusted or used to provide speed-ups for large control problems if the controller could function within this algorithmic framework. This work provides the first steps toward attempting to address this question by investigating how optimization-based control problems would fit into this framework. A process described by ẋ=x+u is considered as a test case. The modified Grover’s algorithm requires the optimization problem to be mapped into quantum gates. We discuss ideas for attempting to represent an optimization-based controller known as model predictive control (MPC) in the modified Grover’s algorithm framework. We test how various parameters of the control and quantum algorithm designs, including fundamental parameters in MPC such as the number of sampling periods and length of the sampling periods, impact the success of using the quantum algorithm for the MPC. We provide analyses regarding why the results are what they are to give perspective on how quantum computing algorithms work and intersect with engineering problems.
Abstract The rapid growth of quantum technologies requires an increasing number of physicists, computer scientists, and engineers who can work on these technologies. For educating these professionals, quantum mechanics should stop being perceived as incomprehensible. In this paper we contribute to this change by presenting a pedagogical model for explaining Grover’s search algorithm, a prominent quantum algorithm. This model visualizes the three main steps of Grover’s algorithm and, in addition to explaining the algorithm itself, introduces three key principles of quantum mechanics: superposition, interference, and state collapse at measurement. The pedagogical model, visualized by a video, is called the ant colony maze model. It represents the search problems as finding the exit of a maze, and visualizes Grover’s search algorithm as a strategy by which a colony of ants finds that exit.
We develop a classical model of computation (the S model) which captures some important features of quantum computation, and which allows to design fast algorithms for solving specific problems. In particular, we show that Deutsch's problem can be trated within the S model of computation in the same way as within quantum computation; also Grover's search problem of an unsorted database finds a surprisingly fast solution. The correct understanding of these results put into a new perspective the relationship between quantum and classical computation.