Benchmarking the emulation of measurement-based quantum computing through the max K-Cut algorithm

DOI10.1007/S11128-025-05011-1MaRDI QIDQ6860569zbMATH OpenFDO

Authors Sebastiano Corli, Daniele Dragoni, Massimiliano Proietti, Massimiliano Dispenza, Carlo Cavazzoni, Enrico Prati

Publication date 10 February 2026

Published in Quantum Information Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11128-025-05011-1

zbMATH Keywords

MaxCutQAOAMax K-Cut HPCMBQC

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• A complete restricted Boltzmann machine on an adiabatic quantum computer
• Empirical performance bounds for quantum approximate optimization
• Entanglement, flow and classical simulatability in measurement based quantum computation
• Max-independent set and the quantum alternating operator ansatz
• Optimization of the memory reset rate of a quantum echo-state network for time sequential tasks
• Randomized heuristics for the Max-Cut problem
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
• The measurement calculus

This page was built for publication: Benchmarking the emulation of measurement-based quantum computing through the max K-Cut algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6860569)