{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2RVEODDYT6ZNF6TOWNAZC4JKOM","short_pith_number":"pith:2RVEODDY","schema_version":"1.0","canonical_sha256":"d46a470c789fb2d2fa6eb34191712a732b9cced7098a7bfc93339d2118ff9ca4","source":{"kind":"arxiv","id":"2411.08824","version":1},"attestation_state":"computed","paper":{"title":"Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Dani\\\"elle Schuman, Jonas N\\\"u{\\ss}lein, Jonas Stein, Leo S\\\"unkel, Sebastian Feld, Tobias Rohe","submitted_at":"2024-11-13T18:04:01Z","abstract_excerpt":"QAOA is a quantum algorithm for solving combinatorial optimization problems. It is capable of searching for the minimizing solution vector $x$ of a QUBO problem $x^TQx$. The number of two-qubit CNOT gates in the QAOA circuit scales linearly in the number of non-zero couplings of $Q$ and the depth of the circuit scales accordingly. Since CNOT operations have high error rates it is crucial to develop algorithms for reducing their number. We, therefore, present the concept of \\textit{semi-symmetries} in QUBO matrices and an algorithm for identifying and factoring them out into ancilla qubits. \\te"},"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":"2411.08824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-13T18:04:01Z","cross_cats_sorted":[],"title_canon_sha256":"c851290dacb8275362509b9812d9cfb840ea422eb0e97a9d612a8d8671ecb514","abstract_canon_sha256":"c0039060cbaf7d60ca5bc16a7ebb263f976ee9edd5de09ecf6d0dd69417b7e6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:03.036581Z","signature_b64":"3Q+NXj1Icz3Oc3fFgeNx26pCOcNtZn0X8hzaVnI8ige+LctKDdh247l5+gVXdiq6i4+4BFQYQnvI9u6cUPmMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d46a470c789fb2d2fa6eb34191712a732b9cced7098a7bfc93339d2118ff9ca4","last_reissued_at":"2026-07-05T09:35:03.036141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:03.036141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claudia Linnhoff-Popien, Dani\\\"elle Schuman, Jonas N\\\"u{\\ss}lein, Jonas Stein, Leo S\\\"unkel, Sebastian Feld, Tobias Rohe","submitted_at":"2024-11-13T18:04:01Z","abstract_excerpt":"QAOA is a quantum algorithm for solving combinatorial optimization problems. It is capable of searching for the minimizing solution vector $x$ of a QUBO problem $x^TQx$. The number of two-qubit CNOT gates in the QAOA circuit scales linearly in the number of non-zero couplings of $Q$ and the depth of the circuit scales accordingly. Since CNOT operations have high error rates it is crucial to develop algorithms for reducing their number. We, therefore, present the concept of \\textit{semi-symmetries} in QUBO matrices and an algorithm for identifying and factoring them out into ancilla qubits. \\te"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08824","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/2411.08824/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":"2411.08824","created_at":"2026-07-05T09:35:03.036208+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08824v1","created_at":"2026-07-05T09:35:03.036208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08824","created_at":"2026-07-05T09:35:03.036208+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RVEODDYT6ZN","created_at":"2026-07-05T09:35:03.036208+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RVEODDYT6ZNF6TO","created_at":"2026-07-05T09:35:03.036208+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RVEODDY","created_at":"2026-07-05T09:35:03.036208+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/2RVEODDYT6ZNF6TOWNAZC4JKOM","json":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM.json","graph_json":"https://pith.science/api/pith-number/2RVEODDYT6ZNF6TOWNAZC4JKOM/graph.json","events_json":"https://pith.science/api/pith-number/2RVEODDYT6ZNF6TOWNAZC4JKOM/events.json","paper":"https://pith.science/paper/2RVEODDY"},"agent_actions":{"view_html":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM","download_json":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM.json","view_paper":"https://pith.science/paper/2RVEODDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08824&json=true","fetch_graph":"https://pith.science/api/pith-number/2RVEODDYT6ZNF6TOWNAZC4JKOM/graph.json","fetch_events":"https://pith.science/api/pith-number/2RVEODDYT6ZNF6TOWNAZC4JKOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM/action/storage_attestation","attest_author":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM/action/author_attestation","sign_citation":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM/action/citation_signature","submit_replication":"https://pith.science/pith/2RVEODDYT6ZNF6TOWNAZC4JKOM/action/replication_record"}},"created_at":"2026-07-05T09:35:03.036208+00:00","updated_at":"2026-07-05T09:35:03.036208+00:00"}