{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P5OJGUSI345SSOREYNXC5X4IRL","short_pith_number":"pith:P5OJGUSI","schema_version":"1.0","canonical_sha256":"7f5c935248df3b293a24c36e2edf888ad544f655a4bec62870f84ff626d74e60","source":{"kind":"arxiv","id":"2504.16755","version":1},"attestation_state":"computed","paper":{"title":"QAOA-PCA: Enhancing Efficiency in the Quantum Approximate Optimization Algorithm via Principal Component Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.LG","authors_text":"Owain Parry, Phil McMinn","submitted_at":"2025-04-23T14:27:31Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational algorithm for solving combinatorial optimization problems on near-term devices. However, as the number of layers in a QAOA circuit increases, which is correlated with the quality of the solution, the number of parameters to optimize grows linearly. This results in more iterations required by the classical optimizer, which results in an increasing computational burden as more circuit executions are needed. To mitigate this issue, we introduce QAOA-PCA, a novel reparameterization technique that employs Principal Com"},"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":"2504.16755","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-23T14:27:31Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"ece03ef6bf03dd56b32dff457fe8fc4bcff7f0f7d0d29c9d4b9563ea6ad086c4","abstract_canon_sha256":"9ce1002e3a02379d8fc5341b8bd2f5b3d3b3993e10a287884b07d90c10d91203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:04.082711Z","signature_b64":"KtF/A3zwuMIybZ/2yNPVasjNsYEXuSyI9aqlUiprdec4viuinOwXRBL6rF213YVom/lo+FVbRVVXX6/AbxTgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f5c935248df3b293a24c36e2edf888ad544f655a4bec62870f84ff626d74e60","last_reissued_at":"2026-07-05T10:53:04.082253Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:04.082253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QAOA-PCA: Enhancing Efficiency in the Quantum Approximate Optimization Algorithm via Principal Component Analysis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.LG","authors_text":"Owain Parry, Phil McMinn","submitted_at":"2025-04-23T14:27:31Z","abstract_excerpt":"The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational algorithm for solving combinatorial optimization problems on near-term devices. However, as the number of layers in a QAOA circuit increases, which is correlated with the quality of the solution, the number of parameters to optimize grows linearly. This results in more iterations required by the classical optimizer, which results in an increasing computational burden as more circuit executions are needed. To mitigate this issue, we introduce QAOA-PCA, a novel reparameterization technique that employs Principal Com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16755","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/2504.16755/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":"2504.16755","created_at":"2026-07-05T10:53:04.082309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16755v1","created_at":"2026-07-05T10:53:04.082309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16755","created_at":"2026-07-05T10:53:04.082309+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5OJGUSI345S","created_at":"2026-07-05T10:53:04.082309+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5OJGUSI345SSORE","created_at":"2026-07-05T10:53:04.082309+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5OJGUSI","created_at":"2026-07-05T10:53:04.082309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05311","citing_title":"Setting angles in quantum approximate optimization at utility-scale","ref_index":86,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL","json":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL.json","graph_json":"https://pith.science/api/pith-number/P5OJGUSI345SSOREYNXC5X4IRL/graph.json","events_json":"https://pith.science/api/pith-number/P5OJGUSI345SSOREYNXC5X4IRL/events.json","paper":"https://pith.science/paper/P5OJGUSI"},"agent_actions":{"view_html":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL","download_json":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL.json","view_paper":"https://pith.science/paper/P5OJGUSI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16755&json=true","fetch_graph":"https://pith.science/api/pith-number/P5OJGUSI345SSOREYNXC5X4IRL/graph.json","fetch_events":"https://pith.science/api/pith-number/P5OJGUSI345SSOREYNXC5X4IRL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL/action/storage_attestation","attest_author":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL/action/author_attestation","sign_citation":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL/action/citation_signature","submit_replication":"https://pith.science/pith/P5OJGUSI345SSOREYNXC5X4IRL/action/replication_record"}},"created_at":"2026-07-05T10:53:04.082309+00:00","updated_at":"2026-07-05T10:53:04.082309+00:00"}