{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DLCRXIQEZ7L5LGEKVYKZD4SNFM","short_pith_number":"pith:DLCRXIQE","schema_version":"1.0","canonical_sha256":"1ac51ba204cfd7d5988aae1591f24d2b29ad00db6ff793ea40527f13a145bb4d","source":{"kind":"arxiv","id":"2405.07137","version":2},"attestation_state":"computed","paper":{"title":"Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"En-Jui Kuo, Min-Hsiu Hsieh, Nai-Hui Chia, Shih-Han Hung","submitted_at":"2024-05-12T02:19:58Z","abstract_excerpt":"This work investigates the oracle separation between the physically motivated complexity class of noisy quantum circuits, inspired by definitions such as those presented by Chen, Cotler, Huang, and Li (2022). We establish that with a constant error rate, separation can be achieved in terms of NP. When the error rate is $\\Omega(\\log n/n)$, we can extend this result to the separation of PH. Notably, our oracles, in all separations, do not necessitate error correction schemes or fault tolerance, as all quantum circuits are of constant depth. This indicates that even quantum computers with minor e"},"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":"2405.07137","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-12T02:19:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"41b7fa5fdf0d90e0222c157ef276a3dda7abfb3583b510392a0c6bf91cef5cdc","abstract_canon_sha256":"c5e364d034340ceee46ba83e7162d6e72f5728aeb55b9987c7c4f643e022a508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:18:53.205345Z","signature_b64":"Z7jDCxM6zy+Em8fCxbqOy5M5o/YAAamwJjpKLj38OKqxJgHay4GtUmukfoH90s9K4nUeUA8me4OekVEbSv/AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ac51ba204cfd7d5988aae1591f24d2b29ad00db6ff793ea40527f13a145bb4d","last_reissued_at":"2026-07-05T08:18:53.204952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:18:53.204952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"En-Jui Kuo, Min-Hsiu Hsieh, Nai-Hui Chia, Shih-Han Hung","submitted_at":"2024-05-12T02:19:58Z","abstract_excerpt":"This work investigates the oracle separation between the physically motivated complexity class of noisy quantum circuits, inspired by definitions such as those presented by Chen, Cotler, Huang, and Li (2022). We establish that with a constant error rate, separation can be achieved in terms of NP. When the error rate is $\\Omega(\\log n/n)$, we can extend this result to the separation of PH. Notably, our oracles, in all separations, do not necessitate error correction schemes or fault tolerance, as all quantum circuits are of constant depth. This indicates that even quantum computers with minor e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07137","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/2405.07137/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":"2405.07137","created_at":"2026-07-05T08:18:53.205009+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.07137v2","created_at":"2026-07-05T08:18:53.205009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07137","created_at":"2026-07-05T08:18:53.205009+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLCRXIQEZ7L5","created_at":"2026-07-05T08:18:53.205009+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLCRXIQEZ7L5LGEK","created_at":"2026-07-05T08:18:53.205009+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLCRXIQE","created_at":"2026-07-05T08:18:53.205009+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07667","citing_title":"Unsupervised Feature Extraction and Reconstruction Using Parameterized Quantum Circuits","ref_index":70,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM","json":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM.json","graph_json":"https://pith.science/api/pith-number/DLCRXIQEZ7L5LGEKVYKZD4SNFM/graph.json","events_json":"https://pith.science/api/pith-number/DLCRXIQEZ7L5LGEKVYKZD4SNFM/events.json","paper":"https://pith.science/paper/DLCRXIQE"},"agent_actions":{"view_html":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM","download_json":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM.json","view_paper":"https://pith.science/paper/DLCRXIQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.07137&json=true","fetch_graph":"https://pith.science/api/pith-number/DLCRXIQEZ7L5LGEKVYKZD4SNFM/graph.json","fetch_events":"https://pith.science/api/pith-number/DLCRXIQEZ7L5LGEKVYKZD4SNFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM/action/storage_attestation","attest_author":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM/action/author_attestation","sign_citation":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM/action/citation_signature","submit_replication":"https://pith.science/pith/DLCRXIQEZ7L5LGEKVYKZD4SNFM/action/replication_record"}},"created_at":"2026-07-05T08:18:53.205009+00:00","updated_at":"2026-07-05T08:18:53.205009+00:00"}