Quantum Advantage of Noisy Grover's Algorithm

• URL: http://arxiv.org/abs/2306.10855v1
• Date: Mon, 19 Jun 2023 11:17:32 GMT
• Title: Quantum Advantage of Noisy Grover's Algorithm
• Authors: Jian Leng, Fan Yang, Xiang-Bin Wang
• Abstract summary: 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.
• Score: 3.803244458097104
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum advantage is the core of quantum computing. Grover's search algorithm is the only quantum algorithm with proven advantage to any possible classical search algorithm. However, realizing this quantum advantage in practice is quite challenging since Grover's algorithm is very sensitive to noise. Here we present a noise-tolerant method that exponentially improves the noise threshold of Grover's algorithm. We present a lower bound for average fidelity of any quantum circuit with O(log D log D) cost under time-independent noise, where D is the dimension of Hilbert space. According to this bound value, we determine the number of iterates which will be applied in Grover's algorithm. Numerical simulation shows that the noise threshold of quantum advantage of Grover's algorithm by our noise-tolerant method is improved by an exponential factor with qubit amount rise.

Related papers

• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Quantum algorithms for Hopcroft's problem [45.45456673484445]
  We study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. The classical complexity of this problem is well-studied, with the best known algorithm running in $O(n4/3)$ time. Our results are two different quantum algorithms with time complexity $widetilde O(n5/6)$.
  arXiv  Detail & Related papers  (2024-05-02T10:29:06Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• 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)
• Grover's Algorithm Offers No Quantum Advantage [0.0]
  Grover's algorithm is one of the primary algorithms offered as evidence that quantum computers can provide an advantage over classical computers. We construct a quantum inspired algorithm, executable on a classical computer, that performs Grover's task in linear number of call to the oracle. We critically examine the possibility of a practical speedup, a possibility that depends on the nature of the quantum circuit associated with the oracle.
  arXiv  Detail & Related papers  (2023-03-20T17:56:20Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• A quantum algorithm for solving open system dynamics on quantum computers using noise [0.0]
  We present a quantum algorithm that uses noise as a resource. The goal of our quantum algorithm is the calculation of operator averages of an open quantum system evolving in time. We find that classes of open quantum systems exist where our algorithm performs very well, even with gate errors as high as 1%.
  arXiv  Detail & Related papers  (2022-10-21T17:47:32Z)
• Quantum multi-programming for Grover's search [6.359294579761927]
  We propose a quantum multi-programming (QMP) algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We prove that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability.
  arXiv  Detail & Related papers  (2022-07-29T04:05:46Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• 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)
• Qubit-efficient entanglement spectroscopy using qubit resets [0.0]
  We develop qubit-efficient quantum algorithms for entanglement spectroscopy on NISQ devices. Our algorithms use fewer qubits than any previous efficient algorithm while achieving similar performance in the presence of noise. We also introduce the notion of effective circuit depth as a generalization of standard circuit depth suitable for circuits with qubit resets.
  arXiv  Detail & Related papers  (2020-10-06T23:22:57Z)

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.