Quantum Computing in the NISQ era and beyond
read the original abstract
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away --- we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.
This paper has not been read by Pith yet.
Forward citations
Cited by 60 Pith papers
-
An Exponential Advantage for Adaptive Tomography of Structured States under Pauli Basis Measurements
For an explicit prefix/tree family of quantum states, adaptive local Pauli tomography achieves polynomial copy complexity while non-adaptive strategies require exponentially many copies.
-
Simulating the dynamics of an SU(2) matrix model on a trapped-ion quantum computer
First digital quantum simulation of SU(2) matrix model real-time dynamics on Quantinuum H2 using Loschmidt echo, with systematic error breakdown and modest post-selection gains.
-
Sdim: A Qudit Stabilizer Simulator
Sdim is the first open-source qudit stabilizer simulator supporting all dimensions, enabling circuit evaluation and sampling for qudit fault-tolerant quantum computing research.
-
Learning quantum Hamiltonians at any temperature in polynomial time
The authors provide a poly-time algorithm that learns local quantum Hamiltonians to precision ε from poly copies of the Gibbs state at any constant β>0 by reducing the problem to a low-degree sum-of-squares relaxation...
-
An efficient Pauli decomposition algorithm for structured matrices
A randomized algorithm recovers the exact Pauli decomposition of k-sparse n-qubit matrices in poly(n, k, log(1/δ)) time with high probability under sparse query access.
-
Rendering Coherent Scattering via Quantum Collision Models
A ray-tracing framework that models sub-surface scattering via symmetry-constrained unitary quantum collisions, pre-computable on quantum computers to produce BSDFs for new coherent materials.
-
A Coherence Law for Trainability in Noisy Equivariant Quantum Neural Networks
A coherence law based on the readout-visible aligned coherence rate (a Rayleigh quotient of the noise generator) predicts gradient survival in noisy U(1)-equivariant QNNs, with simulations confirming R²=0.979 and a sp...
-
Quantum Computing and Data Processing for Frequent Itemset Mining
QFM is a quantum data-processing framework for frequent itemset mining that introduces bit-vector qubit encoding, mining-aware candidate superposition, and bit-parallel threshold marking, reporting 96% average improve...
-
Forecasting Conceptual Diffusion in Science: The Case of Quantum Computing
LightGBM models on citation and diversity features predict exogenous diffusion of quantum computing concepts with R² up to 0.78 while endogenous reinforcement remains largely unpredictable after growth controls, with ...
-
Winning Lottery Tickets in Neural Networks via a Quantum-Inspired Classical Algorithm
A classical polynomial-time algorithm for optimized sampling of lottery tickets in neural networks removes the exponential dependence on data dimension from prior classical approaches.
-
Quantum Nonlinear Properties from a Single Measurement Setting
CBNE enables estimation of nonlinear quantum properties such as higher-order expectations from a single randomized measurement setting under sufficient system dimension or ancillary qubits.
-
The finite-shot help-harm boundary of zero-noise extrapolation
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
-
Local tensor-train surrogates for quantum learning models
Local tensor-train surrogates approximate quantum machine learning models via Taylor polynomials and tensor networks, delivering polynomial parameter scaling and explicit generalization bounds controlled by patch radius.
-
Isolating Recurring Execution-Dependent Abnormal Patterns on NISQ Quantum Devices
QRisk isolates backend-specific abnormal error patterns on NISQ devices via delta debugging and mitigates them with commuting gate swaps, cutting excess noise by 24-45% on IBM backends where noise models predict no di...
-
Learning PDEs for Portfolio Optimization with Quantum Physics-Informed Neural Networks
Quantum PINNs using tensor-rank polynomials solve the Merton portfolio optimization PDE more accurately and with far fewer parameters than classical neural networks.
-
Gauge-invariant QMETTS with mutually unbiased physical bases for $Z_2$ lattice gauge theories at finite temperature and density
Introduces gauge-invariant QMETTS using mutually unbiased physical bases derived from stabilizer formalism for Z2 LGT at finite T and density, with single-shot sampling shown near-optimal and numerical validation in 1+1D.
-
Robust GHZ State Preparation via Majority-Voted Boundary Measurements
Group-Majority-Voting protocol prepares GHZ states on 30-60 qubit simulated devices with 2.4x higher fidelity than the Line Dynamic method by using parallel local preparations and majority-voted boundary measurements.
-
Accelerating Inference for Multilayer Neural Networks with Quantum Computers
Quantum circuits for coherent multilayer neural network inference achieve quadratic to polylogarithmic speedups over classical methods depending on quantum data access models for inputs and weights.
-
Learning to learn with quantum neural networks via classical neural networks
Classical RNNs trained on small instances provide parameter initializations for QAOA and VQE that reduce total optimization iterations and generalize across problem sizes.
-
LUCI on IBM Hardware: Error Suppression with Almost Half Syndrome Density
Hardware experiment on IBM devices shows reset-free LUCI achieves logical X and Z error suppression ratios of 1.75(10) and 1.93(12), competitive with surface code despite halved syndrome density.
-
A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Gr...
-
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems
AtomTreeSearch embeds a neutral-atom quantum MWIS subroutine inside Monte Carlo Tree Search and matches or exceeds OR-Tools and simulated annealing on TSP instances up to 100 cities.
-
Quantum-classical physics-informed Kolmogorov-Arnold networks for PDEs
QCPIKAN is a quantum-classical physics-informed KAN that claims exponential high-frequency error convergence and superior accuracy over prior QCPINNs on single-phase, transport, and two-phase seepage PDEs.
-
A Finite-Volume Scheme for the Continuum Extrapolation of Lattice Step-Scaling in (2+1)D Hamiltonian U(1) Gauge Theory
Introduces and tests a finite-volume scheme enabling stable continuum extrapolation of the step-scaling function in (2+1)D Hamiltonian U(1) gauge theory via matrix product states.
-
QMaxCal: Path-Space Regularization for Open Quantum Control via Girsanov's Theorem
Derives KL_W and R_DV regularizers from Girsanov's theorem that reduce infidelity by up to 50% and improve robustness to noise mismatch on single- and multi-qubit benchmarks including an IBM Kingston calibration.
-
Simulating quantum circuits with a neural statebank
A compact neural statebank based on autoregressive Transformers simulates 34-qubit quantum circuits with ~0.01 infidelity using 0.3 million parameters, outperforming tested approximate simulators.
-
Explainable Forecasting of Scientific Breakthroughs from Concept Network Dynamics
A two-stage LightGBM model on 59 features from concept networks forecasts link formation and intensity with ROC-AUC 0.95-0.967 across domains.
-
Accelerating physics-informed neural networks for full waveform inversion using a hybrid quantum-classical finite-basis architecture
Hybrid quantum-classical FBPINN for acoustic FWI achieves lower L1 velocity error than classical baselines in ~8x fewer iterations with ~33% fewer parameters on anomaly and checkerboard benchmarks.
-
Quantum Signal Processing for Linear PDEs: Circuit Design and Experimental Validation
End-to-end QSP-based quantum circuits solve linear PDEs on IBM hardware with tunable error and handle non-homogeneous Dirichlet boundaries for a plasma Poisson problem.
-
Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks
Systematic review of 81 QEM papers finds only 25% use inferential methods and demonstrates via ZNE case studies that parameter sensitivity and temporal drift can create illusory performance gains.
-
A Variational Quantum Algorithm for Nonlinear Finite Element Analysis of Hyperelastic Materials
A hybrid quantum-classical variational method using polynomial approximations to the energy functional enables finite element analysis of a 1D Neo-Hookean hyperelastic model on near-term quantum hardware.
-
Physics Guided Generative Optimization for Trotter Suzuki Decomposition
P-GONE applies generative ML to optimize Trotter-Suzuki decompositions, reporting up to 19.4x circuit depth reduction at F >= 0.95 versus Qiskit baselines on structured Hamiltonians.
-
Communication-Efficient Distributed Inverse Quantum Fourier Transform
A pruned distributed inverse quantum Fourier transform reduces inter-node communication from quadratic to linear scaling in the number of nodes while preserving functional correctness.
-
High-Precision Variational Quantum SVD via Classical Orthogonality Correction
A variational quantum SVD framework with classical orthogonality correction enables high-precision extraction of Schmidt components from bipartite states using shallow circuits and classical tensor-network post-processing.
-
Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.
-
Conformalized Quantum DeepONet Ensembles for Scalable Operator Learning with Distribution-Free Uncertainty
A quantum ensemble method reduces operator inference to linear complexity and supplies distribution-free uncertainty bounds for high-dimensional dynamical systems.
-
Conformalized Quantum DeepONet Ensembles for Scalable Operator Learning with Distribution-Free Uncertainty
Conformalized Quantum DeepONet Ensembles reduce operator inference from quadratic to linear complexity using QOrthoNNs and SPQCs while delivering distribution-free uncertainty guarantees through ensemble conformal prediction.
-
Probabilistic Condition, Decision and Path Coverage of Circuit-based Quantum Programs
Quantum circuits show high average condition (97.56%) and decision (97.63%) coverage but lower path coverage (71.84%), with probabilistic versions adding confidence levels (averages 88.87%, 88.65%, 37.18%); mutation t...
-
MCMit: Mid-Circuit Measurement Error Mitigation
MCMit proposes a constant-latency multi-control branch instruction, transformer and CNN discriminators, plus static MCM elimination and stochastic branching, evaluated on Qubic with QPU traces to cut latency by 70% an...
-
Few-Shot Cross-Device Transfer for Quantum Noise Modeling on Real Hardware
A residual neural network trained on one quantum device's noise data can be fine-tuned with 20 samples from a second device to improve prediction of ideal circuit outputs, recovering 34.9% of the performance gap.
-
A Complex-Valued Continuous-Variable Quantum Approximation Optimization Algorithm (CCV-QAOA)
CCV-QAOA is a new complex-valued continuous-variable variant of QAOA that solves real and complex multivariate optimization problems via a variational framework.
-
Co-Designing Error Mitigation and Error Detection for Logical Qubits
Optimized QED intervals plus steady-state extraction enable PEC+QED to deliver 2-11x lower error than PEC alone on Iceberg codes for QAOA.
-
Advancing Practical Quantum Embedding Simulations via Operator Commutativity Based State Preparation for Complex Chemical Systems
A commutativity-based dynamic ansatz within DMET enables ground-state simulations of molecules up to 144 qubits using at most 20 qubits at a time with improved accuracy and lower gate counts than standard approaches.
-
Option Pricing on Noisy Intermediate-Scale Quantum Computers: A Quantum Neural Network Approach
A compact 2-qubit QNN approximates Black-Scholes-Merton option prices with usable accuracy when executed on multiple commercial NISQ quantum processors.
-
Parameter-efficient Quantum Multi-task Learning
QMTL uses shared VQC encoding plus task-specific quantum ansatz heads to achieve linear parameter scaling with the number of tasks while matching or exceeding classical multi-task baselines on three benchmarks.
-
Eliminating Vendor Lock-In in Quantum Machine Learning via Framework-Agnostic Neural Networks
A new QNN architecture with unified graph, HAL, and ONNX pipeline enables cross-framework and cross-hardware QML with training time within 8% of native implementations and identical accuracy on Iris, Wine, and MNIST-4 tasks.
-
QuantumXCT: Learning Interaction-Induced State Transformation in Cell-Cell Communication via Quantum Entanglement and Generative Modeling
QuantumXCT learns parameterized quantum circuits to model interaction-induced unitary transformations between non-interacting and interacting cellular state distributions from transcriptomic profiles.
-
A Framework for Quantum Simulations of Energy-Loss and Hadronization in Non-Abelian Gauge Theories: SU(2) Lattice Gauge Theory in 1+1D
A quantum simulation framework is developed and demonstrated for energy loss and hadronization of a heavy quark in 1+1D SU(2) lattice gauge theory on 18 qubits of IBM hardware, with results matching classical simulations.
-
Detection of noise correlations in two qubit systems by Machine Learning
Machine learning classifies six Markovian and non-Markovian noise classes in two-qubit systems with over 94% accuracy using only final transfer efficiencies from a coherent population transfer protocol under three dri...
-
Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
-
Learning-Optimized Qubit Mapping and Reuse to Minimize Inter-Core Communication in Modular Quantum Architectures
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
-
Synthesis of discrete-continuous quantum circuits with multimodal diffusion models
Multimodal diffusion model generates discrete gate selections and continuous parameters for quantum circuit compilation, claiming better gate counts and noise resilience than prior methods.
-
A PennyLane-Centric Dataset to Enhance LLM-based Quantum Code Generation using RAG
PennyLang dataset of 3,347 PennyLane samples boosts LLM code generation success via RAG from 8.7% to 41.7% for Qwen 7B and 78.8% to 84.8% for LLaMa 4.
-
Bayesian Parameter Shift Rule in Variational Quantum Eigensolvers
Bayesian PSR with Gaussian processes and GradCoRe accelerates VQE SGD by reusing observations and minimizing per-step costs while reducing to standard PSR in special cases.
-
Engineering of Anyons on M5-Probes via Flux Quantization
Flux quantization of the M5-brane tensor field in twisted Cohomotopy yields Pontrjagin homology observables that reproduce abelian Chern-Simons theory and braid actions on defect anyons.
-
Simulating quantum chaos on a quantum computer
Hybrid simulation of the 2-qubit quantum kicked top on IBMQ shows periodic evolution and chaos signatures in time-averaged entanglement, with gate count independent of kick number.
-
Production of Magic States via $Z$ Bosons and Dark Photons
Magic distributions are computed for EW processes (reproducing QED at low energy, new at high energy/Z resonance) and dark-sector scatterings, reaching maximal magic at mass ratios m_f/m_χ → 0 and → 1.83929.
-
Spectral Geometry and Bosonic-Bloch Probes: Explorations in Quantum Learning
Training in graph-regularized quantum networks increases spectral dimension by 0.23 and enables anomaly detection via Bloch drift (ROC-AUC ≥0.9) while bosonic enhancement correlates with Fiedler splits (r=-0.50).
-
QmDFT for Polycyclic Aromatics: Balancing Embedding Ground-State Fidelity and Experimental Gap Estimation
An adaptive damping and DIIS protocol stabilizes QmDFT embedding with hybrid functionals on 10 PAHs, yielding LDA agreement with FCI for ground states and B3LYP agreement with experimental gaps while bypassing explici...
-
Hard-core Bosons in Action: Applications to Quantum Circuits
Hard-core boson algebra is reviewed and extended for quantum circuit simulation with reported speedups over Qiskit and a new genetic-algorithm application for circuit synthesis.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.