{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JGWQCILT4NWHJOSJTQRMPOJYMT","short_pith_number":"pith:JGWQCILT","schema_version":"1.0","canonical_sha256":"49ad012173e36c74ba499c22c7b93864e5f707295129cd05e7259594612f0864","source":{"kind":"arxiv","id":"2405.03173","version":2},"attestation_state":"computed","paper":{"title":"Performance Upper Bound of Grover-Mixer Quantum Alternating Operator Ansatz","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dongsheng Cai, Jiahua Xu, Ningyi Xie, Nobuyoshi Asai, Tiejin Chen, Xinwei Lee, Yoshiyuki Saito","submitted_at":"2024-05-06T05:47:27Z","abstract_excerpt":"The Quantum Alternating Operator Ansatz (QAOA) represents a branch of quantum algorithms for solving combinatorial optimization problems. A specific variant, the Grover-Mixer Quantum Alternating Operator Ansatz (GM-QAOA), ensures uniform amplitude across states that share equivalent objective values. This property makes the algorithm independent of the problem structure, focusing instead on the distribution of objective values within the problem. In this work, we prove the probability upper bound for measuring a computational basis state from a GM-QAOA circuit with a given depth, which is a cr"},"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.03173","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-06T05:47:27Z","cross_cats_sorted":[],"title_canon_sha256":"801d2e9da0df4ae6ecc062f1d6721f04839954b81897466071c9b967e187a0fd","abstract_canon_sha256":"ff53fe2fdbab7907dd13182f35615c5883eda464a47e91499003ef5bbd1164ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:40.223058Z","signature_b64":"QQZccqEgbJb5XW7n44JgrGv5YicV5V7YLMpU1m/dZIVQbHZb4JT74t+5FtUQZaHjFaIihkKCilLLEVNs1zStBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49ad012173e36c74ba499c22c7b93864e5f707295129cd05e7259594612f0864","last_reissued_at":"2026-07-05T08:22:40.222659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:40.222659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Upper Bound of Grover-Mixer Quantum Alternating Operator Ansatz","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dongsheng Cai, Jiahua Xu, Ningyi Xie, Nobuyoshi Asai, Tiejin Chen, Xinwei Lee, Yoshiyuki Saito","submitted_at":"2024-05-06T05:47:27Z","abstract_excerpt":"The Quantum Alternating Operator Ansatz (QAOA) represents a branch of quantum algorithms for solving combinatorial optimization problems. A specific variant, the Grover-Mixer Quantum Alternating Operator Ansatz (GM-QAOA), ensures uniform amplitude across states that share equivalent objective values. This property makes the algorithm independent of the problem structure, focusing instead on the distribution of objective values within the problem. In this work, we prove the probability upper bound for measuring a computational basis state from a GM-QAOA circuit with a given depth, which is a cr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03173","kind":"arxiv","version":2},"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.03173/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.03173","created_at":"2026-07-05T08:22:40.222715+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.03173v2","created_at":"2026-07-05T08:22:40.222715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03173","created_at":"2026-07-05T08:22:40.222715+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGWQCILT4NWH","created_at":"2026-07-05T08:22:40.222715+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGWQCILT4NWHJOSJ","created_at":"2026-07-05T08:22:40.222715+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGWQCILT","created_at":"2026-07-05T08:22:40.222715+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/JGWQCILT4NWHJOSJTQRMPOJYMT","json":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT.json","graph_json":"https://pith.science/api/pith-number/JGWQCILT4NWHJOSJTQRMPOJYMT/graph.json","events_json":"https://pith.science/api/pith-number/JGWQCILT4NWHJOSJTQRMPOJYMT/events.json","paper":"https://pith.science/paper/JGWQCILT"},"agent_actions":{"view_html":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT","download_json":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT.json","view_paper":"https://pith.science/paper/JGWQCILT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.03173&json=true","fetch_graph":"https://pith.science/api/pith-number/JGWQCILT4NWHJOSJTQRMPOJYMT/graph.json","fetch_events":"https://pith.science/api/pith-number/JGWQCILT4NWHJOSJTQRMPOJYMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT/action/storage_attestation","attest_author":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT/action/author_attestation","sign_citation":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT/action/citation_signature","submit_replication":"https://pith.science/pith/JGWQCILT4NWHJOSJTQRMPOJYMT/action/replication_record"}},"created_at":"2026-07-05T08:22:40.222715+00:00","updated_at":"2026-07-05T08:22:40.222715+00:00"}