{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OGOYJKIDCZT2GN627QW6B4MJRZ","short_pith_number":"pith:OGOYJKID","schema_version":"1.0","canonical_sha256":"719d84a9031667a337dafc2de0f1898e5441b116758b3fad47052aed4af6add1","source":{"kind":"arxiv","id":"1511.07084","version":1},"attestation_state":"computed","paper":{"title":"Nested Quantum Annealing Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel A. Lidar, Tameem Albash, Walter Vinci","submitted_at":"2015-11-22T23:08:29Z","abstract_excerpt":"We present a general error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. Given any Ising model optimization problem, the encoding replaces each logical qubit by a complete graph of degree $C$, representing the distance of the error-correcting code. A subsequent minor-embedding step then implements the encoding on the underlying hardware graph of the quantum annealer. We demonstrate experimentally that the performance of a D-Wave Two quantum annealing device improves as $C$ grows. We show that the per"},"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":"1511.07084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-11-22T23:08:29Z","cross_cats_sorted":[],"title_canon_sha256":"a38683ae296f3f97747f700fac3d416bb5b7af6d04e0fbd2f5f3c0f2f4c630b8","abstract_canon_sha256":"363729ea92f23fc0ccfc4e7f5a8784ce88feefc9156615049e8f542b7609e217"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:40.929076Z","signature_b64":"w2nIIJl+jR1K5hqCp+wzi1ZtWLKgj2zWMq4AYsgMBwbrIS+Ov6JKEjNQgTP8JWKBYYulVmjpbcDd7+BRH+hdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"719d84a9031667a337dafc2de0f1898e5441b116758b3fad47052aed4af6add1","last_reissued_at":"2026-05-18T01:06:40.928481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:40.928481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nested Quantum Annealing Correction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel A. Lidar, Tameem Albash, Walter Vinci","submitted_at":"2015-11-22T23:08:29Z","abstract_excerpt":"We present a general error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. Given any Ising model optimization problem, the encoding replaces each logical qubit by a complete graph of degree $C$, representing the distance of the error-correcting code. A subsequent minor-embedding step then implements the encoding on the underlying hardware graph of the quantum annealer. We demonstrate experimentally that the performance of a D-Wave Two quantum annealing device improves as $C$ grows. We show that the per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07084","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":"1511.07084","created_at":"2026-05-18T01:06:40.928571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07084v1","created_at":"2026-05-18T01:06:40.928571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07084","created_at":"2026-05-18T01:06:40.928571+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGOYJKIDCZT2","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGOYJKIDCZT2GN62","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGOYJKID","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06857","citing_title":"Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics","ref_index":64,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ","json":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ.json","graph_json":"https://pith.science/api/pith-number/OGOYJKIDCZT2GN627QW6B4MJRZ/graph.json","events_json":"https://pith.science/api/pith-number/OGOYJKIDCZT2GN627QW6B4MJRZ/events.json","paper":"https://pith.science/paper/OGOYJKID"},"agent_actions":{"view_html":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ","download_json":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ.json","view_paper":"https://pith.science/paper/OGOYJKID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07084&json=true","fetch_graph":"https://pith.science/api/pith-number/OGOYJKIDCZT2GN627QW6B4MJRZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OGOYJKIDCZT2GN627QW6B4MJRZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ/action/storage_attestation","attest_author":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ/action/author_attestation","sign_citation":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ/action/citation_signature","submit_replication":"https://pith.science/pith/OGOYJKIDCZT2GN627QW6B4MJRZ/action/replication_record"}},"created_at":"2026-05-18T01:06:40.928571+00:00","updated_at":"2026-05-18T01:06:40.928571+00:00"}