3-regular graphs
Emerging4papers using it
2024first seen
'3-regular graphs' are a type of graph where each vertex has exactly three edges, and they are used to evaluate the performance of quantum algorithms, specifically in the context of the MaxCut optimization problem.
Papers using 3-regular graphs (4)
- Accelerating Noisy Variational Quantum Algorithms with Physics-Informed Denoising NetworksWarm Start Adaptive-Bias Quantum Approximate Optimization AlgorithmBenchmarking Quantum Optimization for the Maximum-Cut Problem on a
Superconducting Quantum ComputerImaginary Hamiltonian variational ansatz for combinatorial optimization problems