{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:S4HD4Z5TKK4H3NLDNUIDU2PLFQ","short_pith_number":"pith:S4HD4Z5T","schema_version":"1.0","canonical_sha256":"970e3e67b352b87db5636d103a69eb2c0669e3be24604cd840630cf71570b096","source":{"kind":"arxiv","id":"2210.07234","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of NISQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Jerry Li, Jordan Cotler, Sitan Chen","submitted_at":"2022-10-13T17:58:32Z","abstract_excerpt":"The recent proliferation of NISQ devices has made it imperative to understand their computational power. In this work, we define and study the complexity class $\\textsf{NISQ} $, which is intended to encapsulate problems that can be efficiently solved by a classical computer with access to a NISQ device. To model existing devices, we assume the device can (1) noisily initialize all qubits, (2) apply many noisy quantum gates, and (3) perform a noisy measurement on all qubits. We first give evidence that $\\textsf{BPP}\\subsetneq \\textsf{NISQ}\\subsetneq \\textsf{BQP}$, by demonstrating super-polynom"},"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":"2210.07234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-13T17:58:32Z","cross_cats_sorted":["cs.CC","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"3883ebe26f0ed2bc3a5a7b006db7aabe583939625cfba2a6ad4d4ed87e25c852","abstract_canon_sha256":"50bf489e67b23fae774178a6d1f02565f02b44baaf55dc736c0bd7789dd8006a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:26.017826Z","signature_b64":"12e6LEotjJsq9hXdNjFGStJC/cE/cbBP6HVwgA6uKPtl4hKsMsJhaXUviNFyIywvDxweFZwRCR1R6+Q7bKNsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"970e3e67b352b87db5636d103a69eb2c0669e3be24604cd840630cf71570b096","last_reissued_at":"2026-07-05T05:06:26.017287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:26.017287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of NISQ","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","cs.LG","math.IT"],"primary_cat":"quant-ph","authors_text":"Hsin-Yuan Huang, Jerry Li, Jordan Cotler, Sitan Chen","submitted_at":"2022-10-13T17:58:32Z","abstract_excerpt":"The recent proliferation of NISQ devices has made it imperative to understand their computational power. In this work, we define and study the complexity class $\\textsf{NISQ} $, which is intended to encapsulate problems that can be efficiently solved by a classical computer with access to a NISQ device. To model existing devices, we assume the device can (1) noisily initialize all qubits, (2) apply many noisy quantum gates, and (3) perform a noisy measurement on all qubits. We first give evidence that $\\textsf{BPP}\\subsetneq \\textsf{NISQ}\\subsetneq \\textsf{BQP}$, by demonstrating super-polynom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.07234","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/2210.07234/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":"2210.07234","created_at":"2026-07-05T05:06:26.017373+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.07234v1","created_at":"2026-07-05T05:06:26.017373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.07234","created_at":"2026-07-05T05:06:26.017373+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4HD4Z5TKK4H","created_at":"2026-07-05T05:06:26.017373+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4HD4Z5TKK4H3NLD","created_at":"2026-07-05T05:06:26.017373+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4HD4Z5T","created_at":"2026-07-05T05:06:26.017373+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ","json":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ.json","graph_json":"https://pith.science/api/pith-number/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/graph.json","events_json":"https://pith.science/api/pith-number/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/events.json","paper":"https://pith.science/paper/S4HD4Z5T"},"agent_actions":{"view_html":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ","download_json":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ.json","view_paper":"https://pith.science/paper/S4HD4Z5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.07234&json=true","fetch_graph":"https://pith.science/api/pith-number/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/action/storage_attestation","attest_author":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/action/author_attestation","sign_citation":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/action/citation_signature","submit_replication":"https://pith.science/pith/S4HD4Z5TKK4H3NLDNUIDU2PLFQ/action/replication_record"}},"created_at":"2026-07-05T05:06:26.017373+00:00","updated_at":"2026-07-05T05:06:26.017373+00:00"}