Realizing the promise of quantum computation for condensed matter many-body problems depends as much on software as on hardware, yet the area is reviewed far more often than it is quantified. We address this gap by pairing a focused survey of quantum algorithm software for condensed matter physics with a compact, fully reproducible benchmark suite that turns qualitative claims into concrete numbers. Each algorithm family, namely the variational quantum eigensolver (VQE), quantum phase estimation (QPE), quantum annealing and the quantum approximate optimization algorithm (QAOA), and quantum machine learning (QML), is demonstrated on a canonical lattice model and validated against an independent classical reference, from exact diagonalization and the Bethe ansatz to matrix-product-state DMRG. Within this suite we quantify two issues usually treated only qualitatively. Mapping the Fermi-Hubbard model to qubits under the Jordan-Wigner and Bravyi-Kitaev encodings, we tabulate qubit counts, operator weights, and gate costs and expose a geometry-dependent trade-off between the two. Simulating the circuits under a depolarizing noise model, we show that zero-noise extrapolation restores ground-state energies and optimization quality across the noise range. Around these results we review the algorithms as applied to strongly correlated systems, topological phases, and quantum magnetism, together with the leading software development kits (Qiskit, Cirq, PennyLane, and Q\#) and the classical and tensor-network methods against which quantum approaches must be benchmarked. All circuits, seeds, and data are released so the benchmarks can be reproduced and extended. We argue that standardized, reproducible benchmarks of this kind are essential to gauge progress and identify genuine quantum advantage in condensed matter physics.
Realizing the promise of quantum computation for condensed matter many-body problems depends as much on software as on hardware, yet the area is reviewed far more often than it is quantified. We address this gap by pairing a focused survey of quantum algorithm software for condensed matter physics with a compact, fully reproducible benchmark suite that turns qualitative claims into concrete numbers. Each algorithm family, namely the variational quantum eigensolver (VQE), quantum phase estimation (QPE), quantum annealing and the quantum approximate optimization algorithm (QAOA), and quantum machine learning (QML), is demonstrated on a canonical lattice model and validated against an independent classical reference, from exact diagonalization and the Bethe ansatz to matrix-product-state DMRG. Within this suite we quantify two issues usually treated only qualitatively. Mapping the Fermi-Hubbard model to qubits under the Jordan-Wigner and Bravyi-Kitaev encodings, we tabulate qubit counts, operator weights, and gate costs and expose a geometry-dependent trade-off between the two. Simulating the circuits under a depolarizing noise model, we show that zero-noise extrapolation restores ground-state energies and optimization quality across the noise range. Around these results we review the algorithms as applied to strongly correlated systems, topological phases, and quantum magnetism, together with the leading software development kits (Qiskit, Cirq, PennyLane, and Q#) and the classical and tensor-network methods against which quantum approaches must be benchmarked. All circuits, seeds, and data are released so the benchmarks can be reproduced and extended. We argue that standardized, reproducible benchmarks of this kind are essential to gauge progress and identify genuine quantum advantage in condensed matter physics.
Condensed matter physics increasingly depends on computation to explain how collective behaviour emerges from interacting electrons, spins and lattices, and to anticipate which materials will host unconventional superconductivity, quantum spin liquids, topological phases or correlated states in two-dimensional moiré superlattices. Methodological progress has been rapid, yet the literature remains divided into method-specific reviews that seldom ask a common question: how far can a computational conclusion about an emergent phenomenon be trusted, and what evidence establishes that trust? This critical narrative review addresses that question for theoretical and computational studies of quantum materials published between January 2004 and September 2026, supplemented by foundational earlier work. Literature was identified through multidisciplinary and physics-relevant scholarly indexes, citation tracing and examination of benchmark studies, and was appraised for control of approximations, convergence and finite-size analysis, agreement across independent methods, reproducibility and the quality of experimental confrontation. The synthesis indicates that density functional theory and its high-throughput extensions are dependable for structural energetics, phonon-mediated superconductivity and symmetry-indicated band topology when the relevant correlations are weak, whereas their conclusions for magnetic and correlated materials depend strongly on the exchange–correlation approximation. Embedding theories, tensor networks and quantum Monte Carlo methods have converged on several model ground states, most clearly the stripe-dominated physics of the two-dimensional Hubbard model. By contrast, the kagome antiferromagnet, Kitaev materials, nickelate superconductors and fractional Chern insulators illustrate persistent disagreement driven by model construction, parameter sensitivity and finite-size effects. Machine-learned potentials and wavefunctions extend accessible length and time scales but introduce dataset-dependent biases, and claims of quantum computational advantage for materials problems have repeatedly been narrowed by improved classical algorithms. The review proposes a tiered framework that treats internal verification, cross-method convergence and prospective experimental falsification as successive levels of predictive reliability. Priorities include uncertainty-quantified construction of low-energy models, shared benchmarks for realistic multi-orbital Hamiltonians and prospective tests of computational predictions. Computational condensed matter physics has become genuinely predictive in specific, well-characterised regimes; the principal task now is to state explicitly where those regimes end.
Abstract Quantum computers promise to solve electronic structure, lattice dynamics, and strongly correlated problems beyond classical reach. However, near-term noisy intermediate scale quantum (NISQ) processors require systematic benchmarking to establish where variational algorithms with error mitigation can achieve chemical accuracy and cor rectly predict physical phenomena. Here we present 28 quantum material simula tions implemented with Qiskit, spanning molecular hydrogen (H 2 ) through the iron molybdenum cofactor (FeMoco), one-dimensional Hubbard chains, Kitaev honeycomb spin liquids, topological insulators (SSH model), BCS superconductors, and disordered Anderson insulators. Using the variational quantum eigensolver (VQE) with UCCSD ansatz, we achieve chemical accuracy (±1.6 mHa) for H 2 across the full dissociation curve and recover exact ground-state energies for H4 within 9 mHa after zero-noise extrapolation (ZNE) — reducing raw VQE errors from 152 mHa to 9 mHa. We accu rately identify the transverse-field Ising quantum critical point (h c = J) with 4 qubits, resolve Majorana Dirac dispersions in the Kitaev spin liquid, and reproduce the Mott transition in the Fermi-Hubbard model at U c = 6t. Resource estimation for FeMoco reveals O(N 2.5 ) scaling, projecting chemical accuracy with ∼200 logical qubits. Across all benchmarks, we quantify the accuracy-circuit depth tradeoff, demonstrating that depth-6 VQE ans¨atze achieve chemical accuracy for small molecules while depth-10 is required for correlated lattices. These results establish a comprehensive benchmark suite for evaluating quantum hardware, error mitigation protocols, and variational al gorithms for materials science on NISQ processors.
Quantum simulation and near-term quantum algorithms have gained significant momentum over the past few years, with researchers exploring quantum-based approaches to solve classically intractable problems. Out of many research problems, certain problems are well suited for quantum algorithms. Fermi Hubbard model based on lattice structures is one of the quantum-mechanical models used in many-body and condensed matter physics to capture the essence of electron-correlated systems. In this work, we show one of the first kinds of experiments on simulating the ground state properties of 1D and 2D Fermi Hubbard-based lattice models compared with the reference ground state energy values using Qiskit Nature. We utilize the Variational Quantum Eigensolver (VQE) and different gradient-based optimizers to achieve results that closely converge towards the exact values, showcasing the potential of variational quantum algorithms.
In this thesis we have implemented three many-body methods in quantum mechanics on quantum computers, namely the Quantum Phase Estimation (QPE) algorithm, the Variational Quantum Eigensolver (VQE) algorithm and the Quantum Adiabatic Time Evolution (QATE) algorithm.We utilized these methods to approximate the ground state energy of the pairing model Hamiltonian.We provided a comparison between the ideal simulation of a quantum computer and a simulation including the noise model from some of IBM's actual quantum devices.For the VQE algortihm, we also run the method on the IBM Q London five-qubit device.As the time complexity (circuit depth) of a quantum algorithm (quantum circuit) is often the bottleneck on current quantum computers, we also introduced a circuit optimization scheme, called Recursive Circuit Optimization, which can be utilized to approximate the action of a quantum circuit by learning the parameters of a parametrized unitary operation and only evaluating small parts of the circuit at a time.We tested out the method by trying to optimize a random circuit, the QATE algorithm and the unitary coupled cluster doubles (UCCD) ansatz.Finally, we implemented a quantum circuit that allows us to encode a real data set into the amplitudes of a quantum state, and we utilized this circuit to implement several realizations of dense and recurrent neural networks on quantum computers.We proposed neural network layers that are consisting of hardware-and parameter-efficient parametrized quantum circuits, and we have made a Python framework to construct and train deep quantum neural networks.We then tested the neural networks by trying to learn a simple non-linear function as well as finding the smallest eigenvalue of the pairing Hamiltonian Full Configuration Interaction (FCI) matrix.We found that all the quantum many-body methods showed promise in providing an upper bound on the ground state energy for the ideal simulation of a quantum computer.When performing the simulation with noise and the execution on the real quantum device however, we found that only the VQE algorithm was able to yield reasonable results due to short circuit depth.Still, the success of the method was found to be dependent on the interaction strength g of the quantum system, as the approximation of the ground state energy started to deviate from the actual value as we increased g.For the recursive circuit optimization of a random circuit, we found that we were able to approximate the state given by the random circuit, and we learned that we should expect some error in the approximation due to finite measurements and the flexibility of the parametrized unitary.When utilizing the recursive optimization scheme to approximate the QATE algorithm, we found that although we were not able to exactly reproduce the action of the operator, we did provide an upper bound to the ground state energy close to the one given by the actual QATE algorithm.In the same time, the circuit depth of the algorithm was drastically decreased.When utilizing the scheme for the VQE algorithm, we got promising results while reducing the circuit depth of the UCCD ansatz.Over to the neural networks, we managed to approximate a non-linear function utilizing a hardware-efficient three layered network, with only three qubits in the intermediate layers.We showed that our proposed neural network are suitable for near-term quantum computers by successfully approximating the lowest eigenvalue of the FCI matrix when running a simulation with the noise model from the IBM Q London five-qubit computer.i I would first like to thank my supervisor, Morten Hjorth-Jensen, for being helpful and motivational throughout my time at the University of Oslo.Your door has always been open when help is needed, which has been a great relief in stressful times.I would also like to thank my friends and family for believing in me and providing emotional support.Your continuous interest in my studies and well-being has meant a lot to me.My next thanks goes to Heidi K. J.I highly appreciate your never-ending support.Finally I would like to thank the computational physics study group.You have been invaluable to me in both a social and educational manner.
This paper presents a comprehensive review and systematic coverage of foundational quantum optimization algorithms-QAOA, Quantum Annealing, VQE, VQLS, and HHL-tracing their development all the way from Schrödinger's equation through gate-based quantum computing (Deutsch, Deutsch-Jozsa, Bernstein-Vazirani, QFT, Shor's, and Grover's algorithms) to hybrid quantum-classical approaches for NISQ-era hardware. We also present the transverse field Ising model's role in quantum annealing as well as practical hardware implementations with the Chimera, Pegasus, and Zephyr topologies of the D-Wave quantum annealer, addressing key challenges including barren plateaus, circuit trainability, and noise resilience. In the simulations section, quantum computing applications to collaborative filtering and social network optimization have been presented. We introduce two original contributions: (1) a quantum collaborative filtering model based on VQE principles that leverages quantum entanglement to represent user-item relationships, requiring logarithmically fewer parameters than classical embedding methods while accessing exponentially larger state spaces, and demonstrating test RMSE of 0.85 on synthetic data; and (2) a Quantum Social Network (QSN) framework modeling belief dynamics through superposition and entanglement, revealing emergent consensus and polarization phenomena validated via Qiskit simulations. By demonstrating that variational quantum algorithms can tackle real-world recommendation and network optimization problems on current hardware, we bridge theoretical quantum computing with practical machine learning applications and identify concrete pathways toward quantum advantage beyond traditional combinatorial optimization.
Accurate prediction of molecular structures and properties is vital for chemistry; materials science, and drug discovery, yet classical electronic-structure methods often fail for strongly correlated systems, large basis sets, and complex potential-energy landscapes. Quantum technology encompassing quantum computing, quantum machine learning, and hybrid quantum classical strategies offers a fundamentally new paradigm by encoding many-electron wave functions directly on qubits and exploiting superposition and entanglement to explore exponentially large Hilbert spaces. This review synthesizes recent algorithmic and hardware advances relevant to molecular modelling, including the Variational Quantum Eigensolver (VQE), Quantum Phase Estimation (QPE), quantum unitary coupled-cluster (q-UCC) families, equation-of-motion and subspace methods for excited states, tensor-network hybrids, and quantum kernel and variational QML approaches. We examine noise-aware hybrid workflows, error-mitigation techniques, symmetry-preserving ansätze, and operator-factorization methods that reduce measurement and gate overhead. Representative applications are discussed: ground- and excited-state energy prediction, potential-energy surface mapping, geometry and transition-state optimization, spectroscopic property estimation (IR, UV–Vis, NMR, EPR), and reaction-dynamics scenarios where non-adiabatic effects and conical intersections dominate. Resource estimates and scaling analyses clarify current NISQ limitations qubit counts, circuit depth, shot complexity and delineate the roadmap to fault-tolerant QPE for chemical accuracy. We compare quantum approaches with classical baselines (DFT, CCSD (T), multireference methods), identifying domains where quantum methods already show promise (strong correlation, multi-reference dissociation, spin-state ordering) and where classical methods remain competitive. Finally, we highlight near-term industrial opportunities in drug design, catalysis, CO2 capture, and energy materials, and outline critical research directions: algorithmic reductions in measurement/precision cost, hardware improvements in fidelity and connectivity, scalable ansatz design, and integrated software stacks for reproducible hybrid simulations. Together, these developments indicate that while practical, large-scale quantum advantage for general chemistry remains future work, quantum technologies are rapidly maturing into powerful tools for targeted molecular problems that are intractable with existing classical techniques.