{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QJFVDCC5LLMWF2J3LD5KDS6KAM","short_pith_number":"pith:QJFVDCC5","schema_version":"1.0","canonical_sha256":"824b51885d5ad962e93b58faa1cbca03386923c274cbc8e8ec381087d51ef371","source":{"kind":"arxiv","id":"1105.5831","version":2},"attestation_state":"computed","paper":{"title":"Reducing Quantum Cost in Reversible Toffoli Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Marek Szyprowski, Pawel Kerntopf","submitted_at":"2011-05-29T21:43:27Z","abstract_excerpt":"Recently, reversible circuit synthesis has been intensively studied. One of the problems that has not been solved for a long time was exact minimization of gate count (GC) in 4-bit circuits. Finally, last year a tool of practical usage for finding optimal gate count Toffoli networks for any 4-variable function was developed. However, not much work has been done yet on exact minimization of quantum cost (QC) in 4-bit circuits. This paper presents an application of the above mentioned tool to reducing QC of 4-bit reversible circuits. It is shown that for benchmarks and for designs taken from rec"},"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":"1105.5831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2011-05-29T21:43:27Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"d949733e935a7f15329184d679b23120a90c9118ba3861bf28fbc0fd472b652d","abstract_canon_sha256":"72679f895dc1acc27604317330b08c114e645964e3046a9f0a910b5064214387"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:35.814266Z","signature_b64":"lgsh+RwaqGKMi6PiMgTidLe4QWW/ICqL+hDvBSRNwO1UtKfSodsCFL4dQv0OBxh+WVEP8Z5FDH69NLHZUF+wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"824b51885d5ad962e93b58faa1cbca03386923c274cbc8e8ec381087d51ef371","last_reissued_at":"2026-05-18T04:10:35.813630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:35.813630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing Quantum Cost in Reversible Toffoli Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Marek Szyprowski, Pawel Kerntopf","submitted_at":"2011-05-29T21:43:27Z","abstract_excerpt":"Recently, reversible circuit synthesis has been intensively studied. One of the problems that has not been solved for a long time was exact minimization of gate count (GC) in 4-bit circuits. Finally, last year a tool of practical usage for finding optimal gate count Toffoli networks for any 4-variable function was developed. However, not much work has been done yet on exact minimization of quantum cost (QC) in 4-bit circuits. This paper presents an application of the above mentioned tool to reducing QC of 4-bit reversible circuits. It is shown that for benchmarks and for designs taken from rec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5831","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":""},"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":"1105.5831","created_at":"2026-05-18T04:10:35.813730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5831v2","created_at":"2026-05-18T04:10:35.813730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5831","created_at":"2026-05-18T04:10:35.813730+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJFVDCC5LLMW","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJFVDCC5LLMWF2J3","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJFVDCC5","created_at":"2026-05-18T12:26:39.201973+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/QJFVDCC5LLMWF2J3LD5KDS6KAM","json":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM.json","graph_json":"https://pith.science/api/pith-number/QJFVDCC5LLMWF2J3LD5KDS6KAM/graph.json","events_json":"https://pith.science/api/pith-number/QJFVDCC5LLMWF2J3LD5KDS6KAM/events.json","paper":"https://pith.science/paper/QJFVDCC5"},"agent_actions":{"view_html":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM","download_json":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM.json","view_paper":"https://pith.science/paper/QJFVDCC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5831&json=true","fetch_graph":"https://pith.science/api/pith-number/QJFVDCC5LLMWF2J3LD5KDS6KAM/graph.json","fetch_events":"https://pith.science/api/pith-number/QJFVDCC5LLMWF2J3LD5KDS6KAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM/action/storage_attestation","attest_author":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM/action/author_attestation","sign_citation":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM/action/citation_signature","submit_replication":"https://pith.science/pith/QJFVDCC5LLMWF2J3LD5KDS6KAM/action/replication_record"}},"created_at":"2026-05-18T04:10:35.813730+00:00","updated_at":"2026-05-18T04:10:35.813730+00:00"}