Low Depth Distributed Quantum Algorithms for Unordered Database Search

• URL: http://arxiv.org/abs/2604.14081v1
• Date: Wed, 15 Apr 2026 16:56:16 GMT
• Title: Low Depth Distributed Quantum Algorithms for Unordered Database Search
• Abstract summary: In the NISQ era, distributed quantum computing can decrease circuit depth and reduce noise.<n>In this paper, an algorithm for constructing query operators for subfunctions is proposed.<n> Experiments conducted with the quantum software MindQuantum confirm the effectiveness and feasibility of the proposed distributed algorithm.
• Score: 3.4941649601796745
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Grover's algorithm accelerates unstructured database search quadratically compared to classical algorithms. In the NISQ era, distributed quantum computing can decrease circuit depth and reduce noise. In this paper, an algorithm for constructing query operators for subfunctions is proposed. By dividing the target string of the search problem into several substrings and integrating the query operator of each subfunction, a low-depth distributed exact quantum search algorithm is designed. The contributions of this paper are as follows: (1) The proposed distributed algorithm has a lower circuit depth and can mitigate error accumulation compared to distributed quantum search algorithms; (2) The target can be accurately located by the proposed distributed algorithm; (3) Experiments conducted with the quantum software MindQuantum confirm the effectiveness and feasibility of the proposed distributed algorithm. Moreover, the introduction of noise to the circuit during these experiments indicates that the algorithm possesses an inherent capacity for noise resistance.

Related papers

• Exponential convergence dynamics in Grover's search algorithm [0.0]
  Grover's search algorithm is the cornerstone of many applications of quantum computing.<n>We modify Grover's algorithm to eliminate the oscillatory dynamics, such that the search proceeds as an exponential decay into the solution states.<n>The basic idea is to convert the solution states into a reservoir by using ancilla qubits such that the initial state is nonreflectively absorbed.
  arXiv  Detail & Related papers  (2025-12-17T05:43:07Z)
• A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization [39.146761527401424]
  This work presents a rigorous worst-case runtime analysis of a measurement-driven quantum SAT solver.<n>We show that this quantum algorithm does not exclusively rely on Grover-type methods and shows promising numerical performance.<n>We also develop a new readout routine that efficiently finds a solution even for instances with multiple satisfying assignments.
  arXiv  Detail & Related papers  (2025-11-12T19:00:13Z)
• Distributed quantum approximate counting algorithm [1.0026496861838448]
  We apply the proposed algorithm to estimate inner products and Hamming distances.<n>Compared to existing counting algorithms, the proposed algorithm has advantages in terms of the number of qubits, circuit depth, and the number of quantum gates.
  arXiv  Detail & Related papers  (2025-11-07T03:09:03Z)
• Survey on Algorithms for multi-index models [45.143425167349314]
  We review the literature on algorithms for estimating the index space in a multi-index model.<n>The primary focus is on computationally efficient (polynomial-time) algorithms in Gaussian space, the assumptions under which consistency is guaranteed by these methods, and their sample complexity.
  arXiv  Detail & Related papers  (2025-04-07T18:50:11Z)
• Distributed quantum algorithm for the dihedral hidden subgroup problem [2.3026482262928587]
  This paper proposes a distributed algorithm for the dihedral hidden subgroup problem.<n>By splitting the original function into multiple subfunctions, the algorithm significantly reduces the quantum circuit depth and qubit requirements for individual nodes.<n>Compared to the original algorithm, the distributed version not only reduces the influence of circuit depth and noise, but also improves the probability of measurement success.
  arXiv  Detail & Related papers  (2025-03-09T06:32:26Z)
• 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)
• Gravitational-wave matched filtering with variational quantum algorithms [0.0]
  We explore the application of variational quantum algorithms to the problem of matched filtering in the detection of gravitational waves. We present results of classical numerical simulations of these quantum algorithms using open science data from LIGO.
  arXiv  Detail & Related papers  (2024-08-23T15:53:56Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Towards Optimally Efficient Tree Search with Deep Learning [76.64632985696237]
  This paper investigates the classical integer least-squares problem which estimates signals integer from linear models. The problem is NP-hard and often arises in diverse applications such as signal processing, bioinformatics, communications and machine learning. We propose a general hyper-accelerated tree search (HATS) algorithm by employing a deep neural network to estimate the optimal estimation for the underlying simplified memory-bounded A* algorithm.
  arXiv  Detail & Related papers  (2021-01-07T08:00:02Z)
• Efficient Algorithms for Causal Order Discovery in Quantum Networks [44.356294905844834]
  Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm. We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with. Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks.
  arXiv  Detail & Related papers  (2020-12-03T07:12:08Z)
• 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.