{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PMX3BM3APSVIFGNQAZXQAD3I7S","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":"950054cc7e21d9a3cc34ef6a1f63135e4442ef145ab0e9655faae4153cb0fed8","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-05T13:26:26Z","title_canon_sha256":"a2761047fec4d57f62b1051252f89434170bb7cf97ed6f62a21117c0bfb76da7"},"schema_version":"1.0","source":{"id":"1908.01609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01609","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01609v1","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01609","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_12","alias_value":"PMX3BM3APSVI","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_16","alias_value":"PMX3BM3APSVIFGNQ","created_at":"2026-07-04T23:51:32Z"},{"alias_kind":"pith_short_8","alias_value":"PMX3BM3A","created_at":"2026-07-04T23:51:32Z"}],"graph_snapshots":[{"event_id":"sha256:579a550f700b528cc6f2bc2a13a5f7fda679588ef3fffaa2605f693b6357cd24","target":"graph","created_at":"2026-07-04T23:51:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01609/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Earl Campbell, Giovanni De Micheli, Giulia Meuli, Martin Roetteler, Mathias Soeken","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-05T13:26:26Z","title":"The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01609","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:1852c8195e3a0fc8ad84ed8231dee7059a3bc98865ddd2f677fa9fd485b04751","target":"record","created_at":"2026-07-04T23:51:32Z","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":"950054cc7e21d9a3cc34ef6a1f63135e4442ef145ab0e9655faae4153cb0fed8","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-05T13:26:26Z","title_canon_sha256":"a2761047fec4d57f62b1051252f89434170bb7cf97ed6f62a21117c0bfb76da7"},"schema_version":"1.0","source":{"id":"1908.01609","kind":"arxiv","version":1}},"canonical_sha256":"7b2fb0b3607caa8299b0066f000f68fc806b95cb9018e2d96ef2cdbacc99f8f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b2fb0b3607caa8299b0066f000f68fc806b95cb9018e2d96ef2cdbacc99f8f0","first_computed_at":"2026-07-04T23:51:32.158387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:51:32.158387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WE19JpDOSG8F3IwRpOfpV0hlfb0xfgfWIfn7dhF315tefdMERAAxqKlVcEzAZEGzzAabNoWdph3dePOQAJ/kDg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:51:32.158739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1852c8195e3a0fc8ad84ed8231dee7059a3bc98865ddd2f677fa9fd485b04751","sha256:579a550f700b528cc6f2bc2a13a5f7fda679588ef3fffaa2605f693b6357cd24"],"state_sha256":"d0831a7a6ccf320351ebbcb60148f7a965dd57fb09d91f4407fd9eab631b6398"}