arXiv subjects

Qi-Ming Ding

Publications and source records attributed to Qi-Ming Ding.

8 recordsLinked to original sources

arXiv2026

A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing

Variational quantum algorithms (VQAs) have established themselves as a central computational paradigm in the Noisy Intermediate-Scale Quantum (NISQ) era. By coupling parameterized quantum circuits (PQCs) with classical optimization, they operate effectively under strict hardware limitations. However, as quantum architectures transition toward early fault-tolerant (EFT) and ultimate fault-tolerant (FT) regimes, the foundational principles and long-term viability of VQAs require systematic reassessment. This review offers an insightful analysis of VQAs and their progression toward the fault-tolerant regime. We deconstruct the core algorithmic framework by examining ansatz design and classical optimization strategies, including cost function formulation, gradient computation, and optimizer selection. Concurrently, we evaluate critical training bottlenecks, notably barren plateaus (BPs), alongside established mitigation strategies. The discussion then explores the EFT phase, detailing how the integration of quantum error mitigation and partial error correction can sustain algorithmic performance. Addressing the FT phase, we analyze the inherent challenges confronting current hybrid VQA models. Furthermore, we synthesize recent VQA applications across diverse domains, including many-body physics, quantum chemistry, machine learning, and mathematical optimization. Ultimately, this review outlines a theoretical roadmap for adapting quantum algorithms to future hardware generations, elucidating how variational principles can be systematically refined to maintain their relevance and efficiency within an error-corrected computational environment.

quant-ph↗

arXiv2025

Obtaining Accurate Ground-State Properties on Near-term Quantum Devices

Accurate ground-state calculations on noisy quantum computers are fundamentally limited by restricted ansatz expressivity and unavoidable hardware errors. We introduce a hybrid-quantum classical framework that simultaneously addresses these challenges. Our method systematically purifies noisy two electron reduced density matrices from quantum devices by enforcing N-representability conditions through efficient semidefinite programming, guided by a norm-based distance constraint to the experimental data. To implement this constraint, we develop a hardware efficient calibration protocol based on Clifford circuits. We demonstrate near full configuration interaction accuracy for ground-state energies of H2, LiH, and H4, and compute precise scattering intensities for C6H8 on noisy hardware. This approach surpasses conventional methods by simultaneously overcoming both ansatz limitations and hardware noise, establishing a scalable route to quantum advantage and marking a critical step toward reliable simulations of complex molecularnsystems on noisy devices.

quant-ph↗

arXiv2025

Scalable protocol to coherence estimation from scarce data: Theory and experiment

Key quantum features like coherence are the fundamental resources enabling quantum advantages and ascertaining their presence in quantum systems is crucial for developing quantum technologies. This task, however, faces severe challenges in the noisy intermediate-scale quantum era. On one hand, experimental data are typically scarce, rendering full state reconstruction infeasible. On the other hand, these features are usually quantified by highly nonlinear functionals that elude efficient estimations via existing methods. In this work, we propose a scalable protocol for estimating coherence from scarce data and further experimentally demonstrate its practical utility. The key innovation here is to relax the potentially NP-hard coherence estimation problem into a computationally efficient optimization. This renders the computational cost in our protocol insensitive to the system size, in sharp contrast to the exponential growth in traditional methods. This work opens a novel route toward estimating coherence of large-scale quantum systems under data-scarce conditions.

quant-ph↗

arXiv2024

Molecular docking via quantum approximate optimization algorithm

Molecular docking plays a pivotal role in drug discovery and precision medicine, enabling us to understand protein functions and advance novel therapeutics. Here, we introduce a potential alternative solution to this problem, the digitized-counterdiabatic quantum approximate optimization algorithm (DC-QAOA), which utilizes counterdiabatic driving and QAOA on a quantum computer. Our method was applied to analyze diverse biological systems, including the SARS-CoV-2 Mpro complex with PM-2-020B, the DPP-4 complex with piperidine fused imidazopyridine 34, and the HIV-1 gp120 complex with JP-III-048. The DC-QAOA exhibits superior performance, providing more accurate and biologically relevant docking results, especially for larger molecular docking problems. Moreover, QAOA-based algorithms demonstrate enhanced hardware compatibility in the noisy intermediate-scale quantum era, indicating their potential for efficient implementation under practical docking scenarios. Our findings underscore quantum computing's potential in drug discovery and offer valuable insights for optimizing protein-ligand docking processes.

quant-ph↗

arXiv2021

The tightness of multipartite coherence from spectrum estimation

Detecting multipartite quantum coherence usually requires quantum state reconstruction, which is quite inefficient for large-scale quantum systems. Along this line of research, several efficient procedures have been proposed to detect multipartite quantum coherence without quantum state reconstruction, among which the spectrum-estimation-based method is suitable for various coherence measures. Here, we first generalize the spectrum-estimation-based method for the geometric measure of coherence. Then, we investigate the tightness of the estimated lower bound of various coherence measures, including the geometric measure of coherence, $l_1$-norm of coherence, the robustness of coherence, and some convex roof quantifiers of coherence multiqubit GHZ states and linear cluster states. Finally, we demonstrate the spectrum-estimation-based method as well as the other two efficient methods by using the same experimental data [Ding et al. Phys. Rev. Research 3, 023228 (2021)]. We observe that the spectrum-estimation-based method outperforms other methods in various coherence measures, which significantly enhances the accuracy of estimation.

quant-ph↗

arXiv2021

Efficient estimation of multipartite quantum coherence

Quantification of coherence lies at the heart of quantum information processing and fundamental physics. Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for large-scale multipartite systems. Here, we propose a systematic theoretical approach to efficiently estimating lower and upper bounds of coherence in multipartite states. Under the stabilizer formalism, the lower bound is determined by the spectrum estimation method with a small number of measurements and the upper bound is determined by a single measurement. We verify our theory with a four-qubit optical quantum system.We experimentally implement various multi-qubit entangled states, including the Greenberger-Horne-Zeilinger state, the cluster state, and the W state, and show how their coherence are efficiently inferred from measuring few observables.

quant-ph↗

arXiv2018

Superadditivity of convex roof coherence measures

In this paper, we examine the superadditivity of convex roof coherence measures. We put forward a theorem on the superadditivity of convex roof coherence measures, which provides a sufficient condition to identify the convex roof coherence measures fulfilling the superadditivity. By applying the theorem to each of the known convex roof coherence measures, we prove that the coherence of formation and the coherence concurrence are superadditive, while the geometric measure of coherence, the convex roof coherence measure based on linear entropy, the convex roof coherence measure based on fidelity, and convex roof coherence measure based on $\frac{1}{2}$-entropy are non-superadditive.

quant-ph↗

arXiv2017

A new coherence measure based on fidelity

Quantifying coherence is an essential endeavor for both quantum foundations and quantum technologies. In this paper, we put forward a quantitative measure of coherence by following the axiomatic definition of coherence measures introduced in [T. Baumgratz, M. Cramer, and M. B. Plenio, Phys. Rev. Lett. 113, 140401 (2014)]. Our measure is based on fidelity and analytically computable for arbitrary states of a qubit. As one of its applications, we show that our measure can be used to examine whether a pure qubit state can be transformed into another pure or mixed qubit state only by incoherent operations.

quant-ph↗