{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5IWVDWWV5IF4FQZVLCMWS55UWY","short_pith_number":"pith:5IWVDWWV","schema_version":"1.0","canonical_sha256":"ea2d51dad5ea0bc2c33558996977b4b607e774e8cc21b98188723fa697aea7f7","source":{"kind":"arxiv","id":"2504.10386","version":1},"attestation_state":"computed","paper":{"title":"Universal fault-tolerant logic with heterogeneous holographic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Alexander Jahn, ChunJun Cao, Jens Eisert, Junyu Fan, Matthew Steinberg, Sebastian Feld","submitted_at":"2025-04-14T16:28:33Z","abstract_excerpt":"The study of holographic bulk-boundary dualities has led to the construction of novel quantum error correcting codes. Although these codes have shed new light on conceptual aspects of these dualities, they have widely been believed to lack a crucial feature of practical quantum error correction: The ability to support universal fault-tolerant quantum logic. In this work, we introduce a new class of holographic codes that realize this feature. These heterogeneous holographic codes are constructed by combining two seed codes in a tensor network on an alternating hyperbolic tiling. We show how th"},"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":"2504.10386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-04-14T16:28:33Z","cross_cats_sorted":["hep-th"],"title_canon_sha256":"7b04712d9cd86be82957630e9babe9f511ab98988500fe6ef43eb792f36eb13a","abstract_canon_sha256":"a3afcd4bbfa8331f6ba1acceff343b0e8aa7ae3ddaa232e0e1b5a0dea5bdcf6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:59.313959Z","signature_b64":"xfoD9l5jASi8y7PZXxEv7cZ7o7eryY+dzNMMV+MG8hELQ49XKc5KUoUWtngEzMZGUzFmz/0/A8PbUDfqgtD5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea2d51dad5ea0bc2c33558996977b4b607e774e8cc21b98188723fa697aea7f7","last_reissued_at":"2026-07-05T10:48:59.313501Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:59.313501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal fault-tolerant logic with heterogeneous holographic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th"],"primary_cat":"quant-ph","authors_text":"Alexander Jahn, ChunJun Cao, Jens Eisert, Junyu Fan, Matthew Steinberg, Sebastian Feld","submitted_at":"2025-04-14T16:28:33Z","abstract_excerpt":"The study of holographic bulk-boundary dualities has led to the construction of novel quantum error correcting codes. Although these codes have shed new light on conceptual aspects of these dualities, they have widely been believed to lack a crucial feature of practical quantum error correction: The ability to support universal fault-tolerant quantum logic. In this work, we introduce a new class of holographic codes that realize this feature. These heterogeneous holographic codes are constructed by combining two seed codes in a tensor network on an alternating hyperbolic tiling. We show how th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10386","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/2504.10386/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":"2504.10386","created_at":"2026-07-05T10:48:59.313553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10386v1","created_at":"2026-07-05T10:48:59.313553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10386","created_at":"2026-07-05T10:48:59.313553+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IWVDWWV5IF4","created_at":"2026-07-05T10:48:59.313553+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IWVDWWV5IF4FQZV","created_at":"2026-07-05T10:48:59.313553+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IWVDWWV","created_at":"2026-07-05T10:48:59.313553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15266","citing_title":"Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2510.08210","citing_title":"Hyper-optimized Quantum Lego Contraction Schedules","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY","json":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY.json","graph_json":"https://pith.science/api/pith-number/5IWVDWWV5IF4FQZVLCMWS55UWY/graph.json","events_json":"https://pith.science/api/pith-number/5IWVDWWV5IF4FQZVLCMWS55UWY/events.json","paper":"https://pith.science/paper/5IWVDWWV"},"agent_actions":{"view_html":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY","download_json":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY.json","view_paper":"https://pith.science/paper/5IWVDWWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10386&json=true","fetch_graph":"https://pith.science/api/pith-number/5IWVDWWV5IF4FQZVLCMWS55UWY/graph.json","fetch_events":"https://pith.science/api/pith-number/5IWVDWWV5IF4FQZVLCMWS55UWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY/action/storage_attestation","attest_author":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY/action/author_attestation","sign_citation":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY/action/citation_signature","submit_replication":"https://pith.science/pith/5IWVDWWV5IF4FQZVLCMWS55UWY/action/replication_record"}},"created_at":"2026-07-05T10:48:59.313553+00:00","updated_at":"2026-07-05T10:48:59.313553+00:00"}