{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NOSHGRQ4QYJFPXSU3JOOJAYWML","short_pith_number":"pith:NOSHGRQ4","canonical_record":{"source":{"id":"1609.09643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-30T09:13:12Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a219d7cfb1fb2f8245f84809fdc8f41db96cfb63a325304d2a25a0c020fc023a","abstract_canon_sha256":"140f8ac9164f53aacbba6586a6351d1c14fabeb4918bca7d928371c45597d47c"},"schema_version":"1.0"},"canonical_sha256":"6ba473461c861257de54da5ce4831662fb79294b248c466977ab178ddafc9484","source":{"kind":"arxiv","id":"1609.09643","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09643","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09643v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09643","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"NOSHGRQ4QYJF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NOSHGRQ4QYJFPXSU","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NOSHGRQ4","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NOSHGRQ4QYJFPXSU3JOOJAYWML","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-30T09:13:12Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"a219d7cfb1fb2f8245f84809fdc8f41db96cfb63a325304d2a25a0c020fc023a","abstract_canon_sha256":"140f8ac9164f53aacbba6586a6351d1c14fabeb4918bca7d928371c45597d47c"},"schema_version":"1.0"},"canonical_sha256":"6ba473461c861257de54da5ce4831662fb79294b248c466977ab178ddafc9484","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:35.462998Z","signature_b64":"5ir6L9veOGyLDWcCve42aSW8Ypi8fA6u0AyB9AW6DZ9ZkiGOZ6oqoNkVSsntDMsAoXqewe4izaefzWv/zfoeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ba473461c861257de54da5ce4831662fb79294b248c466977ab178ddafc9484","last_reissued_at":"2026-05-18T01:03:35.462384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:35.462384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09643","source_version":1,"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-05-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHsmIyOIPnxU4o57xfm1RIakPkVt/9C6M7PyL4/8JDg1LMBsNKm9JbN0TkfAvdN5npzfBvlc4avTYDGXTEkNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:16:29.768272Z"},"content_sha256":"b0f472d272e89fd83da93687a22d01b86e9c62b0b3331b531a3d97ffe59c28a1","schema_version":"1.0","event_id":"sha256:b0f472d272e89fd83da93687a22d01b86e9c62b0b3331b531a3d97ffe59c28a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NOSHGRQ4QYJFPXSU3JOOJAYWML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Mateus de Oliveira Oliveira","submitted_at":"2016-09-30T09:13:12Z","abstract_excerpt":"We show that any quantum circuit of treewidth $t$, built from $r$-qubit gates, requires at least $\\Omega(\\frac{n^{2}}{2^{O(r\\cdot t)}\\cdot \\log^4 n})$ gates to compute the element distinctness function. Our result generalizes a near-quadratic lower bound for quantum formula size obtained by Roychowdhury and Vatan [SIAM J. on Computing, 2001]. The proof of our lower bound follows by an extension of Ne\\v{c}iporuk's method to the context of quantum circuits of constant treewidth. This extension is made via a combination of techniques from structural graph theory, tensor-network theory, and the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09643","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":""},"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-05-18T01:03:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKh1bqqkL9IwXHBkmQLBWQOPNbafAHEg/j1Y0MXUYx6pdwFAGnMgxBb6mJJn+XIVQXqbmVJP6EgjypB8lrubDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:16:29.768717Z"},"content_sha256":"6e50af50ef125f27dce20ccb034af5fe6b92f42a92c96aebd93edac2e1f92cf8","schema_version":"1.0","event_id":"sha256:6e50af50ef125f27dce20ccb034af5fe6b92f42a92c96aebd93edac2e1f92cf8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/bundle.json","state_url":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/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-05-21T23:16:29Z","links":{"resolver":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML","bundle":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/bundle.json","state":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NOSHGRQ4QYJFPXSU3JOOJAYWML","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":"140f8ac9164f53aacbba6586a6351d1c14fabeb4918bca7d928371c45597d47c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-30T09:13:12Z","title_canon_sha256":"a219d7cfb1fb2f8245f84809fdc8f41db96cfb63a325304d2a25a0c020fc023a"},"schema_version":"1.0","source":{"id":"1609.09643","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09643","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09643v1","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09643","created_at":"2026-05-18T01:03:35Z"},{"alias_kind":"pith_short_12","alias_value":"NOSHGRQ4QYJF","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NOSHGRQ4QYJFPXSU","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NOSHGRQ4","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:6e50af50ef125f27dce20ccb034af5fe6b92f42a92c96aebd93edac2e1f92cf8","target":"graph","created_at":"2026-05-18T01:03:35Z","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"},"paper":{"abstract_excerpt":"We show that any quantum circuit of treewidth $t$, built from $r$-qubit gates, requires at least $\\Omega(\\frac{n^{2}}{2^{O(r\\cdot t)}\\cdot \\log^4 n})$ gates to compute the element distinctness function. Our result generalizes a near-quadratic lower bound for quantum formula size obtained by Roychowdhury and Vatan [SIAM J. on Computing, 2001]. The proof of our lower bound follows by an extension of Ne\\v{c}iporuk's method to the context of quantum circuits of constant treewidth. This extension is made via a combination of techniques from structural graph theory, tensor-network theory, and the co","authors_text":"Mateus de Oliveira Oliveira","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-30T09:13:12Z","title":"A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09643","kind":"arxiv","version":1},"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:b0f472d272e89fd83da93687a22d01b86e9c62b0b3331b531a3d97ffe59c28a1","target":"record","created_at":"2026-05-18T01:03:35Z","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":"140f8ac9164f53aacbba6586a6351d1c14fabeb4918bca7d928371c45597d47c","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-30T09:13:12Z","title_canon_sha256":"a219d7cfb1fb2f8245f84809fdc8f41db96cfb63a325304d2a25a0c020fc023a"},"schema_version":"1.0","source":{"id":"1609.09643","kind":"arxiv","version":1}},"canonical_sha256":"6ba473461c861257de54da5ce4831662fb79294b248c466977ab178ddafc9484","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ba473461c861257de54da5ce4831662fb79294b248c466977ab178ddafc9484","first_computed_at":"2026-05-18T01:03:35.462384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:35.462384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ir6L9veOGyLDWcCve42aSW8Ypi8fA6u0AyB9AW6DZ9ZkiGOZ6oqoNkVSsntDMsAoXqewe4izaefzWv/zfoeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:35.462998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09643","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0f472d272e89fd83da93687a22d01b86e9c62b0b3331b531a3d97ffe59c28a1","sha256:6e50af50ef125f27dce20ccb034af5fe6b92f42a92c96aebd93edac2e1f92cf8"],"state_sha256":"d38577355198898881283f6f27bb4051199f01e7d32617aa5a1f9af9bdc76c44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DoGxFMTp7Ipogu4Y0qqm+aaJefmeFeSlDto3eITYrUZ25+Jzg0n5MKC1RQLOPeGttQNRWfU+YhHYHt6RHDZoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:16:29.772028Z","bundle_sha256":"fce11a5dcc316212338a8e21e1563f3571cda956433e08ee993d1fd238eb337f"}}