{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:ES42WHWWWFJG65SZ6YRCDA3LN5","short_pith_number":"pith:ES42WHWW","schema_version":"1.0","canonical_sha256":"24b9ab1ed6b1526f7659f62221836b6f5dcd566cf3a4b67d4dc6554ca01ffc44","source":{"kind":"arxiv","id":"quant-ph/9611027","version":1},"attestation_state":"computed","paper":{"title":"Active stabilisation, quantum computation and quantum state synthesis","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Steane (Clarendon Laboratory, Oxford University)","submitted_at":"1996-11-16T14:49:19Z","abstract_excerpt":"Active stabilisation of a quantum system is the active suppression of noise (such as decoherence) in the system, without disrupting its unitary evolution. Quantum error correction suggests the possibility of achieving this, but only if the recovery network can suppress more noise than it introduces. A general method of constructing such networks is proposed, which gives a substantial improvement over previous fault tolerant designs. The construction permits quantum error correction to be understood as essentially quantum state synthesis. An approximate analysis implies that algorithms involvin"},"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/9611027","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1996-11-16T14:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"82ba1233d894a36d8e691ccf2d8e976be31153d79f39282deba112427a9dccb2","abstract_canon_sha256":"f306f2b4cda62fd296ff074b613a89db5b0d430a2c04d7abf9b1971102330ca9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:36:41.842417Z","signature_b64":"taejTpUZZqU2RhZvrpz5yMkBqAQU2WmLklsC1X4AdxxCRthWYm+zq4oE2VGn5fU2uCfRHuSiNXEa6zpVXq10Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24b9ab1ed6b1526f7659f62221836b6f5dcd566cf3a4b67d4dc6554ca01ffc44","last_reissued_at":"2026-07-04T15:36:41.841941Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:36:41.841941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active stabilisation, quantum computation and quantum state synthesis","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Steane (Clarendon Laboratory, Oxford University)","submitted_at":"1996-11-16T14:49:19Z","abstract_excerpt":"Active stabilisation of a quantum system is the active suppression of noise (such as decoherence) in the system, without disrupting its unitary evolution. Quantum error correction suggests the possibility of achieving this, but only if the recovery network can suppress more noise than it introduces. A general method of constructing such networks is proposed, which gives a substantial improvement over previous fault tolerant designs. The construction permits quantum error correction to be understood as essentially quantum state synthesis. An approximate analysis implies that algorithms involvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9611027","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/quant-ph/9611027/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":"quant-ph/9611027","created_at":"2026-07-04T15:36:41.841998+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9611027v1","created_at":"2026-07-04T15:36:41.841998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9611027","created_at":"2026-07-04T15:36:41.841998+00:00"},{"alias_kind":"pith_short_12","alias_value":"ES42WHWWWFJG","created_at":"2026-07-04T15:36:41.841998+00:00"},{"alias_kind":"pith_short_16","alias_value":"ES42WHWWWFJG65SZ","created_at":"2026-07-04T15:36:41.841998+00:00"},{"alias_kind":"pith_short_8","alias_value":"ES42WHWW","created_at":"2026-07-04T15:36:41.841998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2304.04743","citing_title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15344","citing_title":"Fire and ice: Partially fault-tolerant quantum computing with selective state filtering","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2404.02280","citing_title":"Demonstration of logical qubits and repeated error correction with better-than-physical error rates","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5","json":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5.json","graph_json":"https://pith.science/api/pith-number/ES42WHWWWFJG65SZ6YRCDA3LN5/graph.json","events_json":"https://pith.science/api/pith-number/ES42WHWWWFJG65SZ6YRCDA3LN5/events.json","paper":"https://pith.science/paper/ES42WHWW"},"agent_actions":{"view_html":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5","download_json":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5.json","view_paper":"https://pith.science/paper/ES42WHWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9611027&json=true","fetch_graph":"https://pith.science/api/pith-number/ES42WHWWWFJG65SZ6YRCDA3LN5/graph.json","fetch_events":"https://pith.science/api/pith-number/ES42WHWWWFJG65SZ6YRCDA3LN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5/action/storage_attestation","attest_author":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5/action/author_attestation","sign_citation":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5/action/citation_signature","submit_replication":"https://pith.science/pith/ES42WHWWWFJG65SZ6YRCDA3LN5/action/replication_record"}},"created_at":"2026-07-04T15:36:41.841998+00:00","updated_at":"2026-07-04T15:36:41.841998+00:00"}