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

arXiv:1404.0668

Quantum Circuit for Calculating Mean Values Via Grover-like Algorithm

Robert R. Tucci

Published Mar 31, 2014• 3 citations
arXivHTMLPDF

Abstract

In this paper, we give a quantum circuit for calculating the mean value of a function $A(x^n)\in \mathbb{C}$, where $x^n\in \{0,1\}^n$. Known classical algorithms for calculating the mean value of a structureless function $A(x^n)$ take ${\cal O}(2^n)$ steps. Our quantum algorithm is based on a Grover-like algorithm and it takes ${\cal O}(\sqrt{2^n})$ steps. Our algorithm differs significantly from previously proposed quantum algorithms for calculating the mean value of a function via Grover's algorithm.

DOI
10.48550/arxiv.1404.0668

Related papers

Quantum Circuit for Calculating Mobius-like Transforms Via Grover-like Algorithm

Robert R. Tucci

In this paper, we give quantum circuits for calculating two closely related linear transforms that we refer to jointly as Mobius-like transforms. The first is the Mobius transform of a function $f^{-}(S^-)\in \mathbb{C}$, where $S^-\subset \{0,1,\ldots,n-1\}$. The second is a marginal of a probability distribution $P(y^n)$, where $y^n\in Bool^n$. Known classical algorithms for calculating these Mobius-like transforms take ${\cal O}(2^n)$ steps. Our quantum algorithm is based on a Grover-like algorithm and it takes ${\cal O}(\sqrt{2^n})$ steps.

arXiv:1403.6910•Mar 27, 2014•3 citations

Quantum Circuit for Calculating Symmetrized Functions Via Grover-like Algorithm

Robert R. Tucci

In this paper, we give a quantum circuit that calculates symmetrized functions. Our algorithm applies the original Grover's algorithm or a variant thereof such as AFGA (adaptive fixed point Grover's algorithm). Our algorithm uses AFGA in conjunction with two new techniques we call "targeting two hypotheses" and "blind targeting". Suppose AFGA drives the starting state $|s\rangle$ to the target state $|t\rangle$. When targeting two hypotheses, $|t\rangle$ is a superposition $a_0|0\rangle + a_1|1\rangle$ of two orthonormal states or hypotheses $|0\rangle$ and $|1\rangle$. When targeting blindly, the value of $\langle t| s\rangle$ is not known a priori.

arXiv:1403.6707•Mar 26, 2014•3 citations

Solving mathematical problems with quantum search algorithm

Rubens Viana Ramos, Paulo Benicio Melo de Sousa, David Sena Oliveira

Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical algorithm. It is possible to use Grover algorithm, taking profit of its ability to find a specific value in a unordered database, to find, for example, the zero of a logical function; the minimal or maximal value in a database or to recognize if an odd number is prime or not. Here we show quantum algorithms to solve those cited mathematical problems. The solution requires the use of a quantum bit string comparator being used as oracle. This quantum circuit compares two quantum states and identifies if they are equal or, otherwise, which of them is the largest. Moreover, we also show the quantum bit string comparator allow us to implement conditional statements in quantum computation, a fundamental structure for designing of algorithms.

arXiv:quant-ph/0605003•Apr 29, 2006•4 citations

More-efficient Quantum Multivariate Mean Value Estimator from Generalized Grover Operator

Letian Tang

In this work, we present an efficient algorithm for multivariate mean value estimation. Our algorithm outperforms previous work by polylog factors and nearly saturates the known lower bound. More formally, given a random vector $\vec{X}$ of dimension $d$, we find an algorithm that uses $O\left(n \log \frac{d}δ\right)$ samples to find a mean estimate that $\vec{\tildeμ}$ that differs from the true mean $\vecμ$ by $\frac{\sqrt{\text{tr } Σ}}{n}$ in $\ell^\infty$ norm and hence $\frac{\sqrt{d \text{ tr } Σ}}{n}$ in $\ell^2$ norm, where $Σ$ is the covariance matrix of the components of the random vector. We also presented another algorithm that uses smaller memory but costs an extra $d^\frac{1}{4}$ in complexity. Consider the Grover operator, the unitary operator used in Grover's algorithm. It contains an oracle that uses a $\pm 1$ phase for each candidate for the search space. Previous work has demonstrated that when we substitute the oracle in Grover operator with generic phases, it ended up being a good mean value estimator in some mathematical notion. We used this idea to build our algorithm. Our result remains not exactly optimal due to a $\log \frac{d}δ$ term in our complexity, as opposed to something nicer such as $\log \frac{1}δ$; This comes from the phase estimation primitive in our algorithm. So far, this primitive is the only major known method to tackle the problem, and moving beyond this idea seems hard. Our results demonstrates that the methodology with generalized Grover operator can be used develop the optimal algorithm without polylog overhead for different tasks relating to mean value estimation.

arXiv:2504.06940•Apr 9, 2025•2 citations

Quantum Calculator on Circuit Optimization of Quantum Computing Using Qiskit

Milind B. Waghmare, Nayan S Thorat, Kamlesh A. Waghmare +1 more

This paper introduces a comprehensive quantum calculator using Qiskit that integrates quantum arithmetic and logic functions into a single calculator. The calculator relies on quantum Fourier transforms (QFT), controlled-phase gates, and quantum modular arithmetic to perform basic arithmetic operations such as addition, subtraction, and multiplication. These arithmetic techniques used quantum parallelism and interference to perform calculations more efficiently, particularly for tasks involving large numerical inputs. Numerical values are stored in qubit registers and processed using QFT-based circuits, which enable efficient and reversible mathematical computations. In addition to arithmetic operations, the calculator also implements quantum logic algorithms, including Grover’s Search and the Deutsch-Jozsa algorithm. Grover’s algorithm is an unstructured search algorithm that operates by constructing an oracle and iteratively amplifying the probability amplitude of the target solution. This amplitude amplification significantly increases the likelihood of measuring the desired outcome. Due to this property, Grover’s algorithm has practical relevance in applications such as database searching and solving combinatorial optimization problems. The Deutsch-Jozsa algorithm determines whether or not a certain Boolean function is constant or balanced and offers an exponential speed up compared to classical methods for this class of problem. A key fundamental function of the calculator is the ability to generate hybrid quantum circuits that support both arithmetic and logical functions. That allows the exploration of simple as well as complex problem-solving strategies that take advantage of both quantum arithmetic and decision-making algorithms. For instance, combining Grover’s amplification with function characterizations from the Deutsch-Jozsa algorithm provides not only interesting circuit configurations but also adds value to the possibilities of the algorithms. This research offers a modular idea and allows exploring the fundamental principles of quantum computing generally speaking and will be a valuable resource for educational as well as research purposes in the rapidly growing field of quantum algorithm development.

Cureus Journal of Computer Science.•Jan 7, 2026•1 citation

How to utilize a Grover search in general programming

Shigeru Yamashita

It is widely believed that quantum computers (if realized) will be more powerful than today’s computers from the viewpoint of computational complexity . However, it is not obvious how to utilize quantum computers in practical situations. For practical purposes, a Grover search may be one of the most promising quantum algorithms known so far. Thus, in this paper, we propose an efficient framework where we can use Grover search for general programming. Our framework has the following steps. (1) A programmer writes a program by using standard C++ programming language. (2) Some if expressions within for loops in the C++ source code are chosen as candidates to be performed as a Grover search on a quantum computer. (3) The framework automatically generates a corresponding quantum circuit for each Grover search chosen in (2). Unlike the existing quantum circuit design methods, we can treat large problems in our quantum circuit design. (4) By evaluating the number of primitive quantum gates in the quantum circuit generated in (3), the framework determines whether the processing time of the quantum circuit is faster than the processing time of the corresponding if expression on a classical computer. If the framework determines that the quantum circuit is faster, it generates some interface source codes for a classical computer. Thus, in our framework, a programmer can use a Grover search with almost no effort.

Laser Physics•Apr 1, 2006•1 citation
In this paper, we give a quantum circuit for calculating the mean value of a function A(xn)∈CA(x^n)\in \mathbb{C}A(xn)∈C, where xn∈{0,1}nx^n\in \{0,1\}^nxn∈{0,1}n. Known classical algorithms for calculating the mean value of a structureless function A(xn)A(x^n)A(xn) take O(2n){\cal O}(2^n)O(2n) steps. Our quantum algorithm is based on a Grover-like algorithm and it takes O(2n){\cal O}(\sqrt{2^n})O(2n​) steps. Our algorithm differs significantly from previously proposed quantum algorithms for calculating the mean value of a function via Grover's algorithm.
In this paper, we give quantum circuits for calculating two closely related linear transforms that we refer to jointly as Mobius-like transforms. The first is the Mobius transform of a function f−(S−)∈Cf^{-}(S^-)\in \mathbb{C}f−(S−)∈C, where S−⊂{0,1,…,n−1}S^-\subset \{0,1,\ldots,n-1\}S−⊂{0,1,…,n−1}. The second is a marginal of a probability distribution P(yn)P(y^n)P(yn), where yn∈Boolny^n\in Bool^nyn∈Booln. Known classical algorithms for calculating these Mobius-like transforms take O(2n){\cal O}(2^n)O(2n) steps. Our quantum algorithm is based on a Grover-like algorithm and it takes O(2n){\cal O}(\sqrt{2^n})O(2n​) steps.
In this paper, we give a quantum circuit that calculates symmetrized functions. Our algorithm applies the original Grover's algorithm or a variant thereof such as AFGA (adaptive fixed point Grover's algorithm). Our algorithm uses AFGA in conjunction with two new techniques we call "targeting two hypotheses" and "blind targeting". Suppose AFGA drives the starting state ∣s⟩|s\rangle∣s⟩ to the target state ∣t⟩|t\rangle∣t⟩. When targeting two hypotheses, ∣t⟩|t\rangle∣t⟩ is a superposition a0∣0⟩+a1∣1⟩a_0|0\rangle + a_1|1\ranglea0​∣0⟩+a1​∣1⟩ of two orthonormal states or hypotheses ∣0⟩|0\rangle∣0⟩ and ∣1⟩|1\rangle∣1⟩. When targeting blindly, the value of ⟨t∣s⟩\langle t| s\rangle⟨t∣s⟩ is not known a priori.
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical algorithm. It is possible to use Grover algorithm, taking profit of its ability to find a specific value in a unordered database, to find, for example, the zero of a logical function; the minimal or maximal value in a database or to recognize if an odd number is prime or not. Here we show quantum algorithms to solve those cited mathematical problems. The solution requires the use of a quantum bit string comparator being used as oracle. This quantum circuit compares two quantum states and identifies if they are equal or, otherwise, which of them is the largest. Moreover, we also show the quantum bit string comparator allow us to implement conditional statements in quantum computation, a fundamental structure for designing of algorithms.
In this work, we present an efficient algorithm for multivariate mean value estimation. Our algorithm outperforms previous work by polylog factors and nearly saturates the known lower bound. More formally, given a random vector X⃗\vec{X}X of dimension ddd, we find an algorithm that uses O(nlog⁡dδ)O\left(n \log \frac{d}δ\right)O(nlogδd​) samples to find a mean estimate that μ~⃗\vec{\tildeμ}μ~​​ that differs from the true mean μ⃗\vecμμ​ by tr Σn\frac{\sqrt{\text{tr } Σ}}{n}ntr Σ​​ in ℓ∞\ell^\inftyℓ∞ norm and hence d tr Σn\frac{\sqrt{d \text{ tr } Σ}}{n}nd tr Σ​​ in ℓ2\ell^2ℓ2 norm, where ΣΣΣ is the covariance matrix of the components of the random vector. We also presented another algorithm that uses smaller memory but costs an extra d14d^\frac{1}{4}d41​ in complexity. Consider the Grover operator, the unitary operator used in Grover's algorithm. It contains an oracle that uses a ±1\pm 1±1 phase for each candidate for the search space. Previous work has demonstrated that when we substitute the oracle in Grover operator with generic phases, it ended up being a good mean value estimator in some mathematical notion. We used this idea to build our algorithm. Our result remains not exactly optimal due to a log⁡dδ\log \frac{d}δlogδd​ term in our complexity, as opposed to something nicer such as log⁡1δ\log \frac{1}δlogδ1​; This comes from the phase estimation primitive in our algorithm. So far, this primitive is the only major known method to tackle the problem, and moving beyond this idea seems hard. Our results demonstrates that the methodology with generalized Grover operator can be used develop the optimal algorithm without polylog overhead for different tasks relating to mean value estimation.
This paper introduces a comprehensive quantum calculator using Qiskit that integrates quantum arithmetic and logic functions into a single calculator. The calculator relies on quantum Fourier transforms (QFT), controlled-phase gates, and quantum modular arithmetic to perform basic arithmetic operations such as addition, subtraction, and multiplication. These arithmetic techniques used quantum parallelism and interference to perform calculations more efficiently, particularly for tasks involving large numerical inputs. Numerical values are stored in qubit registers and processed using QFT-based circuits, which enable efficient and reversible mathematical computations. In addition to arithmetic operations, the calculator also implements quantum logic algorithms, including Grover’s Search and the Deutsch-Jozsa algorithm. Grover’s algorithm is an unstructured search algorithm that operates by constructing an oracle and iteratively amplifying the probability amplitude of the target solution. This amplitude amplification significantly increases the likelihood of measuring the desired outcome. Due to this property, Grover’s algorithm has practical relevance in applications such as database searching and solving combinatorial optimization problems. The Deutsch-Jozsa algorithm determines whether or not a certain Boolean function is constant or balanced and offers an exponential speed up compared to classical methods for this class of problem. A key fundamental function of the calculator is the ability to generate hybrid quantum circuits that support both arithmetic and logical functions. That allows the exploration of simple as well as complex problem-solving strategies that take advantage of both quantum arithmetic and decision-making algorithms. For instance, combining Grover’s amplification with function characterizations from the Deutsch-Jozsa algorithm provides not only interesting circuit configurations but also adds value to the possibilities of the algorithms. This research offers a modular idea and allows exploring the fundamental principles of quantum computing generally speaking and will be a valuable resource for educational as well as research purposes in the rapidly growing field of quantum algorithm development.
It is widely believed that quantum computers (if realized) will be more powerful than today’s computers from the viewpoint of computational complexity . However, it is not obvious how to utilize quantum computers in practical situations. For practical purposes, a Grover search may be one of the most promising quantum algorithms known so far. Thus, in this paper, we propose an efficient framework where we can use Grover search for general programming. Our framework has the following steps. (1) A programmer writes a program by using standard C++ programming language. (2) Some if expressions within for loops in the C++ source code are chosen as candidates to be performed as a Grover search on a quantum computer. (3) The framework automatically generates a corresponding quantum circuit for each Grover search chosen in (2). Unlike the existing quantum circuit design methods, we can treat large problems in our quantum circuit design. (4) By evaluating the number of primitive quantum gates in the quantum circuit generated in (3), the framework determines whether the processing time of the quantum circuit is faster than the processing time of the corresponding if expression on a classical computer. If the framework determines that the quantum circuit is faster, it generates some interface source codes for a classical computer. Thus, in our framework, a programmer can use a Grover search with almost no effort.