I spent about 2.5 years working on variational quantum algorithms for noisy intermediate-scale quantum (NISQ) devices [1]. The question was straightforward: can we do anything useful with these noisy, small-scale, "universal" quantum devices? Here useful was typically to mean faster, but could also mean solve far too complex problems for classical quantum chemistry.
The short answer I came to was: not in any way that clearly demonstrated a speedup over well-tuned classical solvers. The longer answer: you can get them to run, get numbers back, even match the literature, but there's no clear, reproducible speed-up. Most of the effort is in engineering the system to produce anything coherent, not in pushing computational frontiers. I'm not sure if this is a good thing or a bad thing.
So what is the state now? Are there any clear signs of utility for variational quantum algorithms? Are there any new quantum algorithms for chemistry or physics that require error correction but have proven advantage over classical computers? My guess is the answer is no not really, but I'm not sure and for now don't have the time to read up and investigate.
What I saw with Universal Quantum Computing in the NISQ Era
Universal quantum computing here means we have a qubit, quantum information analog of digital bits, and we can do arbitrary single-qubit rotations and controlled two-qubit gates to produce logic operations that put qubits into superposition and can entangle them. We can also compose them into circuits that approximate any unitary evolution.
For famous algorithms like Shor's or Grover's, the path to usefulness is clear if you had fault-tolerant quantum computing with sufficient qubits. But in the NISQ setting, VQA [2] or QAOA are the only viable options. There might be some new class of NISQ-like algorithms, I'm not sure, but it's probably still safe to say VQA and QAOA are dominant.
Lets say that you moved beyond the NISQ era, which may well be happening, and thus the noise and decoherence are under control, there's still the ansatz problem, that is how do you pick a circuit structure that can efficiently represent the solution state in the first place?
The Ansatz Problem
An ansatz is a parameterized (quantum circuit) guess for the form of your quantum state. In VQAs, it's the fixed sequence of gates you tune with a classical optimizer. In phase estimation (PEA) or Hamiltonian simulation, it's often the state-preparation step for your quantum algorithm.
The difficulty is balancing expressivity and feasibility:
- Too shallow: can't represent the physics; optimizer converges to the wrong state.
- Too deep: hardware noise kills you in NISQ; in fault-tolerant hardware, depth inflates T-gate and qubit costs.
- Too generic: risks barren plateaus [3].
- Too problem-specific: works only on one Hamiltonian.
In PEA, the ansatz problem just shifts to the state-preparation step. You might nail the controlled-unitary and inverse QFT, but if you can't efficiently prepare the eigenstate, you'll likely get garbage.
So what did I work on?
Most of the creativity in the research I did comes all from my colleague/co-author, I was mostly involved in domain application, instrumentation, and analysis. There were two works [4-5] but the one I'll highlight is probably the least interesting: we developed a hybrid quantum–classical eigensolver without variation or parametric gates[4]. The idea is to project the problem Hamiltonian into a smaller subspace, measured term-by-term with short circuits, and diagonalized classically.
This allowed us to:
- Extract ground and excited states for small molecules (BeH₂, LiH).
- Validate against exact diagonalization.
- Run on the quantum hardware at the time (i.e., IBM devices).
It avoided long, problem-tailored ansatz circuits, but the choice of basis in the subspace projection is still a hidden ansatz.
A Self-Critique of Our Hybrid Eigensolver Work
We avoided variational loops and deep, problem-specific ansätze: no parameterized circuits, no barren plateau optimizers. The issue, though, was
- We dodged the ansatz problem: The reduced-space basis is still an ansatz, thus performance depends on making a smart choice. We didn't quantify sensitivity.
- Hardware vs. simulation gap unexplored IBM runs matched noiseless simulations, but was this due to noise resilience, shallow circuits, or luck?
- Thin classical comparisons We used exact diagonalization due to simplicty of the chemical system and basis. Real claims require benchmarks vs. DMRG [6], coupled-cluster, etc.
Why NISQ VQAs Struggle
There has been a lot of work on this in the last few years and I'm not fully up to date but this is what I gather:
- Noise vs. depth: deeper means more decoherence.
- Barren plateaus: gradients vanish exponentially with qubits.
- Optimizer instability: hardware drift, shot noise, optimizer quirks.
- Classical competition: tensor networks, DMRG [6] often scale better [7].
- Ansatz rigidity: wrong ansatz wastes all gates and shots.
Summary of My Position
I'm not a seasoned quantum algorithm researcher, but from my limited research, I see NISQ-era of VQAs as mainly useful for benchmarking, with their progress limited by the challenge of designing effective ansätze. In quantum chemistry, there is little convincing evidence so far that VQAs offer practical advantages1. Digital quantum simulation is highly flexible but comes with significant resource costs. Analog simulation, which directly emulates physical systems, is already useful in certain specialized areas but will always be a niche. Looking ahead to fault-tolerant quantum computing, real breakthroughs may be possible, but efficient state preparation will remain a central obstacle.
Footnotes
References
[1] J. Preskill, Quantum Computing in the NISQ era and beyond, arXiv (2018). [2] M. Cerezo et al., Variational Quantum Algorithms, arXiv (2021). [3] M. Larocca et al., Barren Plateaus in Variational Quantum Computing, arXiv (2024). [4] P. Jouzdani & S. Bringuier, Hybrid Quantum–Classical Eigensolver Without Variation or Parametric Gates, Quantum Reports 3, 8 (2021). DOI [5] P. Jouzdani, S. Bringuier, M. Kostuk, A method of determining molecular excited-states using quantum computation, MRS Advances 6 (2021) 558–563. DOI [6] S. R. White, Density matrix formulation for quantum renormalization groups, PRL 69, 2863 (1992). [7] S. Lee et al., Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry, Nat. Commun. 14, 1952 (2023). DOI