Recognition: unknown
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 40 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.
-
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.
-
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.
-
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...
-
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.
-
Physics Guided Generative Optimization for Trotter Suzuki Decomposition
A generative optimization loop using diffusion models, PINNs, and GNNs achieves 85.6% of fourth-order Qiskit fidelity at 21.8% circuit depth for transverse-field Ising model Trotter-Suzuki decomposition.
-
Shuttling of $\mathbb{Z}_4$ parafermions in an electronic ladder model
Numerical study demonstrates controlled transport of Z4 parafermion edge states in a ladder model and quantifies the adiabatic speed limit under realistic conditions.
-
Quantum Flow algorithm: quantum simulations of chemical systems using reduced quantum resources and constant depth quantum circuits
QFlow-SD matches canonical UCCSD energies for tested molecules while using substantially fewer qubits via reduced active spaces and constant-depth circuits, with a composite classical-quantum downfolding strategy demo...
-
MCMit: Mid-Circuit Measurement Error Mitigation
MCMit mitigates mid-circuit measurement errors via a new multi-control branch instruction, CNN and transformer discriminators, and software techniques, reporting up to 70% latency reduction and 80% lower logical error...
-
Wave-Based Dispatch for Circuit Cutting in Hybrid HPC--Quantum Systems
DQR enables efficient scheduling and failover for cut quantum circuit fragments across local QPUs and remote simulators on real HPC hardware with low coordination overhead.
-
The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits
Sparse qubit connectivity raises compiled depth in noisy IQP circuits, requiring lower effective noise to remain outside the classically simulatable regime compared to fully connected layouts.
-
Frustration-Induced Expressibility Limitations in Variational Quantum Algorithms
Geometric frustration in a square-lattice Ising model with diagonal couplings produces strongly inhomogeneous correlations that standard Hamiltonian-inspired variational ansatze cannot capture efficiently, increasing ...
-
A parallel and distributed fixed-point quantum search algorithm for solving SAT problems
A parallel fixed-point quantum search algorithm solves SAT by independently processing CNF clauses via entanglement, reducing circuit depth and supporting distributed execution on NISQ devices.
-
Per-Shot Evaluation of QAOA on Max-Cut: A Black-Box Implementation Comparison with Goemans-Williamson
QAOA with default parameters is compared per-shot to Goemans-Williamson on realistic Max-Cut instances, highlighting practical limitations under black-box use.
-
No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
Absence of quantum advantage for log-depth QAOA on the binary paint shop problem implies a classical mean-field algorithm achieving a paint-swap ratio of approximately 0.2799, outperforming known heuristics and quantu...
-
A Hybrid Classical-Quantum Annealing Algorithm for the TSP
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.
-
Dimeric Perylene-Bisimide Organic Molecules: Fractional-Time Control of Quantum Resources
Fractional time order modulates coherence, entanglement, and nonlocality in dimeric PBI molecules via dipole-dipole interactions.
-
Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits
The Shortest Path in Pauli Forest algorithm decomposes Pauli exponentials into quantum circuits with improved CNOT counts and runtime for random cases and molecular ansatze.
-
Efficient Transpilation of OpenQASM 3.0 Dynamic Circuits to CUDA-Q: Performance and Expressiveness Advantages
A transpilation framework maps OpenQASM 3.0 dynamic circuits with conditionals and loops to CUDA-Q kernels, reducing depth and improving execution efficiency via direct control-flow translation.
-
Probing the Planck scale with quantum computation
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.
-
What quantum computer to buy?
Most institutions should start with the smallest quantum capability layer that delivers repeatable near-term value and builds expertise rather than acquiring large on-premises systems.
-
Lecture Notes on Replica Tensor Networks for Random Quantum Circuits
Lecture notes and accompanying library teach replica tensor network methods to compute circuit-averaged observables in random quantum circuits by mapping them to classical statistical mechanics models.
-
Quantum Complexity and New Directions in Nuclear Physics and High-Energy Physics Phenomenology
A review of how quantum information science is expected to provide new tools and insights for nuclear and high-energy physics phenomenology and quantum simulations.
-
Over forty years of research towards the understanding of Quantum Brownian Motion -- the contributions of A. O. Caldeira
The paper summarizes A. O. Caldeira's foundational work on quantum Brownian motion, including dissipation in tunneling, alternative models, and links to decoherence and quantum thermodynamics.
- Engineering of Anyons on M5-Probes via Flux Quantization
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.