In the early fault-tolerant regime, where quantum resources remain limited, hybrid quantum-classical strategies offer one possible route toward quantum advantage. We introduce CANOE, the Classically Assisted Non-Orthogonal Eigensolver, as such an approach, distributing Rayleigh-Ritz basis states between quantum and classical hardware. This approach leverages the expressive power of quantum states, which are costly to reproduce classically, while augmenting them with a large pool of classically generated basis states that can be incorporated at negligible computational cost. We validate this through numerical simulations of a 76-qubit chromium atom system, quantifying how each additional quantum basis state enhances ground-state representability and how the inclusion of classical states further amplifies this improvement. Such a hybrid basis framework necessarily requires an efficient protocol on quantum hardware for evaluating overlaps between quantum and classical states in the resulting generalized eigenvalue formulation. We address this by introducing a histogram-based protocol and demonstrate through numerical simulations that it can approach chemical accuracy at moderate sampling cost. To solve the resulting generalized eigenvalue problem stably, CANOE incorporates a Schur-complement-based stabilization procedure that mitigates ill-conditioning caused by linear dependencies in the hybrid basis. Taken together, these results position CANOE as a practical framework for combining limited quantum resources with expansive classical resources for early fault-tolerant quantum simulations.
In the early fault-tolerant regime, where quantum resources remain limited, hybrid quantum-classical strategies offer one possible route toward quantum advantage. We introduce CANOE, the Classically Assisted Non-Orthogonal Eigensolver, as such an approach, distributing Rayleigh-Ritz basis states between quantum and classical hardware. This approach leverages the expressive power of quantum states, which are costly to reproduce classically, while augmenting them with a large pool of classically generated basis states that can be incorporated at negligible computational cost. We validate this through numerical simulations of a 76-qubit chromium atom system, quantifying how each additional quantum basis state enhances ground-state representability and how the inclusion of classical states further amplifies this improvement. Such a hybrid basis framework necessarily requires an efficient protocol on quantum hardware for evaluating overlaps between quantum and classical states in the resulting generalized eigenvalue formulation. We address this by introducing a histogram-based protocol and demonstrate through numerical simulations that it can approach chemical accuracy at moderate sampling cost. To solve the resulting generalized eigenvalue problem stably, CANOE incorporates a Schur-complement-based stabilization procedure that mitigates ill-conditioning caused by linear dependencies in the hybrid basis. Taken together, these results position CANOE as a practical framework for combining limited quantum resources with expansive classical resources for early fault-tolerant quantum simulations.
Abstract Hybrid quantum-classical approaches offer potential solutions to quantum chemistry problems, yet they often manifest as constrained optimization problems. Here, we explore the interconnection between constrained optimization and generalized eigenvalue problems through the Unitary Coupled Cluster (UCC) excitation generators. Inspired by the generator coordinate method, we employ these UCC excitation generators to construct non-orthogonal, overcomplete many-body bases, projecting the system Hamiltonian into an effective Hamiltonian, which bypasses issues such as barren plateaus that heuristic numerical minimizers often encountered in standard variational quantum eigensolver (VQE). Diverging from conventional quantum subspace expansion methods, we introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the UCC excitation generators. This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization to address complex, strongly correlated quantum chemical systems cost-effectively, setting the stage for more advanced quantum simulations in chemistry.
The Non-Orthogonal Quantum Eigensolver (NOQE) provides an accurate framework for electronic-structure calculations, but the estimation of its Hamiltonian and overlap matrix elements relies on sampling and requires O(1/ε2) circuit repetitions to achieve additive precision ε. Here, we reformulate this matrix-element estimation step as a collection of amplitude-estimation tasks and integrate iterative quantum amplitude estimation into the NOQE workflow. The resulting protocol achieves near-Heisenberg query complexity O(1/ε) for these estimation tasks, by replacing incoherent statistical averaging with coherent amplitude amplification. We present explicit circuit constructions and the corresponding implementation procedure. Numerical simulations for the electronic states of the hydrogen molecule show that the proposed method reaches chemical accuracy with substantially fewer total queries than the original sampling-based protocol. Overall, this work provides a measurement-efficient route to high-precision energy estimation and illustrates how sampling-limited quantum algorithms can be systematically reformulated to leverage quantum coherence and achieve lower measurement costs.
The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to these problems is currently infeasible due to limitations in the number of logical qubits, their fidelity, and the shallow circuit depths supported by existing hardware, all of which hinder simulations at the required level of accuracy. A promising alternative is hybrid quantum-classical computing, where classical resources are used to construct effective Hamiltonians characterized by dimensions that conform to the constraints of current quantum devices. In this paper, we demonstrate the performance of a hybrid approach: coupled cluster downfolded Hamiltonians are first evaluated in reduced-dimensionality active spaces, and the corresponding ground-state energies are subsequently computed using quantum algorithms. Our comprehensive analysis explores the achievable accuracy in recovering correlation energies when hundreds of orbitals are downfolded into a problem size tractable by today’s quantum hardware. We argue that such flexible hybrid algorithms, where problem size can be tailored to available quantum resources, can serve as a bridge between noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, marking a step toward the early realization of quantum advantage in chemistry.
The transition from the Noisy Intermediate-Scale Quantum era toward fault tolerance will in-troduce an intermediate regime, Early Fault-Tolerant Quantum Computing. In this regime faulttolerance is first achieved but restricted by strict hardware limits, such as a small pool of logicalqubits or limited ancilla resources, and shallow logical circuits are guaranteed to be protected byerror correction protocols. This thesis investigates whether variational algorithms retain prac-tical utility in this regime, and whether anchoring them to a protocol with known analyticalcomplexity can supply the trainability guarantees that generic variational methods lack.We introduce a Variational Quantum Amplifier, a hybrid algorithm in which a parameter-ized quantum circuit prepares a trial state and a Quantum Phase Estimation block amplifies andreads out its overlap with a target eigenstate specified only by its eigenvalue. The central featureof this construction is that the cost function is the probability assigned to the target eigenvalue,ensuring the target eigenstate is addressed through its eigenvalue alone and never prepared as areference. We show that the trainable ansatz converts an otherwise exponential sampling costinto a polynomial one and for a local Hamiltonian, we derive a closed-form expression for thegradient variance, identifying in this manner conditions under which barren plateaus are avoided,and provide an analytical, hardware-estimable gradient via a modified Hadamard-test circuit.Building on this, we construct an adaptive variant of this Variational Quantum Amplifier, andbenchmark it on local autoencoder and entangled projector Hamiltonians. Finally, a rigorousresource estimation against a representative family of NISQ and fault-tolerant algorithms showsthat the proposed method occupies a distinctive niche, inheriting the circuit depth of an EFTQCmethod while actively reducing the sampling overhead through the trainable ansatz during execution.
Combining variational quantum process with classical neural learning offers a flexible route to improve ground-state estimation. We establish an integrated framework that connects neural transformations, measurement statistics, and physical stability through three requirements: self-contained training, polynomial resource scaling, and variational consistency. Its constructive realization, termed unitary variational quantum-neural hybrid eigensolver (U-VQNHE), couples a variational quantum circuit to a neural phase function through norm-preserving post-processing. The learned transformation is evaluated from measurement records, preserves the exact variational bound, and admits range-independent concentration guarantees for independent finite-shot evaluations. Complementing this construction, we characterize the statistical and representational constraints of amplitude reweighting: sampled-support mismatch can destabilize empirical normalization, while polynomial-range reweighting exactly matches only an exponentially small fraction of Haar-random target distributions from a fixed ansatz, and exact matching for structured ansatz--target pairs can require exponentially large dynamic range under specified near-tensorizability and mismatch conditions. Finite-shot simulations on Ising and disordered XYZ spin models demonstrate improved energy accuracy over the underlying variational quantum eigensolver and greater robustness than the amplitude-reweighting baselines. Together, these results provide a principled foundation for quantum--neural eigensolvers in which physical consistency, expressive capacity, and measurement cost are treated as a single design problem.
The Noisy Intermediate-Scale Quantum (NISQ) era, defined by qubit counts in the hundreds and gate error rates that preclude long coherence times, imposes severe constraints on purely quantum computation. The central problem is that achieving practical quantum advantage for real-world tasks must overcome these hardware limitations, yet fault-tolerant quantum computers with full error correction remain years away. To address this, we present a systematic survey of hybrid classical-quantum computing models, in which classical high-performance resources orchestrate the workflow, perform iterative optimization, and apply error mitigation to noisy quantum processing units. Our review encompasses variational quantum algorithms, such as the variational quantum eigensolver and quantum approximate optimization algorithm; classical optimizers tailored for noisy quantum landscapes; error mitigation techniques including zero-noise extrapolation and probabilistic error cancellation; and circuit knitting that partitions large circuits across small QPUs. We find that these hybrid architectures have already demonstrated domain-specific utility in quantum chemistry for molecular ground-state estimation, in logistics and finance for combinatorial optimization, and in machine learning for generative and recommendation models. Notably, they often surpass purely classical or purely quantum approaches on carefully chosen benchmarks. The evidence indicates that hybrid classical-quantum systems are not a temporary stopgap but a durable paradigm. Their role will persist into the early fault-tolerant era, where small, logical qubits will similarly require classical coordination. Consequently, the field urgently demands the establishment of standardized hybrid performance benchmarks, the maturation of robust quantum-classical middleware capable of efficient transpiration and execution management, and holistic co-design frameworks that seamlessly integrate hardware constraints, software stack layers, and application-specific requirements from the outset.