{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H24VRD5LKQOFAJ4NO2TER56JN7","short_pith_number":"pith:H24VRD5L","schema_version":"1.0","canonical_sha256":"3eb9588fab541c50278d76a648f7c96fd83f8b9b12a87545bae3b41a8e870453","source":{"kind":"arxiv","id":"1709.04972","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Embedding Quantum-Dot Cellular Automata Networks onto a Quantum Annealing Processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"(2) D-Wave Systems Inc., Aidan Roy (2), Burnaby, Canada, Canada), Jacob Retallick (1), Konrad Walus (1) ((1) The University of British Columbia, Mark Johnson (2), Michael Babcock (1), Miguel Aroca-Ouellette (1), Shane McNamara (1), Steve Wilton (1), Vancouver","submitted_at":"2017-09-14T20:50:12Z","abstract_excerpt":"Advancements in computing based on qubit networks, and in particular the flux-qubit processor architecture developed by D-Wave System's Inc., have enabled the physical simulation of quantum-dot cellular automata (QCA) networks beyond the limit of classical methods. However, the embedding of QCA networks onto the available processor architecture is a key challenge in preparing such simulations. In this work, two approaches to embedding QCA circuits are characterized: a dense placement algorithm that uses a routing method based on negotiated congestion; and a heuristic method implemented in D-Wa"},"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":"1709.04972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-14T20:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"10aaa1180d86deca973f5f25d82bc4ea0c9d69eccc1e1c20ac0bcdec7ecfd650","abstract_canon_sha256":"f7ec95e4dc0c4cf0701bb52eacd9eb81e5688fce6f45667a46df6a0e3d46aca3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:08.713855Z","signature_b64":"ThFEIQqmj24TwjJWHt7G+FdahdLj7DqpqCF1DWyiV7JgurE9ny5GzlniellZR2ruIR7SZ5OSKYXR6S1nC/7oCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3eb9588fab541c50278d76a648f7c96fd83f8b9b12a87545bae3b41a8e870453","last_reissued_at":"2026-05-18T00:35:08.713454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:08.713454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Embedding Quantum-Dot Cellular Automata Networks onto a Quantum Annealing Processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"(2) D-Wave Systems Inc., Aidan Roy (2), Burnaby, Canada, Canada), Jacob Retallick (1), Konrad Walus (1) ((1) The University of British Columbia, Mark Johnson (2), Michael Babcock (1), Miguel Aroca-Ouellette (1), Shane McNamara (1), Steve Wilton (1), Vancouver","submitted_at":"2017-09-14T20:50:12Z","abstract_excerpt":"Advancements in computing based on qubit networks, and in particular the flux-qubit processor architecture developed by D-Wave System's Inc., have enabled the physical simulation of quantum-dot cellular automata (QCA) networks beyond the limit of classical methods. However, the embedding of QCA networks onto the available processor architecture is a key challenge in preparing such simulations. In this work, two approaches to embedding QCA circuits are characterized: a dense placement algorithm that uses a routing method based on negotiated congestion; and a heuristic method implemented in D-Wa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04972","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":"1709.04972","created_at":"2026-05-18T00:35:08.713517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04972v1","created_at":"2026-05-18T00:35:08.713517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04972","created_at":"2026-05-18T00:35:08.713517+00:00"},{"alias_kind":"pith_short_12","alias_value":"H24VRD5LKQOF","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H24VRD5LKQOFAJ4N","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H24VRD5L","created_at":"2026-05-18T12:31:18.294218+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/H24VRD5LKQOFAJ4NO2TER56JN7","json":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7.json","graph_json":"https://pith.science/api/pith-number/H24VRD5LKQOFAJ4NO2TER56JN7/graph.json","events_json":"https://pith.science/api/pith-number/H24VRD5LKQOFAJ4NO2TER56JN7/events.json","paper":"https://pith.science/paper/H24VRD5L"},"agent_actions":{"view_html":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7","download_json":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7.json","view_paper":"https://pith.science/paper/H24VRD5L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04972&json=true","fetch_graph":"https://pith.science/api/pith-number/H24VRD5LKQOFAJ4NO2TER56JN7/graph.json","fetch_events":"https://pith.science/api/pith-number/H24VRD5LKQOFAJ4NO2TER56JN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7/action/storage_attestation","attest_author":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7/action/author_attestation","sign_citation":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7/action/citation_signature","submit_replication":"https://pith.science/pith/H24VRD5LKQOFAJ4NO2TER56JN7/action/replication_record"}},"created_at":"2026-05-18T00:35:08.713517+00:00","updated_at":"2026-05-18T00:35:08.713517+00:00"}