{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NOSHGRQ4QYJFPXSU3JOOJAYWML","short_pith_number":"pith:NOSHGRQ4","schema_version":"1.0","canonical_sha256":"6ba473461c861257de54da5ce4831662fb79294b248c466977ab178ddafc9484","source":{"kind":"arxiv","id":"1609.09643","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.09643","created_at":"2026-05-18T01:03:35.462481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09643v1","created_at":"2026-05-18T01:03:35.462481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09643","created_at":"2026-05-18T01:03:35.462481+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOSHGRQ4QYJF","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOSHGRQ4QYJFPXSU","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOSHGRQ4","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML","json":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML.json","graph_json":"https://pith.science/api/pith-number/NOSHGRQ4QYJFPXSU3JOOJAYWML/graph.json","events_json":"https://pith.science/api/pith-number/NOSHGRQ4QYJFPXSU3JOOJAYWML/events.json","paper":"https://pith.science/paper/NOSHGRQ4"},"agent_actions":{"view_html":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML","download_json":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML.json","view_paper":"https://pith.science/paper/NOSHGRQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09643&json=true","fetch_graph":"https://pith.science/api/pith-number/NOSHGRQ4QYJFPXSU3JOOJAYWML/graph.json","fetch_events":"https://pith.science/api/pith-number/NOSHGRQ4QYJFPXSU3JOOJAYWML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/action/storage_attestation","attest_author":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/action/author_attestation","sign_citation":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/action/citation_signature","submit_replication":"https://pith.science/pith/NOSHGRQ4QYJFPXSU3JOOJAYWML/action/replication_record"}},"created_at":"2026-05-18T01:03:35.462481+00:00","updated_at":"2026-05-18T01:03:35.462481+00:00"}