Erdős-Rényi graphs

Erdős-Rényi graphs are a type of random graph used to evaluate the performance of quantum algorithms, specifically in the context of combinatorial optimization problems like the maximal independent set.

Papers using Erdős-Rényi graphs (2)

Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion2025Addressing the Minor-Embedding Problem in Quantum Annealing and Evaluating State-of-the-Art Algorithm Performance2025