{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HUZJSZ2QFA345KUT45UQAKZAVJ","short_pith_number":"pith:HUZJSZ2Q","schema_version":"1.0","canonical_sha256":"3d329967502837ceaa93e769002b20aa7d4c520bb125dfadf1e8ef345870bc6f","source":{"kind":"arxiv","id":"1109.4948","version":1},"attestation_state":"computed","paper":{"title":"Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"L. DiCarlo, L. Frunzio, L. Sun, M. D. Reed, R. J. Schoelkopf, S. E. Nigg, S. M. Girvin","submitted_at":"2011-09-22T20:07:35Z","abstract_excerpt":"Quantum computers promise to solve certain problems exponentially faster than possible classically but are challenging to build because of their increased susceptibility to errors. Remarkably, however, it is possible to detect and correct errors without destroying coherence by using quantum error correcting codes [1]. The simplest of these are the three-qubit codes, which map a one-qubit state to an entangled three-qubit state and can correct any single phase-flip or bit-flip error of one of the three qubits, depending on the code used [2]. Here we demonstrate both codes in a superconducting c"},"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":"1109.4948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-09-22T20:07:35Z","cross_cats_sorted":["cond-mat.mes-hall","cond-mat.supr-con"],"title_canon_sha256":"3be7bbe1934d85fb8a469c02779d06ec5384b3e6d97d91f1a8c86ff08855b7f0","abstract_canon_sha256":"3f03a9dae1cf32648a0ddea62335f9a9092163c0b0ddb093fbb085913c9ad372"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:39.417775Z","signature_b64":"+1nAWWTN9uqNOaw6I7akQcb+B2ZrJVUSG8W4JzpoxDSaAU2v9pmCwYOew3Is31EZocGrCkecwzRSiMYsRHsmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d329967502837ceaa93e769002b20aa7d4c520bb125dfadf1e8ef345870bc6f","last_reissued_at":"2026-05-18T04:01:39.417127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:39.417127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"L. DiCarlo, L. Frunzio, L. Sun, M. D. Reed, R. J. Schoelkopf, S. E. Nigg, S. M. Girvin","submitted_at":"2011-09-22T20:07:35Z","abstract_excerpt":"Quantum computers promise to solve certain problems exponentially faster than possible classically but are challenging to build because of their increased susceptibility to errors. Remarkably, however, it is possible to detect and correct errors without destroying coherence by using quantum error correcting codes [1]. The simplest of these are the three-qubit codes, which map a one-qubit state to an entangled three-qubit state and can correct any single phase-flip or bit-flip error of one of the three qubits, depending on the code used [2]. Here we demonstrate both codes in a superconducting c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4948","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":"1109.4948","created_at":"2026-05-18T04:01:39.417224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4948v1","created_at":"2026-05-18T04:01:39.417224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4948","created_at":"2026-05-18T04:01:39.417224+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUZJSZ2QFA34","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUZJSZ2QFA345KUT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUZJSZ2Q","created_at":"2026-05-18T12:26:30.835961+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/HUZJSZ2QFA345KUT45UQAKZAVJ","json":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ.json","graph_json":"https://pith.science/api/pith-number/HUZJSZ2QFA345KUT45UQAKZAVJ/graph.json","events_json":"https://pith.science/api/pith-number/HUZJSZ2QFA345KUT45UQAKZAVJ/events.json","paper":"https://pith.science/paper/HUZJSZ2Q"},"agent_actions":{"view_html":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ","download_json":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ.json","view_paper":"https://pith.science/paper/HUZJSZ2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4948&json=true","fetch_graph":"https://pith.science/api/pith-number/HUZJSZ2QFA345KUT45UQAKZAVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HUZJSZ2QFA345KUT45UQAKZAVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ/action/storage_attestation","attest_author":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ/action/author_attestation","sign_citation":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ/action/citation_signature","submit_replication":"https://pith.science/pith/HUZJSZ2QFA345KUT45UQAKZAVJ/action/replication_record"}},"created_at":"2026-05-18T04:01:39.417224+00:00","updated_at":"2026-05-18T04:01:39.417224+00:00"}