{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6W5XNXIRRVPUE6654DIMPW4TAV","short_pith_number":"pith:6W5XNXIR","schema_version":"1.0","canonical_sha256":"f5bb76dd118d5f427bdde0d0c7db930567383a754de6d0add0978e71b0e319dd","source":{"kind":"arxiv","id":"2404.19005","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant compiling of classically hard IQP circuits on hypercubes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cond-mat.quant-gas","cond-mat.stat-mech","cs.CC","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Dolev Bluvstein, Dominik Hangleiter, Madelyn Cain, Marcin Kalinowski, Michael J. Gullans, Mikhail D. Lukin, Nishad Maskara, Xun Gao","submitted_at":"2024-04-29T18:00:03Z","abstract_excerpt":"Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to reducing noise, it requires a large overhead for generic algorithms. Here, we develop and analyze a hardware-efficient, fault-tolerant approach to realizing complex sampling circuits. We co-design the circuits with the appropriate quantum error correcting codes for efficient implementation in a reconfigurable neutral atom array architecture, constituting what we call a fault-tolerant compilation of the sampling algorithm"},"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":"2404.19005","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2024-04-29T18:00:03Z","cross_cats_sorted":["cond-mat.quant-gas","cond-mat.stat-mech","cs.CC","physics.atom-ph"],"title_canon_sha256":"4d3844d1c354e126ce3de3cc5b214415b407870f1bceaa9ddd00b074ba39f0cd","abstract_canon_sha256":"61dfc1b73c575ef25114e5e6ed2e200f0074a09b834d4a27c91485b51d14954d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:17.407209Z","signature_b64":"z+twp1hoWRLctBdf6vinirmW8goc+ZWcl51lpXe/0cCC9UOqUjb24PsfbOCp1fNRzeO6NEwxhOmr3jMX3tueBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5bb76dd118d5f427bdde0d0c7db930567383a754de6d0add0978e71b0e319dd","last_reissued_at":"2026-07-05T11:12:17.406704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:17.406704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant compiling of classically hard IQP circuits on hypercubes","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cond-mat.quant-gas","cond-mat.stat-mech","cs.CC","physics.atom-ph"],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Dolev Bluvstein, Dominik Hangleiter, Madelyn Cain, Marcin Kalinowski, Michael J. Gullans, Mikhail D. Lukin, Nishad Maskara, Xun Gao","submitted_at":"2024-04-29T18:00:03Z","abstract_excerpt":"Realizing computationally complex quantum circuits in the presence of noise and imperfections is a challenging task. While fault-tolerant quantum computing provides a route to reducing noise, it requires a large overhead for generic algorithms. Here, we develop and analyze a hardware-efficient, fault-tolerant approach to realizing complex sampling circuits. We co-design the circuits with the appropriate quantum error correcting codes for efficient implementation in a reconfigurable neutral atom array architecture, constituting what we call a fault-tolerant compilation of the sampling algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.19005","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/2404.19005/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":"2404.19005","created_at":"2026-07-05T11:12:17.406768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.19005v2","created_at":"2026-07-05T11:12:17.406768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.19005","created_at":"2026-07-05T11:12:17.406768+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W5XNXIRRVPU","created_at":"2026-07-05T11:12:17.406768+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W5XNXIRRVPUE665","created_at":"2026-07-05T11:12:17.406768+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W5XNXIR","created_at":"2026-07-05T11:12:17.406768+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2501.04776","citing_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV","json":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV.json","graph_json":"https://pith.science/api/pith-number/6W5XNXIRRVPUE6654DIMPW4TAV/graph.json","events_json":"https://pith.science/api/pith-number/6W5XNXIRRVPUE6654DIMPW4TAV/events.json","paper":"https://pith.science/paper/6W5XNXIR"},"agent_actions":{"view_html":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV","download_json":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV.json","view_paper":"https://pith.science/paper/6W5XNXIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.19005&json=true","fetch_graph":"https://pith.science/api/pith-number/6W5XNXIRRVPUE6654DIMPW4TAV/graph.json","fetch_events":"https://pith.science/api/pith-number/6W5XNXIRRVPUE6654DIMPW4TAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV/action/storage_attestation","attest_author":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV/action/author_attestation","sign_citation":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV/action/citation_signature","submit_replication":"https://pith.science/pith/6W5XNXIRRVPUE6654DIMPW4TAV/action/replication_record"}},"created_at":"2026-07-05T11:12:17.406768+00:00","updated_at":"2026-07-05T11:12:17.406768+00:00"}