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

• URL: http://arxiv.org/abs/2006.10037v2
• Date: Fri, 18 Sep 2020 19:32:12 GMT
• Title: Prospect of using Grover's search in the noisy-intermediate-scale quantum-computer era
• Authors: Yulun Wang and Predrag S. Krstic
• Abstract summary: We undertake a series of simulations by inflicting various types of noise, modelled by the IBM QISKit. We find the upper bound of noise for these cases, establish its dependence on the quantum depth of the circuit. We predict what would be the typical gate error bounds when apply the Grover's algorithms for the search of a data in a data set as large as thirty two thousands.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In order to understand the bounds of utilization of the Grover's search algorithm for the large unstructured data in presence of the quantum computer noise, we undertake a series of simulations by inflicting various types of noise, modelled by the IBM QISKit. We apply three forms of Grover's algorithms: (1) the standard one, with 4-10 qubits, (2) recently published modified Grover's algorithm, set to reduce the circuit depth, and (3) the algorithms in (1) and (2) with multi-control Toffoli's modified by 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 apply the Grover's algorithms for the search of a data in a data set as large as thirty two thousands.

Related papers

• Distributed exact multi-objective quantum search algorithm [9.09986332387569]
  Grover's algorithm has quadratic acceleration in multi-objection search. Iterated operator in Grover's algorithm is a key element and plays an important role in amplitude amplification.
  arXiv  Detail & Related papers  (2024-09-06T06:16:53Z)
• Scalable improvement of the generalized Toffoli gate realization using trapped-ion-based qutrits [32.33017977520031]
  Direct realizations of the Toffoli gate require either a prohibitive growth of the number of two-qubit gates or using ancilla qubits. Here we experimentally demonstrate a scalable improvement of the realization of the Toffoli gate using trapped-ion-based dual-type optic-microwave qutrits.
  arXiv  Detail & Related papers  (2024-07-10T15:34:56Z)
• Distributed Exact Generalized Grover's Algorithm [9.675088142486729]
  We propose a distributed Exactized Grover's Algorithm (DEGGA) to solve a generalized search problem. Our algorithm ensures accuracy, with a theoretical probability of identifying the target states at $100%$. Our method requires a total of $n$ qubits, eliminating the need for auxiliary qubits.
  arXiv  Detail & Related papers  (2024-05-11T09:17:11Z)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Quantum Advantage of Noisy Grover's Algorithm [3.803244458097104]
  Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. We present a noise-tolerant method that exponentially improves the noise threshold of Grover's algorithm.
  arXiv  Detail & Related papers  (2023-06-19T11:17:32Z)
• Distributed exact quantum algorithms for Bernstein-Vazirani and search problems [9.146620606615889]
  We give a distributed Bernstein-Vazirani algorithm (DBVA) with $t$ computing nodes, and a distributed exact Grover's algorithm (DEGA) that solve the search problem with only one target item in the unordered databases. We provide situations of our DBVA and DEGA on MindQuantum (a quantum software) to validate the correctness and practicability of our methods.
  arXiv  Detail & Related papers  (2023-03-19T14:18:49Z)
• Characterizing low-frequency qubit noise [55.41644538483948]
  Fluctuations of the qubit frequencies are one of the major problems to overcome on the way to scalable quantum computers. The statistics of the fluctuations can be characterized by measuring the correlators of the outcomes of periodically repeated Ramsey measurements. This work suggests a method that allows describing qubit dynamics during repeated measurements in the presence of evolving noise.
  arXiv  Detail & Related papers  (2022-07-04T22:48:43Z)
• 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)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)
• A Systematic Characterization of Sampling Algorithms for Open-ended Language Generation [71.31905141672529]
  We study the widely adopted ancestral sampling algorithms for auto-regressive language models. We identify three key properties that are shared among them: entropy reduction, order preservation, and slope preservation. We find that the set of sampling algorithms that satisfies these properties performs on par with the existing sampling algorithms.
  arXiv  Detail & Related papers  (2020-09-15T17:28:42Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.