{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2AHH4SOZFCHTUVKPIAHQ2GCEO2","short_pith_number":"pith:2AHH4SOZ","schema_version":"1.0","canonical_sha256":"d00e7e49d9288f3a554f400f0d184476a3ab2f0bda168d209f08b2c2ac42dbce","source":{"kind":"arxiv","id":"1703.08540","version":1},"attestation_state":"computed","paper":{"title":"Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Anupam Chattopadhyay, Debjyoti Bhattacharjee","submitted_at":"2017-03-24T02:19:45Z","abstract_excerpt":"A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction between two qubits is undesirable since, it can be interpreted as a noise. Therefore, multiple quantum technologies and quantum error correcting codes strongly require the interacting qubits to be arranged in a nearest neighbor (NN) fashion. The current literature on converting a given quantum circuit to an NN-arranged one mainly considered chained qubit topo"},"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":"1703.08540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-03-24T02:19:45Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"4c48ee32a3d0d2bbe38390b98e7ee88d538b9481d48b86521f63369eea5ce93b","abstract_canon_sha256":"71c65b9b701f4327696af105dd8b772d5e8575bdec48a9b953dfa966f0e5be2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:56.161446Z","signature_b64":"lWhe2+vThHVHmVBUK7lrFH+/MhT7NJR4IG9bs3RZ/V8c8xRooKbrRTIHHRjuex+vXQ61OM7qS/l+IlodqzpuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d00e7e49d9288f3a554f400f0d184476a3ab2f0bda168d209f08b2c2ac42dbce","last_reissued_at":"2026-05-18T00:47:56.160792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:56.160792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Anupam Chattopadhyay, Debjyoti Bhattacharjee","submitted_at":"2017-03-24T02:19:45Z","abstract_excerpt":"A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction between two qubits is undesirable since, it can be interpreted as a noise. Therefore, multiple quantum technologies and quantum error correcting codes strongly require the interacting qubits to be arranged in a nearest neighbor (NN) fashion. The current literature on converting a given quantum circuit to an NN-arranged one mainly considered chained qubit topo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08540","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":"1703.08540","created_at":"2026-05-18T00:47:56.160890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.08540v1","created_at":"2026-05-18T00:47:56.160890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08540","created_at":"2026-05-18T00:47:56.160890+00:00"},{"alias_kind":"pith_short_12","alias_value":"2AHH4SOZFCHT","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2AHH4SOZFCHTUVKP","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2AHH4SOZ","created_at":"2026-05-18T12:30:55.937587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.21718","citing_title":"An Exact Branch and Bound Algorithm for the generalized Qubit Mapping Problem","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2","json":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2.json","graph_json":"https://pith.science/api/pith-number/2AHH4SOZFCHTUVKPIAHQ2GCEO2/graph.json","events_json":"https://pith.science/api/pith-number/2AHH4SOZFCHTUVKPIAHQ2GCEO2/events.json","paper":"https://pith.science/paper/2AHH4SOZ"},"agent_actions":{"view_html":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2","download_json":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2.json","view_paper":"https://pith.science/paper/2AHH4SOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.08540&json=true","fetch_graph":"https://pith.science/api/pith-number/2AHH4SOZFCHTUVKPIAHQ2GCEO2/graph.json","fetch_events":"https://pith.science/api/pith-number/2AHH4SOZFCHTUVKPIAHQ2GCEO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2/action/storage_attestation","attest_author":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2/action/author_attestation","sign_citation":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2/action/citation_signature","submit_replication":"https://pith.science/pith/2AHH4SOZFCHTUVKPIAHQ2GCEO2/action/replication_record"}},"created_at":"2026-05-18T00:47:56.160890+00:00","updated_at":"2026-05-18T00:47:56.160890+00:00"}