{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:V7VUHWTXSMBZWLJGJKJYLTZFHE","short_pith_number":"pith:V7VUHWTX","schema_version":"1.0","canonical_sha256":"afeb43da7793039b2d264a9385cf25392cea2c4bc2c20d9aae1f597e37e71930","source":{"kind":"arxiv","id":"2309.02863","version":2},"attestation_state":"computed","paper":{"title":"Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Abhinav Kandala, Alireza Seif, Ashvin Vishwanath, David Layden, Edward H. Chen, Elisa B\\\"aumer, Guanyu Zhu, Guo-Yi Zhu, Nathanan Tantivasadakarn, Ruben Verresen, Sarah Sheldon, Simon Trebst","submitted_at":"2023-09-06T09:43:12Z","abstract_excerpt":"Preparing quantum states across many qubits is necessary to unlock the full potential of quantum computers. However, a key challenge is to realize efficient preparation protocols which are stable to noise and gate imperfections. Here, using a measurement-based protocol on a 127 superconducting qubit device, we study the generation of the simplest long-range order -- Ising order, familiar from Greenberger-Horne-Zeilinger (GHZ) states and the repetition code -- on 54 system qubits. Our efficient implementation of the constant-depth protocol and classical decoder shows higher fidelities for GHZ s"},"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":"2309.02863","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-06T09:43:12Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cond-mat.str-el"],"title_canon_sha256":"22b474fe9884f81e6f2aa4a2f603b70ce8e1b48c504907b1d8de54f3fff146d5","abstract_canon_sha256":"5a1a172e7351e1af6dbb2f9d040408ff5eded18fee12e247c1ae922258bcf801"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:07.234697Z","signature_b64":"IfH+ZvPMAMu+VQ8fRMTxIoqFcc3LjPszM8SVoUm2lmi9KAxSkryqzKzJUA1OxOov1ds9FxZwCJbIucJNGe5RAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afeb43da7793039b2d264a9385cf25392cea2c4bc2c20d9aae1f597e37e71930","last_reissued_at":"2026-07-05T10:05:07.234217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:07.234217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Realizing the Nishimori transition across the error threshold for constant-depth quantum circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Abhinav Kandala, Alireza Seif, Ashvin Vishwanath, David Layden, Edward H. Chen, Elisa B\\\"aumer, Guanyu Zhu, Guo-Yi Zhu, Nathanan Tantivasadakarn, Ruben Verresen, Sarah Sheldon, Simon Trebst","submitted_at":"2023-09-06T09:43:12Z","abstract_excerpt":"Preparing quantum states across many qubits is necessary to unlock the full potential of quantum computers. However, a key challenge is to realize efficient preparation protocols which are stable to noise and gate imperfections. Here, using a measurement-based protocol on a 127 superconducting qubit device, we study the generation of the simplest long-range order -- Ising order, familiar from Greenberger-Horne-Zeilinger (GHZ) states and the repetition code -- on 54 system qubits. Our efficient implementation of the constant-depth protocol and classical decoder shows higher fidelities for GHZ s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02863","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/2309.02863/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":"2309.02863","created_at":"2026-07-05T10:05:07.234274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.02863v2","created_at":"2026-07-05T10:05:07.234274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02863","created_at":"2026-07-05T10:05:07.234274+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7VUHWTXSMBZ","created_at":"2026-07-05T10:05:07.234274+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7VUHWTXSMBZWLJG","created_at":"2026-07-05T10:05:07.234274+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7VUHWTX","created_at":"2026-07-05T10:05:07.234274+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2403.02294","citing_title":"Empirical learning of dynamical decoupling on quantum processors","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2405.08810","citing_title":"Quantum computing with Qiskit","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE","json":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE.json","graph_json":"https://pith.science/api/pith-number/V7VUHWTXSMBZWLJGJKJYLTZFHE/graph.json","events_json":"https://pith.science/api/pith-number/V7VUHWTXSMBZWLJGJKJYLTZFHE/events.json","paper":"https://pith.science/paper/V7VUHWTX"},"agent_actions":{"view_html":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE","download_json":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE.json","view_paper":"https://pith.science/paper/V7VUHWTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.02863&json=true","fetch_graph":"https://pith.science/api/pith-number/V7VUHWTXSMBZWLJGJKJYLTZFHE/graph.json","fetch_events":"https://pith.science/api/pith-number/V7VUHWTXSMBZWLJGJKJYLTZFHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE/action/storage_attestation","attest_author":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE/action/author_attestation","sign_citation":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE/action/citation_signature","submit_replication":"https://pith.science/pith/V7VUHWTXSMBZWLJGJKJYLTZFHE/action/replication_record"}},"created_at":"2026-07-05T10:05:07.234274+00:00","updated_at":"2026-07-05T10:05:07.234274+00:00"}