{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-quantum-walk-assisted-approximate-algorithm","title":"A quantum walk assisted approximate algorithm for bounded NP optimisation problems","arxiv_id":"1804.08227","date":"2018-04-23","proceeding":null,"authors":["Samuel Marsh","Jingbo Wang"],"abstract":"This paper describes an application of the Quantum Approximate Optimisation Algorithm (QAOA) to efficiently find approximate solutions for computational problems contained in the polynomially bounded NP optimisation complexity class (NPO PB). We consider a generalisation of the QAOA state evolution to alternating quantum walks and solution-quality-dependent phase shifts, and use the quantum walks to integrate the problem constraints of NPO problems. We apply the recent concept of a hybrid quantum-classical variational scheme to attempt finding the highest expectation value, which contains a high-quality solution. The algorithm is applied to the problem of minimum vertex cover, showing promising results using only a fixed and low number of optimisation parameters.","url_abs":"https://arxiv.org/abs/1804.08227v2","url_pdf":"https://arxiv.org/pdf/1804.08227v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-quantum-walk-assisted-approximate-algorithm","repo_url":"https://github.com/Edric-Matwiejew/QuOp_MPI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-quantum-walk-assisted-approximate-algorithm","repo_url":"https://github.com/Edric-Matwiejew/qwao_mpi","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}