{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZNT5I46UN4GTFJVL3BGBVMZJFM","short_pith_number":"pith:ZNT5I46U","schema_version":"1.0","canonical_sha256":"cb67d473d46f0d32a6abd84c1ab3292b18ca267ba10374749c966bf874635eae","source":{"kind":"arxiv","id":"2308.08050","version":1},"attestation_state":"computed","paper":{"title":"Exploring the Potential of Qutrits for Quantum Optimization of Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gabriel Bottrill, Mudit Pandey, Olivia Di Matteo","submitted_at":"2023-08-15T21:31:37Z","abstract_excerpt":"Recent hardware demonstrations and advances in circuit compilation have made quantum computing with higher-dimensional systems (qudits) on near-term devices an attractive possibility. Some problems have more natural or optimal encodings using qudits over qubits. We explore this potential by formulating graph 3-coloring, a well-known and difficult problem with practical applications, using qutrits, and solve it using the quantum approximate optimization algorithm (QAOA). Qutrit-based cost and mixer Hamiltonians are constructed along with appropriate quantum circuits using qutrit gates. We run n"},"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":"2308.08050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-08-15T21:31:37Z","cross_cats_sorted":[],"title_canon_sha256":"fd6bfa584066b3325667f0c0dfff262d7ae722c87eaa41fe93439494bd099e13","abstract_canon_sha256":"0c56814b598207c76c608cbd5b21fd5d69f4ca36866f42ccbae73a919b4cc622"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:53.575647Z","signature_b64":"8Hzqf2uLvwyw4tFKN6Qpnr3lsZuyYrQXkKmkPZ0kTNVsPuvuG9DGHfpS6ByICQkxAp4sge26byKeLadxR5RoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb67d473d46f0d32a6abd84c1ab3292b18ca267ba10374749c966bf874635eae","last_reissued_at":"2026-07-05T06:41:53.575159Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:53.575159Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the Potential of Qutrits for Quantum Optimization of Graph Coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Gabriel Bottrill, Mudit Pandey, Olivia Di Matteo","submitted_at":"2023-08-15T21:31:37Z","abstract_excerpt":"Recent hardware demonstrations and advances in circuit compilation have made quantum computing with higher-dimensional systems (qudits) on near-term devices an attractive possibility. Some problems have more natural or optimal encodings using qudits over qubits. We explore this potential by formulating graph 3-coloring, a well-known and difficult problem with practical applications, using qutrits, and solve it using the quantum approximate optimization algorithm (QAOA). Qutrit-based cost and mixer Hamiltonians are constructed along with appropriate quantum circuits using qutrit gates. We run n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.08050","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.08050/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":"2308.08050","created_at":"2026-07-05T06:41:53.575216+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.08050v1","created_at":"2026-07-05T06:41:53.575216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.08050","created_at":"2026-07-05T06:41:53.575216+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNT5I46UN4GT","created_at":"2026-07-05T06:41:53.575216+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNT5I46UN4GTFJVL","created_at":"2026-07-05T06:41:53.575216+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNT5I46U","created_at":"2026-07-05T06:41:53.575216+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10945","citing_title":"Non-Abelian dynamics on a cube: improving quantum compilation through qudit-based simulations","ref_index":85,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM","json":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM.json","graph_json":"https://pith.science/api/pith-number/ZNT5I46UN4GTFJVL3BGBVMZJFM/graph.json","events_json":"https://pith.science/api/pith-number/ZNT5I46UN4GTFJVL3BGBVMZJFM/events.json","paper":"https://pith.science/paper/ZNT5I46U"},"agent_actions":{"view_html":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM","download_json":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM.json","view_paper":"https://pith.science/paper/ZNT5I46U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.08050&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNT5I46UN4GTFJVL3BGBVMZJFM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNT5I46UN4GTFJVL3BGBVMZJFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM/action/storage_attestation","attest_author":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM/action/author_attestation","sign_citation":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM/action/citation_signature","submit_replication":"https://pith.science/pith/ZNT5I46UN4GTFJVL3BGBVMZJFM/action/replication_record"}},"created_at":"2026-07-05T06:41:53.575216+00:00","updated_at":"2026-07-05T06:41:53.575216+00:00"}