Noisy intermediate-scale quantum computing

NISQ algorithms are quantum algorithms designed for quantum processors in the NISQ era. Common examples are the variational quantum eigensolver (VQE) and quantum approximate optimization algorithm (QAOA), which use NISQ devices but offload some calculations to classical processors. These methods constitute a way of reducing the effect of noise by running a set of circuits and applying post-processing to the measured data. In contrast to quantum error correction, where errors are continuously detected and corrected during the run of the circuit, error mitigation can only use the outcome of the noisy circuits. The quantum hardware landscape Current NISQ devices typically contain between 50 and 1,000 physical qubits, with leading systems from IBM, Google, and other companies pushing these boundaries. However, these qubits are inherently "noisy" – they suffer from decoherence, gate errors, and measurement errors that accumulate during computation. Gate fidelities hover around 99-99.5% for single-qubit operations and 95–99% for two-qubit gates, which while impressive, still introduce significant errors in circuits with thousands of operations. The fundamental challenge lies in the exponential scaling of quantum noise. With error rates above 0.1% per gate, quantum circuits can execute approximately 1,000 gates before noise overwhelms the signal. This constraint severely limits the depth and complexity of algorithms that can be successfully implemented on current hardware, necessitating the development of specialized NISQ algorithms that work within these constraints. Mathematical foundation and implementation VQE operates on the variational principle of quantum mechanics, which states that the expectation value of any trial wavefunction provides an upper bound on the true ground state energy. The algorithm constructs a parameterized quantum circuit called an ansatz∣ψ(θ)⟩, to approximate the ground state of a molecular Hamiltonian \hat{H}:\quad E(\theta) = \langle \psi(\theta) \mid \hat{H} \mid \psi(\theta) \rangle The quantum processor prepares the ansatz state and measures the Hamiltonian expectation value, while a classical optimizer iteratively adjusts the parameters θ to minimize the energy. This hybrid approach leverages quantum superposition to explore exponentially large molecular configuration spaces while relying on well-established classical optimization techniques. The algorithm has proven particularly valuable for studying chemical reactions, transition states, and excited state properties. Recent implementations have achieved chemical accuracy (within 1 kcal/mol) for small molecules, demonstrating the potential for quantum advantage in materials discovery and drug development applications. Scaling challenges and solutions Despite its successes, VQE faces significant scaling challenges. The number of measurements required grows polynomial with the number of qubits, while the optimization landscape becomes increasingly complex for larger systems. The fragment molecular orbital (FMO) approach combined with VQE has shown promise for addressing scalability, allowing efficient simulation of larger molecular systems by breaking them into manageable fragments. Performance benchmarks and quantum advantage Recent theoretical and experimental work has demonstrated QAOA's potential for quantum advantage on specific problem classes. For the Max Cut problem on random graphs, QAOA at depth p=11 has been shown to outperform standard semidefinite programming algorithms. Even more remarkably, QAOA can exploit non-adiabatic quantum effects that classical algorithms cannot access, potentially circumventing fundamental limitations that constrain classical optimization methods. Experimental implementations on quantum hardware have shown promising results for problems with up to 20–30 variables, though current hardware limitations restrict practical applications to relatively small problem sizes. The algorithm's performance improves with circuit depth p, but NISQ constraints limit the achievable depth, creating a fundamental trade-off between solution quality and hardware requirement. == Error mitigation: Making noisy quantum computing practical ==

Since NISQ devices lack full quantum error correction, error mitigation techniques become essential for extracting meaningful results from noisy quantum computations. These techniques operate through post-processing measured data rather than actively correcting errors during computation, making them suitable for near-term hardware implementations. Zero-noise extrapolation Zero-noise extrapolation (ZNE) represents one of the most widely used error mitigation techniques, artificially amplifying circuit noise and extrapolating results to the zero-noise limit. The method assumes that errors scale predictably with noise levels, allowing researchers to fit polynomial or exponential functions to noisy data and infer noise-free results. Recent implementations of purity-assisted ZNE have shown improved performance by incorporating additional information about quantum state degradation. This approach can extend ZNE's effectiveness to higher error regimes where conventional extrapolation methods fail, though it requires additional measurement overhead. Symmetry verification and probabilistic error cancellation Symmetry verification exploits conservation laws inherent in quantum systems to detect and correct errors. For quantum chemistry calculations, symmetries such as particle number conservation or spin conservation provide powerful error detection mechanisms. When measurement results violate these symmetries, they can be discarded or corrected through post-selection. Probabilistic error cancellation reconstructs ideal quantum operations as linear combinations of noisy operations that can be implemented on hardware. While this approach can achieve zero bias in principle, the sampling overhead typically scales exponentially with error rates, limiting practical applications to relatively low-noise scenarios. Performance overhead and trade-offs Error mitigation techniques inevitably increase measurement requirements, with overheads ranging from 2x to 10x or more depending on error rates and the specific method employed. This creates a fundamental trade-off between accuracy and experimental resources, requiring careful optimization for each application. == Quantum advantage: Current status and future prospects ==

The question of quantum advantage in the NISQ era remains hotly debated, with different complexity-theoretic frameworks providing varying conclusions about the computational power of noisy quantum devices. While theoretical work suggests that NISQ algorithms occupy a computational complexity class strictly between classical computing (BPP) and ideal quantum computing (BQP), experimental demonstrations of practical quantum advantage remain elusive. == Theoretical separations and limitations ==

Recent complexity theory results show that NISQ devices cannot achieve Grover-like quadratic speedups for unstructured search problems, fundamentally limiting their advantage for certain algorithm classes. However, NISQ algorithms can still achieve exponential advantages over classical methods for specific structured problems, such as the Bernstein-Vazirani problem, where quantum advantage requires only logarithmic query complexity. For quantum state learning problems, NISQ devices face exponential limitations compared to fault-tolerant quantum computers, highlighting the importance of error correction for certain applications. These theoretical insights help define the boundaries of NISQ computational power and guide algorithm development efforts. == Beyond-NISQ era ==

The creation of a computer with tens of thousands of qubits and enough error correction would eventually end the NISQ era. In April 2024, researchers at Microsoft announced a significant reduction in error rates that required only 4 logical qubits, suggesting that quantum computing at scale could be years away instead of decades. == Industry roadmaps and timeline projections ==

Leading quantum computing companies have published ambitious roadmaps for achieving fault-tolerant quantum computing within the current decade. IBM has committed to delivering a large-scale fault-tolerant quantum computer, IBM Quantum Starling, by 2029. This system aims to execute quantum circuits comprising 100 million quantum gates on 200 logical qubits, representing a computational capability requiring the memory of more than 10^{48} classical supercomputers to simulate. IBM's approach relies on quantum low-density parity check (qLDPC) codes and bivariate bicycle codes to minimize the physical qubit overhead required for fault tolerance. Quantinuum has announced an accelerated roadmap to achieve universal fault-tolerant quantum computing by 2029–2030, building on their recent breakthroughs in implementing both Clifford and non-Clifford gates fault-tolerantly. Their trapped-ion architecture has demonstrated the industry's highest quantum volumes and longest coherence times, positioning them as a leading contender for early fault-tolerant systems. Other companies, including Google, are pursuing alternative approaches such as surface code implementations and novel qubit architectures to achieve similar timelines. Independent analysis suggests that practical quantum applications may emerge around 2035–2040, assuming continued exponential growth in quantum hardware capabilities. However, these projections depend critically on simultaneous advances across multiple technical domains, including qubit hardware, control systems, error correction algorithms, and quantum software stacks. The transition from NISQ to fault-tolerant quantum computing represents one of the most significant technological challenges in modern physics and engineering, requiring sustained international collaboration and investment to realize its transformative potential. == See also ==