Pith. sign in

REVIEW 5 cited by

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.08448 v2 pith:PPMI4WX6 submitted 2021-01-21 quant-ph cond-mat.stat-mechcs.AIcs.LG

Noisy intermediate-scale quantum (NISQ) algorithms

classification quant-ph cond-mat.stat-mechcs.AIcs.LG
keywords algorithmsquantumnisqdevicesnoisyqubitscoherencecomputers
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Simulating quantum circuits with a neural statebank

    quant-ph 2026-06 unverdicted novelty 6.0

    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.

  2. Co-Designing Error Mitigation and Error Detection for Logical Qubits

    quant-ph 2026-04 unverdicted novelty 6.0

    Optimized QED intervals plus steady-state extraction enable PEC+QED to deliver 2-11x lower error than PEC alone on Iceberg codes for QAOA.

  3. QMC-Net: Data-Aware Quantum Representations for Remote Sensing Image Classification

    quant-ph 2026-04 unverdicted novelty 6.0

    QMC-Net maps per-band statistics to customized quantum circuit hyperparameters and achieves 93.80% and 99.34% accuracy on EuroSAT and SAT-6, outperforming classical and monolithic quantum baselines.

  4. Impact of gate-voltage noise on silicon spin-qubit variational quantum eigensolvers

    quant-ph 2026-06 unverdicted novelty 5.0

    A hardware-algorithm co-simulation identifies noise regimes where silicon spin-qubit VQE can still reach chemically accurate H2 ground-state energies, showing exchange gates are far more sensitive than single-qubit rotations.

  5. Co-Design quantum simulation of nanoscale NMR

    quant-ph 2022-02 unverdicted novelty 5.0

    Proposes a transmon-based co-designed quantum processor using a central resonator and QCR to enable NISQ simulation of nanoscale NMR with major SWAP reduction and non-unitary hyperpolarization operations.