Peer-reviewedPublisher termsPhysical Review Research
Scalable quantum-enhanced greedy algorithm for the maximum independent set problems on random regular graphs
Related
- Solving Graph Coloring Problems Using Feedback-Based Algorithm for Quantum Optimization
- Near-Optimal Quantum Algorithm and Complexity Analysis for Riccati Problems
- Experimental quantum-computing-enhanced sensing using Grover's algorithm
- A Highly Scalable Quantized Tensor-Train FDTD Framework for the Simulation of Three-Dimensional Electromagnetic Scattering Problems
- Scalable Bayesian Optimization of Composite Functions for Image-Based Inverse Problems in Materials Characterization
BibTeX
@article{wybo2026scalable,
title = {{Scalable quantum-enhanced greedy algorithm for the maximum independent set problems on random regular graphs}},
author = {Elisabeth Wybo and Jami Rönkkö and Olli Hirviniemi and Jernej Rudi Finžgar and Martin Leib},
journal = {Physical Review Research},
year = {2026},
month = oct,
doi = {10.1103/ds1n-wsdm},
url = {https://link.aps.org/doi/10.1103/ds1n-wsdm},
}
RIS
TY - JOUR
TI - Scalable quantum-enhanced greedy algorithm for the maximum independent set problems on random regular graphs
AU - Elisabeth Wybo
AU - Jami Rönkkö
AU - Olli Hirviniemi
AU - Jernej Rudi Finžgar
AU - Martin Leib
PY - 2026
DA - 2026/10/19
JO - Physical Review Research
DO - 10.1103/ds1n-wsdm
UR - https://link.aps.org/doi/10.1103/ds1n-wsdm
SN - 2643-1564
ER -