{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3NWWISKQALE2FFMYPKCKYUSV2Y","short_pith_number":"pith:3NWWISKQ","schema_version":"1.0","canonical_sha256":"db6d64495002c9a295987a84ac5255d638078fe79a82972872b1ebdcc6d57c4c","source":{"kind":"arxiv","id":"2402.19114","version":2},"attestation_state":"computed","paper":{"title":"Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ryoji Miyazaki, Takashi Imoto, Yuichiro Matsuzaki, Yuki Susa","submitted_at":"2024-02-29T12:47:29Z","abstract_excerpt":"Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures for quantum computation: gate-based quantum computers and quantum annealing. In gate-based quantum computation, we implement a sequence of quantum gates that manipulate qubits. This approach allows us to perform universal quantum computation, yet they pose significant experimental challenges for large-scale integration. On the other hand, with quantum annea"},"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":"2402.19114","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-02-29T12:47:29Z","cross_cats_sorted":[],"title_canon_sha256":"8f845031d32206d4831eebe70d25899dd4575099807e9adb9665631f78d0c3f7","abstract_canon_sha256":"ba5d1b09080ad783e24e71872c25447bfdff40a5a6c0480195d3e34f6185f51b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:15.631088Z","signature_b64":"z/fL9YWOY93LV++cx2RM/8wdPlbntZ7ocpMeFD41NH1jrOt+eGUFnqNmOY6hmf8BZ2N5rkugstyHpeE+iYgxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db6d64495002c9a295987a84ac5255d638078fe79a82972872b1ebdcc6d57c4c","last_reissued_at":"2026-07-05T10:29:15.630431Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:15.630431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ryoji Miyazaki, Takashi Imoto, Yuichiro Matsuzaki, Yuki Susa","submitted_at":"2024-02-29T12:47:29Z","abstract_excerpt":"Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures for quantum computation: gate-based quantum computers and quantum annealing. In gate-based quantum computation, we implement a sequence of quantum gates that manipulate qubits. This approach allows us to perform universal quantum computation, yet they pose significant experimental challenges for large-scale integration. On the other hand, with quantum annea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.19114","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.19114/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2402.19114","created_at":"2026-07-05T10:29:15.630508+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.19114v2","created_at":"2026-07-05T10:29:15.630508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.19114","created_at":"2026-07-05T10:29:15.630508+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NWWISKQALE2","created_at":"2026-07-05T10:29:15.630508+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NWWISKQALE2FFMY","created_at":"2026-07-05T10:29:15.630508+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NWWISKQ","created_at":"2026-07-05T10:29:15.630508+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01227","citing_title":"Polynomial equivalence of the global transverse-field Ising model and the gate model of quantum computation","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2603.15534","citing_title":"Analog-Digital Quantum Computing with Quantum Annealing Processors","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y","json":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y.json","graph_json":"https://pith.science/api/pith-number/3NWWISKQALE2FFMYPKCKYUSV2Y/graph.json","events_json":"https://pith.science/api/pith-number/3NWWISKQALE2FFMYPKCKYUSV2Y/events.json","paper":"https://pith.science/paper/3NWWISKQ"},"agent_actions":{"view_html":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y","download_json":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y.json","view_paper":"https://pith.science/paper/3NWWISKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.19114&json=true","fetch_graph":"https://pith.science/api/pith-number/3NWWISKQALE2FFMYPKCKYUSV2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/3NWWISKQALE2FFMYPKCKYUSV2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y/action/storage_attestation","attest_author":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y/action/author_attestation","sign_citation":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y/action/citation_signature","submit_replication":"https://pith.science/pith/3NWWISKQALE2FFMYPKCKYUSV2Y/action/replication_record"}},"created_at":"2026-07-05T10:29:15.630508+00:00","updated_at":"2026-07-05T10:29:15.630508+00:00"}