{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6FHRILORCEPE6IROS7NIE6R7ZR","short_pith_number":"pith:6FHRILOR","schema_version":"1.0","canonical_sha256":"f14f142dd1111e4f222e97da827a3fcc6da581fbf8903fb0be321ce103f4f060","source":{"kind":"arxiv","id":"2302.06639","version":2},"attestation_state":"computed","paper":{"title":"Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126133 Cat Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Diego Ruiz, \\'Elie Gouzien, Francois-Marie Le R\\'egent, J\\'er\\'emie Guillaud, Nicolas Sangouard","submitted_at":"2023-02-13T19:01:05Z","abstract_excerpt":"Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be ensured by a simple repetition code. We here quantify the cost of a repetition code and provide valuable guidance for the choice of a large scale architecture using cat qubits by realizing a performance analysis based on the computation of discrete logarithms on an elliptic curve with Shor's algorithm. By focusing on a 2D grid of cat qubits with neighboring"},"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":"2302.06639","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-02-13T19:01:05Z","cross_cats_sorted":[],"title_canon_sha256":"cabffa3b326841e4c7d7940f85b645a763585133bf6da68cd345334815a440f9","abstract_canon_sha256":"3da99ad7c0c437883136b04cd7d816c43e4c3a1f9947973dcd2430c18347af10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:37:43.103556Z","signature_b64":"9Cjjcmx8/3m780trVAwLAwLP7UCy/u1pq0YPDii7oKH/nXznf68Y4bZGKPIG/6EyMLJ5SImWSoVWV4obIT9HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f14f142dd1111e4f222e97da827a3fcc6da581fbf8903fb0be321ce103f4f060","last_reissued_at":"2026-07-05T06:37:43.103096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:37:43.103096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Analysis of a Repetition Cat Code Architecture: Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126133 Cat Qubits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Diego Ruiz, \\'Elie Gouzien, Francois-Marie Le R\\'egent, J\\'er\\'emie Guillaud, Nicolas Sangouard","submitted_at":"2023-02-13T19:01:05Z","abstract_excerpt":"Cat qubits provide appealing building blocks for quantum computing. They exhibit a tunable noise bias yielding an exponential suppression of bit flips with the average photon number and a protection against the remaining phase errors can be ensured by a simple repetition code. We here quantify the cost of a repetition code and provide valuable guidance for the choice of a large scale architecture using cat qubits by realizing a performance analysis based on the computation of discrete logarithms on an elliptic curve with Shor's algorithm. By focusing on a 2D grid of cat qubits with neighboring"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06639","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/2302.06639/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":"2302.06639","created_at":"2026-07-05T06:37:43.103153+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06639v2","created_at":"2026-07-05T06:37:43.103153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06639","created_at":"2026-07-05T06:37:43.103153+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FHRILORCEPE","created_at":"2026-07-05T06:37:43.103153+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FHRILORCEPE6IRO","created_at":"2026-07-05T06:37:43.103153+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FHRILOR","created_at":"2026-07-05T06:37:43.103153+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/6FHRILORCEPE6IROS7NIE6R7ZR","json":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR.json","graph_json":"https://pith.science/api/pith-number/6FHRILORCEPE6IROS7NIE6R7ZR/graph.json","events_json":"https://pith.science/api/pith-number/6FHRILORCEPE6IROS7NIE6R7ZR/events.json","paper":"https://pith.science/paper/6FHRILOR"},"agent_actions":{"view_html":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR","download_json":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR.json","view_paper":"https://pith.science/paper/6FHRILOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06639&json=true","fetch_graph":"https://pith.science/api/pith-number/6FHRILORCEPE6IROS7NIE6R7ZR/graph.json","fetch_events":"https://pith.science/api/pith-number/6FHRILORCEPE6IROS7NIE6R7ZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR/action/storage_attestation","attest_author":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR/action/author_attestation","sign_citation":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR/action/citation_signature","submit_replication":"https://pith.science/pith/6FHRILORCEPE6IROS7NIE6R7ZR/action/replication_record"}},"created_at":"2026-07-05T06:37:43.103153+00:00","updated_at":"2026-07-05T06:37:43.103153+00:00"}