{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:3ZPYBTMBDZYVAXY46FMLNQDFRH","short_pith_number":"pith:3ZPYBTMB","schema_version":"1.0","canonical_sha256":"de5f80cd811e71505f1cf158b6c06589f2b16604fe0c2a42cea988032cc2d260","source":{"kind":"arxiv","id":"quant-ph/0411071","version":1},"attestation_state":"computed","paper":{"title":"Robust and parsimonious realisations of unitaries in the one-way model","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Prakash Panangaden, Vincent Danos","submitted_at":"2004-11-10T06:04:35Z","abstract_excerpt":"We present a new set of generators for unitary maps over \\otimes^n(C^2) which differs from the traditional rotation-based generating set in that it uses a single-parameter family of 1-qubit unitaries J(a), together with a single 2-qubit unitary controlled-Z.\n  Each generator is implementable in the one-way model using only two qubits, and this leads to both parsimonious and robust implementations of general unitaries. As an illustration, we give an implementation of the controlled-U family which uses only 14 qubits, and has a 2-colourable underlying entanglement graph (known to yield robust en"},"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":"quant-ph/0411071","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-11-10T06:04:35Z","cross_cats_sorted":[],"title_canon_sha256":"48dfd88cc9df23ee0af0e9ae448fc7373dcce2a687c30094bfd75ba923a18b4a","abstract_canon_sha256":"8eceef45bdf0af7ac47b7157b54a61be074fb032fa73de45401de6a692f46a0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:19.990522Z","signature_b64":"YjP3MtwzemJ02bYl8ULyMz+0yDSrpRtwqGp6kWs+QM3Vi6wW0ZHGo3GkcQnMb/eSHZvBdLFbDCgLK2MNDs64DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de5f80cd811e71505f1cf158b6c06589f2b16604fe0c2a42cea988032cc2d260","last_reissued_at":"2026-05-18T03:24:19.990040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:19.990040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust and parsimonious realisations of unitaries in the one-way model","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Elham Kashefi, Prakash Panangaden, Vincent Danos","submitted_at":"2004-11-10T06:04:35Z","abstract_excerpt":"We present a new set of generators for unitary maps over \\otimes^n(C^2) which differs from the traditional rotation-based generating set in that it uses a single-parameter family of 1-qubit unitaries J(a), together with a single 2-qubit unitary controlled-Z.\n  Each generator is implementable in the one-way model using only two qubits, and this leads to both parsimonious and robust implementations of general unitaries. As an illustration, we give an implementation of the controlled-U family which uses only 14 qubits, and has a 2-colourable underlying entanglement graph (known to yield robust en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0411071","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":""},"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":"quant-ph/0411071","created_at":"2026-05-18T03:24:19.990116+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0411071v1","created_at":"2026-05-18T03:24:19.990116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0411071","created_at":"2026-05-18T03:24:19.990116+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZPYBTMBDZYV","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZPYBTMBDZYVAXY4","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZPYBTMB","created_at":"2026-05-18T12:25:52.051335+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/3ZPYBTMBDZYVAXY46FMLNQDFRH","json":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH.json","graph_json":"https://pith.science/api/pith-number/3ZPYBTMBDZYVAXY46FMLNQDFRH/graph.json","events_json":"https://pith.science/api/pith-number/3ZPYBTMBDZYVAXY46FMLNQDFRH/events.json","paper":"https://pith.science/paper/3ZPYBTMB"},"agent_actions":{"view_html":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH","download_json":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH.json","view_paper":"https://pith.science/paper/3ZPYBTMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0411071&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZPYBTMBDZYVAXY46FMLNQDFRH/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZPYBTMBDZYVAXY46FMLNQDFRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH/action/storage_attestation","attest_author":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH/action/author_attestation","sign_citation":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH/action/citation_signature","submit_replication":"https://pith.science/pith/3ZPYBTMBDZYVAXY46FMLNQDFRH/action/replication_record"}},"created_at":"2026-05-18T03:24:19.990116+00:00","updated_at":"2026-05-18T03:24:19.990116+00:00"}