{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:BYWE6L4EXAOPR27BRX4OPB6KQN","short_pith_number":"pith:BYWE6L4E","schema_version":"1.0","canonical_sha256":"0e2c4f2f84b81cf8ebe18df8e787ca835debd22ba4178613fb8f439a20b67706","source":{"kind":"arxiv","id":"quant-ph/0312209","version":2},"attestation_state":"computed","paper":{"title":"Bounds on the Power of Constant-Depth Quantum Circuits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic Green, Stephen Fenner, Steven Homer, Yong Zhang","submitted_at":"2003-12-28T20:34:58Z","abstract_excerpt":"We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 is contained in P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo (quant-ph/0205133) to show that, for any family F of quantum gates including Hadamard and CNOT gates, computing the acceptance probabilities of depth-five circuits over F is just as hard as computing these probabilities fo"},"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":"quant-ph/0312209","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-12-28T20:34:58Z","cross_cats_sorted":[],"title_canon_sha256":"e1d2730f35234b63127b6b0b3ce9d8e37f9c35374caa3d569a324c1ea28e677b","abstract_canon_sha256":"5d0dbcf5d66cc1ee15f8a96a00264580c6d0ad3cd049f32815ac85a7f9315756"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:29.573229Z","signature_b64":"YRbkSLlOfU2rmrTYqWpk6/3ESPO0q6xIC6z9c2y9xJP0HzjgCwzKOEailNnhGeB5kTivUKCeJGgFzQ94DY7ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e2c4f2f84b81cf8ebe18df8e787ca835debd22ba4178613fb8f439a20b67706","last_reissued_at":"2026-07-04T14:46:29.572851Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:29.572851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Power of Constant-Depth Quantum Circuits","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Frederic Green, Stephen Fenner, Steven Homer, Yong Zhang","submitted_at":"2003-12-28T20:34:58Z","abstract_excerpt":"We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 is contained in P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo (quant-ph/0205133) to show that, for any family F of quantum gates including Hadamard and CNOT gates, computing the acceptance probabilities of depth-five circuits over F is just as hard as computing these probabilities fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0312209","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/quant-ph/0312209/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":"quant-ph/0312209","created_at":"2026-07-04T14:46:29.572906+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0312209v2","created_at":"2026-07-04T14:46:29.572906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0312209","created_at":"2026-07-04T14:46:29.572906+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYWE6L4EXAOP","created_at":"2026-07-04T14:46:29.572906+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYWE6L4EXAOPR27B","created_at":"2026-07-04T14:46:29.572906+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYWE6L4E","created_at":"2026-07-04T14:46:29.572906+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.13169","citing_title":"Witnessing the architecture of quantum circuits","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN","json":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN.json","graph_json":"https://pith.science/api/pith-number/BYWE6L4EXAOPR27BRX4OPB6KQN/graph.json","events_json":"https://pith.science/api/pith-number/BYWE6L4EXAOPR27BRX4OPB6KQN/events.json","paper":"https://pith.science/paper/BYWE6L4E"},"agent_actions":{"view_html":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN","download_json":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN.json","view_paper":"https://pith.science/paper/BYWE6L4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0312209&json=true","fetch_graph":"https://pith.science/api/pith-number/BYWE6L4EXAOPR27BRX4OPB6KQN/graph.json","fetch_events":"https://pith.science/api/pith-number/BYWE6L4EXAOPR27BRX4OPB6KQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/action/storage_attestation","attest_author":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/action/author_attestation","sign_citation":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/action/citation_signature","submit_replication":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/action/replication_record"}},"created_at":"2026-07-04T14:46:29.572906+00:00","updated_at":"2026-07-04T14:46:29.572906+00:00"}