{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WQWM6VOJKWNQGAN6F2HOB3MXEJ","short_pith_number":"pith:WQWM6VOJ","schema_version":"1.0","canonical_sha256":"b42ccf55c9559b0301be2e8ee0ed97225277d02ad3ab55be5ac92a9474caab57","source":{"kind":"arxiv","id":"2112.05724","version":1},"attestation_state":"computed","paper":{"title":"A Quantum Complexity Lowerbound from Differential Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","quant-ph"],"primary_cat":"hep-th","authors_text":"Adam R. Brown","submitted_at":"2021-12-10T18:28:01Z","abstract_excerpt":"The Bishop-Gromov bound -- a cousin of the focusing lemmas that Hawking and Penrose used to prove their black hole singularity theorems -- is a differential geometry result that upperbounds the rate of growth of volume of geodesic balls in terms of the Ricci curvature. In this paper, I apply the Bishop-Gromov bound to Nielsen's complexity geometry to prove lowerbounds on the quantum complexity of a typical unitary. For a broad class of penalty schedules, the typical complexity is shown to be exponentially large in the number of qubits. This technique gives results that are tighter than all kno"},"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":"2112.05724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-th","submitted_at":"2021-12-10T18:28:01Z","cross_cats_sorted":["math.DG","quant-ph"],"title_canon_sha256":"bdda578e3153cc31e9b96ae2f5664cbf228cd5f5006e36d00061fb9fdc1c0866","abstract_canon_sha256":"805035b834e79ab062a2123050d5632a374b0059336b8a4ea6e0ef4e9dbac749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:26.923909Z","signature_b64":"5p43KbIv280To6Xmfwtx2c/JCQy2YNtf7LYifnD47FZW/Gu3cHkhmsEZzGsqgMCfdCoQwUa1/E0ENWzkPpZNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b42ccf55c9559b0301be2e8ee0ed97225277d02ad3ab55be5ac92a9474caab57","last_reissued_at":"2026-07-05T05:54:26.923406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:26.923406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Complexity Lowerbound from Differential Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DG","quant-ph"],"primary_cat":"hep-th","authors_text":"Adam R. Brown","submitted_at":"2021-12-10T18:28:01Z","abstract_excerpt":"The Bishop-Gromov bound -- a cousin of the focusing lemmas that Hawking and Penrose used to prove their black hole singularity theorems -- is a differential geometry result that upperbounds the rate of growth of volume of geodesic balls in terms of the Ricci curvature. In this paper, I apply the Bishop-Gromov bound to Nielsen's complexity geometry to prove lowerbounds on the quantum complexity of a typical unitary. For a broad class of penalty schedules, the typical complexity is shown to be exponentially large in the number of qubits. This technique gives results that are tighter than all kno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.05724","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.05724/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":"2112.05724","created_at":"2026-07-05T05:54:26.923470+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.05724v1","created_at":"2026-07-05T05:54:26.923470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.05724","created_at":"2026-07-05T05:54:26.923470+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQWM6VOJKWNQ","created_at":"2026-07-05T05:54:26.923470+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQWM6VOJKWNQGAN6","created_at":"2026-07-05T05:54:26.923470+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQWM6VOJ","created_at":"2026-07-05T05:54:26.923470+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02817","citing_title":"Nielsen complexity with multiple cost factors","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ","json":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ.json","graph_json":"https://pith.science/api/pith-number/WQWM6VOJKWNQGAN6F2HOB3MXEJ/graph.json","events_json":"https://pith.science/api/pith-number/WQWM6VOJKWNQGAN6F2HOB3MXEJ/events.json","paper":"https://pith.science/paper/WQWM6VOJ"},"agent_actions":{"view_html":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ","download_json":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ.json","view_paper":"https://pith.science/paper/WQWM6VOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.05724&json=true","fetch_graph":"https://pith.science/api/pith-number/WQWM6VOJKWNQGAN6F2HOB3MXEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WQWM6VOJKWNQGAN6F2HOB3MXEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ/action/storage_attestation","attest_author":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ/action/author_attestation","sign_citation":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ/action/citation_signature","submit_replication":"https://pith.science/pith/WQWM6VOJKWNQGAN6F2HOB3MXEJ/action/replication_record"}},"created_at":"2026-07-05T05:54:26.923470+00:00","updated_at":"2026-07-05T05:54:26.923470+00:00"}