Related papers: Probing quantum advantage for solving the Fermi-Hu…
In order to quantify the relative performance of different testbed quantum computing devices, it is useful to benchmark them using a common protocol. While some benchmarks rely on the performance of random circuits and are generic in…
Assessing whether a noisy quantum device can potentially exhibit quantum advantage is essential for selecting practical quantum utility tasks that are not efficiently verifiable by classical means. For optimization, a prominent candidate…
Understanding the limitations imposed by noise on current and next-generation quantum devices is a crucial step towards demonstrating practical quantum advantage. In this work, we investigate the accumulation of entropy density as a…
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. Given the rapid evolution of quantum hardware, it is increasingly important…
The famous, yet unsolved, Fermi-Hubbard model for strongly-correlated electronic systems is a prominent target for quantum computers. However, accurately representing the Fermi-Hubbard ground state for large instances may be beyond the…
The Fermi-Hubbard model is a plausible target to be solved by a quantum computer using the variational quantum eigensolver algorithm. However, problem sizes beyond the reach of classical exact diagonalisation are also beyond the reach of…
Quantum computing holds immense promise for simulating quantum systems, a critical task for advancing our understanding of complex quantum phenomena. One of the primary goals in this domain is to accurately approximate the ground state of…
Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…
The Fermi-Hubbard model is of fundamental importance in condensed-matter physics, yet is extremely challenging to solve numerically. Finding the ground state of the Hubbard model using variational methods has been predicted to be one of the…
We introduce universal, easy-to-reproduce generative models for the QUBO instances to differentiate the performance of the hardware/solvers effectively. Our benchmark process extends the well-known Hebb's rule of associative memory with the…
The efficient simulation of correlated quantum systems is the most promising near-term application of quantum computers. Here, we present a measurement of the second Renyi entropy of the ground state of the two-site Fermi-Hubbard model on a…
We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits…
The competition between evolution time, interaction strength, and temperature challenges our understanding of many-body quantum systems out-of-equilibrium. Here we consider a benchmark system, the Hubbard dimer, which allows us to explore…
The rapid pace of development in quantum computing technology has sparked a proliferation of benchmarks for assessing the performance of quantum computing hardware and software. Good benchmarks empower scientists, engineers, programmers,…
Identify, Transform, Benchmark, Show Quantum Advantage (ITBQ): Evaluating use cases for quantum computers. We introduce a four-step framework for assessing quantum computing applications -- from identifying relevant industry problems to…
We develop a workflow to use current quantum computing hardware for solving quantum many-body problems, using the example of the fermionic Hubbard model. Concretely, we study a four-site Hubbard ring that exhibits a transition from a…
Architectures for quantum computing can only be scaled up when they are accompanied by suitable benchmarking techniques. The document provides a comprehensive overview of the state and recommendations for systematic benchmarking of quantum…
We investigate an efficient, generic method for evaluating the performance of quantum annealing devices that does not require the prior knowledge of the true ground state of the benchmark problem. This approach exploits symmetry properties…
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing…