Designing quantum algorithms that scale gracefully with problem size on NISQ devices -- maintaining useful approximation quality as qubit count, circuit depth, and noise accumulation increase -- remains the central engineering challenge of the NISQ era. Current variational quantum algorithms face two fundamental scalability barriers: barren plateaus (exponentially vanishing gradients that prevent training of deep parameterised circuits) and noise accumulation (gate errors compounding with circuit depth, degrading output fidelity). This paper proposes the Scalable NISQ Algorithm Design (SNAD) framework, a systematic methodology for designing quantum algorithms that remain effective as problem scale increases, comprising four design principles and associated algorithmic techniques: locality-structured ansatz design (LSAD) to avoid barren plateaus through geometric locality constraints; adaptive noise budget allocation (ANBA) distributing gate operations to maximise fidelity within noise constraints; circuit compression and synthesis (CCS) reducing circuit depth through gate cancellation and re-synthesis; and scalability-aware performance prediction (SAPP) using classical simulation to predict NISQ performance at target scale before hardware execution. SNAD is validated on QAOA and VQE circuits across n = 12-84 qubits on IBM Quantum Eagle and Falcon. LSAD eliminates barren plateaus for n up to 84 qubits, maintaining gradient magnitude > 10^-3 where standard random ansatz shows < 10^-8 at n=48. CCS reduces circuit depth by 28.4% (SD = 4.8%) for QAOA circuits on heavy-hex topology. ANBA improves approximation ratio by 6.4pp vs. uniform depth allocation under fixed noise budget. SAPP predicts NISQ approximation ratios with mean error 3.2% (SD = 1.4%) across 284 circuits.
Designing quantum algorithms that scale gracefully with problem size on NISQ devices -- maintaining useful approximation quality as qubit count, circuit depth, and noise accumulation increase -- remains the central engineering challenge of the NISQ era. Current variational quantum algorithms face two fundamental scalability barriers: barren plateaus (exponentially vanishing gradients that prevent training of deep parameterised circuits) and noise accumulation (gate errors compounding with circuit depth, degrading output fidelity). This paper proposes the Scalable NISQ Algorithm Design (SNAD) framework, a systematic methodology for designing quantum algorithms that remain effective as problem scale increases, comprising four design principles and associated algorithmic techniques: locality-structured ansatz design (LSAD) to avoid barren plateaus through geometric locality constraints; adaptive noise budget allocation (ANBA) distributing gate operations to maximise fidelity within noise constraints; circuit compression and synthesis (CCS) reducing circuit depth through gate cancellation and re-synthesis; and scalability-aware performance prediction (SAPP) using classical simulation to predict NISQ performance at target scale before hardware execution. SNAD is validated on QAOA and VQE circuits across n = 12-84 qubits on IBM Quantum Eagle and Falcon. LSAD eliminates barren plateaus for n up to 84 qubits, maintaining gradient magnitude > 10^-3 where standard random ansatz shows < 10^-8 at n=48. CCS reduces circuit depth by 28.4% (SD = 4.8%) for QAOA circuits on heavy-hex topology. ANBA improves approximation ratio by 6.4pp vs. uniform depth allocation under fixed noise budget. SAPP predicts NISQ approximation ratios with mean error 3.2% (SD = 1.4%) across 284 circuits.
Large-scale combinatorial and continuous optimisation problems remain intractable for classical algorithms as problem dimensionality scales. Quantum computing offers advantages through parallelism, amplitude amplification, and tunnelling, but practical realisation on near-term noisy intermediate-scale quantum (NISQ) devices demands careful algorithm design balancing advantage against noise resilience and circuit depth constraints. This paper presents the Quantum Optimisation Algorithm Suite (QOAS), a systematic framework across four algorithmic paradigms: Adaptive QAOA with dynamic depth scheduling; Variational Quantum Eigensolver (VQE) for QUBO problems; hybrid Quantum Annealing (QA); and Grover-enhanced Branch and Bound (GBB) for constrained integer programming. QOAS is benchmarked on five problem classes (MaxCut, TSP, Portfolio, Drug-Target, Feature Selection) across n = 12-84 qubits on IBM Quantum Eagle (127-qubit) and Falcon (27-qubit). Adaptive QAOA achieves approximation ratio 0.924 (SD = 0.018) for MaxCut at n = 48 -- outperforming standard QAOA (0.848) and Goemans-Williamson (0.878) at equivalent wall-clock time. GBB achieves 28.4x speedup over classical branch-and-bound for the n = 24 drug-target problem. QOAS provides systematic methodology for algorithm selection, circuit depth optimisation, and noise mitigation for NISQ workloads.
Variational quantum algorithms (VQAs) are a leading framework for realizing quantum advantages in the Noisy Intermediate-Scale Quantum (NISQ) era, with applications spanning discrete combinatorial problems and continuous optimization. While the topologies of parameterized quantum circuits (ansatzes) fundamentally govern both expressibility and trainability in continuous landscapes, existing reviews predominantly focus on static algorithmic classifications or discrete settings, leaving the structural evolution and practical limitations of ansatz architectures insufficiently explored. To address this gap, this review presents a systematic analysis of variational ansatz architectures, tracing their progression from static, pre-defined topologies to adaptive growth mechanisms. Beyond traditional gradient-driven and architecture-search paradigms, we evaluate supplementary strategies such as layerwise training and noise-adaptive construction, revealing inherent vulnerabilities such as local minima entrapment and the compilation overhead induced by calibration drift. The mathematical foundations of VQAs are outlined, and representative fixed ansatz architectures, including hardware-efficient, physics-inspired, and problem-specific designs, are characterized within continuous-domain mappings. Intrinsic limitations arising from barren plateaus (BPs) and noise-induced barren plateaus (NIBPs) are analyzed, revealing the fundamental coupling between circuit depth, parameter scaling, and trainability degradation. Furthermore, adaptive construction strategies and recent advances in automated variational quantum architecture search (VQAS) are examined. Through the synthesis of intrinsic limitations (BPs, NIBPs, and hardware-algorithm coupling) and the evaluation of standardized benchmarking protocols, this review rigorously assesses the resource trade-offs of current VQA frameworks. Ultimately, next-generation ansatz design will adopt hardware–software co-design principles grounded in physical constraints, enabling scalable and noise-resilient quantum optimization.
Abstract The arrival of noisy intermediate-scale quantum (NISQ) devices defines an era in which quantum utility is fundamentally constrained by finite coherence times, limited qubit counts, gate infidelities, restricted connectivity, and measurement noise. Within this regime, hybrid quantum-classical frameworks have emerged as the dominant operational paradigm, particularly for quantum machine learning (QML). This review identifies a fundamental trade-off between expressivity, trainability, and noise resilience that governs the performance and scalability of NISQ-era QML systems. To contextualize these challenges, we introduce the resource-constrained iterative routing framework, a hardware-aware conceptual architecture that integrates topology-aware classical compression and distributed quantum orchestration to maintain circuit depths within device-dependent limits while routing representations toward symmetry-constrained Hilbert subspaces to mitigate noise-induced barren plateaus. Furthermore, we shift the discussion of quantum advantage away from asymptotic fault-tolerant complexity toward the notion of operational NISQ advantage based on finite-resource scaling, trainability preservation, and sampling complexity. We evaluate the practical resource efficiency of variational quantum algorithms, quantum kernel methods, and quantum neural networks across superconducting, trapped-ion, neutral-atom, and photonic platforms. The review also examines reproducibility challenges, emphasizing benchmarking against optimized classical baselines, and discusses strategies for managing the sampling overhead of error mitigation alongside distributed execution and quantum circuit compilation. Ultimately, NISQ in Practice positions hybrid QML as a physically constrained computational paradigm while outlining a pathway from contemporary noisy workflows toward early fault-tolerant quantum architectures.
The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.
Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.
The Quantum Approximate Optimization Algorithm (QAOA) is widely regarded as a promising near-term quantum algorithm for addressing hard combinatorial optimization problems on Noisy Intermediate-Scale Quantum (NISQ) devices; however, its real-world effectiveness is severely constrained by hardware noise, including gate infidelities, decoherence, and measurement errors. This work explores an error mitigation–driven approach to enhance the performance and robustness of QAOA without altering its algorithmic structure or requiring fault-tolerant quantum resources. Measurement error mitigation and zero-noise extrapolation are incorporated into the execution and post-processing stages of QAOA circuits and evaluated using the Minimum Vertex Cover problem as a representative benchmark. Performance is assessed through approximation ratios, solution stability, and noise sensitivity across multiple circuit depths. The results indicate that error mitigation not only improves approximation accuracy but also stabilizes output distributions and delays performance degradation at increased circuit depths. Additionally, the mitigated executions demonstrate better consistency across repeated runs, highlighting improved resilience to stochastic noise. These findings emphasize that lightweight and hardware-efficient error mitigation techniques can significantly extend the practical usability of QAOA on current NISQ hardware, providing a scalable and realistic pathway for executing quantum optimization algorithms more reliably in near-term quantum computing environments.