{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X5IAF4ONS3XBUHQAPQO57LYSXM","short_pith_number":"pith:X5IAF4ON","schema_version":"1.0","canonical_sha256":"bf5002f1cd96ee1a1e007c1ddfaf12bb0e1f9bb5be08dfaa98c1be4ec3a1af7c","source":{"kind":"arxiv","id":"1904.01124","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds on the non-Clifford resources for quantum computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl Campbell, Mark Howard, Michael Beverland, Vadym Kliuchnikov","submitted_at":"2019-04-01T21:57:16Z","abstract_excerpt":"We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. Our bounds apply to adaptive computations using measurements and an arbitrary number of stabilizer ancillas. We consider (1) resource state conversion, (2) single-qubit unitary synthesis, and (3) computational tasks.\n  To prove our resource conversion bounds we introduce two new monotones, the stabilizer nullity and the dyadic monotone, and make use of the already-known stabilizer extent. We consider conversions that "},"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":"1904.01124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-04-01T21:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"e52dd375209395272806ac58da1c83bb72718a9cf3c8ba7922d0aa77ed0979db","abstract_canon_sha256":"f94c600fdbd79706f89b13bb34f91a6c2fd7b3995c1fa3a0a7a549aae5f7f939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:52:52.748450Z","signature_b64":"9ONFao3i0yfc65H5BVMmkqPpDlRasHEWTK/6GjIQ67X74cmMd4iIqFdB6TD61JqoWLwN0AexKAdq/Bf2B4+lAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf5002f1cd96ee1a1e007c1ddfaf12bb0e1f9bb5be08dfaa98c1be4ec3a1af7c","last_reissued_at":"2026-07-05T03:52:52.747938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:52:52.747938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds on the non-Clifford resources for quantum computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl Campbell, Mark Howard, Michael Beverland, Vadym Kliuchnikov","submitted_at":"2019-04-01T21:57:16Z","abstract_excerpt":"We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. Our bounds apply to adaptive computations using measurements and an arbitrary number of stabilizer ancillas. We consider (1) resource state conversion, (2) single-qubit unitary synthesis, and (3) computational tasks.\n  To prove our resource conversion bounds we introduce two new monotones, the stabilizer nullity and the dyadic monotone, and make use of the already-known stabilizer extent. We consider conversions that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01124","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/1904.01124/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":"1904.01124","created_at":"2026-07-05T03:52:52.748002+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01124v2","created_at":"2026-07-05T03:52:52.748002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01124","created_at":"2026-07-05T03:52:52.748002+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5IAF4ONS3XB","created_at":"2026-07-05T03:52:52.748002+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5IAF4ONS3XBUHQA","created_at":"2026-07-05T03:52:52.748002+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5IAF4ON","created_at":"2026-07-05T03:52:52.748002+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08508","citing_title":"Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward","ref_index":29,"is_internal_anchor":true},{"citing_arxiv_id":"2605.30108","citing_title":"Asymptotic magic state distillation with almost linear rate","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21276","citing_title":"Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2409.17595","citing_title":"Magic state cultivation: growing T states as cheap as CNOT gates","ref_index":110,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10122","citing_title":"Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli Operation","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM","json":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM.json","graph_json":"https://pith.science/api/pith-number/X5IAF4ONS3XBUHQAPQO57LYSXM/graph.json","events_json":"https://pith.science/api/pith-number/X5IAF4ONS3XBUHQAPQO57LYSXM/events.json","paper":"https://pith.science/paper/X5IAF4ON"},"agent_actions":{"view_html":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM","download_json":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM.json","view_paper":"https://pith.science/paper/X5IAF4ON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01124&json=true","fetch_graph":"https://pith.science/api/pith-number/X5IAF4ONS3XBUHQAPQO57LYSXM/graph.json","fetch_events":"https://pith.science/api/pith-number/X5IAF4ONS3XBUHQAPQO57LYSXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM/action/storage_attestation","attest_author":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM/action/author_attestation","sign_citation":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM/action/citation_signature","submit_replication":"https://pith.science/pith/X5IAF4ONS3XBUHQAPQO57LYSXM/action/replication_record"}},"created_at":"2026-07-05T03:52:52.748002+00:00","updated_at":"2026-07-05T03:52:52.748002+00:00"}