{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4KSPCUQ2WHL4KKLZHXOIFMU76A","short_pith_number":"pith:4KSPCUQ2","schema_version":"1.0","canonical_sha256":"e2a4f1521ab1d7c529793ddc82b29ff01ff12726fb3b0c892815286a75d27a9c","source":{"kind":"arxiv","id":"2306.17083","version":9},"attestation_state":"computed","paper":{"title":"LX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Franz G. Fuchs, Ruben Pariente Bassa","submitted_at":"2023-06-29T16:36:07Z","abstract_excerpt":"We present a novel formalism to both understand and construct mixers that preserve a given subspace. The method connects and utilizes the stabilizer formalism that is used in error correcting codes. This can be useful in the setting when the quantum approximate optimization algorithm (QAOA), a popular meta-heuristic for solving combinatorial optimization problems, is applied in the setting where the constraints of the problem lead to a feasible subspace that is large but easy to specify. The proposed method gives a systematic way to construct mixers that are resource efficient in the number of"},"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":"2306.17083","kind":"arxiv","version":9},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-29T16:36:07Z","cross_cats_sorted":[],"title_canon_sha256":"71839da6995c896f300c3fd8e7045b2bd0bfd68aedfe019e90e41034c9ec7ba0","abstract_canon_sha256":"d3b135d6545af837e0cce34169f8f7e29860c8224f54cbfe4dd52af95278c14c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:22.775446Z","signature_b64":"qKTZy/FefEddioqpeOhvIuwEoO3Pk0OGqejJixbChS39sqb6K2N+p2dfNaFU/S2xHt1ZRdvaVXSMScnryFPJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a4f1521ab1d7c529793ddc82b29ff01ff12726fb3b0c892815286a75d27a9c","last_reissued_at":"2026-07-05T09:43:22.774879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:22.774879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LX-mixers for QAOA: Optimal mixers restricted to subspaces and the stabilizer formalism","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Franz G. Fuchs, Ruben Pariente Bassa","submitted_at":"2023-06-29T16:36:07Z","abstract_excerpt":"We present a novel formalism to both understand and construct mixers that preserve a given subspace. The method connects and utilizes the stabilizer formalism that is used in error correcting codes. This can be useful in the setting when the quantum approximate optimization algorithm (QAOA), a popular meta-heuristic for solving combinatorial optimization problems, is applied in the setting where the constraints of the problem lead to a feasible subspace that is large but easy to specify. The proposed method gives a systematic way to construct mixers that are resource efficient in the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17083","kind":"arxiv","version":9},"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/2306.17083/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":"2306.17083","created_at":"2026-07-05T09:43:22.774944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17083v9","created_at":"2026-07-05T09:43:22.774944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17083","created_at":"2026-07-05T09:43:22.774944+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KSPCUQ2WHL4","created_at":"2026-07-05T09:43:22.774944+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KSPCUQ2WHL4KKLZ","created_at":"2026-07-05T09:43:22.774944+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KSPCUQ2","created_at":"2026-07-05T09:43:22.774944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.09745","citing_title":"Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants","ref_index":87,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A","json":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A.json","graph_json":"https://pith.science/api/pith-number/4KSPCUQ2WHL4KKLZHXOIFMU76A/graph.json","events_json":"https://pith.science/api/pith-number/4KSPCUQ2WHL4KKLZHXOIFMU76A/events.json","paper":"https://pith.science/paper/4KSPCUQ2"},"agent_actions":{"view_html":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A","download_json":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A.json","view_paper":"https://pith.science/paper/4KSPCUQ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17083&json=true","fetch_graph":"https://pith.science/api/pith-number/4KSPCUQ2WHL4KKLZHXOIFMU76A/graph.json","fetch_events":"https://pith.science/api/pith-number/4KSPCUQ2WHL4KKLZHXOIFMU76A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A/action/storage_attestation","attest_author":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A/action/author_attestation","sign_citation":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A/action/citation_signature","submit_replication":"https://pith.science/pith/4KSPCUQ2WHL4KKLZHXOIFMU76A/action/replication_record"}},"created_at":"2026-07-05T09:43:22.774944+00:00","updated_at":"2026-07-05T09:43:22.774944+00:00"}