{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:T6MD64JTNEW7RRAC4IOJWKZANX","short_pith_number":"pith:T6MD64JT","schema_version":"1.0","canonical_sha256":"9f983f7133692df8c402e21c9b2b206ddb1dbf8e5050b05fdf2ed7e4ae2df0ee","source":{"kind":"arxiv","id":"2606.06455","version":1},"attestation_state":"computed","paper":{"title":"Breakeven demonstration of quantum low-density parity-check codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ashay N. Patel, Edwin Tham, Erik Nielsen, Jason Nguyen, John Gamble, Jyothi Saraladevi, Kenneth Wright, Michael L. Goldman, Neal Pisenti, Nicolas Delfosse, Shantanu Debnath","submitted_at":"2026-06-04T17:49:27Z","abstract_excerpt":"High-rate quantum low-density parity-check (qLDPC) codes are a leading candidate for fault-tolerant quantum computing. They feature higher encoding rates than planar alternatives such as the surface code, but their implementation often entails significant hardware hurdles like the need for long-range couplers. We leverage the flexibility of a trapped-ion quantum computer to demonstrate nine quantum error-correcting codes with starkly different qubit connectivity requirements on a single device without any hardware reconfiguration. These experiments span three families of quantum error-correcti"},"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":"2606.06455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-04T17:49:27Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"4ad20986bffa6a491445eaf0702964efa23ed8227912c90a442a245f5aca2106","abstract_canon_sha256":"6912983dc22ce2d6a758558c6662589e50e9cf95d2b1a57cf38bb6f6001da9a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:46.092903Z","signature_b64":"6suH5DkuEt6j/otQcqigIeaLWX2gxaGEY62OaI2X6E8LBZmKiOD1KWcJ8n8zBlxGZlcWeSHP5rAdQfzxhw7GBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f983f7133692df8c402e21c9b2b206ddb1dbf8e5050b05fdf2ed7e4ae2df0ee","last_reissued_at":"2026-06-05T01:15:46.092407Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:46.092407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breakeven demonstration of quantum low-density parity-check codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Ashay N. Patel, Edwin Tham, Erik Nielsen, Jason Nguyen, John Gamble, Jyothi Saraladevi, Kenneth Wright, Michael L. Goldman, Neal Pisenti, Nicolas Delfosse, Shantanu Debnath","submitted_at":"2026-06-04T17:49:27Z","abstract_excerpt":"High-rate quantum low-density parity-check (qLDPC) codes are a leading candidate for fault-tolerant quantum computing. They feature higher encoding rates than planar alternatives such as the surface code, but their implementation often entails significant hardware hurdles like the need for long-range couplers. We leverage the flexibility of a trapped-ion quantum computer to demonstrate nine quantum error-correcting codes with starkly different qubit connectivity requirements on a single device without any hardware reconfiguration. These experiments span three families of quantum error-correcti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06455","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/2606.06455/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":"2606.06455","created_at":"2026-06-05T01:15:46.092476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06455v1","created_at":"2026-06-05T01:15:46.092476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06455","created_at":"2026-06-05T01:15:46.092476+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6MD64JTNEW7","created_at":"2026-06-05T01:15:46.092476+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6MD64JTNEW7RRAC","created_at":"2026-06-05T01:15:46.092476+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6MD64JT","created_at":"2026-06-05T01:15:46.092476+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/T6MD64JTNEW7RRAC4IOJWKZANX","json":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX.json","graph_json":"https://pith.science/api/pith-number/T6MD64JTNEW7RRAC4IOJWKZANX/graph.json","events_json":"https://pith.science/api/pith-number/T6MD64JTNEW7RRAC4IOJWKZANX/events.json","paper":"https://pith.science/paper/T6MD64JT"},"agent_actions":{"view_html":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX","download_json":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX.json","view_paper":"https://pith.science/paper/T6MD64JT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06455&json=true","fetch_graph":"https://pith.science/api/pith-number/T6MD64JTNEW7RRAC4IOJWKZANX/graph.json","fetch_events":"https://pith.science/api/pith-number/T6MD64JTNEW7RRAC4IOJWKZANX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX/action/storage_attestation","attest_author":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX/action/author_attestation","sign_citation":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX/action/citation_signature","submit_replication":"https://pith.science/pith/T6MD64JTNEW7RRAC4IOJWKZANX/action/replication_record"}},"created_at":"2026-06-05T01:15:46.092476+00:00","updated_at":"2026-06-05T01:15:46.092476+00:00"}