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

ФИЗИКА ЭЛЕМЕНТАРНЫХ ЧАСТИЦ И АТОМНОГО ЯДРА

Единственность оператора диффузии Гровера для квантового алгоритма поиска Гровера: Аннотации

M. T. Dima, M. Dima, M. Mihailescu, М. Т. Дима, М. Т. Дима, М. Михаилеску

Published Sep 24, 2025• 0 citations
OpenAlex

Abstract

The repetition of Grover-diffusion operator of the order of $\sqrt{N}$ times is the essence of the Grover quantum selection algorithm. For large N the coherence time $T \,2$ of the qubits limits the application of the algorithm. We explore what other operators could be devised in its place to accelerate convergence. We present a $C++ SU(2)$ model of the Grover-diffusion operator implemented using our $SU2$ package.

Related papers

Grover-Diffusion Operator Unicity for the Grover Quantum-Search Algorithm

Mihai Octavian Dima, Mihai Octavian Dima, M. Mihailescu

Abstract The repetition of Grover-diffusion operator the order of √N times is the essence of the Grover quantum selection algorithm. For large N the coherence time T2 of the qubits limits the application of the algorithm. We explore what other operators could be devised in its place to accelerate convergence. We present a C++ SU(2) model of the Grover-diffusion operator implemented using our SU2 package.

Physics of Particles and Nuclei•Aug 1, 2025•0 citations

Creation and Training of Quantum Neural Networks Based on Grover’s Algorithm

Ц.Б. Пронин, Andrey Vladimirovich Ostroukh

В данной работе рассматривается возможность создания квантовых нейронных сетей, обучаемых с помощью алгоритма Гровера. Цель данной работы заключается в совмещении процесса обучения нейронной сети, производимого с помощью алгоритма Гровера, и функциональной структуры нейронной сети, интерпретированной в виде квантовой схемы. В качестве простого примера нейронной сети, для рассмотрения концепции, был предложен персептрон с одним обучаемым параметром – весом синапса, входящего в скрытый нейрон. This paper discusses the possibility of creating quantum neural networks trained using Grover’s algorithm. The purpose of this work is to combine the learning process of the neural network, produced using Grover’s algorithm, and the functional structure of the neural network, interpreted as a quantum circuit. As a simple example of a neural network, to consider the concept, a perceptron was proposed with one learning parameter – the weight of a synapse entering a hidden neuron.

arXiv:2110.01443•Промышленные АСУ и контроллеры.•Nov 26, 2021•3 citations

Faster quantum searching with almost any diffusion operator

Avatar Tulsi

Grover's search algorithm drives a quantum system from an initial state $|s\ensuremath{\rangle}$ to a desired final state $|t\ensuremath{\rangle}$ by using selective phase inversions of these two states. Earlier, we studied a generalization of Grover's algorithm that relaxes the assumption of the efficient implementation of ${I}_{s}$, the selective phase inversion of the initial state, also known as a diffusion operator. This assumption is known to become a serious handicap in cases of physical interest. Our general search algorithm works with almost any diffusion operator ${D}_{s}$ with the only restriction of having $|s\ensuremath{\rangle}$ as one of its eigenstates. The price that we pay for using any operator is an increase in the number of oracle queries by a factor of $O(B)$, where $B$ is a characteristic of the eigenspectrum of ${D}_{s}$ and can be large in some situations. Here we show that by using a quantum Fourier transform, we can regain the optimal query complexity of Grover's algorithm without losing the freedom of using any diffusion operator for quantum searching. However, the total number of operators required by the algorithm is still $O(B)$ times more than that of Grover's algorithm. So our algorithm offers an advantage only if the oracle operator is computationally more expensive than the diffusion operator, which is true in most search problems.

arXiv:1503.05712•Physical Review A•May 7, 2015•11 citations

Квантовые вычисления на основе алгоритмических вентилей: проектирование алгоритма квантового поиска Гровера в квантовой программной инженерии

V. Sergey, V. Sergey, S. Viktor +1 more

The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators.Input to QA in this case is always the same.Output of QA says which problem coded.In some sense, give a function to QA to analyze and QA returns its property as an answer without quantitative computing.QA studies qualitative properties of the functions.The core of any QA is a set of unitary quantum operators or quantum gates.In practical representation, quantum gate is a unitary matrix with particular structure.The size of this matrix grows exponentially with an increase in the number of inputs, which significantly limits the QA simulation on a classical computer with von Neumann architecture.Quantum search algorithm (QSA)models apply for the solution of computer science problems as searching in unstructured data base, quantum cryptography, engineering tasks, control system design, robotics, smart controllers, etc. Grover's algorithm is explained in details along with implementations on a local computer simulator.The presented article describes a practical approach to modeling one of the most famous QA on classical computers, the Grover algorithm.

Международный журнал Программные продукты и системы•Dec 13, 2023•0 citations

Development of Quantum Schemes for Machine Learning of Neural Networks with the Architecture of the Persecepton Based on the Principles of the Govers Algorithm

Ц.Б. Пронин, Andrey Vladimirovich Ostroukh

Целью данной работы, является практическое исследование возможности формирования квантовых схем для машинного обучения нейронных сетей. За основу демонстрируемых квантовых схем были взяты принципы работы квантового алгоритма Гровера (Grover’s Search Algorithm). За архитектуру примера обучаемой нейронной сети был взят персептрон. Многослойный персептрон является достаточно популярной архитектурой нейронной сети за счет масштабируемости и возможности применения для решения широкого спектра задач. The purpose of this work is a practical study of the possibility of forming quantum schemes for machine learning neural networks. The principles of operation of the Grovers Search Algorithm (Grover’s Search Algorithm) were taken as the basis of the quantum schemes. For the architecture of an example of a trained neural network was taken by Perseceptron. The multilayer perceptron is a fairly popular neural network architecture due to scalability and the possibility of applying a wide range of tasks.

Промышленные АСУ и контроллеры.•Dec 21, 2021•0 citations

Practical Guide to Quantum Computing: Grover's Algorithm # 4

Mikhail Pavlov

Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.

•Mar 4, 2026•0 citations
The repetition of Grover-diffusion operator of the order of N\sqrt{N}N​ times is the essence of the Grover quantum selection algorithm. For large N the coherence time T 2T \,2T2 of the qubits limits the application of the algorithm. We explore what other operators could be devised in its place to accelerate convergence. We present a C++SU(2)C++ SU(2)C++SU(2) model of the Grover-diffusion operator implemented using our SU2SU2SU2 package.
В данной работе рассматривается возможность создания квантовых нейронных сетей, обучаемых с помощью алгоритма Гровера. Цель данной работы заключается в совмещении процесса обучения нейронной сети, производимого с помощью алгоритма Гровера, и функциональной структуры нейронной сети, интерпретированной в виде квантовой схемы. В качестве простого примера нейронной сети, для рассмотрения концепции, был предложен персептрон с одним обучаемым параметром – весом синапса, входящего в скрытый нейрон. This paper discusses the possibility of creating quantum neural networks trained using Grover’s algorithm. The purpose of this work is to combine the learning process of the neural network, produced using Grover’s algorithm, and the functional structure of the neural network, interpreted as a quantum circuit. As a simple example of a neural network, to consider the concept, a perceptron was proposed with one learning parameter – the weight of a synapse entering a hidden neuron.
Grover's search algorithm drives a quantum system from an initial state $|s\ensuremath{\rangle}$ to a desired final state $|t\ensuremath{\rangle}$ by using selective phase inversions of these two states. Earlier, we studied a generalization of Grover's algorithm that relaxes the assumption of the efficient implementation of Is{I}_{s}Is​, the selective phase inversion of the initial state, also known as a diffusion operator. This assumption is known to become a serious handicap in cases of physical interest. Our general search algorithm works with almost any diffusion operator Ds{D}_{s}Ds​ with the only restriction of having $|s\ensuremath{\rangle}$ as one of its eigenstates. The price that we pay for using any operator is an increase in the number of oracle queries by a factor of O(B)O(B)O(B), where BBB is a characteristic of the eigenspectrum of Ds{D}_{s}Ds​ and can be large in some situations. Here we show that by using a quantum Fourier transform, we can regain the optimal query complexity of Grover's algorithm without losing the freedom of using any diffusion operator for quantum searching. However, the total number of operators required by the algorithm is still O(B)O(B)O(B) times more than that of Grover's algorithm. So our algorithm offers an advantage only if the oracle operator is computationally more expensive than the diffusion operator, which is true in most search problems.
The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators.Input to QA in this case is always the same.Output of QA says which problem coded.In some sense, give a function to QA to analyze and QA returns its property as an answer without quantitative computing.QA studies qualitative properties of the functions.The core of any QA is a set of unitary quantum operators or quantum gates.In practical representation, quantum gate is a unitary matrix with particular structure.The size of this matrix grows exponentially with an increase in the number of inputs, which significantly limits the QA simulation on a classical computer with von Neumann architecture.Quantum search algorithm (QSA)models apply for the solution of computer science problems as searching in unstructured data base, quantum cryptography, engineering tasks, control system design, robotics, smart controllers, etc. Grover's algorithm is explained in details along with implementations on a local computer simulator.The presented article describes a practical approach to modeling one of the most famous QA on classical computers, the Grover algorithm.
Целью данной работы, является практическое исследование возможности формирования квантовых схем для машинного обучения нейронных сетей. За основу демонстрируемых квантовых схем были взяты принципы работы квантового алгоритма Гровера (Grover’s Search Algorithm). За архитектуру примера обучаемой нейронной сети был взят персептрон. Многослойный персептрон является достаточно популярной архитектурой нейронной сети за счет масштабируемости и возможности применения для решения широкого спектра задач. The purpose of this work is a practical study of the possibility of forming quantum schemes for machine learning neural networks. The principles of operation of the Grovers Search Algorithm (Grover’s Search Algorithm) were taken as the basis of the quantum schemes. For the architecture of an example of a trained neural network was taken by Perseceptron. The multilayer perceptron is a fairly popular neural network architecture due to scalability and the possibility of applying a wide range of tasks.
Abstract This guide is based on the IBM Quantum course Phase Estimation and Factoring and focuses on Grover’s algorithm, a quantum algorithm for unstructured search problems that provides a quadratic speedup over classical approaches. In an unstructured search problem, we are given a function (often represented as an oracle) that marks one or more “correct” solutions among NNN possible candidates. A classical algorithm requires on the order of O(N)O(N)O(N) evaluations in the worst case. In contrast, Grover’s algorithm finds a solution using only O(N)O(\sqrt{N})O(N) oracle queries. This quadratic improvement implies: The quantum algorithm requires roughly the square root of the number of operations needed classically. Any classical algorithm for unstructured search must have cost at least quadratic relative to Grover’s quantum procedure. Core Idea of the Algorithm Grover’s algorithm relies on: Preparation of a uniform superposition (typically using Hadamard gates). An oracle that marks valid solutions via phase inversion. The Grover diffusion operator, which amplifies the probability amplitude of the marked states through interference. By repeatedly applying the Grover operator, the amplitude of the desired solution grows while others diminish, allowing measurement to reveal the correct answer with high probability. Practical Considerations Despite its theoretical elegance and wide applicability, the quadratic speedup of Grover’s algorithm is unlikely to yield near-term practical advantage. Modern classical hardware operates at extremely high clock rates and is vastly more mature than current quantum devices. For problem sizes accessible to today’s quantum computers, classical systems remain dominant. However, history shows that even sub-quadratic classical improvements — such as: Fast Fourier Transform (FFT) Efficient sorting algorithms like quicksort and mergesort have had transformative practical impact. The crucial distinction is that Grover’s algorithm depends on fundamentally different hardware — quantum processors — which are still in early development. Long-Term Perspective As quantum hardware advances in qubit count, coherence time, and error correction, Grover’s quadratic advantage may become practically significant for: Cryptographic key search Optimization heuristics Combinatorial search problems Amplitude amplification subroutines in broader quantum algorithms Through hands-on experimentation on IBM Q, this lesson demonstrates how theoretical amplitude amplification translates into executable quantum circuits, reinforcing the relationship between interference, probability amplitudes, and computational complexity.