Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of the AAAI Symposium Series

Horizon-Conditioned Proposals for Rare-Event Estimation with Variational and Hybrid Quantum Circuits

Victoria Zhang, Phuong Cao, R. Srikant

Published Nov 6, 2026• 0 citations
Publisher

Abstract

Claims about quantum learning models are difficult to audit when the function they approximate is rarely available for comparison. We construct a setting in which it is. For a finite-horizon hitting problem, the optimal importance-sampling proposal is the Doob h-transform, a value function conditioned on the number of steps remaining as well as on the current state. On an enumerable state space, both this target and the exact variance of any proposal derived from it are computable, allowing learning error to be measured rather than estimated. On this testbed, we compare three horizon encodings crossed with two symmetry sectors for Born machines, together with a hybrid dressed circuit and classical regressors, and study sensitivity to initialization, increasingly rare failure regimes, and finite measurement budgets. Within the architectures studied, the statewise-regressive models substantially outperform the Born-machine parameterizations. Across repeated initializations, additive time re-uploading remains the weakest of the tested horizon encodings, while a symmetry-restricted ansatz consistently improves median learning error despite using eight times fewer circuit parameters. Initialization strongly affects absolute performance, yet these broader design trends survive aggregation across seeds. Because both model classes produce normalized proposals, the observed gap reflects differences in parameterization and optimization rather than normalization alone. The two quantum architectures also exhibit distinct sensitivity to finite-shot readout, and across a γ-retuned family spanning p_T = 10^-2 to 10^-8 the classical-to-hybrid gap widens substantially. Together, these results show how an exactly evaluable rare-event benchmark can separate effects of representation, optimization, and measurement that are otherwise easy to conflate in quantum-learning comparisons.

DOI
10.1609/aaaiss.v10i1.43499

Related papers

Hybrid Parameterized Quantum States for Variational Quantum Learning

Chen-Yu Liu

Variational quantum learning faces practical challenges in the noisy intermediate-scale quantum (NISQ) era. Parameterized quantum circuit (PQC) models suffer from statistical uncertainty due to finite-shot measurements and are highly sensitive to quantum noise, while purely classical approximations like neural quantum states (NQS) lack access to genuine quantum correlations and are limited in scalability. This work introduces Hybrid Parameterized Quantum States (HPQS), a general-purpose modeling framework that interpolates between quantum and classical parameterizations. HPQS combines PQC-based measurements with neural estimators via a blending mechanism and postprocessing functions, enabling enhanced, shot-efficient evaluation under hardware constraints. We demonstrate HPQS across three representative quantum learning tasks: (1) Expectation-based QML, where HPQS yields higher classification accuracy than PQC-only and NQS-only baselines under limited quantum measurements. (2) Quantum-Train, where HPQS generates the entire parameter set of classical networks using polylogarithmic trainable variables; and (3) Quantum Parameter Adaptation (QPA), where HPQS produces LoRA adapter parameters for fine-tuning large language models like GPT-2 and Gemma-2 with improved perplexity under low-shot conditions; Together, these results position HPQS as a scalable, noise-resilient approach for variational quantum learning, compatible with both current NISQ hardware and future fault-tolerant architectures.

arXiv:2505.16676•May 22, 2025•1 citation

Benchmarking Modular Optimization Strategies for Parameterized Quantum Circuits

Carla Cotea, Stefan Balauca, Andreea Arusoaie

Training parameterized quantum circuits requires balancing optimization progress with limited evaluation budgets and the statistical uncertainty of near-term quantum hardware. We present a modular benchmarking framework that separates quantum search-direction estimation from classical parameter-update rules, allowing their interactions and sensitivities to be examined independently. We evaluate a suite of gradient-based, stochastic, and derivative-free optimizers across combinatorial optimization using the Quantum Approximate Optimization Algorithm (QAOA), supervised quantum machine learning using Iris classification and a quantum convolutional neural network (QCNN) for binary MNIST classification, and quantum chemistry using the variational quantum eigensolver (VQE) for molecular hydrogen. By separating objective evaluations from sample-circuit costs under finite-shot simulation and physical execution on a 156-qubit processor, we compare optimizer behavior across workloads with different parameter counts and measurement requirements. Four selected simulator and hardware case studies report terminal and best observed objectives separately, alongside post-training classifier accuracies. The comparisons include selected MaxCut and hydrogen trajectories and illustrate workload-dependent objective changes and evaluation costs, while the simulator benchmark compares both peak and mean performance across three seeds. The hardware runs do not establish an optimizer ranking or isolate a causal effect of device noise.

quant-pharXiv:2610.10254•Oct 8, 2026•0 citations

Who can sample forever? Shot noise effects in quantum linear regression

Gabriele Lo Monaco, Salvatore Lorenzo, Alessandro Ferraro +3 more

Quantum fidelity kernels and quantum extreme learning machines share the same basic architecture: a fixed quantum device generates features that are combined through a classically trained linear model. We refer to this broad non-variational setting as quantum linear regression. A defining aspect of these models is that the quantum features are not directly available, but must be estimated from a finite number of shots. We show that finite statistics makes quantum linear regression unavoidably ill-conditioned. Ideal feature vectors are confined to a subspace determined by the dimension of the Hilbert space, whereas finite-shot estimates generically acquire components outside this subspace. Training then attempts to fit directions that disappear in the infinite-statistics limit, making the learned model increasingly sensitive to sampling noise. We analyze this mechanism for quantum extreme learning machines trained on $n_{\rm tr}$ states with $N$ shots per state. Despite the ill-conditioning, predictions remain controlled when the training targets are exact. Finite sampling produces a systematic prediction error that decreases quadratically with $N$, while fluctuations induced by the random training measurements decrease inversely with the total training budget. Thus, unlike in standard linear regression with exactly known features, increasing the dataset size alone cannot remove the error caused by sampling noise. If the training targets are also noisy, due for instance to state-preparation errors, the otherwise hidden directions become active. The test error can then increase with $N$, a behavior that we ascribe to a form of quantum overfitting. Our results expose a fundamental tradeoff between dataset size and per-state statistics in non-variational quantum learning and provide a baseline for resource-aware training and regularization strategies.

quant-pharXiv:2610.12015•Oct 9, 2026•1 citation

Factorial Benchmarking of Exact and Finite-Shot Gradient Resolvability in a Four-Qubit Hybrid Quantum Neural Network

Brandon Shen

Abstract Gradient resolvability in quantum neural networks can depend simultaneously on circuit structure, objective construction, and finite-shot measurement, yet these interventions are usually benchmarked separately. We use a complete 2³ factorial design to test interactions among a pair-restricted controlled-NOT (CNOT) schedule (E), normalized transverse-field Ising model (TFIM) energy objective (L), and fixed residual shortcut (R) in a four-qubit measure–re-encode–reset hybrid quantum neural network. Across 50 matched initialization clusters and 30 finite-shot replicates per scientific cell, configurations were matched by block count, parameter identity, and total implemented simulator-shot budget. The centered E × L interaction in exact-gradient magnitude was positive and was supported by both mixed-model inference and an initialization-cluster bootstrap; the positive direction was retained in an independent-seed dataset, although its magnitude and depth profile remained uncertain. Finite-shot E × L and E × R interactions met the protocol-derived Wald/Holm rule, but their 1,000-fit nested-bootstrap intervals included zero, and the residual result was estimator-mode sensitive and inactive at D = 1, 2. The L × R-by-depth interaction remained unresolved. These results show that factorial benchmarking can expose composition effects that marginal comparisons miss while separating exact-gradient signal from finite-shot estimator behavior. They do not establish optimization success, hardware advantage, shot savings, or matched physical-resource cost.

•Aug 11, 2026•0 citations

Machine learning strategies for near-term quantum algorithms

Y.J. Patel

The central claim of this thesis is simple but underappreciated: the primary bottleneck in near-term quantum computing is not a shortage of algorithms; it is a lack of systematic decision-making. Which problem instances should we test? Which circuit architectures are worth training? Which hyperparameters actually drive performance, and which are distractions? Today’s quantum hardware sits in an uncomfortable middle ground. It is expressive enough to explore nontrivial quantum dynamics, yet it is too noisy and shallow for the theoretical speedups that motivate the field. This thesis argues that applying machine learning to classical control decisions in hybrid quantum classical methods is one of the most tractable ways to make these methods genuinely useful in this regime. This argument is developed through four research questions, each addressing a distinct decision-making layer and illustrating the thesis. The first asks whether the decisions inside a hybrid heuristic can be learned rather than hand-coded. Chapter 4 analyzes Recursive QAOA (RQAOA), a promising yet brittle approach to combinatorial optimization, and identifies regimes in which its fixed-elimination strategy fails. It then replaces that strategy with a reinforcement learning policy, RL-RQAOA, that adapts to instance structure. The resulting method performs better on the constructed failure cases while remaining competitive elsewhere. The broader point is that learned classical control policies can materially improve hybrid quantum heuristics without increasing quantum depth, which is a significant practical advantage on constrained hardware. The second question evaluates whether the quantum optimization algorithm benchmarking instances we use are principled. Chapter 5 observes that much benchmarking in this space is driven by convenience. Researchers test on whatever graphs are readily available and then report aggregate performance. Instead, the chapter proposes a generative pipeline that couples a permutation-invariant graph autoencoder with evolutionary optimization to deliberately construct Max-Cut instances that strongly discriminate between a quantum-inspired solver, RQAOA, and a strong classical baseline, Goemans-Williamson, in both directions. By connecting solver behavior to structural graph features, the chapter turns benchmarking from a static choice into an interpretable experimental tool. The generated instances also expose failure modes that random graphs often fail to reveal. The third question asks what changes when realistic noise constraints are taken seriously during circuit design, not only during execution. Chapter 6 develops RLQAS, a reinforcement learning framework for quantum architecture search that incorporates noise assumptions informed by real IBM device characteristics throughout training, rather than treating noise as a post hoc correction. Paired with an efficient Pauli transfer matrix simulation, the framework makes large-scale noisy circuit search computationally feasible. The circuits it discovers are compact, trainable, and achieve competitive accuracy on ground-state energy tasks. This suggests that hardware-aware circuit design is tractable and can yield materially different choices than noise-agnostic search. The fourth question asks: even when the circuit architecture is fixed, how much of what we attribute to quantum model design is actually due to hyperparameter sensitivity? Chapter 7 extends functional ANOVA to quantum neural networks to quantify which hyperparameter choices drive performance variance. The finding is clear. Learning rate, circuit depth, and data encoding/reuploading dominate, while many architectural micro-choices contribute far less than the literature often implies. Rather than stopping at diagnosis, the chapter turns these importance rankings into data-driven priors that accelerate hyperparameter optimization. It converts a critique into a practical improvement. Taken together, these contributions form a coherent toolkit for developing and evaluating hybrid quantum–classical methods in the NISQ regime. While the work does not eliminate the fundamental constraints of shallow, noisy hardware, it clarifies what can be improved immediately and how to do so in a reproducible manner. The broader goal is to help shift near-term quantum research from isolated demonstrations toward an engineering discipline, in which algorithms, benchmarks, and model-selection practices can be compared fairly, stress-tested rigorously, and iterated systematically as hardware matures.

•Nov 10, 2026•0 citations

Comparing Simulated versus Hardware Training Data for Learning-Based Quantum Error Mitigation

Seyed Mohamad Ali Tousi, Guilherme N. DeSouza

Learning-based Quantum Error Mitigation (QEM) has emerged as a promising approach for reducing noise-induced bias on near-term Noisy Intermediate-Scale Quantum (NISQ) hardware. While simulated noise models enable scalable training of learning-based mitigators, real hardware data more accurately reflect device-specific error mechanisms, but are expensive and sparse. Understanding how these two data regimes interact is therefore critical for the practical deployment of learning-based QEM. In this paper, we present a systematic and empirical analysis on the nature of the data (simulated versus hardware noise) for learning-based QEM. Using a recently developed attention-based graph transformer for small- and large-scale quantum error mitigation, we compare various training regimes, starting from exclusively simulated noise and progressively integrating more measurements from real quantum hardware. Our study spans two distinct circuit families: 1) randomly generated circuits with relatively homogeneous structure; and 2) targeted quantum circuits derived from a specific problem, in this case the one-dimensional Burgers’ equation. Across five-fold cross validation, we analyze how hardware data affects generalization performance as measured by mean absolute error (MAE). Our results demonstrate that the impact of hardware data strongly depends on circuit structure and diversity. For random circuits, simulated data already guarantees lower absolute error, while hardware data yields consistent, but moderate improvements. In contrast, for targeted circuits, like the structured Burgers’ circuits, simulated noise can be less representative of the actual (testing) quantum error, and incorporating hardware data produces substantially larger relative reductions in MAE – despite the intrinsically higher MAE. These findings indicate the value of the nature of the training data in learning-based QEM, which is governed not only by the data’s ability to approximate reality – as expected – but also by how difficult it may be to capture circuit-induced error mechanisms in quantum simulations. In general, this work highlights the urgency of quantum circuit coverage in designing scalable and cost-effective learning-based QEM pipelines for devices in this new NISQ-era.

International Joint Conference on Neural Networks (IJCNN)•Jun 1, 2026•0 citations
Claims about quantum learning models are difficult to audit when the function they approximate is rarely available for comparison. We construct a setting in which it is. For a finite-horizon hitting problem, the optimal importance-sampling proposal is the Doob h-transform, a value function conditioned on the number of steps remaining as well as on the current state. On an enumerable state space, both this target and the exact variance of any proposal derived from it are computable, allowing learning error to be measured rather than estimated. On this testbed, we compare three horizon encodings crossed with two symmetry sectors for Born machines, together with a hybrid dressed circuit and classical regressors, and study sensitivity to initialization, increasingly rare failure regimes, and finite measurement budgets. Within the architectures studied, the statewise-regressive models substantially outperform the Born-machine parameterizations. Across repeated initializations, additive time re-uploading remains the weakest of the tested horizon encodings, while a symmetry-restricted ansatz consistently improves median learning error despite using eight times fewer circuit parameters. Initialization strongly affects absolute performance, yet these broader design trends survive aggregation across seeds. Because both model classes produce normalized proposals, the observed gap reflects differences in parameterization and optimization rather than normalization alone. The two quantum architectures also exhibit distinct sensitivity to finite-shot readout, and across a γ-retuned family spanning p_T = 10^-2 to 10^-8 the classical-to-hybrid gap widens substantially. Together, these results show how an exactly evaluable rare-event benchmark can separate effects of representation, optimization, and measurement that are otherwise easy to conflate in quantum-learning comparisons.
Variational quantum learning faces practical challenges in the noisy intermediate-scale quantum (NISQ) era. Parameterized quantum circuit (PQC) models suffer from statistical uncertainty due to finite-shot measurements and are highly sensitive to quantum noise, while purely classical approximations like neural quantum states (NQS) lack access to genuine quantum correlations and are limited in scalability. This work introduces Hybrid Parameterized Quantum States (HPQS), a general-purpose modeling framework that interpolates between quantum and classical parameterizations. HPQS combines PQC-based measurements with neural estimators via a blending mechanism and postprocessing functions, enabling enhanced, shot-efficient evaluation under hardware constraints. We demonstrate HPQS across three representative quantum learning tasks: (1) Expectation-based QML, where HPQS yields higher classification accuracy than PQC-only and NQS-only baselines under limited quantum measurements. (2) Quantum-Train, where HPQS generates the entire parameter set of classical networks using polylogarithmic trainable variables; and (3) Quantum Parameter Adaptation (QPA), where HPQS produces LoRA adapter parameters for fine-tuning large language models like GPT-2 and Gemma-2 with improved perplexity under low-shot conditions; Together, these results position HPQS as a scalable, noise-resilient approach for variational quantum learning, compatible with both current NISQ hardware and future fault-tolerant architectures.
Training parameterized quantum circuits requires balancing optimization progress with limited evaluation budgets and the statistical uncertainty of near-term quantum hardware. We present a modular benchmarking framework that separates quantum search-direction estimation from classical parameter-update rules, allowing their interactions and sensitivities to be examined independently. We evaluate a suite of gradient-based, stochastic, and derivative-free optimizers across combinatorial optimization using the Quantum Approximate Optimization Algorithm (QAOA), supervised quantum machine learning using Iris classification and a quantum convolutional neural network (QCNN) for binary MNIST classification, and quantum chemistry using the variational quantum eigensolver (VQE) for molecular hydrogen. By separating objective evaluations from sample-circuit costs under finite-shot simulation and physical execution on a 156-qubit processor, we compare optimizer behavior across workloads with different parameter counts and measurement requirements. Four selected simulator and hardware case studies report terminal and best observed objectives separately, alongside post-training classifier accuracies. The comparisons include selected MaxCut and hydrogen trajectories and illustrate workload-dependent objective changes and evaluation costs, while the simulator benchmark compares both peak and mean performance across three seeds. The hardware runs do not establish an optimizer ranking or isolate a causal effect of device noise.
Quantum fidelity kernels and quantum extreme learning machines share the same basic architecture: a fixed quantum device generates features that are combined through a classically trained linear model. We refer to this broad non-variational setting as quantum linear regression. A defining aspect of these models is that the quantum features are not directly available, but must be estimated from a finite number of shots. We show that finite statistics makes quantum linear regression unavoidably ill-conditioned. Ideal feature vectors are confined to a subspace determined by the dimension of the Hilbert space, whereas finite-shot estimates generically acquire components outside this subspace. Training then attempts to fit directions that disappear in the infinite-statistics limit, making the learned model increasingly sensitive to sampling noise. We analyze this mechanism for quantum extreme learning machines trained on ntrn_{\rm tr}ntr​ states with NNN shots per state. Despite the ill-conditioning, predictions remain controlled when the training targets are exact. Finite sampling produces a systematic prediction error that decreases quadratically with NNN, while fluctuations induced by the random training measurements decrease inversely with the total training budget. Thus, unlike in standard linear regression with exactly known features, increasing the dataset size alone cannot remove the error caused by sampling noise. If the training targets are also noisy, due for instance to state-preparation errors, the otherwise hidden directions become active. The test error can then increase with NNN, a behavior that we ascribe to a form of quantum overfitting. Our results expose a fundamental tradeoff between dataset size and per-state statistics in non-variational quantum learning and provide a baseline for resource-aware training and regularization strategies.
Abstract Gradient resolvability in quantum neural networks can depend simultaneously on circuit structure, objective construction, and finite-shot measurement, yet these interventions are usually benchmarked separately. We use a complete 2³ factorial design to test interactions among a pair-restricted controlled-NOT (CNOT) schedule (E), normalized transverse-field Ising model (TFIM) energy objective (L), and fixed residual shortcut (R) in a four-qubit measure–re-encode–reset hybrid quantum neural network. Across 50 matched initialization clusters and 30 finite-shot replicates per scientific cell, configurations were matched by block count, parameter identity, and total implemented simulator-shot budget. The centered E × L interaction in exact-gradient magnitude was positive and was supported by both mixed-model inference and an initialization-cluster bootstrap; the positive direction was retained in an independent-seed dataset, although its magnitude and depth profile remained uncertain. Finite-shot E × L and E × R interactions met the protocol-derived Wald/Holm rule, but their 1,000-fit nested-bootstrap intervals included zero, and the residual result was estimator-mode sensitive and inactive at D = 1, 2. The L × R-by-depth interaction remained unresolved. These results show that factorial benchmarking can expose composition effects that marginal comparisons miss while separating exact-gradient signal from finite-shot estimator behavior. They do not establish optimization success, hardware advantage, shot savings, or matched physical-resource cost.
The central claim of this thesis is simple but underappreciated: the primary bottleneck in near-term quantum computing is not a shortage of algorithms; it is a lack of systematic decision-making. Which problem instances should we test? Which circuit architectures are worth training? Which hyperparameters actually drive performance, and which are distractions? Today’s quantum hardware sits in an uncomfortable middle ground. It is expressive enough to explore nontrivial quantum dynamics, yet it is too noisy and shallow for the theoretical speedups that motivate the field. This thesis argues that applying machine learning to classical control decisions in hybrid quantum classical methods is one of the most tractable ways to make these methods genuinely useful in this regime. This argument is developed through four research questions, each addressing a distinct decision-making layer and illustrating the thesis. The first asks whether the decisions inside a hybrid heuristic can be learned rather than hand-coded. Chapter 4 analyzes Recursive QAOA (RQAOA), a promising yet brittle approach to combinatorial optimization, and identifies regimes in which its fixed-elimination strategy fails. It then replaces that strategy with a reinforcement learning policy, RL-RQAOA, that adapts to instance structure. The resulting method performs better on the constructed failure cases while remaining competitive elsewhere. The broader point is that learned classical control policies can materially improve hybrid quantum heuristics without increasing quantum depth, which is a significant practical advantage on constrained hardware. The second question evaluates whether the quantum optimization algorithm benchmarking instances we use are principled. Chapter 5 observes that much benchmarking in this space is driven by convenience. Researchers test on whatever graphs are readily available and then report aggregate performance. Instead, the chapter proposes a generative pipeline that couples a permutation-invariant graph autoencoder with evolutionary optimization to deliberately construct Max-Cut instances that strongly discriminate between a quantum-inspired solver, RQAOA, and a strong classical baseline, Goemans-Williamson, in both directions. By connecting solver behavior to structural graph features, the chapter turns benchmarking from a static choice into an interpretable experimental tool. The generated instances also expose failure modes that random graphs often fail to reveal. The third question asks what changes when realistic noise constraints are taken seriously during circuit design, not only during execution. Chapter 6 develops RLQAS, a reinforcement learning framework for quantum architecture search that incorporates noise assumptions informed by real IBM device characteristics throughout training, rather than treating noise as a post hoc correction. Paired with an efficient Pauli transfer matrix simulation, the framework makes large-scale noisy circuit search computationally feasible. The circuits it discovers are compact, trainable, and achieve competitive accuracy on ground-state energy tasks. This suggests that hardware-aware circuit design is tractable and can yield materially different choices than noise-agnostic search. The fourth question asks: even when the circuit architecture is fixed, how much of what we attribute to quantum model design is actually due to hyperparameter sensitivity? Chapter 7 extends functional ANOVA to quantum neural networks to quantify which hyperparameter choices drive performance variance. The finding is clear. Learning rate, circuit depth, and data encoding/reuploading dominate, while many architectural micro-choices contribute far less than the literature often implies. Rather than stopping at diagnosis, the chapter turns these importance rankings into data-driven priors that accelerate hyperparameter optimization. It converts a critique into a practical improvement. Taken together, these contributions form a coherent toolkit for developing and evaluating hybrid quantum–classical methods in the NISQ regime. While the work does not eliminate the fundamental constraints of shallow, noisy hardware, it clarifies what can be improved immediately and how to do so in a reproducible manner. The broader goal is to help shift near-term quantum research from isolated demonstrations toward an engineering discipline, in which algorithms, benchmarks, and model-selection practices can be compared fairly, stress-tested rigorously, and iterated systematically as hardware matures.
Learning-based Quantum Error Mitigation (QEM) has emerged as a promising approach for reducing noise-induced bias on near-term Noisy Intermediate-Scale Quantum (NISQ) hardware. While simulated noise models enable scalable training of learning-based mitigators, real hardware data more accurately reflect device-specific error mechanisms, but are expensive and sparse. Understanding how these two data regimes interact is therefore critical for the practical deployment of learning-based QEM. In this paper, we present a systematic and empirical analysis on the nature of the data (simulated versus hardware noise) for learning-based QEM. Using a recently developed attention-based graph transformer for small- and large-scale quantum error mitigation, we compare various training regimes, starting from exclusively simulated noise and progressively integrating more measurements from real quantum hardware. Our study spans two distinct circuit families: 1) randomly generated circuits with relatively homogeneous structure; and 2) targeted quantum circuits derived from a specific problem, in this case the one-dimensional Burgers’ equation. Across five-fold cross validation, we analyze how hardware data affects generalization performance as measured by mean absolute error (MAE). Our results demonstrate that the impact of hardware data strongly depends on circuit structure and diversity. For random circuits, simulated data already guarantees lower absolute error, while hardware data yields consistent, but moderate improvements. In contrast, for targeted circuits, like the structured Burgers’ circuits, simulated noise can be less representative of the actual (testing) quantum error, and incorporating hardware data produces substantially larger relative reductions in MAE – despite the intrinsically higher MAE. These findings indicate the value of the nature of the training data in learning-based QEM, which is governed not only by the data’s ability to approximate reality – as expected – but also by how difficult it may be to capture circuit-induced error mechanisms in quantum simulations. In general, this work highlights the urgency of quantum circuit coverage in designing scalable and cost-effective learning-based QEM pipelines for devices in this new NISQ-era.