Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers

• URL: http://arxiv.org/abs/2406.16018v1
• Date: Sun, 23 Jun 2024 05:27:46 GMT
• Title: Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
• Authors: M. AbuGhanem,
• Abstract summary: We report results for the implementation and characterization of a three-qubit Grover search algorithm. Our investigation spans the execution of the algorithm across all eight conceivable single-result oracles, alongside nine two-result oracles, employing IBM Quantum's 127-qubit quantum computers. By connecting theoretical concepts with real-world experiments, this study shed light on the potential of NISQ computers in facilitating large-scale database searches.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. Here, we report results for the implementation and characterization of a three-qubit Grover search algorithm using the state-of-the-art scalable quantum computing technology of superconducting quantum architectures. To delve into the algorithm's scalability and performance metrics, our investigation spans the execution of the algorithm across all eight conceivable single-result oracles, alongside nine two-result oracles, employing IBM Quantum's 127-qubit quantum computers. Moreover, we conduct five quantum state tomography experiments to precisely gauge the behavior and efficiency of our implemented algorithm under diverse conditions; ranging from noisy, noise-free environments to the complexities of real-world quantum hardware. By connecting theoretical concepts with real-world experiments, this study not only shed light on the potential of NISQ (Noisy Intermediate-Scale Quantum) computers in facilitating large-scale database searches but also offer valuable insights into the practical application of the Grover search algorithm in real-world quantum computing applications.

Related papers

• Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck [55.22418739014892]
  We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al. We apply our algorithm to the quantum information bottleneck with three quantum systems. Our numerical analysis shows that our algorithm is better than their algorithm.
  arXiv  Detail & Related papers  (2023-11-19T00:06:11Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• A Scalable 5,6-Qubit Grover's Quantum Search Algorithm [0.0]
  Grover's quantum search algorithm is one of the well-known applications of quantum computing. In this paper, a scalable Quantum Grover Search algorithm is introduced and implemented using 5-qubit and 6-qubit quantum circuits. The accuracy of the proposed 5-qubit and 6-qubit circuits is benchmarked against the state-of-the-art implementations for 3-qubit and 4-qubit.
  arXiv  Detail & Related papers  (2022-04-30T00:35:54Z)
• Quantum search on noisy intermediate-scale quantum devices [7.147209811770232]
  Grover's algorithm is designed without considering the physical resources, such as depth, in the real implementations. We present detailed benchmarks of the five-qubit quantum search algorithm on different quantum processors, including IBMQ, IonQ, and Honeywell quantum devices. Our results show that designing the error-aware quantum search algorithms is possible, which can maximally harness the power of NISQ computers.
  arXiv  Detail & Related papers  (2022-01-31T22:25:58Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Quantum Computing for Location Determination [6.141741864834815]
  We introduce an example for the expected gain of using quantum algorithms for location determination research. The proposed quantum algorithm has a complexity that is exponentially better than its classical algorithm version, both in space and running time. We discuss both software and hardware research challenges and opportunities that researchers can build on to explore this exciting new domain.
  arXiv  Detail & Related papers  (2021-06-11T15:39:35Z)
• Robustness Verification of Quantum Classifiers [1.3534683694551501]
  We define a formal framework for the verification and analysis of quantum machine learning algorithms against noises. A robust bound is derived and an algorithm is developed to check whether or not a quantum machine learning algorithm is robust with respect to quantum training data. Our approach is implemented on Google's Quantum classifier and can verify the robustness of quantum machine learning algorithms with respect to a small disturbance of noises.
  arXiv  Detail & Related papers  (2020-08-17T11:56:23Z)
• Fast simulation of Grover's quantum search on classical computer [0.0]
  Grover's search algorithm is known to be the most compute intensive. Our approach highlights the design principles for the fast simulation of Grover's search which can be implemented on a general purpose personal computer. The performance obtained are encouraging when compared to the existing simulators.
  arXiv  Detail & Related papers  (2020-05-10T12:17:39Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.