Probing quantum advantage for solving the Fermi-Hubbard model with entropy benchmarking

• URL: http://arxiv.org/abs/2510.00930v1
• Date: Wed, 01 Oct 2025 14:10:30 GMT
• Title: Probing quantum advantage for solving the Fermi-Hubbard model with entropy benchmarking
• Authors: Pauline Besserve, Raúl García-Patrón,
• Abstract summary: We develop a quantum advantage benchmarking framework.<n>It connects the accumulation of entropy in a quantum processing unit and the degradation of the solution to a target optimization problem.<n>We demonstrate its applicability on the problem of finding the ground state of the two-dimensional Fermi-Hubbard.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We developed a practical quantum advantage benchmarking framework that connects the accumulation of entropy in a quantum processing unit and the degradation of the solution to a target optimization problem. The benchmark is based on approximating from below the Gibbs states boundary in the energy-entropy space for the application of interest. We believe the proposed benchmarking technique creates a powerful bridge between hardware benchmarking and application benchmarking, while remaining hardware-agnostic. It can be extended to fault-tolerant scenarios and relies on computationally tractable numerics. We demonstrate its applicability on the problem of finding the ground state of the two-dimensional Fermi-Hubbard.

Related papers

• QB Ground State Energy Estimation Benchmark [30.045562070102537]
  Ground State Energy Estimation is a central problem in quantum chemistry and condensed matter physics.<n>This work introduces a structured benchmarking framework for evaluating the performance of both classical and quantum solvers.
  arXiv  Detail & Related papers  (2025-08-14T17:45:28Z)
• Hybrid quantum-classical algorithm for near-optimal planning in POMDPs [39.682133213072554]
  Reinforcement learning (RL) provides a principled framework for decision-making in partially observable environments.<n>Recent advances demonstrate that inference on sparse Bayesian networks can be accelerated using quantum rejection sampling combined with amplitude amplification.<n>We introduce Quantum Bayesian Reinforcement Learning (QBRL), a hybrid quantum-classical look-ahead algorithm for model-based RL in partially observable environments.
  arXiv  Detail & Related papers  (2025-07-24T17:42:30Z)
• Branch-and-bound digitized counterdiabatic quantum optimization [39.58317527488534]
  Branch-and-bound algorithms effectively solve convex optimization problems, relying on the relaxation the objective function to obtain tight lower bounds.<n>We propose a branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO) algorithm that addresses the relaxation difficulties.
  arXiv  Detail & Related papers  (2025-04-21T18:19:19Z)
• Entropy Density Benchmarking of Near-Term Quantum Circuits [0.0]
  In this work, we investigate the accumulation of entropy density as a benchmark to monitor the performance of quantum processing units.<n>A combination of analytical methods, numerical simulations, and experiments on programmable superconducting quantum circuits is used.
  arXiv  Detail & Related papers  (2024-12-23T22:01:09Z)
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization [35.18016233072556]
  Combinatorial optimization plays a crucial role in many industrial applications.<n>We present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO)<n>Our results show that BF-DCQO offers an effective path for solving large-scale HUBO problems on current and near-term quantum processors.
  arXiv  Detail & Related papers  (2024-09-05T17:38:59Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization [58.720142291102135]
  We introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theoretical convergence of the proposed scheme from the viewpoint of the collisions in the object which stores the tabu states, based on the Ising model.
  arXiv  Detail & Related papers  (2022-09-05T07:23:03Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark [0.0]
  We propose and implement a practical, application-based benchmark for testbed quantum computing devices. Our protocol calculates the energy of the ground state in the single particle subspace of a 1-D Fermi Hubbard model. We demonstrate and analyze the benchmark performance on superconducting and ion trap testbed hardware from three hardware vendors and with up to 24 qubits.
  arXiv  Detail & Related papers  (2021-10-29T18:52:46Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Parity Quantum Optimization: Benchmarks [0.4499833362998487]
  We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. We consider random spin models with higher order terms, as well as the problems of predicting financial crashes and finding the ground states of electronic structure Hamiltonians.
  arXiv  Detail & Related papers  (2021-05-13T12:43:16Z)
• An application benchmark for fermionic quantum simulations [0.0]
  It is expected that the simulation of correlated fermions in chemistry and material science will be one of the first practical applications of quantum processors. We propose using the one-dimensional Fermi-Hubbard model as an application benchmark for variational quantum simulations on near-term quantum devices.
  arXiv  Detail & Related papers  (2020-03-04T02:23:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.