{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FWQLCTH6H4CAIHFMVPBOXCJWZR","short_pith_number":"pith:FWQLCTH6","schema_version":"1.0","canonical_sha256":"2da0b14cfe3f04041cacabc2eb8936cc7770121572f0f0460435c598396f4947","source":{"kind":"arxiv","id":"2402.05874","version":3},"attestation_state":"computed","paper":{"title":"Complexity of graph-state preparation by Clifford circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ryuhei Mori, Soh Kumabe, Yusei Yoshimura","submitted_at":"2024-02-08T18:08:09Z","abstract_excerpt":"In this work, we study the complexity of graph-state preparation. We consider general quantum algorithms consisting of Clifford operations acting on at most two qubits for graph-state preparations. We define the CZ-complexity of a graph state $|G\\rangle$ as the minimum number of two-qubit Clifford operations (excluding single-qubit Clifford operations) for generating $|G\\rangle$ from a trivial state $|0\\rangle^{\\otimes n}$. We first prove that a graph state $|G\\rangle$ is generated by at most $t$ two-qubit Clifford operations if and only if $|G\\rangle$ is generated by at most $t$ controlled-Z "},"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":"2402.05874","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-08T18:08:09Z","cross_cats_sorted":[],"title_canon_sha256":"0eb0d83b3d1ecd1044bbe1fd7f9fcaf1a7bac6964666ed4b3a5a0d7c79905062","abstract_canon_sha256":"3b90004fd6d55a6973b4c02b5b52aa51dfeb4d3d1a56e1293f1f468e4b8dea6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:32.132479Z","signature_b64":"x6REq0p0rhal5b7dZW4orEbTmQMvbt6MkmbPK0oWVILYj+VLkFh62Nx04XI6LmDgjmeYU8zFKdrBs0qd0U8sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2da0b14cfe3f04041cacabc2eb8936cc7770121572f0f0460435c598396f4947","last_reissued_at":"2026-07-05T11:05:32.132044Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:32.132044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of graph-state preparation by Clifford circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ryuhei Mori, Soh Kumabe, Yusei Yoshimura","submitted_at":"2024-02-08T18:08:09Z","abstract_excerpt":"In this work, we study the complexity of graph-state preparation. We consider general quantum algorithms consisting of Clifford operations acting on at most two qubits for graph-state preparations. We define the CZ-complexity of a graph state $|G\\rangle$ as the minimum number of two-qubit Clifford operations (excluding single-qubit Clifford operations) for generating $|G\\rangle$ from a trivial state $|0\\rangle^{\\otimes n}$. We first prove that a graph state $|G\\rangle$ is generated by at most $t$ two-qubit Clifford operations if and only if $|G\\rangle$ is generated by at most $t$ controlled-Z "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05874","kind":"arxiv","version":3},"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/2402.05874/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":"2402.05874","created_at":"2026-07-05T11:05:32.132098+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.05874v3","created_at":"2026-07-05T11:05:32.132098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05874","created_at":"2026-07-05T11:05:32.132098+00:00"},{"alias_kind":"pith_short_12","alias_value":"FWQLCTH6H4CA","created_at":"2026-07-05T11:05:32.132098+00:00"},{"alias_kind":"pith_short_16","alias_value":"FWQLCTH6H4CAIHFM","created_at":"2026-07-05T11:05:32.132098+00:00"},{"alias_kind":"pith_short_8","alias_value":"FWQLCTH6","created_at":"2026-07-05T11:05:32.132098+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.09785","citing_title":"Biclique decompositions from Welzl orders","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06792","citing_title":"Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations","ref_index":56,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06792","citing_title":"Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR","json":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR.json","graph_json":"https://pith.science/api/pith-number/FWQLCTH6H4CAIHFMVPBOXCJWZR/graph.json","events_json":"https://pith.science/api/pith-number/FWQLCTH6H4CAIHFMVPBOXCJWZR/events.json","paper":"https://pith.science/paper/FWQLCTH6"},"agent_actions":{"view_html":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR","download_json":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR.json","view_paper":"https://pith.science/paper/FWQLCTH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.05874&json=true","fetch_graph":"https://pith.science/api/pith-number/FWQLCTH6H4CAIHFMVPBOXCJWZR/graph.json","fetch_events":"https://pith.science/api/pith-number/FWQLCTH6H4CAIHFMVPBOXCJWZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/action/storage_attestation","attest_author":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/action/author_attestation","sign_citation":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/action/citation_signature","submit_replication":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/action/replication_record"}},"created_at":"2026-07-05T11:05:32.132098+00:00","updated_at":"2026-07-05T11:05:32.132098+00:00"}