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:2406.09450

Grover's algorithm on two-way quantum computer

Grzegorz Czelusta, Verma, Dev Rishi, Wanjalkar, Govind

Published Jun 12, 2024• 6 citations
arXivHTMLPDF

Abstract

Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of $\mathcal{O}(1)$. In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorithm.

DOI
10.48550/arxiv.2406.09450

Related papers

Noise effects in the quantum search algorithm from the viewpoint of computational complexity

Piotr Gawron, Jerzy Klamka, R. Winiarczyk

Noise effects in the quantum search algorithm from the viewpoint of computational complexity We analyse the resilience of the quantum search algorithm in the presence of quantum noise modelled as trace preserving completely positive maps. We study the influence of noise on the computational complexity of the quantum search algorithm. We show that it is only for small amounts of noise that the quantum search algorithm is still more efficient than any classical algorithm.

arXiv:1108.1915•International Journal of Applied Mathematics and Computer Science•Jun 1, 2012•27 citations

No-cloning theorem for 2WQC and postselection

Mah Noor, Jarek Duda

Two-way quantum computers (2WQC) are proposed extension of standard 1WQC: adding conjugated state preparation operation $\langle 0|$ similar to postselection $|0\ra \langle 0|$, by performing a process which from perspective of CPT symmetry is the original state preparation process, for example by reversing EM impulses used for state preparation. As there were concerns that this extension might violate no-cloning theorem for example for attacks on quantum cryptographic protocols like BB84, here we extend the original proof to show this theorem still holds for 2WQC and postselection.

arXiv:2407.15623•Jul 22, 2024•2 citations

Prospect of using Grover's search in the noisy-intermediate-scale quantum-computer era

Yulun Wang, Predrag Krstić

In order to understand the bounds of utilization of Grover's search algorithm for large unstructured data in the presence of quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modeled by the IBM qiskit. We apply three forms of Grover's algorithm: (i) the standard one, with 4--10 qubits; (ii) a recently published modified Grover's algorithm, set to reduce the circuit depth; and (iii) the algorithms in (i) and (ii) with multicontrol Toffoli's gates modified by the addition of an ancilla qubit. Based on these simulations, we find the upper bound of noise for these cases, establish its dependence on the quantum depth of the circuit, and provide comparison among them. By extrapolation of the fitted thresholds, we predict what would be the typical gate error bounds when applying Grover's algorithms for the search of data in a data set as large as 32 000.

arXiv:2006.10037•Physical Review A•Oct 20, 2020•36 citations

Shor's algorithm and Grover's algorithm in quantum computing.

Chris Valle

In this paper we will analyse two quantum algorithms that sparked interest in the potential of quantum computers. The first is Lov Grover's algorithm which may be used to conduct a type of database search. The second is Peter Shor's algorithm which may be used to factor large numbers and provides an exponential speed up over the best current classical algorithms. In the context of these two algorithms we will discuss the benefits and weaknesses of quantum computation. We will show that in exchange for a quantum computer's greater speed we must accept an inherent level of uncertainty in our results.

•Jan 1, 2011•1 citation

Implementation of Grover's Algorithm based on Quantum Reservoir Computing

Shivani Mehta, Vidya Praveen Bhallamudi, Arige Sumanth +1 more

Quantum computing represents the leading edge of computational technology, leveraging the principles of quantum mechanics to execute targeted computations much faster than classical computers. In contrast to classical bits, which are limited to representing either 0 or 1, qubits, or quantum bits, exhibit the extraordinary property of superposition. This distinctive characteristic enables qubits to simultaneously occupy multiple states, empowering quantum computers to explore numerous potential solutions to a problem concurrently. This feature makes quantum computing particularly potent for specific tasks. Recent research endeavors have been sparked by the potential of advanced quantum computing technology, leading to the creation of simulations of quantum computers using classical hardware. Grover's quantum search algorithm serves as a notable illustration of quantum computing application, enabling quantum computers to conduct a database search within an unsorted array with a quadratic speedup in time efficiency compared to classical computers. This document presents the quantum Grover search algorithm and its application through 5-qubit quantum circuits, as well as a design framework to simplify the creation of an oracle for a greater number of qubits.

International Conference for Emerging Technology (INCET)•May 24, 2024•2 citations

Opening the Black Box inside Grover’s Algorithm

Edwin Miles Stoudenmire, Xavier Waintal

Grover’s algorithm is one of the primary algorithms offered as evidence that quantum computers can provide an advantage over classical computers. It involves an “oracle” (external quantum subroutine), which must be specified for a given application and whose internal structure is not part of the formal scaling of the quadratic quantum speedup guaranteed by the algorithm. Grover’’s algorithm also requires exponentially many calls to the quantum oracle (approximately 2 n calls where n is the number of qubits) to succeed, raising the question of its implementation on both noisy and error-corrected quantum computers. In this work, we construct a quantum-inspired algorithm executable on a classical computer that performs Grover’s task in a linear number of calls to (simulations of) the oracle—an exponentially smaller number than Grover’s algorithm—and demonstrate this algorithm explicitly for Boolean satisfiability problems. The complexity of our algorithm depends on the cost to simulate the oracle once, which may or may not be exponential, depending on its internal structure. Indeed, Grover’s algorithm does not have an quantum speedup as soon as one is given access to the “source code” of the oracle, which may reveal an internal structure of the problem. Our findings illustrate this point explicitly, as our algorithm exploits the structure of the quantum circuit used to program the quantum computer to speed up the search. There are still problems where Grover’s algorithm would provide an asymptotic speedup if it could be run accurately for large enough sizes. Our quantum-inspired algorithm provides lower bounds, in terms of the quantum-circuit complexity, for the quantum hardware to beat classical approaches for these problems. These estimates, combined with the unfavorable scaling of the success probability of Grover’s algorithm, which in the presence of noise decays as the exponential of the exponential of the number of qubits, makes a practical speedup unrealistic even under extremely optimistic assumptions of the evolution of both hardware quality and availability. Published by the American Physical Society 2024

arXiv:2303.11317•Physical Review X•Nov 1, 2024•56 citations
Two-way quantum computing (2WQC) represents a novel approach to quantum computing that introduces a CPT version of state preparation. This paper analyses the influence of this approach on Grover's algorithm and compares the behaviour of typical Grover and its 2WQC version in the presence of noise in the system. Our findings indicate that, in an ideal scenario without noise, the 2WQC Grover algorithm exhibits a constant complexity of O(1)\mathcal{O}(1)O(1). In the presence of noise, the 2WQC Grover algorithm demonstrates greater resilience to different noise models than the standard Grover's algorithm.
Two-way quantum computers (2WQC) are proposed extension of standard 1WQC: adding conjugated state preparation operation ⟨0∣\langle 0|⟨0∣ similar to postselection $|0\ra \langle 0|$, by performing a process which from perspective of CPT symmetry is the original state preparation process, for example by reversing EM impulses used for state preparation. As there were concerns that this extension might violate no-cloning theorem for example for attacks on quantum cryptographic protocols like BB84, here we extend the original proof to show this theorem still holds for 2WQC and postselection.
In order to understand the bounds of utilization of Grover's search algorithm for large unstructured data in the presence of quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modeled by the IBM qiskit. We apply three forms of Grover's algorithm: (i) the standard one, with 4--10 qubits; (ii) a recently published modified Grover's algorithm, set to reduce the circuit depth; and (iii) the algorithms in (i) and (ii) with multicontrol Toffoli's gates modified by the addition of an ancilla qubit. Based on these simulations, we find the upper bound of noise for these cases, establish its dependence on the quantum depth of the circuit, and provide comparison among them. By extrapolation of the fitted thresholds, we predict what would be the typical gate error bounds when applying Grover's algorithms for the search of data in a data set as large as 32 000.
In this paper we will analyse two quantum algorithms that sparked interest in the potential of quantum computers. The first is Lov Grover's algorithm which may be used to conduct a type of database search. The second is Peter Shor's algorithm which may be used to factor large numbers and provides an exponential speed up over the best current classical algorithms. In the context of these two algorithms we will discuss the benefits and weaknesses of quantum computation. We will show that in exchange for a quantum computer's greater speed we must accept an inherent level of uncertainty in our results.
Quantum computing represents the leading edge of computational technology, leveraging the principles of quantum mechanics to execute targeted computations much faster than classical computers. In contrast to classical bits, which are limited to representing either 0 or 1, qubits, or quantum bits, exhibit the extraordinary property of superposition. This distinctive characteristic enables qubits to simultaneously occupy multiple states, empowering quantum computers to explore numerous potential solutions to a problem concurrently. This feature makes quantum computing particularly potent for specific tasks. Recent research endeavors have been sparked by the potential of advanced quantum computing technology, leading to the creation of simulations of quantum computers using classical hardware. Grover's quantum search algorithm serves as a notable illustration of quantum computing application, enabling quantum computers to conduct a database search within an unsorted array with a quadratic speedup in time efficiency compared to classical computers. This document presents the quantum Grover search algorithm and its application through 5-qubit quantum circuits, as well as a design framework to simplify the creation of an oracle for a greater number of qubits.
Grover’s algorithm is one of the primary algorithms offered as evidence that quantum computers can provide an advantage over classical computers. It involves an “oracle” (external quantum subroutine), which must be specified for a given application and whose internal structure is not part of the formal scaling of the quadratic quantum speedup guaranteed by the algorithm. Grover’’s algorithm also requires exponentially many calls to the quantum oracle (approximately 2 n calls where n is the number of qubits) to succeed, raising the question of its implementation on both noisy and error-corrected quantum computers. In this work, we construct a quantum-inspired algorithm executable on a classical computer that performs Grover’s task in a linear number of calls to (simulations of) the oracle—an exponentially smaller number than Grover’s algorithm—and demonstrate this algorithm explicitly for Boolean satisfiability problems. The complexity of our algorithm depends on the cost to simulate the oracle once, which may or may not be exponential, depending on its internal structure. Indeed, Grover’s algorithm does not have an quantum speedup as soon as one is given access to the “source code” of the oracle, which may reveal an internal structure of the problem. Our findings illustrate this point explicitly, as our algorithm exploits the structure of the quantum circuit used to program the quantum computer to speed up the search. There are still problems where Grover’s algorithm would provide an asymptotic speedup if it could be run accurately for large enough sizes. Our quantum-inspired algorithm provides lower bounds, in terms of the quantum-circuit complexity, for the quantum hardware to beat classical approaches for these problems. These estimates, combined with the unfavorable scaling of the success probability of Grover’s algorithm, which in the presence of noise decays as the exponential of the exponential of the number of qubits, makes a practical speedup unrealistic even under extremely optimistic assumptions of the evolution of both hardware quality and availability. Published by the American Physical Society 2024