{"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-hybrid-quantum-classical-algorithm-for","title":"A Hybrid Quantum-Classical Algorithm for Robust Fitting","arxiv_id":"2201.10110","date":"2022-01-25","proceeding":"CVPR 2022 1","authors":["Anh-Dzung Doan","Michele Sasdelli","David Suter","Tat-Jun Chin"],"abstract":"Fitting geometric models onto outlier contaminated data is provably intractable. Many computer vision systems rely on random sampling heuristics to solve robust fitting, which do not provide optimality guarantees and error bounds. It is therefore critical to develop novel approaches that can bridge the gap between exact solutions that are costly, and fast heuristics that offer no quality assurances. In this paper, we propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs and terminates with a global solution or an error bound. The combinatorial subproblems are amenable to a quantum annealer, which helps to tighten the bound efficiently. While our usage of quantum computing does not surmount the fundamental intractability of robust fitting, by providing error bounds our algorithm is a practical improvement over randomised heuristics. Moreover, our work represents a concrete application of quantum computing in computer vision. We present results obtained using an actual quantum computer (D-Wave Advantage) and via simulation. Source code: https://github.com/dadung/HQC-robust-fitting","url_abs":"https://arxiv.org/abs/2201.10110v4","url_pdf":"https://arxiv.org/pdf/2201.10110v4.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":"abstracts"},"code_links":[{"paper_slug":"a-hybrid-quantum-classical-algorithm-for","repo_url":"https://github.com/dadung/hqc-robust-fitting","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2201.10110","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.10110"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/dadung/HQC-robust-fitting","reach":null}],"summary":{"ran_draft_wrong":2,"ran_fixture":1,"ran_honours":2},"by_repo_kind":{"official":{"samples":5,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":5,"samples":[{"code_sha256_prefix":"235b9525cc595ce8","entry":"create_Q","repo":"dadung/HQC-robust-fitting","repo_kind":"official","path":"qubo.py","file_url":"https://github.com/dadung/HQC-robust-fitting/blob/HEAD/qubo.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"235b9525cc595ce8"}},{"code_sha256_prefix":"f6025e5a7482ea5a","entry":"create_qubo","repo":"dadung/HQC-robust-fitting","repo_kind":"official","path":"qubo.py","file_url":"https://github.com/dadung/HQC-robust-fitting/blob/HEAD/qubo.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f6025e5a7482ea5a"}},{"code_sha256_prefix":"2e721f62048c8aec","entry":"hyperedges_to_matrix","repo":"dadung/HQC-robust-fitting","repo_kind":"official","path":"qubo.py","file_url":"https://github.com/dadung/HQC-robust-fitting/blob/HEAD/qubo.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"2e721f62048c8aec"}},{"code_sha256_prefix":"f4089d096bf73545","entry":"matrix_to_upper_triangular","repo":"dadung/HQC-robust-fitting","repo_kind":"official","path":"qubo.py","file_url":"https://github.com/dadung/HQC-robust-fitting/blob/HEAD/qubo.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f4089d096bf73545"}},{"code_sha256_prefix":"48e76c986771e5f0","entry":"restructure_Q","repo":"dadung/HQC-robust-fitting","repo_kind":"official","path":"qubo.py","file_url":"https://github.com/dadung/HQC-robust-fitting/blob/HEAD/qubo.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"48e76c986771e5f0"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}