{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TMMY5KLDLMY5GOYUNZ5ADPCPRI","short_pith_number":"pith:TMMY5KLD","schema_version":"1.0","canonical_sha256":"9b198ea9635b31d33b146e7a01bc4f8a0c84e631955e21cb4ad1e23a5087f375","source":{"kind":"arxiv","id":"2306.08507","version":2},"attestation_state":"computed","paper":{"title":"Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alexander Dukakis, Benjamin Tan, Dimitris G. Angelakis, Ioannis D. Leonidas","submitted_at":"2023-06-14T13:44:35Z","abstract_excerpt":"The vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables, to evaluate the effectiveness of NISQ devices when applied to industry relevant optimization problems. We apply a quantum variational approach to a testbed of multiple VRPTW instances ranging from 11 to 3964 routes. These intances were formulated as quadratic unconstrained binary optimization (QUBO) problems based on realistic shipping scenarios. We "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2306.08507","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-14T13:44:35Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4059956c831b8258970846f50be8ede703c0ac181995bee83d4fda0c792c8191","abstract_canon_sha256":"532fac3a82805eac60f0a7c690aa77d063d7b99efd14f1ab231d08769c1c634e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:04.940385Z","signature_b64":"uJ+QRSYAJezowIlHeyaCOScGHM/c8PDubHpCH3LzU7Dmp+b52+9FzXMrcOJ/nxwkJRiPEo3T1/BcT1tzoB4GBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b198ea9635b31d33b146e7a01bc4f8a0c84e631955e21cb4ad1e23a5087f375","last_reissued_at":"2026-07-05T06:52:04.939915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:04.939915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alexander Dukakis, Benjamin Tan, Dimitris G. Angelakis, Ioannis D. Leonidas","submitted_at":"2023-06-14T13:44:35Z","abstract_excerpt":"The vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables, to evaluate the effectiveness of NISQ devices when applied to industry relevant optimization problems. We apply a quantum variational approach to a testbed of multiple VRPTW instances ranging from 11 to 3964 routes. These intances were formulated as quadratic unconstrained binary optimization (QUBO) problems based on realistic shipping scenarios. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.08507","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.08507/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2306.08507","created_at":"2026-07-05T06:52:04.939986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.08507v2","created_at":"2026-07-05T06:52:04.939986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.08507","created_at":"2026-07-05T06:52:04.939986+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMMY5KLDLMY5","created_at":"2026-07-05T06:52:04.939986+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMMY5KLDLMY5GOYU","created_at":"2026-07-05T06:52:04.939986+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMMY5KLD","created_at":"2026-07-05T06:52:04.939986+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07550","citing_title":"RL-Guided Quantum-ALNS for Constrained VRP","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02671","citing_title":"Quantum optimisation in cities: Limitations and prospects of urban transport systems","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20321","citing_title":"Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem","ref_index":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI","json":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI.json","graph_json":"https://pith.science/api/pith-number/TMMY5KLDLMY5GOYUNZ5ADPCPRI/graph.json","events_json":"https://pith.science/api/pith-number/TMMY5KLDLMY5GOYUNZ5ADPCPRI/events.json","paper":"https://pith.science/paper/TMMY5KLD"},"agent_actions":{"view_html":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI","download_json":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI.json","view_paper":"https://pith.science/paper/TMMY5KLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.08507&json=true","fetch_graph":"https://pith.science/api/pith-number/TMMY5KLDLMY5GOYUNZ5ADPCPRI/graph.json","fetch_events":"https://pith.science/api/pith-number/TMMY5KLDLMY5GOYUNZ5ADPCPRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI/action/storage_attestation","attest_author":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI/action/author_attestation","sign_citation":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI/action/citation_signature","submit_replication":"https://pith.science/pith/TMMY5KLDLMY5GOYUNZ5ADPCPRI/action/replication_record"}},"created_at":"2026-07-05T06:52:04.939986+00:00","updated_at":"2026-07-05T06:52:04.939986+00:00"}