{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OR2MQFIWD7V3D37TEBOGQOIHJS","short_pith_number":"pith:OR2MQFIW","schema_version":"1.0","canonical_sha256":"7474c815161febb1eff3205c6839074cb28e27c85d82e5cfae58ea6382387b2b","source":{"kind":"arxiv","id":"1907.00529","version":1},"attestation_state":"computed","paper":{"title":"Exponential-time quantum algorithms for graph coloring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Kazuya Shimizu, Ryuhei Mori","submitted_at":"2019-07-01T03:35:48Z","abstract_excerpt":"The fastest known classical algorithm deciding the $k$-colorability of $n$-vertex graph requires running time $\\Omega(2^n)$ for $k\\ge 5$. In this work, we present an exponential-space quantum algorithm computing the chromatic number with running time $O(1.9140^n)$ using quantum random access memory (QRAM). Our approach is based on Ambainis et al's quantum dynamic programming with applications of Grover's search to branching algorithms. We also present a polynomial-space quantum algorithm not using QRAM for the graph $20$-coloring problem with running time $O(1.9575^n)$. In the polynomial-space"},"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":"1907.00529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-01T03:35:48Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"bb516e6aaad96f1b308d14245ee9229ce18afa980c2f666d768893b3d4c2c8e7","abstract_canon_sha256":"3b2300785c94e535c079b7188263e3daa50be08841527f8d03c1e5a0b3586fbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:51.320947Z","signature_b64":"B3cM3UEH3rKNkxdimBX9NOyGJ5spC0Ce97O8pbmCx4XoEDUTX+0kQvE1fnfb3QhOGHF0r1y4dB+JwOsoW2inDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7474c815161febb1eff3205c6839074cb28e27c85d82e5cfae58ea6382387b2b","last_reissued_at":"2026-05-17T23:41:51.320234Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:51.320234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential-time quantum algorithms for graph coloring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Kazuya Shimizu, Ryuhei Mori","submitted_at":"2019-07-01T03:35:48Z","abstract_excerpt":"The fastest known classical algorithm deciding the $k$-colorability of $n$-vertex graph requires running time $\\Omega(2^n)$ for $k\\ge 5$. In this work, we present an exponential-space quantum algorithm computing the chromatic number with running time $O(1.9140^n)$ using quantum random access memory (QRAM). Our approach is based on Ambainis et al's quantum dynamic programming with applications of Grover's search to branching algorithms. We also present a polynomial-space quantum algorithm not using QRAM for the graph $20$-coloring problem with running time $O(1.9575^n)$. In the polynomial-space"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.00529","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1907.00529","created_at":"2026-05-17T23:41:51.320351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.00529v1","created_at":"2026-05-17T23:41:51.320351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.00529","created_at":"2026-05-17T23:41:51.320351+00:00"},{"alias_kind":"pith_short_12","alias_value":"OR2MQFIWD7V3","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OR2MQFIWD7V3D37T","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OR2MQFIW","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS","json":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS.json","graph_json":"https://pith.science/api/pith-number/OR2MQFIWD7V3D37TEBOGQOIHJS/graph.json","events_json":"https://pith.science/api/pith-number/OR2MQFIWD7V3D37TEBOGQOIHJS/events.json","paper":"https://pith.science/paper/OR2MQFIW"},"agent_actions":{"view_html":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS","download_json":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS.json","view_paper":"https://pith.science/paper/OR2MQFIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.00529&json=true","fetch_graph":"https://pith.science/api/pith-number/OR2MQFIWD7V3D37TEBOGQOIHJS/graph.json","fetch_events":"https://pith.science/api/pith-number/OR2MQFIWD7V3D37TEBOGQOIHJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS/action/storage_attestation","attest_author":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS/action/author_attestation","sign_citation":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS/action/citation_signature","submit_replication":"https://pith.science/pith/OR2MQFIWD7V3D37TEBOGQOIHJS/action/replication_record"}},"created_at":"2026-05-17T23:41:51.320351+00:00","updated_at":"2026-05-17T23:41:51.320351+00:00"}