{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PMX3BM3APSVIFGNQAZXQAD3I7S","short_pith_number":"pith:PMX3BM3A","schema_version":"1.0","canonical_sha256":"7b2fb0b3607caa8299b0066f000f68fc806b95cb9018e2d96ef2cdbacc99f8f0","source":{"kind":"arxiv","id":"1908.01609","version":1},"attestation_state":"computed","paper":{"title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Earl Campbell, Giovanni De Micheli, Giulia Meuli, Martin Roetteler, Mathias Soeken","submitted_at":"2019-08-05T13:26:26Z","abstract_excerpt":"We present a constructive method to create quantum circuits that implement oracles $|x\\rangle|y\\rangle|0\\rangle^k \\mapsto |x\\rangle|y \\oplus f(x)\\rangle|0\\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count. In our method $f$ is given as a 2-regular Boolean logic network over the gate basis $\\{\\land, \\oplus, 1\\}$. Our construction leads to circuits with a $T$-count that is at most four times the number of AND nodes in the network. In addition, we propose a SAT-based method that allows us to trade qubits for $T$ gates, and explore the space/complexity trade-off of quantum circui"},"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":"1908.01609","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-05T13:26:26Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"a2761047fec4d57f62b1051252f89434170bb7cf97ed6f62a21117c0bfb76da7","abstract_canon_sha256":"950054cc7e21d9a3cc34ef6a1f63135e4442ef145ab0e9655faae4153cb0fed8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:32.158739Z","signature_b64":"WE19JpDOSG8F3IwRpOfpV0hlfb0xfgfWIfn7dhF315tefdMERAAxqKlVcEzAZEGzzAabNoWdph3dePOQAJ/kDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b2fb0b3607caa8299b0066f000f68fc806b95cb9018e2d96ef2cdbacc99f8f0","last_reissued_at":"2026-07-04T23:51:32.158387Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:32.158387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Earl Campbell, Giovanni De Micheli, Giulia Meuli, Martin Roetteler, Mathias Soeken","submitted_at":"2019-08-05T13:26:26Z","abstract_excerpt":"We present a constructive method to create quantum circuits that implement oracles $|x\\rangle|y\\rangle|0\\rangle^k \\mapsto |x\\rangle|y \\oplus f(x)\\rangle|0\\rangle^k$ for $n$-variable Boolean functions $f$ with low $T$-count. In our method $f$ is given as a 2-regular Boolean logic network over the gate basis $\\{\\land, \\oplus, 1\\}$. Our construction leads to circuits with a $T$-count that is at most four times the number of AND nodes in the network. In addition, we propose a SAT-based method that allows us to trade qubits for $T$ gates, and explore the space/complexity trade-off of quantum circui"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01609","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/1908.01609/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":"1908.01609","created_at":"2026-07-04T23:51:32.158451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01609v1","created_at":"2026-07-04T23:51:32.158451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01609","created_at":"2026-07-04T23:51:32.158451+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMX3BM3APSVI","created_at":"2026-07-04T23:51:32.158451+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMX3BM3APSVIFGNQ","created_at":"2026-07-04T23:51:32.158451+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMX3BM3A","created_at":"2026-07-04T23:51:32.158451+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/PMX3BM3APSVIFGNQAZXQAD3I7S","json":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S.json","graph_json":"https://pith.science/api/pith-number/PMX3BM3APSVIFGNQAZXQAD3I7S/graph.json","events_json":"https://pith.science/api/pith-number/PMX3BM3APSVIFGNQAZXQAD3I7S/events.json","paper":"https://pith.science/paper/PMX3BM3A"},"agent_actions":{"view_html":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S","download_json":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S.json","view_paper":"https://pith.science/paper/PMX3BM3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01609&json=true","fetch_graph":"https://pith.science/api/pith-number/PMX3BM3APSVIFGNQAZXQAD3I7S/graph.json","fetch_events":"https://pith.science/api/pith-number/PMX3BM3APSVIFGNQAZXQAD3I7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S/action/storage_attestation","attest_author":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S/action/author_attestation","sign_citation":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S/action/citation_signature","submit_replication":"https://pith.science/pith/PMX3BM3APSVIFGNQAZXQAD3I7S/action/replication_record"}},"created_at":"2026-07-04T23:51:32.158451+00:00","updated_at":"2026-07-04T23:51:32.158451+00:00"}