This work analyzes how circuit design constraints can systematically reduce the measurement overhead associated with repeated evaluations of the candidate gate pool in adaptive algorithms by focusing on the Hadamard test circuit architecture, hardware-aware qubit connectivity, and problem-specific adaptive framework.
Abstract
Resource-efficient computation is of central importance in the noisy intermediate-scale quantum (NISQ) era, where decoherence, gate errors, and restricted qubit connectivity severely limit the reliable execution of quantum algorithms. In this work, we demonstrate that incorporating circuit design considerations is crucial for developing resource-efficient variational quantum algorithms. By focusing on the Hadamard test circuit architecture, hardware-aware qubit connectivity, and problem-specific adaptive framework, we analyze how circuit design constraints can systematically reduce the measurement overhead associated with repeated evaluations of the candidate gate pool in adaptive algorithms. Specifically, we demonstrate reductions in the required measurement resources ranging from at least 25% to as high as 50% - 55%. To assess the effectiveness of our approach, we investigate the ground state problem of the nonlinear Schr\"{o}dinger equation. Overall, our work contributes to resource-friendly strategies for quantum computation and underscores that algorithmic frameworks should systematically integrate circuit design constraints with hardware-aware and problem-specific structures to enhance the practical feasibility of quantum devices in the NISQ era.
A noise-aware adaptive approach to quantum approximate optimization, Noise-Directed Adaptive Warm-Starting (ND-AWS), that builds on recent concepts such as Warm-Start QAOA and Noise-Directed Adaptive Remapping by leveraging bitflip gauge transformations, and exploits amplitude-damping-like noise components.
Filip B. Maciejewski, Stuart Hadfield, Oscar Wallis et al.· 4 citations
Quantum circuit optimization plays a critical role in improving the performance of algorithms executed on noisy intermediate-scale quantum (NISQ) devices. While modern quantum compilers provide multiple optimization levels, selecting an appropriate optimization strategy remains a non-trivial task due to the complex int...
M. Chittem, Varsha S. Sambhaje· 2026 IEEE International Conf...· 0 citations
Noisy Intermediate-Scale Quantum (NISQ) devices impose structural constraints on the training of Variational Quantum Algorithms (VQAs). In the absence of full error correction, each quantum gate introduces a non-zero probability of error that accumulates with circuit depth, while gradient estimation through finite samp...
C. Braga, Manuel A. Serrano, E. Fernández-Medina· 2026 IEEE International Conf...· 0 citations
This paper examines quantum algorithms and their computational complexity through a unified framework combining mathematical modeling, system architecture, and empirical evaluation. Key complexity measures circuit depth, gate count, and query complexity are analyzed under NISQ constraints. A hybrid quantum classical op...
A modular implementation in Qiskit that supports non-binary alphabets and incorporates several key enhancements, including a deterministic BBHT-inspired Grover search, domain expansion via ancillary qubits to stabilize amplitude amplification, and circuit-level optimizations that reduce overhead are developed.
R. Cantone, G. Falci, Simone Faro et al.· IEEE International Symposium...· 0 citations
This work investigates how errors at module interfaces and within individual QPUs affect fault-tolerant computation when qubits are encoded using the rotated surface code, and develops an efficient protocol for preparing distributed fault-tolerant logical GHZ states.
S. Chelluri, R. Mengoni, Tom Darras et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.