{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RFT4FS646W2J5PJBWQMG7KN5VK","short_pith_number":"pith:RFT4FS64","schema_version":"1.0","canonical_sha256":"8967c2cbdcf5b49ebd21b4186fa9bdaabad8fd0602ebceef7b2fb1785bcba7c0","source":{"kind":"arxiv","id":"1404.2495","version":2},"attestation_state":"computed","paper":{"title":"Simple scheme for encoding and decoding a qubit in unknown state for various topological codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrzej Grudka, Justyna {\\L}odyga, Micha{\\l} Horodecki, Pawe{\\l} Mazurek","submitted_at":"2014-04-09T14:13:41Z","abstract_excerpt":"We present a scheme for encoding and decoding an unknown state for CSS codes, based on syndrome measurements. We illustrate our method by means of Kitaev toric code, defected-lattice code, topological subsystem code and Haah 3D code. The protocol is local whenever in a given code the crossings between the logical operators consist of next neighbour pairs, which holds for the above codes. For subsystem code we also present scheme in a noisy case, where we allow for bit and phase-flip errors on qubits as well as state preparation and syndrome measurement errors. Similar scheme can be built for t"},"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":"1404.2495","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-04-09T14:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"8f418105af79023aaf2571a44d2db2d63d6d394a9b5cac5c80d2feb74996d4d1","abstract_canon_sha256":"445ce22c147200fc84f1993db988b3426127f63970cd133abe50e448816cf951"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:09.475694Z","signature_b64":"NYZyVKjd60yCd0pKyF9WW3YFv18VLoLDUFECoU1M1+QCBZH2rx/2WopFQ/mvFuoeCXRnjYjpEkkDRzr2nqcGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8967c2cbdcf5b49ebd21b4186fa9bdaabad8fd0602ebceef7b2fb1785bcba7c0","last_reissued_at":"2026-05-18T01:53:09.475116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:09.475116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple scheme for encoding and decoding a qubit in unknown state for various topological codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrzej Grudka, Justyna {\\L}odyga, Micha{\\l} Horodecki, Pawe{\\l} Mazurek","submitted_at":"2014-04-09T14:13:41Z","abstract_excerpt":"We present a scheme for encoding and decoding an unknown state for CSS codes, based on syndrome measurements. We illustrate our method by means of Kitaev toric code, defected-lattice code, topological subsystem code and Haah 3D code. The protocol is local whenever in a given code the crossings between the logical operators consist of next neighbour pairs, which holds for the above codes. For subsystem code we also present scheme in a noisy case, where we allow for bit and phase-flip errors on qubits as well as state preparation and syndrome measurement errors. Similar scheme can be built for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2495","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":"1404.2495","created_at":"2026-05-18T01:53:09.475183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2495v2","created_at":"2026-05-18T01:53:09.475183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2495","created_at":"2026-05-18T01:53:09.475183+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFT4FS646W2J","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFT4FS646W2J5PJB","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFT4FS64","created_at":"2026-05-18T12:28:46.137349+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/RFT4FS646W2J5PJBWQMG7KN5VK","json":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK.json","graph_json":"https://pith.science/api/pith-number/RFT4FS646W2J5PJBWQMG7KN5VK/graph.json","events_json":"https://pith.science/api/pith-number/RFT4FS646W2J5PJBWQMG7KN5VK/events.json","paper":"https://pith.science/paper/RFT4FS64"},"agent_actions":{"view_html":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK","download_json":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK.json","view_paper":"https://pith.science/paper/RFT4FS64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2495&json=true","fetch_graph":"https://pith.science/api/pith-number/RFT4FS646W2J5PJBWQMG7KN5VK/graph.json","fetch_events":"https://pith.science/api/pith-number/RFT4FS646W2J5PJBWQMG7KN5VK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK/action/storage_attestation","attest_author":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK/action/author_attestation","sign_citation":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK/action/citation_signature","submit_replication":"https://pith.science/pith/RFT4FS646W2J5PJBWQMG7KN5VK/action/replication_record"}},"created_at":"2026-05-18T01:53:09.475183+00:00","updated_at":"2026-05-18T01:53:09.475183+00:00"}