{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:J7WQNEE2QJAZJEJF2W355KMDPG","short_pith_number":"pith:J7WQNEE2","schema_version":"1.0","canonical_sha256":"4fed06909a8241949125d5b7dea98379a53f7d97253f7ff058996e0e835a283f","source":{"kind":"arxiv","id":"2512.16400","version":2},"attestation_state":"computed","paper":{"title":"Coined Quantum Walks on Complex Networks for Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Dual-register encoding lets quantum circuits run coined walks on complex networks with depth scaling as N to the 1.9","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rei Sato","submitted_at":"2025-12-18T10:55:55Z","abstract_excerpt":"We propose a quantum circuit design for implementing coined quantum walks on complex networks. In complex networks, the coin and shift operators depend on the varying degrees of the nodes, which makes circuit construction more challenging than for regular networks. To address this issue, we use a dual-register encoding to enable a simplified shift operator and reduces the resource overhead. We implement the circuit using Qmod, a high-level quantum programming language, and evaluated the performance through numerical simulations on Erd\\H{o}s-R\\'enyi, Watts-Strogatz, and Barab\\'asi-Albert models"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2512.16400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-12-18T10:55:55Z","cross_cats_sorted":[],"title_canon_sha256":"9e6f84c3b0666d242c43b44c6e9329389c4f0b719f773f1276da292af50c3825","abstract_canon_sha256":"8bcb79da5932de1efd74760015bb7e9589f67ee02eaa64f701f0bcd08d76340d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:18.820992Z","signature_b64":"tD3mU+Su51QokNRWr4umKLLWm9z+RIMBJT5aJQLTnmgu5RSUNbFwxxhuTv2hVUTBPpLBgq+i3qgH+T10wikIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fed06909a8241949125d5b7dea98379a53f7d97253f7ff058996e0e835a283f","last_reissued_at":"2026-05-20T00:04:18.820261Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:18.820261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coined Quantum Walks on Complex Networks for Quantum Computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Dual-register encoding lets quantum circuits run coined walks on complex networks with depth scaling as N to the 1.9","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rei Sato","submitted_at":"2025-12-18T10:55:55Z","abstract_excerpt":"We propose a quantum circuit design for implementing coined quantum walks on complex networks. In complex networks, the coin and shift operators depend on the varying degrees of the nodes, which makes circuit construction more challenging than for regular networks. To address this issue, we use a dual-register encoding to enable a simplified shift operator and reduces the resource overhead. We implement the circuit using Qmod, a high-level quantum programming language, and evaluated the performance through numerical simulations on Erd\\H{o}s-R\\'enyi, Watts-Strogatz, and Barab\\'asi-Albert models"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The results show that the circuit depth scales as approximately N^{1.9} regardless of the network topology.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the dual-register encoding faithfully reproduces the coined walk dynamics on arbitrary degree sequences without introducing systematic bias or extra depth that grows faster than the reported scaling for large N.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Dual-register encoding enables coined quantum walks on degree-varying complex networks with circuit depth scaling as N^1.9, shown via simulations on standard models and small IBM hardware executions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Dual-register encoding lets quantum circuits run coined walks on complex networks with depth scaling as N to the 1.9","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"456bbeb07b3ef93c897d2f13170fcd97c845d384174873be809e1347741f3c54"},"source":{"id":"2512.16400","kind":"arxiv","version":2},"verdict":{"id":"6f9f5f6e-e09f-492c-982d-883cf23a3691","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T21:23:01.812443Z","strongest_claim":"The results show that the circuit depth scales as approximately N^{1.9} regardless of the network topology.","one_line_summary":"Dual-register encoding enables coined quantum walks on degree-varying complex networks with circuit depth scaling as N^1.9, shown via simulations on standard models and small IBM hardware executions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the dual-register encoding faithfully reproduces the coined walk dynamics on arbitrary degree sequences without introducing systematic bias or extra depth that grows faster than the reported scaling for large N.","pith_extraction_headline":"Dual-register encoding lets quantum circuits run coined walks on complex networks with depth scaling as N to the 1.9"},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.16400/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":42,"sample":[{"doi":"","year":2020,"title":"S. Marsh and J. B. Wang. Combinatorial opti- mization via quantum walks. Physical Review A , 101(5):052319, 2020. 7","work_id":"c20f2b13-960d-4143-9091-8044d9e5dee6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"A quantum walk model of financial op- tions","work_id":"58ed099c-a10f-48cf-b9ec-c492121bcaf7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Qfold: quan- tum walks and deep learning to solve protein folding","work_id":"a5388ac3-c8b9-4e63-972d-7954a7ef97b5","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Childs and Jeffrey Goldstone","work_id":"01095e54-c7e2-458c-894b-3165e947f513","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"Y. Aharonov, L. Davidovich, and N. Zagury. Quan- tum random walks. Phys. Rev. A , 48:1687–1690, Aug 1993","work_id":"c8ba7263-6ef4-4bd9-841b-db11338814cb","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":42,"snapshot_sha256":"d5993351fbb5223f1fc120b703a21201432f7243a954e69286226a39df1d10ba","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":"2512.16400","created_at":"2026-05-20T00:04:18.820377+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.16400v2","created_at":"2026-05-20T00:04:18.820377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.16400","created_at":"2026-05-20T00:04:18.820377+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7WQNEE2QJAZ","created_at":"2026-05-20T00:04:18.820377+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7WQNEE2QJAZJEJF","created_at":"2026-05-20T00:04:18.820377+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7WQNEE2","created_at":"2026-05-20T00:04:18.820377+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/J7WQNEE2QJAZJEJF2W355KMDPG","json":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG.json","graph_json":"https://pith.science/api/pith-number/J7WQNEE2QJAZJEJF2W355KMDPG/graph.json","events_json":"https://pith.science/api/pith-number/J7WQNEE2QJAZJEJF2W355KMDPG/events.json","paper":"https://pith.science/paper/J7WQNEE2"},"agent_actions":{"view_html":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG","download_json":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG.json","view_paper":"https://pith.science/paper/J7WQNEE2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.16400&json=true","fetch_graph":"https://pith.science/api/pith-number/J7WQNEE2QJAZJEJF2W355KMDPG/graph.json","fetch_events":"https://pith.science/api/pith-number/J7WQNEE2QJAZJEJF2W355KMDPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG/action/storage_attestation","attest_author":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG/action/author_attestation","sign_citation":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG/action/citation_signature","submit_replication":"https://pith.science/pith/J7WQNEE2QJAZJEJF2W355KMDPG/action/replication_record"}},"created_at":"2026-05-20T00:04:18.820377+00:00","updated_at":"2026-05-20T00:04:18.820377+00:00"}