{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:65EQFCZECXHAAQDNOU66FAKHVO","short_pith_number":"pith:65EQFCZE","schema_version":"1.0","canonical_sha256":"f749028b2415ce00406d753de28147ab92cdb4ab531e99ed2915d99c99b507d9","source":{"kind":"arxiv","id":"2508.05883","version":1},"attestation_state":"computed","paper":{"title":"MPS-JuliQAOA: User-friendly, Scalable MPS-based Simulation for Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.SE"],"primary_cat":"quant-ph","authors_text":"John Golden, Reuben Tate, Sean Feeney, Stephan Eidenbenz","submitted_at":"2025-08-07T22:25:51Z","abstract_excerpt":"We present the MPS-JuliQAOA simulator, a user-friendly, open-source tool to simulate the Quantum Approximate Optimization Algorithm (QAOA) of any optimization problem that can be expressed as diagonal Hamiltonian. By leveraging Julia-language constructs and the ITensor package to implement a Matrix Product State (MPS) approach to simulating QAOA, MPS-Juli-QAOA effortlessly scales to 512 qubits and 20 simulation rounds on the standard de-facto benchmark 3-regular MaxCut QAOA problem. MPS-JuliQAOA also has built-in parameter finding capabilities, which is a crucial performance aspect of QAOA. 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":"2508.05883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-08-07T22:25:51Z","cross_cats_sorted":["cs.ET","cs.SE"],"title_canon_sha256":"97252e764d6b4e5347b58648dedf4dd1ba5bfe07c95d637bf6fa3e0701736fd1","abstract_canon_sha256":"a5a0fb9afd51550c1f498c2f53e9cd337d27f51186939732e1976f2c429cda45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:44.960567Z","signature_b64":"uo0jL/0Vj/ldm7gQlhpz70oEjHKmrZZASjyWIWxO0LSsXNdsei0nkZwUkx2K8nXe/YeGXFcCO/XZsvKXzO4sCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f749028b2415ce00406d753de28147ab92cdb4ab531e99ed2915d99c99b507d9","last_reissued_at":"2026-07-05T11:50:44.959875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:44.959875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MPS-JuliQAOA: User-friendly, Scalable MPS-based Simulation for Quantum Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET","cs.SE"],"primary_cat":"quant-ph","authors_text":"John Golden, Reuben Tate, Sean Feeney, Stephan Eidenbenz","submitted_at":"2025-08-07T22:25:51Z","abstract_excerpt":"We present the MPS-JuliQAOA simulator, a user-friendly, open-source tool to simulate the Quantum Approximate Optimization Algorithm (QAOA) of any optimization problem that can be expressed as diagonal Hamiltonian. By leveraging Julia-language constructs and the ITensor package to implement a Matrix Product State (MPS) approach to simulating QAOA, MPS-Juli-QAOA effortlessly scales to 512 qubits and 20 simulation rounds on the standard de-facto benchmark 3-regular MaxCut QAOA problem. MPS-JuliQAOA also has built-in parameter finding capabilities, which is a crucial performance aspect of QAOA. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05883","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/2508.05883/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":"2508.05883","created_at":"2026-07-05T11:50:44.959948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05883v1","created_at":"2026-07-05T11:50:44.959948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05883","created_at":"2026-07-05T11:50:44.959948+00:00"},{"alias_kind":"pith_short_12","alias_value":"65EQFCZECXHA","created_at":"2026-07-05T11:50:44.959948+00:00"},{"alias_kind":"pith_short_16","alias_value":"65EQFCZECXHAAQDN","created_at":"2026-07-05T11:50:44.959948+00:00"},{"alias_kind":"pith_short_8","alias_value":"65EQFCZE","created_at":"2026-07-05T11:50:44.959948+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":55,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28866","citing_title":"Quantum Variational Approaches to the Maximum Independent Set Problem at Utility Scale","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO","json":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO.json","graph_json":"https://pith.science/api/pith-number/65EQFCZECXHAAQDNOU66FAKHVO/graph.json","events_json":"https://pith.science/api/pith-number/65EQFCZECXHAAQDNOU66FAKHVO/events.json","paper":"https://pith.science/paper/65EQFCZE"},"agent_actions":{"view_html":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO","download_json":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO.json","view_paper":"https://pith.science/paper/65EQFCZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05883&json=true","fetch_graph":"https://pith.science/api/pith-number/65EQFCZECXHAAQDNOU66FAKHVO/graph.json","fetch_events":"https://pith.science/api/pith-number/65EQFCZECXHAAQDNOU66FAKHVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO/action/storage_attestation","attest_author":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO/action/author_attestation","sign_citation":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO/action/citation_signature","submit_replication":"https://pith.science/pith/65EQFCZECXHAAQDNOU66FAKHVO/action/replication_record"}},"created_at":"2026-07-05T11:50:44.959948+00:00","updated_at":"2026-07-05T11:50:44.959948+00:00"}