{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MUDZXCXHUHDLT7LRNL6ER3EVJZ","short_pith_number":"pith:MUDZXCXH","schema_version":"1.0","canonical_sha256":"65079b8ae7a1c6b9fd716afc48ec954e71450dfc4fe72ed5401e2c26c15c1286","source":{"kind":"arxiv","id":"1706.02721","version":1},"attestation_state":"computed","paper":{"title":"Logic Synthesis for Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Giovanni De Micheli, Martin Roetteler, Mathias Soeken, Nathan Wiebe","submitted_at":"2017-06-08T18:10:02Z","abstract_excerpt":"We present a synthesis framework to map logic networks into quantum circuits for quantum computing. The synthesis framework is based on LUT networks (lookup-table networks), which play a key role in conventional logic synthesis. Establishing a connection between LUTs in a LUT network and reversible single-target gates in a reversible network allows us to bridge conventional logic synthesis with logic synthesis for quantum computing, despite several fundamental differences. We call our synthesis framework LUT-based Hierarchical Reversible Logic Synthesis (LHRS). Input to LHRS is a classical log"},"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":"1706.02721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-06-08T18:10:02Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"73b039bcb05ba9aa5375b9f58f69c51b78a19b6089f3377dbb7d54c564f34bc2","abstract_canon_sha256":"dea26d198607dd3f52ce9f79f1a1c42270c197fb476761d34819184a83f1d4a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:43.296208Z","signature_b64":"JI3zmiXRFAkPs1LQPa9yCzwTH0bYN+lGkMIqnYvMgqJVA2aU/jGDmsQzo+1n45z6vHKaA3gXtz0LWZ5dobgpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65079b8ae7a1c6b9fd716afc48ec954e71450dfc4fe72ed5401e2c26c15c1286","last_reissued_at":"2026-05-18T00:42:43.295574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:43.295574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logic Synthesis for Quantum Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Giovanni De Micheli, Martin Roetteler, Mathias Soeken, Nathan Wiebe","submitted_at":"2017-06-08T18:10:02Z","abstract_excerpt":"We present a synthesis framework to map logic networks into quantum circuits for quantum computing. The synthesis framework is based on LUT networks (lookup-table networks), which play a key role in conventional logic synthesis. Establishing a connection between LUTs in a LUT network and reversible single-target gates in a reversible network allows us to bridge conventional logic synthesis with logic synthesis for quantum computing, despite several fundamental differences. We call our synthesis framework LUT-based Hierarchical Reversible Logic Synthesis (LHRS). Input to LHRS is a classical log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02721","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":"1706.02721","created_at":"2026-05-18T00:42:43.295699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02721v1","created_at":"2026-05-18T00:42:43.295699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02721","created_at":"2026-05-18T00:42:43.295699+00:00"},{"alias_kind":"pith_short_12","alias_value":"MUDZXCXHUHDL","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MUDZXCXHUHDLT7LR","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MUDZXCXH","created_at":"2026-05-18T12:31:31.346846+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/MUDZXCXHUHDLT7LRNL6ER3EVJZ","json":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ.json","graph_json":"https://pith.science/api/pith-number/MUDZXCXHUHDLT7LRNL6ER3EVJZ/graph.json","events_json":"https://pith.science/api/pith-number/MUDZXCXHUHDLT7LRNL6ER3EVJZ/events.json","paper":"https://pith.science/paper/MUDZXCXH"},"agent_actions":{"view_html":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ","download_json":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ.json","view_paper":"https://pith.science/paper/MUDZXCXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02721&json=true","fetch_graph":"https://pith.science/api/pith-number/MUDZXCXHUHDLT7LRNL6ER3EVJZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MUDZXCXHUHDLT7LRNL6ER3EVJZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ/action/storage_attestation","attest_author":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ/action/author_attestation","sign_citation":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ/action/citation_signature","submit_replication":"https://pith.science/pith/MUDZXCXHUHDLT7LRNL6ER3EVJZ/action/replication_record"}},"created_at":"2026-05-18T00:42:43.295699+00:00","updated_at":"2026-05-18T00:42:43.295699+00:00"}