{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:FEN6QJ537CHSGJRN4IYMZVMS4B","short_pith_number":"pith:FEN6QJ53","schema_version":"1.0","canonical_sha256":"291be827bbf88f23262de230ccd592e04c83170884b496f40f89b1dfa4d65ab0","source":{"kind":"arxiv","id":"1001.3116","version":2},"attestation_state":"computed","paper":{"title":"Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Vicky Choi","submitted_at":"2010-01-18T18:09:22Z","abstract_excerpt":"In [Choi08], we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in a quantum hardware graph U is a subgraph of U such that G can be obtained from it by contracting edges. In this paper, we describe the intertwined adiabatic quantum architecture design problem, which is to construct a hardware graph U that satisfies all known physical constraints and, at the same time, permits an efficient minor-embedding algorithm. We illustrate an optimal complete-graph-minor hardware graph. Given a family F of graphs, a (host) graph U is called F-min"},"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":"1001.3116","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-01-18T18:09:22Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"9d10ba81aa883595f7e22a30601b5e954195430793868a0a0a303ae88cfc8b74","abstract_canon_sha256":"a4d23b697705c2029aa0cfd357024c2585d42d1bf0efe854898e90f449a5eeb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:00.737716Z","signature_b64":"0FkgXN471xOAl4RScT1fwaXCeQOBojFLNGk35qpdTJVFYy6A6mm1hHQBCdE/2RJeDzhRAmefM6phiZVKMze5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"291be827bbf88f23262de230ccd592e04c83170884b496f40f89b1dfa4d65ab0","last_reissued_at":"2026-05-18T04:21:00.737138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:00.737138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Vicky Choi","submitted_at":"2010-01-18T18:09:22Z","abstract_excerpt":"In [Choi08], we introduced the notion of minor-embedding in adiabatic quantum optimization. A minor-embedding of a graph G in a quantum hardware graph U is a subgraph of U such that G can be obtained from it by contracting edges. In this paper, we describe the intertwined adiabatic quantum architecture design problem, which is to construct a hardware graph U that satisfies all known physical constraints and, at the same time, permits an efficient minor-embedding algorithm. We illustrate an optimal complete-graph-minor hardware graph. Given a family F of graphs, a (host) graph U is called F-min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3116","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":"1001.3116","created_at":"2026-05-18T04:21:00.737230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.3116v2","created_at":"2026-05-18T04:21:00.737230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3116","created_at":"2026-05-18T04:21:00.737230+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEN6QJ537CHS","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEN6QJ537CHSGJRN","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEN6QJ53","created_at":"2026-05-18T12:26:07.630475+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/FEN6QJ537CHSGJRN4IYMZVMS4B","json":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B.json","graph_json":"https://pith.science/api/pith-number/FEN6QJ537CHSGJRN4IYMZVMS4B/graph.json","events_json":"https://pith.science/api/pith-number/FEN6QJ537CHSGJRN4IYMZVMS4B/events.json","paper":"https://pith.science/paper/FEN6QJ53"},"agent_actions":{"view_html":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B","download_json":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B.json","view_paper":"https://pith.science/paper/FEN6QJ53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.3116&json=true","fetch_graph":"https://pith.science/api/pith-number/FEN6QJ537CHSGJRN4IYMZVMS4B/graph.json","fetch_events":"https://pith.science/api/pith-number/FEN6QJ537CHSGJRN4IYMZVMS4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B/action/storage_attestation","attest_author":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B/action/author_attestation","sign_citation":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B/action/citation_signature","submit_replication":"https://pith.science/pith/FEN6QJ537CHSGJRN4IYMZVMS4B/action/replication_record"}},"created_at":"2026-05-18T04:21:00.737230+00:00","updated_at":"2026-05-18T04:21:00.737230+00:00"}