{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IIKXBGBLZX55OS6DDZMMKSERDV","short_pith_number":"pith:IIKXBGBL","schema_version":"1.0","canonical_sha256":"421570982bcdfbd74bc31e58c548911d5a7dfe43cd38458f3bcfdd1c5259606f","source":{"kind":"arxiv","id":"1904.09474","version":4},"attestation_state":"computed","paper":{"title":"Repetition Cat Qubits for Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Guillaud, Mazyar Mirrahimi","submitted_at":"2019-04-20T18:03:56Z","abstract_excerpt":"We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative process, exhibit a tunable noise bias where the effective bit-flip errors are exponentially suppressed with the average number of photons. We propose a realization of a set of gates on the cat qubits that preserve such a noise bias. Combining these base qubit operations, we build, at the level of the repetition cat qubit, a universal set of fully protected logical "},"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":"1904.09474","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-20T18:03:56Z","cross_cats_sorted":["cond-mat.supr-con"],"title_canon_sha256":"3196ebfa0eda08b1a82c980506ed94bc4db07352be8a124af8251fb0f108f4a8","abstract_canon_sha256":"d3e28acacdeed5efa2278b2cf78fe5e32e3bcab26b42a9a327f47b4958aa64ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:34.973003Z","signature_b64":"Fci8D+B4ls4wIF2HG9HclMUpU8huhjlE/7o2DzrREUQ8Dh0kTfDW5PAS6F2BO78r1N4UisBIHK07xGwEQlMgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"421570982bcdfbd74bc31e58c548911d5a7dfe43cd38458f3bcfdd1c5259606f","last_reissued_at":"2026-07-05T00:26:34.972563Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:34.972563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repetition Cat Qubits for Fault-Tolerant Quantum Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.supr-con"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Guillaud, Mazyar Mirrahimi","submitted_at":"2019-04-20T18:03:56Z","abstract_excerpt":"We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative process, exhibit a tunable noise bias where the effective bit-flip errors are exponentially suppressed with the average number of photons. We propose a realization of a set of gates on the cat qubits that preserve such a noise bias. Combining these base qubit operations, we build, at the level of the repetition cat qubit, a universal set of fully protected logical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09474","kind":"arxiv","version":4},"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/1904.09474/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":"1904.09474","created_at":"2026-07-05T00:26:34.972619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09474v4","created_at":"2026-07-05T00:26:34.972619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09474","created_at":"2026-07-05T00:26:34.972619+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIKXBGBLZX55","created_at":"2026-07-05T00:26:34.972619+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIKXBGBLZX55OS6D","created_at":"2026-07-05T00:26:34.972619+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIKXBGBL","created_at":"2026-07-05T00:26:34.972619+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07892","citing_title":"Enhancing dissipative cat qubit protection by squeezing","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV","json":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV.json","graph_json":"https://pith.science/api/pith-number/IIKXBGBLZX55OS6DDZMMKSERDV/graph.json","events_json":"https://pith.science/api/pith-number/IIKXBGBLZX55OS6DDZMMKSERDV/events.json","paper":"https://pith.science/paper/IIKXBGBL"},"agent_actions":{"view_html":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV","download_json":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV.json","view_paper":"https://pith.science/paper/IIKXBGBL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09474&json=true","fetch_graph":"https://pith.science/api/pith-number/IIKXBGBLZX55OS6DDZMMKSERDV/graph.json","fetch_events":"https://pith.science/api/pith-number/IIKXBGBLZX55OS6DDZMMKSERDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV/action/storage_attestation","attest_author":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV/action/author_attestation","sign_citation":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV/action/citation_signature","submit_replication":"https://pith.science/pith/IIKXBGBLZX55OS6DDZMMKSERDV/action/replication_record"}},"created_at":"2026-07-05T00:26:34.972619+00:00","updated_at":"2026-07-05T00:26:34.972619+00:00"}