{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UIVYAG5TE3DJC5Z6H5LU755EJB","short_pith_number":"pith:UIVYAG5T","schema_version":"1.0","canonical_sha256":"a22b801bb326c691773e3f574ff7a4486919d046fec0ae30e6d5c00dce12121a","source":{"kind":"arxiv","id":"1011.5464","version":2},"attestation_state":"computed","paper":{"title":"Optimal preparation of graph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adan Cabello, Antonio J. Lopez-Tarrida, Jose R. Portillo, Lars Eirik Danielsen","submitted_at":"2010-11-24T19:32:12Z","abstract_excerpt":"We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circui"},"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":"1011.5464","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-11-24T19:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"df254a81f274b6f101a9e8b32005fe57eece2390f4ee5afcaf89077b15e59561","abstract_canon_sha256":"7eecf3d418f3eccd5205731099fad596e591fdd6bf0eb674dbfce3283dd873b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.055205Z","signature_b64":"Fo3Yw9Rl6odqlm1zKE1VyxHbMB7aYEf0kDMI7236UVC6ijldNHQ0cmNdoYPum/RyY0gCPvGfSigDsdG10B8sCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a22b801bb326c691773e3f574ff7a4486919d046fec0ae30e6d5c00dce12121a","last_reissued_at":"2026-05-18T04:24:06.054567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.054567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal preparation of graph states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adan Cabello, Antonio J. Lopez-Tarrida, Jose R. Portillo, Lars Eirik Danielsen","submitted_at":"2010-11-24T19:32:12Z","abstract_excerpt":"We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the fact that any graph state belongs to an equivalence class under local Clifford operations. We extend up to 12 qubits the classification of graph states according to their entanglement properties, and identify each class using only a reduced set of invariants. For any state, we provide a circuit with both properties (a) and (b), if it does exist, or, if it does not, one circui"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5464","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1011.5464","created_at":"2026-05-18T04:24:06.054672+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5464v2","created_at":"2026-05-18T04:24:06.054672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5464","created_at":"2026-05-18T04:24:06.054672+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIVYAG5TE3DJ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIVYAG5TE3DJC5Z6","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIVYAG5T","created_at":"2026-05-18T12:26:15.391820+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/UIVYAG5TE3DJC5Z6H5LU755EJB","json":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB.json","graph_json":"https://pith.science/api/pith-number/UIVYAG5TE3DJC5Z6H5LU755EJB/graph.json","events_json":"https://pith.science/api/pith-number/UIVYAG5TE3DJC5Z6H5LU755EJB/events.json","paper":"https://pith.science/paper/UIVYAG5T"},"agent_actions":{"view_html":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB","download_json":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB.json","view_paper":"https://pith.science/paper/UIVYAG5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5464&json=true","fetch_graph":"https://pith.science/api/pith-number/UIVYAG5TE3DJC5Z6H5LU755EJB/graph.json","fetch_events":"https://pith.science/api/pith-number/UIVYAG5TE3DJC5Z6H5LU755EJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/action/storage_attestation","attest_author":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/action/author_attestation","sign_citation":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/action/citation_signature","submit_replication":"https://pith.science/pith/UIVYAG5TE3DJC5Z6H5LU755EJB/action/replication_record"}},"created_at":"2026-05-18T04:24:06.054672+00:00","updated_at":"2026-05-18T04:24:06.054672+00:00"}