{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:BYWE6L4EXAOPR27BRX4OPB6KQN","short_pith_number":"pith:BYWE6L4E","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"},"canonical_sha256":"0e2c4f2f84b81cf8ebe18df8e787ca835debd22ba4178613fb8f439a20b67706","source":{"kind":"arxiv","id":"quant-ph/0312209","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0312209","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0312209v2","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0312209","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"BYWE6L4EXAOP","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"pith_short_16","alias_value":"BYWE6L4EXAOPR27B","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"pith_short_8","alias_value":"BYWE6L4E","created_at":"2026-07-04T14:46:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:BYWE6L4EXAOPR27BRX4OPB6KQN","target":"record","payload":{"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"},"canonical_sha256":"0e2c4f2f84b81cf8ebe18df8e787ca835debd22ba4178613fb8f439a20b67706","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"},"source_kind":"arxiv","source_id":"quant-ph/0312209","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZO3TpwRWrRz8PXZ/nicfaJcC7l9YPAnOnjNNvzgiGOc0c6kAm3lnlDz3VZOV9yyGEyjmnWSJNUU20e4eR5dkCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:05:14.045130Z"},"content_sha256":"b3056f968d2b48e2dfef90d1223aed79c620459a0eb9cc931e7ad1d14dbc65bb","schema_version":"1.0","event_id":"sha256:b3056f968d2b48e2dfef90d1223aed79c620459a0eb9cc931e7ad1d14dbc65bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:BYWE6L4EXAOPR27BRX4OPB6KQN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T14:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DNtrdXPCvVYUmr141Fhchq0iJ5IoPIHjAhV5/y/nng8Me8i38AfXUDzseb8ypnYH+VlGsD4vAxFEJ5LGAYmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T20:05:14.046113Z"},"content_sha256":"85a3ed72b949b96f5c64ad3b149087ccfe1051b0e10b2fc49afafc52a6e774a9","schema_version":"1.0","event_id":"sha256:85a3ed72b949b96f5c64ad3b149087ccfe1051b0e10b2fc49afafc52a6e774a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/bundle.json","state_url":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T20:05:14Z","links":{"resolver":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN","bundle":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/bundle.json","state":"https://pith.science/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYWE6L4EXAOPR27BRX4OPB6KQN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:BYWE6L4EXAOPR27BRX4OPB6KQN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5d0dbcf5d66cc1ee15f8a96a00264580c6d0ad3cd049f32815ac85a7f9315756","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-12-28T20:34:58Z","title_canon_sha256":"e1d2730f35234b63127b6b0b3ce9d8e37f9c35374caa3d569a324c1ea28e677b"},"schema_version":"1.0","source":{"id":"quant-ph/0312209","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0312209","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0312209v2","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0312209","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"BYWE6L4EXAOP","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"pith_short_16","alias_value":"BYWE6L4EXAOPR27B","created_at":"2026-07-04T14:46:29Z"},{"alias_kind":"pith_short_8","alias_value":"BYWE6L4E","created_at":"2026-07-04T14:46:29Z"}],"graph_snapshots":[{"event_id":"sha256:85a3ed72b949b96f5c64ad3b149087ccfe1051b0e10b2fc49afafc52a6e774a9","target":"graph","created_at":"2026-07-04T14:46:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0312209/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Frederic Green, Stephen Fenner, Steven Homer, Yong Zhang","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2003-12-28T20:34:58Z","title":"Bounds on the Power of Constant-Depth Quantum Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0312209","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3056f968d2b48e2dfef90d1223aed79c620459a0eb9cc931e7ad1d14dbc65bb","target":"record","created_at":"2026-07-04T14:46:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5d0dbcf5d66cc1ee15f8a96a00264580c6d0ad3cd049f32815ac85a7f9315756","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2003-12-28T20:34:58Z","title_canon_sha256":"e1d2730f35234b63127b6b0b3ce9d8e37f9c35374caa3d569a324c1ea28e677b"},"schema_version":"1.0","source":{"id":"quant-ph/0312209","kind":"arxiv","version":2}},"canonical_sha256":"0e2c4f2f84b81cf8ebe18df8e787ca835debd22ba4178613fb8f439a20b67706","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e2c4f2f84b81cf8ebe18df8e787ca835debd22ba4178613fb8f439a20b67706","first_computed_at":"2026-07-04T14:46:29.572851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:46:29.572851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YRbkSLlOfU2rmrTYqWpk6/3ESPO0q6xIC6z9c2y9xJP0HzjgCwzKOEailNnhGeB5kTivUKCeJGgFzQ94DY7ABA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:46:29.573229Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0312209","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3056f968d2b48e2dfef90d1223aed79c620459a0eb9cc931e7ad1d14dbc65bb","sha256:85a3ed72b949b96f5c64ad3b149087ccfe1051b0e10b2fc49afafc52a6e774a9"],"state_sha256":"cdd59192901acff088e5a7caebaa71ac7e5a7f7930437501c3008aa55c7923bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCc8kY7tgu9hGauQYq6+nQxKTj0lU+UFdWG9g5p4xhwWHAaIiqUTeg1FKBLuUBHmRfFD9lKdS5AUpGG3qtv1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T20:05:14.056514Z","bundle_sha256":"a806ccb15a6962eebd389582f8985e23c04b6b57a1603e9a6d55cb2b1f60fb3b"}}