arXiv subjects

Huaijing Huang

Publications and source records attributed to Huaijing Huang.

5 recordsLinked to original sources

arXiv2026

Distributed quantum-classical hybrid algorithm for solving K-SAT problem

Recently, Dunjko et al.(PRL, 2018) proposed an algorithm for accelerating the solution of 3-satisfiability problems using a small-scale quantum computer. In this paper, we design a distributed quantum-classical hybrid algorithm for solving K-satisfiability problems. Under resource-constrained conditions, our algorithm achieves a significant acceleration in the core term of the exponential time complexity. The proposed algorithm is a generalization of the algorithm by Dunjko et al. Compared with their algorithm, our algorithm requires a smaller number of qubits. More importantly, the proposed algorithm does not rely on any quantum communication.

quant-ph↗

arXiv2026

Low Depth Distributed Quantum Algorithms for Unordered Database Search

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.

quant-ph↗

arXiv2025

Distributed quantum approximate counting algorithm

In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure. We apply the proposed algorithm to estimate inner products and Hamming distances. Simulations are conducted on the Qisikit platform, further demonstrating the effectiveness of our algorithm and its suitability for the NISQ era. 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.

quant-ph↗

arXiv2021

Uncertainty and complementarity relations based on generalized skew information

Uncertainty relations and complementarity relations are core issues in quantum mechanics and quantum information theory. By use of the generalized Wigner-Yanase-Dyson (GWYD) skew information, we derive several uncertainty and complementarity relations with respect to mutually unbiased measurements (MUMs), and general symmetric informationally complete positive operator valued measurements (SIC-POVMs), respectively. Our results include some existing ones as particular cases. We also exemplify our results by providing a detailed example.

quant-ph↗

arXiv2020

The $n$-th decay rate of coherence for Bell-diagonal states under quantum channels

We study the degree to which the coherence of quantum states is affected by noise. We give the definition of the $n$-th decay rate and investigate the coherence of Bell-diagonal states under $n$ iterations of channels. We derive explicit formulas of the $n$-th decay rates based on $l_1$ norm of coherence, relative entropy of coherence and skew information-based coherence. It is found that the larger $n$ is, the faster the $n$-th decay rate decreases as the parameter $p$ of Bell-diagonal states increases. Moreover, for any fixed $n$, with the increase of $p$, Bell-diagonal states can be completely incoherent under generalized amplitude damping (GAD) channels, depolarization (DEP) channels and phase flip (PF) channels, while this is not the case for bit flip (BF) channels and bit-phase flip (BPF) channels. We also investigate the geometry of the relative entropy of coherence and skew information-based coherence of Bell-diagonal states under different channels when the $n$-th decay rate is one, i.e., the coherence is frozen. It is shown that compared with BF and BPF channels, when $n$ is large enough, the coherence of Bell-diagonal states will not be frozen under GAD, DEP and PF channels. For skew information-based coherence, similar properties of coherence freezing are found.

quant-ph↗