activity
20242026
most citedEfficient Classical Sampling from Gaussian Boson Sampling Distributions on Unweighted Graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2024 · quant-phShow all

1 paper · 2 filters

quant-ph2024

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs

Tongyang Li, Yuexin Su, Ziyi Yang +1

Maximum cut (MaxCut) on graphs is a classic NP-hard problem. In quantum computing, Farhi, Gutmann, and Goldstone proposed the Quantum Approximate Optimization Algorithm (QAOA) for…