{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L4J6WB5RRWRTUZPZXAWRXWDOBM","short_pith_number":"pith:L4J6WB5R","schema_version":"1.0","canonical_sha256":"5f13eb07b18da33a65f9b82d1bd86e0b2239f4df4616283b1ab80f9f6744a92c","source":{"kind":"arxiv","id":"2510.14905","version":3},"attestation_state":"computed","paper":{"title":"Quantum circuit model for continuous-time quantum walks on random graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rohit Kishan Ray, Rohit Sarma Sarkar, Sabyasachi Chakraborty, Sonjoy Majumder","submitted_at":"2025-10-16T17:24:14Z","abstract_excerpt":"Quantum-circuit implementations of continuous-time quantum walks (CTQWs) can provide an efficient route to model graph-based algorithms. However, constructing circuits that faithfully reproduce CTQW dynamics across arbitrary graphs remains a major challenge. In this work, we introduce a Laplacian partitioning algorithm (LPA) that enables an efficient and scalable quantum-circuit realization of CTQWs on random graphs. A common algorithm to simulate a general graph (of size $N = 2^n$ for $n$ qubits) on a quantum circuit is based on Pauli decomposition of the graph Hamiltonian, which can yield $O"},"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":"2510.14905","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-10-16T17:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"f00a05e01931f356b733232dc5beb5948ed3f9a3f631f22220a4f0c87c6cbb7d","abstract_canon_sha256":"6de3c57c24fe58c96e69ef6f1ebbe2b1de2338b1d7b81867ed68fdc34b22cfc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:03.175989Z","signature_b64":"xKJ+TqqJrg3D+vMlmEnuXug0PrCW0kcjO4h/YG2wtPFxOX9JX0M7poTSB2VZKzSYZoDLgwrhG7JZSDUUroSYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f13eb07b18da33a65f9b82d1bd86e0b2239f4df4616283b1ab80f9f6744a92c","last_reissued_at":"2026-05-26T02:05:03.175055Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:03.175055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum circuit model for continuous-time quantum walks on random graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rohit Kishan Ray, Rohit Sarma Sarkar, Sabyasachi Chakraborty, Sonjoy Majumder","submitted_at":"2025-10-16T17:24:14Z","abstract_excerpt":"Quantum-circuit implementations of continuous-time quantum walks (CTQWs) can provide an efficient route to model graph-based algorithms. However, constructing circuits that faithfully reproduce CTQW dynamics across arbitrary graphs remains a major challenge. In this work, we introduce a Laplacian partitioning algorithm (LPA) that enables an efficient and scalable quantum-circuit realization of CTQWs on random graphs. A common algorithm to simulate a general graph (of size $N = 2^n$ for $n$ qubits) on a quantum circuit is based on Pauli decomposition of the graph Hamiltonian, which can yield $O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.14905","kind":"arxiv","version":3},"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/2510.14905/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":"2510.14905","created_at":"2026-05-26T02:05:03.175213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.14905v3","created_at":"2026-05-26T02:05:03.175213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.14905","created_at":"2026-05-26T02:05:03.175213+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4J6WB5RRWRT","created_at":"2026-05-26T02:05:03.175213+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4J6WB5RRWRTUZPZ","created_at":"2026-05-26T02:05:03.175213+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4J6WB5R","created_at":"2026-05-26T02:05:03.175213+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.16400","citing_title":"Coined Quantum Walks on Complex Networks for Quantum Computers","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM","json":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM.json","graph_json":"https://pith.science/api/pith-number/L4J6WB5RRWRTUZPZXAWRXWDOBM/graph.json","events_json":"https://pith.science/api/pith-number/L4J6WB5RRWRTUZPZXAWRXWDOBM/events.json","paper":"https://pith.science/paper/L4J6WB5R"},"agent_actions":{"view_html":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM","download_json":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM.json","view_paper":"https://pith.science/paper/L4J6WB5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.14905&json=true","fetch_graph":"https://pith.science/api/pith-number/L4J6WB5RRWRTUZPZXAWRXWDOBM/graph.json","fetch_events":"https://pith.science/api/pith-number/L4J6WB5RRWRTUZPZXAWRXWDOBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/action/storage_attestation","attest_author":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/action/author_attestation","sign_citation":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/action/citation_signature","submit_replication":"https://pith.science/pith/L4J6WB5RRWRTUZPZXAWRXWDOBM/action/replication_record"}},"created_at":"2026-05-26T02:05:03.175213+00:00","updated_at":"2026-05-26T02:05:03.175213+00:00"}