{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:55Z3RKE5E7EJ4LY2IVM6I5DVPS","short_pith_number":"pith:55Z3RKE5","canonical_record":{"source":{"id":"quant-ph/0403025","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-03-03T03:05:21Z","cross_cats_sorted":[],"title_canon_sha256":"09f386b2c820c9576e339729c484c5d0c3a3ec54158e5c6ee332a7d152d969a0","abstract_canon_sha256":"1ccdd39ff72d4e2f24727333876c39e5b3386821d9a12e8f89fdb7b47099a950"},"schema_version":"1.0"},"canonical_sha256":"ef73b8a89d27c89e2f1a4559e474757cb35cc827546b104d9844a3ecd02eb5a9","source":{"kind":"arxiv","id":"quant-ph/0403025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0403025","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0403025v2","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0403025","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"55Z3RKE5E7EJ","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"pith_short_16","alias_value":"55Z3RKE5E7EJ4LY2","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"pith_short_8","alias_value":"55Z3RKE5","created_at":"2026-07-05T01:49:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:55Z3RKE5E7EJ4LY2IVM6I5DVPS","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0403025","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-03-03T03:05:21Z","cross_cats_sorted":[],"title_canon_sha256":"09f386b2c820c9576e339729c484c5d0c3a3ec54158e5c6ee332a7d152d969a0","abstract_canon_sha256":"1ccdd39ff72d4e2f24727333876c39e5b3386821d9a12e8f89fdb7b47099a950"},"schema_version":"1.0"},"canonical_sha256":"ef73b8a89d27c89e2f1a4559e474757cb35cc827546b104d9844a3ecd02eb5a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:49:33.420299Z","signature_b64":"xkb7sh2RaHAglEXIQutKCp71AL6s2lbyz2fLQkjfETcHm0kGneZepIDigRuzkQkLJ+gcbJewww+tV0um2w5RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef73b8a89d27c89e2f1a4559e474757cb35cc827546b104d9844a3ecd02eb5a9","last_reissued_at":"2026-07-05T01:49:33.419714Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:49:33.419714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0403025","source_version":2,"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-05T01:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DeozuyrX3x/WEToArXMfeKxqEQMolPWF9z7EFryCngEc+3ANLcca58VUzZne4LW1CBgvn51jkV3taRFtDiHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:44:38.102311Z"},"content_sha256":"54f78d817af636b2fc62f61df84cd7f83da11187629b1387a3ae90c4638959fe","schema_version":"1.0","event_id":"sha256:54f78d817af636b2fc62f61df84cd7f83da11187629b1387a3ae90c4638959fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:55Z3RKE5E7EJ4LY2IVM6I5DVPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Quantum Computation with ideal Clifford gates and noisy ancillas","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexei Kitaev, Sergei Bravyi","submitted_at":"2004-03-03T03:05:21Z","abstract_excerpt":"We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\\rho$, which should be regarded as a parameter of the model. Our goal is to determine for which $\\rho$ universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of $\\rho$ and produce a single output qubit with higher polarization. The protocols allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0403025","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/0403025/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-05T01:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TMnOz2Ive7o2sm/6IJHT8XmKlNTnsLxlcV9C/9aR9/FeCrtUimGu0J12ll/YddIm/pkSGiT9ZrWcA/N/wFPaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:44:38.103290Z"},"content_sha256":"54ccc8ac020698d51a0252978c42972c3fb7aaf118b74d0a3cf40486ab1fc6e8","schema_version":"1.0","event_id":"sha256:54ccc8ac020698d51a0252978c42972c3fb7aaf118b74d0a3cf40486ab1fc6e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55Z3RKE5E7EJ4LY2IVM6I5DVPS/bundle.json","state_url":"https://pith.science/pith/55Z3RKE5E7EJ4LY2IVM6I5DVPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55Z3RKE5E7EJ4LY2IVM6I5DVPS/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-10T08:44:38Z","links":{"resolver":"https://pith.science/pith/55Z3RKE5E7EJ4LY2IVM6I5DVPS","bundle":"https://pith.science/pith/55Z3RKE5E7EJ4LY2IVM6I5DVPS/bundle.json","state":"https://pith.science/pith/55Z3RKE5E7EJ4LY2IVM6I5DVPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55Z3RKE5E7EJ4LY2IVM6I5DVPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:55Z3RKE5E7EJ4LY2IVM6I5DVPS","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":"1ccdd39ff72d4e2f24727333876c39e5b3386821d9a12e8f89fdb7b47099a950","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-03-03T03:05:21Z","title_canon_sha256":"09f386b2c820c9576e339729c484c5d0c3a3ec54158e5c6ee332a7d152d969a0"},"schema_version":"1.0","source":{"id":"quant-ph/0403025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0403025","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0403025v2","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0403025","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"55Z3RKE5E7EJ","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"pith_short_16","alias_value":"55Z3RKE5E7EJ4LY2","created_at":"2026-07-05T01:49:33Z"},{"alias_kind":"pith_short_8","alias_value":"55Z3RKE5","created_at":"2026-07-05T01:49:33Z"}],"graph_snapshots":[{"event_id":"sha256:54ccc8ac020698d51a0252978c42972c3fb7aaf118b74d0a3cf40486ab1fc6e8","target":"graph","created_at":"2026-07-05T01:49:33Z","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/quant-ph/0403025/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\\rho$, which should be regarded as a parameter of the model. Our goal is to determine for which $\\rho$ universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of $\\rho$ and produce a single output qubit with higher polarization. The protocols allo","authors_text":"Alexei Kitaev, Sergei Bravyi","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2004-03-03T03:05:21Z","title":"Universal Quantum Computation with ideal Clifford gates and noisy ancillas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0403025","kind":"arxiv","version":2},"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:54f78d817af636b2fc62f61df84cd7f83da11187629b1387a3ae90c4638959fe","target":"record","created_at":"2026-07-05T01:49:33Z","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":"1ccdd39ff72d4e2f24727333876c39e5b3386821d9a12e8f89fdb7b47099a950","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2004-03-03T03:05:21Z","title_canon_sha256":"09f386b2c820c9576e339729c484c5d0c3a3ec54158e5c6ee332a7d152d969a0"},"schema_version":"1.0","source":{"id":"quant-ph/0403025","kind":"arxiv","version":2}},"canonical_sha256":"ef73b8a89d27c89e2f1a4559e474757cb35cc827546b104d9844a3ecd02eb5a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef73b8a89d27c89e2f1a4559e474757cb35cc827546b104d9844a3ecd02eb5a9","first_computed_at":"2026-07-05T01:49:33.419714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:49:33.419714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xkb7sh2RaHAglEXIQutKCp71AL6s2lbyz2fLQkjfETcHm0kGneZepIDigRuzkQkLJ+gcbJewww+tV0um2w5RDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:49:33.420299Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0403025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54f78d817af636b2fc62f61df84cd7f83da11187629b1387a3ae90c4638959fe","sha256:54ccc8ac020698d51a0252978c42972c3fb7aaf118b74d0a3cf40486ab1fc6e8"],"state_sha256":"7580c6034fc2d3ab298efc8221b675c4101d5d78db776776a4cfe6cff49fc3bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lymFHwO3u7weEgSXenU6X1qJStejUdCYuTjNmT15ImYlV6JX910AqpVGMg+wYCjJ+X4jyMsjy5GpVfmrN4UVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:44:39.104128Z","bundle_sha256":"2dd2537b9713e7bd7075907ec9b74e0108cd3f035dba58ec64001198bc4297ac"}}