{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T4O6J4ETD3OQBT2C6WQ4IJ2JD7","short_pith_number":"pith:T4O6J4ET","schema_version":"1.0","canonical_sha256":"9f1de4f0931edd00cf42f5a1c427491ff018657a69b9a0d0269996208b110f3f","source":{"kind":"arxiv","id":"2509.00170","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Illya V. Hicks, Saber Dinpazhouh","submitted_at":"2025-08-29T18:12:20Z","abstract_excerpt":"We study a cost Hamiltonian compilation problem for the quantum approximate optimization algorithm (QAOA) applied to the Max-Cut problem, focusing on trapped-ion quantum computers. Instead of standard compilation with CNOT and Rz gates, we employ global coupling operations and single-qubit bit flips. Prior work by Rajakumar et al. established that such a compilation is always possible.\n  Minimizing operational error requires short operation sequences. The problem reduces to a low-rank semi-discrete decomposition of the graph's adjacency matrix, where the minimum achievable rank, the graph coup"},"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":"2509.00170","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-29T18:12:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d4edd754f2ac0163481643d6e4e18b64176785a371b44b72f31ee084a3fa47bf","abstract_canon_sha256":"5d7eb785b27016cf4c9ec1b9e5cef3fda26f3812f6b389e9f7028f0a4da19a05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:10.622782Z","signature_b64":"lEgf59mh44h9e7v+FQtkJ/Rs1DBh8qruwVZ3tlGtgGrj0gh3YmbrZ1GccTMiLQ5RQE5REfV+htWqlZ5Cd6jnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f1de4f0931edd00cf42f5a1c427491ff018657a69b9a0d0269996208b110f3f","last_reissued_at":"2026-07-05T12:02:10.622252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:10.622252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Cost Hamiltonian Compilation for Max-Cut QAOA on Unweighted Graphs Using Global Controls and Qubit Bit Flips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Illya V. Hicks, Saber Dinpazhouh","submitted_at":"2025-08-29T18:12:20Z","abstract_excerpt":"We study a cost Hamiltonian compilation problem for the quantum approximate optimization algorithm (QAOA) applied to the Max-Cut problem, focusing on trapped-ion quantum computers. Instead of standard compilation with CNOT and Rz gates, we employ global coupling operations and single-qubit bit flips. Prior work by Rajakumar et al. established that such a compilation is always possible.\n  Minimizing operational error requires short operation sequences. The problem reduces to a low-rank semi-discrete decomposition of the graph's adjacency matrix, where the minimum achievable rank, the graph coup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.00170","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/2509.00170/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":"2509.00170","created_at":"2026-07-05T12:02:10.622325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.00170v1","created_at":"2026-07-05T12:02:10.622325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.00170","created_at":"2026-07-05T12:02:10.622325+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4O6J4ETD3OQ","created_at":"2026-07-05T12:02:10.622325+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4O6J4ETD3OQBT2C","created_at":"2026-07-05T12:02:10.622325+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4O6J4ET","created_at":"2026-07-05T12:02:10.622325+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/T4O6J4ETD3OQBT2C6WQ4IJ2JD7","json":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7.json","graph_json":"https://pith.science/api/pith-number/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/graph.json","events_json":"https://pith.science/api/pith-number/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/events.json","paper":"https://pith.science/paper/T4O6J4ET"},"agent_actions":{"view_html":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7","download_json":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7.json","view_paper":"https://pith.science/paper/T4O6J4ET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.00170&json=true","fetch_graph":"https://pith.science/api/pith-number/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/graph.json","fetch_events":"https://pith.science/api/pith-number/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/action/storage_attestation","attest_author":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/action/author_attestation","sign_citation":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/action/citation_signature","submit_replication":"https://pith.science/pith/T4O6J4ETD3OQBT2C6WQ4IJ2JD7/action/replication_record"}},"created_at":"2026-07-05T12:02:10.622325+00:00","updated_at":"2026-07-05T12:02:10.622325+00:00"}