{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:S6NESEK3RRQKPL553K3J3Z4LWW","short_pith_number":"pith:S6NESEK3","schema_version":"1.0","canonical_sha256":"979a49115b8c60a7afbddab69de78bb5b168a4d329b47277aac23bcc30135546","source":{"kind":"arxiv","id":"2405.16067","version":1},"attestation_state":"computed","paper":{"title":"Weaving Complex Graph on simple low-dimensional qubit lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hao-Yu Guan, Shyam Dhamapurkar, Xiao-Long Zhu, Xiu-Hao Deng, Yu-Hang Dang, Zheng-Yang Zhou","submitted_at":"2024-05-25T05:37:42Z","abstract_excerpt":"In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from simple qubit arrays, specifically grid lattices. The first approach utilizes a subset of qubits as tunable couplers, effectively yielding a range of non-trivial graph-based Hamiltonians. The second approach employs dynamic graph engineering by periodically activating and deactivating couplers, enabling the creation of effective quantum walks with longer-range c"},"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":"2405.16067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-25T05:37:42Z","cross_cats_sorted":[],"title_canon_sha256":"acf04184cd933360a3e95f59140e9cacfe91d1bc6a47cdfcd9ac2aa31bd6f3d3","abstract_canon_sha256":"2f58e2543ca995dc4d7c5f97510411fbcaa4131ffeff61ec33482624ec930c95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:25.193097Z","signature_b64":"Sb+YNAS96bqiszsawgen/nQLmtmmEyu8dL0WJpB8nYL+iAyFTMtvJS7j0bHUMsm14M3ChTlw+kkmCJTAwOqKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"979a49115b8c60a7afbddab69de78bb5b168a4d329b47277aac23bcc30135546","last_reissued_at":"2026-07-05T08:23:25.192648Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:25.192648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weaving Complex Graph on simple low-dimensional qubit lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hao-Yu Guan, Shyam Dhamapurkar, Xiao-Long Zhu, Xiu-Hao Deng, Yu-Hang Dang, Zheng-Yang Zhou","submitted_at":"2024-05-25T05:37:42Z","abstract_excerpt":"In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from simple qubit arrays, specifically grid lattices. The first approach utilizes a subset of qubits as tunable couplers, effectively yielding a range of non-trivial graph-based Hamiltonians. The second approach employs dynamic graph engineering by periodically activating and deactivating couplers, enabling the creation of effective quantum walks with longer-range c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.16067","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.16067/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":"2405.16067","created_at":"2026-07-05T08:23:25.192704+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.16067v1","created_at":"2026-07-05T08:23:25.192704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.16067","created_at":"2026-07-05T08:23:25.192704+00:00"},{"alias_kind":"pith_short_12","alias_value":"S6NESEK3RRQK","created_at":"2026-07-05T08:23:25.192704+00:00"},{"alias_kind":"pith_short_16","alias_value":"S6NESEK3RRQKPL55","created_at":"2026-07-05T08:23:25.192704+00:00"},{"alias_kind":"pith_short_8","alias_value":"S6NESEK3","created_at":"2026-07-05T08:23:25.192704+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/S6NESEK3RRQKPL553K3J3Z4LWW","json":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW.json","graph_json":"https://pith.science/api/pith-number/S6NESEK3RRQKPL553K3J3Z4LWW/graph.json","events_json":"https://pith.science/api/pith-number/S6NESEK3RRQKPL553K3J3Z4LWW/events.json","paper":"https://pith.science/paper/S6NESEK3"},"agent_actions":{"view_html":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW","download_json":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW.json","view_paper":"https://pith.science/paper/S6NESEK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.16067&json=true","fetch_graph":"https://pith.science/api/pith-number/S6NESEK3RRQKPL553K3J3Z4LWW/graph.json","fetch_events":"https://pith.science/api/pith-number/S6NESEK3RRQKPL553K3J3Z4LWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW/action/storage_attestation","attest_author":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW/action/author_attestation","sign_citation":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW/action/citation_signature","submit_replication":"https://pith.science/pith/S6NESEK3RRQKPL553K3J3Z4LWW/action/replication_record"}},"created_at":"2026-07-05T08:23:25.192704+00:00","updated_at":"2026-07-05T08:23:25.192704+00:00"}