{"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/traffic-flow-optimization-using-a-quantum","title":"Traffic flow optimization using a quantum annealer","arxiv_id":"1708.01625","date":"2017-08-04","proceeding":null,"authors":["Florian Neukart","Gabriele Compostella","Christian Seidel","David von Dollen","Sheir Yarkoni","Bob Parney"],"abstract":"Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. In this paper, we present a real-world application that uses quantum technologies. Specifically, we show how to map certain parts of the real-world traffic flow optimization problem to be suitable for quantum annealing. We show that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum applications. Due to the limited size and connectivity of current-generation D-Wave QPUs, we use a hybrid quantum and classical approach to solve the traffic flow problem.","url_abs":"https://arxiv.org/abs/1708.01625v2","url_pdf":"https://arxiv.org/pdf/1708.01625v2.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":"traffic-flow-optimization-using-a-quantum","repo_url":"https://github.com/mbinjavaid/traffic-routes-qc","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1708.01625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.01625"}},"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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mbinjavaid/traffic-routes-qc","reach":null}],"summary":{"ran_draft_wrong":1,"ran_honours":3},"by_repo_kind":{"listed":{"samples":4,"ran":4,"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":4,"samples":[{"code_sha256_prefix":"969b2be6a2b67740","entry":"Q_dict","repo":"mbinjavaid/traffic-routes-qc","repo_kind":"listed","path":"QBSolv.py","file_url":"https://github.com/mbinjavaid/traffic-routes-qc/blob/HEAD/QBSolv.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"969b2be6a2b67740"}},{"code_sha256_prefix":"8c5f68a6705731a1","entry":"cost2IndexConstructor","repo":"mbinjavaid/traffic-routes-qc","repo_kind":"listed","path":"Q.py","file_url":"https://github.com/mbinjavaid/traffic-routes-qc/blob/HEAD/Q.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8c5f68a6705731a1"}},{"code_sha256_prefix":"e09bfdb1cb5f403c","entry":"lembda","repo":"mbinjavaid/traffic-routes-qc","repo_kind":"listed","path":"Q.py","file_url":"https://github.com/mbinjavaid/traffic-routes-qc/blob/HEAD/Q.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"e09bfdb1cb5f403c"}},{"code_sha256_prefix":"67ea83af11f5af7d","entry":"noOfSegments","repo":"mbinjavaid/traffic-routes-qc","repo_kind":"listed","path":"Q.py","file_url":"https://github.com/mbinjavaid/traffic-routes-qc/blob/HEAD/Q.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"67ea83af11f5af7d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}