{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3GGXEONEJHA2C7STPS5WBOOF6J","short_pith_number":"pith:3GGXEONE","schema_version":"1.0","canonical_sha256":"d98d7239a449c1a17e537cbb60b9c5f247517acaf9622a14ad811adf9d5053e0","source":{"kind":"arxiv","id":"1207.6655","version":2},"attestation_state":"computed","paper":{"title":"A 2D Nearest-Neighbor Quantum Architecture for Factoring in Polylogarithmic Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Paul Pham","submitted_at":"2012-07-27T21:12:11Z","abstract_excerpt":"We contribute a 2D nearest-neighbor quantum architecture for Shor's algorithm to factor an $n$-bit number in $O(\\log^2(n))$ depth. Our implementation uses parallel phase estimation, constant-depth fanout and teleportation, and constant-depth carry-save modular addition. We derive upper bounds on the circuit resources of our architecture under a new 2D nearest-neighbor model which allows a classical controller and parallel, communicating modules. We also contribute a novel constant-depth circuit for unbounded quantum unfanout in our new model. Finally, we provide a comparison to all previous ne"},"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":"1207.6655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-07-27T21:12:11Z","cross_cats_sorted":["cs.DS","cs.ET"],"title_canon_sha256":"027f696bf9c2c31a4951cd5253ee1a3f7abb960dee2e2ab1639ad9ad8049a287","abstract_canon_sha256":"80efd6a29c6a2c974edec04747808c48210e451d65684aedb647564788dc8365"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.737670Z","signature_b64":"LRFertSlRMVaP4dANBShQBm8SIfhz0ZHEJ7EZL6qyG9Vr7fsQUuYnt/CFqYifJNUEPHiHKWiByiVwiFXDB24Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d98d7239a449c1a17e537cbb60b9c5f247517acaf9622a14ad811adf9d5053e0","last_reissued_at":"2026-05-18T03:27:32.737261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.737261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 2D Nearest-Neighbor Quantum Architecture for Factoring in Polylogarithmic Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.ET"],"primary_cat":"quant-ph","authors_text":"Krysta M. Svore, Paul Pham","submitted_at":"2012-07-27T21:12:11Z","abstract_excerpt":"We contribute a 2D nearest-neighbor quantum architecture for Shor's algorithm to factor an $n$-bit number in $O(\\log^2(n))$ depth. Our implementation uses parallel phase estimation, constant-depth fanout and teleportation, and constant-depth carry-save modular addition. We derive upper bounds on the circuit resources of our architecture under a new 2D nearest-neighbor model which allows a classical controller and parallel, communicating modules. We also contribute a novel constant-depth circuit for unbounded quantum unfanout in our new model. Finally, we provide a comparison to all previous ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6655","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":"1207.6655","created_at":"2026-05-18T03:27:32.737321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6655v2","created_at":"2026-05-18T03:27:32.737321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6655","created_at":"2026-05-18T03:27:32.737321+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GGXEONEJHA2","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GGXEONEJHA2C7ST","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GGXEONE","created_at":"2026-05-18T12:26:50.516681+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/3GGXEONEJHA2C7STPS5WBOOF6J","json":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J.json","graph_json":"https://pith.science/api/pith-number/3GGXEONEJHA2C7STPS5WBOOF6J/graph.json","events_json":"https://pith.science/api/pith-number/3GGXEONEJHA2C7STPS5WBOOF6J/events.json","paper":"https://pith.science/paper/3GGXEONE"},"agent_actions":{"view_html":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J","download_json":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J.json","view_paper":"https://pith.science/paper/3GGXEONE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6655&json=true","fetch_graph":"https://pith.science/api/pith-number/3GGXEONEJHA2C7STPS5WBOOF6J/graph.json","fetch_events":"https://pith.science/api/pith-number/3GGXEONEJHA2C7STPS5WBOOF6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J/action/storage_attestation","attest_author":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J/action/author_attestation","sign_citation":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J/action/citation_signature","submit_replication":"https://pith.science/pith/3GGXEONEJHA2C7STPS5WBOOF6J/action/replication_record"}},"created_at":"2026-05-18T03:27:32.737321+00:00","updated_at":"2026-05-18T03:27:32.737321+00:00"}