Implementation of efficient quantum search algorithms on NISQ computers

• URL: http://arxiv.org/abs/2102.01783v2
• Date: Mon, 12 Jul 2021 14:20:47 GMT
• Title: Implementation of efficient quantum search algorithms on NISQ computers
• Authors: Kun Zhang, Pooja Rao, Kwangmin Yu, Hyunkyung Lim, Vladimir Korepin
• Abstract summary: Three- and four-qubit search algorithms have been implemented on the IBM quantum processors. We present the successful execution of the five-qubit search on the IBM quantum processor for the first time.
• Score: 5.821247391600171
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Despite the advent of Grover's algorithm for the unstructured search, its successful implementation on near-term quantum devices is still limited. We apply three strategies to reduce the errors associated with implementing quantum search algorithms. Our improved search algorithms have been implemented on the IBM quantum processors. Using them, we demonstrate three- and four-qubit search algorithm with higher average success probabilities compared to previous works. We present the successful execution of the five-qubit search on the IBM quantum processor for the first time. The results have been benchmarked using degraded ratio, which is the ratio between the experimental and the theoretical success probabilities. The fast decay of the degraded ratio supports our divide-and-conquer strategy. Our proposed strategies are also useful for implementation of quantum search algorithms in the post-NISQ era.

Related papers

• Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers [0.0]
  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.
  arXiv  Detail & Related papers  (2024-06-23T05:27:46Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• 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)
• 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)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• 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)
• Hardware Efficient Quantum Search Algorithm [17.74233101199813]
  We propose a novel hardware efficient quantum search algorithm to overcome this challenge. Our key idea is to replace the global diffusion operation with low-cost local diffusions. The circuit cost reduction leads to a remarkable improvement in the system success rates.
  arXiv  Detail & Related papers  (2021-03-26T01:08:50Z)
• Benchmarking 16-element quantum search algorithms on superconducting quantum processors [0.0]
  We present experimental results on running 4-qubit unstructured search on IBM quantum processors. Our best attempt attained probability of success around 24.5%. We conclude that it is extremely important to design hardware-aware algorithms.
  arXiv  Detail & Related papers  (2020-07-13T17:46:19Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.