{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FWQLCTH6H4CAIHFMVPBOXCJWZR","short_pith_number":"pith:FWQLCTH6","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"},"canonical_sha256":"2da0b14cfe3f04041cacabc2eb8936cc7770121572f0f0460435c598396f4947","source":{"kind":"arxiv","id":"2402.05874","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.05874","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2402.05874v3","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05874","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"FWQLCTH6H4CA","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"FWQLCTH6H4CAIHFM","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"FWQLCTH6","created_at":"2026-07-05T11:05:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FWQLCTH6H4CAIHFMVPBOXCJWZR","target":"record","payload":{"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"},"canonical_sha256":"2da0b14cfe3f04041cacabc2eb8936cc7770121572f0f0460435c598396f4947","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"},"source_kind":"arxiv","source_id":"2402.05874","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SY8W5GGdBL0GPX/vLJV9Z7prba4ukUMMR3LZMKBwnClsKWBN/D70qa2bxV4wYXGKV7QTfP7DcOkobNx47vJIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:36:08.025068Z"},"content_sha256":"a2284bb170eea1dff3334aa6e939ef57c7c22779d860b0c467e21d087678ea6b","schema_version":"1.0","event_id":"sha256:a2284bb170eea1dff3334aa6e939ef57c7c22779d860b0c467e21d087678ea6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FWQLCTH6H4CAIHFMVPBOXCJWZR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:05:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TnafhZb+bSMVmSxRZiCjlF7ogCn6BQQgrjU9FMf4zprzh+Ajheo2pt3cM9HEPbmyBSwmISpyDXmwShJGHoCGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:36:08.032188Z"},"content_sha256":"74542ab0810039a0814529105550abc85276fe00d00f7bd0a7d5944b6c3bdb1b","schema_version":"1.0","event_id":"sha256:74542ab0810039a0814529105550abc85276fe00d00f7bd0a7d5944b6c3bdb1b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/bundle.json","state_url":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T10:36:08Z","links":{"resolver":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR","bundle":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/bundle.json","state":"https://pith.science/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWQLCTH6H4CAIHFMVPBOXCJWZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FWQLCTH6H4CAIHFMVPBOXCJWZR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3b90004fd6d55a6973b4c02b5b52aa51dfeb4d3d1a56e1293f1f468e4b8dea6d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-08T18:08:09Z","title_canon_sha256":"0eb0d83b3d1ecd1044bbe1fd7f9fcaf1a7bac6964666ed4b3a5a0d7c79905062"},"schema_version":"1.0","source":{"id":"2402.05874","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.05874","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"arxiv_version","alias_value":"2402.05874v3","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.05874","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"pith_short_12","alias_value":"FWQLCTH6H4CA","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"pith_short_16","alias_value":"FWQLCTH6H4CAIHFM","created_at":"2026-07-05T11:05:32Z"},{"alias_kind":"pith_short_8","alias_value":"FWQLCTH6","created_at":"2026-07-05T11:05:32Z"}],"graph_snapshots":[{"event_id":"sha256:74542ab0810039a0814529105550abc85276fe00d00f7bd0a7d5944b6c3bdb1b","target":"graph","created_at":"2026-07-05T11:05:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.05874/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Ryuhei Mori, Soh Kumabe, Yusei Yoshimura","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-08T18:08:09Z","title":"Complexity of graph-state preparation by Clifford circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.05874","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a2284bb170eea1dff3334aa6e939ef57c7c22779d860b0c467e21d087678ea6b","target":"record","created_at":"2026-07-05T11:05:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3b90004fd6d55a6973b4c02b5b52aa51dfeb4d3d1a56e1293f1f468e4b8dea6d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-02-08T18:08:09Z","title_canon_sha256":"0eb0d83b3d1ecd1044bbe1fd7f9fcaf1a7bac6964666ed4b3a5a0d7c79905062"},"schema_version":"1.0","source":{"id":"2402.05874","kind":"arxiv","version":3}},"canonical_sha256":"2da0b14cfe3f04041cacabc2eb8936cc7770121572f0f0460435c598396f4947","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2da0b14cfe3f04041cacabc2eb8936cc7770121572f0f0460435c598396f4947","first_computed_at":"2026-07-05T11:05:32.132044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:32.132044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x6REq0p0rhal5b7dZW4orEbTmQMvbt6MkmbPK0oWVILYj+VLkFh62Nx04XI6LmDgjmeYU8zFKdrBs0qd0U8sCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:32.132479Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.05874","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2284bb170eea1dff3334aa6e939ef57c7c22779d860b0c467e21d087678ea6b","sha256:74542ab0810039a0814529105550abc85276fe00d00f7bd0a7d5944b6c3bdb1b"],"state_sha256":"fec7c9991cb816da61e4e8a38d5b15a4b1a8c69b29bad25c37244fedc077d74f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wmp/HF4q3iMBjszhxNGJIcFQ+RR/8TYDCfaTETbtlU8cHtZKVhoBQfvba0UH+hbginPS+8Ur52q4XVjCIWm3DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:36:08.053105Z","bundle_sha256":"85fce9f203f00369a624ab515e209ac74dcdf37f21d347557c64e5c17c38b117"}}