{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LOGLEKPOSB57WVU65ELWZBKHV7","short_pith_number":"pith:LOGLEKPO","schema_version":"1.0","canonical_sha256":"5b8cb229ee907bfb569ee9176c8547aff54204b85cb4e49abe628a296b715cd3","source":{"kind":"arxiv","id":"2405.07129","version":3},"attestation_state":"computed","paper":{"title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gordon Cui, Hideyuki Kawashima, Kazuhiro Saito, Rei Sato, Shohei Watabe, Tetsuro Nikuni","submitted_at":"2024-05-12T01:44:19Z","abstract_excerpt":"Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state -- an equal superposition of all feasible solutions satisfying the problem's constraints -- is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solu"},"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":"2405.07129","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-12T01:44:19Z","cross_cats_sorted":[],"title_canon_sha256":"aa00431a197020af227dbf3a0091ce92ee3750c2b3128689384156179b3687c2","abstract_canon_sha256":"f7ee42d1a85876fa3dfa5ad14457cac846e81f4f8184375f603db0ef81ddc051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:17.146257Z","signature_b64":"kxNeD1G+oIkv1ZOiytpTjYsuv/CRgkTeNmTlTYlBzzq70F2/2maQ6ADAwiZq37UkrXQBHGV4yXpXIm/L69VhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b8cb229ee907bfb569ee9176c8547aff54204b85cb4e49abe628a296b715cd3","last_reissued_at":"2026-07-05T10:29:17.145447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:17.145447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gordon Cui, Hideyuki Kawashima, Kazuhiro Saito, Rei Sato, Shohei Watabe, Tetsuro Nikuni","submitted_at":"2024-05-12T01:44:19Z","abstract_excerpt":"Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state -- an equal superposition of all feasible solutions satisfying the problem's constraints -- is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07129","kind":"arxiv","version":3},"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/2405.07129/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":"2405.07129","created_at":"2026-07-05T10:29:17.145538+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07129v3","created_at":"2026-07-05T10:29:17.145538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07129","created_at":"2026-07-05T10:29:17.145538+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOGLEKPOSB57","created_at":"2026-07-05T10:29:17.145538+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOGLEKPOSB57WVU6","created_at":"2026-07-05T10:29:17.145538+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOGLEKPO","created_at":"2026-07-05T10:29:17.145538+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08853","citing_title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7","json":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7.json","graph_json":"https://pith.science/api/pith-number/LOGLEKPOSB57WVU65ELWZBKHV7/graph.json","events_json":"https://pith.science/api/pith-number/LOGLEKPOSB57WVU65ELWZBKHV7/events.json","paper":"https://pith.science/paper/LOGLEKPO"},"agent_actions":{"view_html":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7","download_json":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7.json","view_paper":"https://pith.science/paper/LOGLEKPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07129&json=true","fetch_graph":"https://pith.science/api/pith-number/LOGLEKPOSB57WVU65ELWZBKHV7/graph.json","fetch_events":"https://pith.science/api/pith-number/LOGLEKPOSB57WVU65ELWZBKHV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/action/storage_attestation","attest_author":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/action/author_attestation","sign_citation":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/action/citation_signature","submit_replication":"https://pith.science/pith/LOGLEKPOSB57WVU65ELWZBKHV7/action/replication_record"}},"created_at":"2026-07-05T10:29:17.145538+00:00","updated_at":"2026-07-05T10:29:17.145538+00:00"}