QAOA on qudit-encoded integer graph problems outperforms the Frieze-Jerrum SDP for Max-k-Cut at p≤4 in regimes k=3 d≤10 and k=4 d≤40, while a new degree-of-saturation heuristic beats both on GSet but may be overtaken by QAOA at p≤20.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 3representative citing papers
Neural post-Einsteinian analysis of GWTC-3 finds no GR violation and sets constraints covering both post-Newtonian and beyond-post-Newtonian deviations in a single theory-agnostic setup.
Theoretical study of flopping-mode qubits in Si/SiGe showing that high-fidelity operation is achievable across valley configurations when pulses are tuned for weak noise or when valley splittings are large and phase differences small for strong noise.
citing papers explorer
-
Quantum Approximate Optimization of Integer Graph Problems and Surpassing Semidefinite Programming for Max-k-Cut
QAOA on qudit-encoded integer graph problems outperforms the Frieze-Jerrum SDP for Max-k-Cut at p≤4 in regimes k=3 d≤10 and k=4 d≤40, while a new degree-of-saturation heuristic beats both on GSet but may be overtaken by QAOA at p≤20.
-
Neural Post-Einsteinian Test of General Relativity with the Third Gravitational-Wave Transient Catalog
Neural post-Einsteinian analysis of GWTC-3 finds no GR violation and sets constraints covering both post-Newtonian and beyond-post-Newtonian deviations in a single theory-agnostic setup.
-
The effects of alloy disorder on strongly-driven flopping mode qubits in Si/SiGe
Theoretical study of flopping-mode qubits in Si/SiGe showing that high-fidelity operation is achievable across valley configurations when pulses are tuned for weak noise or when valley splittings are large and phase differences small for strong noise.