{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KYHW6HXYUTBL2XSGOBJFAFVJOI","short_pith_number":"pith:KYHW6HXY","schema_version":"1.0","canonical_sha256":"560f6f1ef8a4c2bd5e4670525016a9723c367f9831628f93e4552a4e170cb4bb","source":{"kind":"arxiv","id":"1112.0564","version":2},"attestation_state":"computed","paper":{"title":"Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Amlan Chakrabarti, Ayan Chaudhury, Susmita Sur-Kolay","submitted_at":"2011-12-02T16:30:08Z","abstract_excerpt":"Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as an important issue in terms of technological implementation for quantum computation. The objective is to obtain a LNN architecture with minimum gate cost. As achieving optimal synthesis is a hard problem, heuristic methods have been proposed in recent literature. In this work we present a graph partitioning based approach for LNN synthesis with reduction in circuit cost. In particular, the number of SWAP gates required to convert a given gate-level quantum circuit to its equivalent LNN configuration is minimized. Our"},"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":"1112.0564","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2011-12-02T16:30:08Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"825e44a92ce2e65912b3af99b64088296e3c5bcce1d00163abdc6dfeaaaba6cc","abstract_canon_sha256":"d59e64c539aa719e8da228be07f90c4d0c25d1238962daa6a500ddc24c20e166"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:28.125815Z","signature_b64":"VKOv7GKECdWGLEfrzm93U/a5ewhqeL/Lz+NPgxBrKKbr50odRH9I16Wu3ZqBoxNJ8BLT/EEEh0m8jE5iSe9hCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"560f6f1ef8a4c2bd5e4670525016a9723c367f9831628f93e4552a4e170cb4bb","last_reissued_at":"2026-05-18T02:21:28.125116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:28.125116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Amlan Chakrabarti, Ayan Chaudhury, Susmita Sur-Kolay","submitted_at":"2011-12-02T16:30:08Z","abstract_excerpt":"Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as an important issue in terms of technological implementation for quantum computation. The objective is to obtain a LNN architecture with minimum gate cost. As achieving optimal synthesis is a hard problem, heuristic methods have been proposed in recent literature. In this work we present a graph partitioning based approach for LNN synthesis with reduction in circuit cost. In particular, the number of SWAP gates required to convert a given gate-level quantum circuit to its equivalent LNN configuration is minimized. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0564","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":"1112.0564","created_at":"2026-05-18T02:21:28.125214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0564v2","created_at":"2026-05-18T02:21:28.125214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0564","created_at":"2026-05-18T02:21:28.125214+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYHW6HXYUTBL","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYHW6HXYUTBL2XSG","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYHW6HXY","created_at":"2026-05-18T12:26:34.985390+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/KYHW6HXYUTBL2XSGOBJFAFVJOI","json":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI.json","graph_json":"https://pith.science/api/pith-number/KYHW6HXYUTBL2XSGOBJFAFVJOI/graph.json","events_json":"https://pith.science/api/pith-number/KYHW6HXYUTBL2XSGOBJFAFVJOI/events.json","paper":"https://pith.science/paper/KYHW6HXY"},"agent_actions":{"view_html":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI","download_json":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI.json","view_paper":"https://pith.science/paper/KYHW6HXY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0564&json=true","fetch_graph":"https://pith.science/api/pith-number/KYHW6HXYUTBL2XSGOBJFAFVJOI/graph.json","fetch_events":"https://pith.science/api/pith-number/KYHW6HXYUTBL2XSGOBJFAFVJOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI/action/storage_attestation","attest_author":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI/action/author_attestation","sign_citation":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI/action/citation_signature","submit_replication":"https://pith.science/pith/KYHW6HXYUTBL2XSGOBJFAFVJOI/action/replication_record"}},"created_at":"2026-05-18T02:21:28.125214+00:00","updated_at":"2026-05-18T02:21:28.125214+00:00"}