{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:P2ESB4SVVGKM364NKX32FG455B","short_pith_number":"pith:P2ESB4SV","schema_version":"1.0","canonical_sha256":"7e8920f255a994cdfb8d55f7a29b9de848b143caeab999743b263280e666f4e0","source":{"kind":"arxiv","id":"2012.10268","version":2},"attestation_state":"computed","paper":{"title":"Gate-Based Circuit Designs For Quantum Adder Inspired Quantum Random Walks on Superconducting Qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Projansky, Daniel Koch, Michael Samodurov, Paul M. Alsing","submitted_at":"2020-12-18T14:34:18Z","abstract_excerpt":"Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen many great mathematical advances, with experimental demonstrations now catching up. In this study, we examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator, with quantum circuit designs specifically for superconducting qubits. We focus on the strengths and weaknesses of these walks, particularly circuit de"},"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":"2012.10268","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2020-12-18T14:34:18Z","cross_cats_sorted":[],"title_canon_sha256":"b49469fe25b9bbf5fe7f7f0a95b7b2708bee05b73cc67bd7149d14838221e253","abstract_canon_sha256":"db2086ae7868437876df5660bae90862b0f79a37150858f95ef75944c22c94d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:08:40.612856Z","signature_b64":"sq06WK5lt70BYfmzHpq/DBA6NYb8Xbj5RWmtwoUkgQ1yzyo+Ch4s+ajeh9oOgBWApl+YfdF8Y3ndZpMgkEKEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e8920f255a994cdfb8d55f7a29b9de848b143caeab999743b263280e666f4e0","last_reissued_at":"2026-07-05T02:08:40.612433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:08:40.612433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gate-Based Circuit Designs For Quantum Adder Inspired Quantum Random Walks on Superconducting Qubits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Projansky, Daniel Koch, Michael Samodurov, Paul M. Alsing","submitted_at":"2020-12-18T14:34:18Z","abstract_excerpt":"Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen many great mathematical advances, with experimental demonstrations now catching up. In this study, we examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator, with quantum circuit designs specifically for superconducting qubits. We focus on the strengths and weaknesses of these walks, particularly circuit de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.10268","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/2012.10268/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":"2012.10268","created_at":"2026-07-05T02:08:40.612487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.10268v2","created_at":"2026-07-05T02:08:40.612487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.10268","created_at":"2026-07-05T02:08:40.612487+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2ESB4SVVGKM","created_at":"2026-07-05T02:08:40.612487+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2ESB4SVVGKM364N","created_at":"2026-07-05T02:08:40.612487+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2ESB4SV","created_at":"2026-07-05T02:08:40.612487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15030","citing_title":"A NISQ-friendly Coined Quantum Walk Algorithm for Chaos-based Cryptographic Applications","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B","json":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B.json","graph_json":"https://pith.science/api/pith-number/P2ESB4SVVGKM364NKX32FG455B/graph.json","events_json":"https://pith.science/api/pith-number/P2ESB4SVVGKM364NKX32FG455B/events.json","paper":"https://pith.science/paper/P2ESB4SV"},"agent_actions":{"view_html":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B","download_json":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B.json","view_paper":"https://pith.science/paper/P2ESB4SV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.10268&json=true","fetch_graph":"https://pith.science/api/pith-number/P2ESB4SVVGKM364NKX32FG455B/graph.json","fetch_events":"https://pith.science/api/pith-number/P2ESB4SVVGKM364NKX32FG455B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B/action/storage_attestation","attest_author":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B/action/author_attestation","sign_citation":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B/action/citation_signature","submit_replication":"https://pith.science/pith/P2ESB4SVVGKM364NKX32FG455B/action/replication_record"}},"created_at":"2026-07-05T02:08:40.612487+00:00","updated_at":"2026-07-05T02:08:40.612487+00:00"}