{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XNFO74OHDSAJBX7XU54UBHZMND","short_pith_number":"pith:XNFO74OH","schema_version":"1.0","canonical_sha256":"bb4aeff1c71c8090dff7a779409f2c68c7a5498529086b4642cc86233c9cab13","source":{"kind":"arxiv","id":"1607.05317","version":1},"attestation_state":"computed","paper":{"title":"Continuous Time Quantum Walks in finite Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shanshan Li, Stefan Boettcher","submitted_at":"2016-07-18T20:41:49Z","abstract_excerpt":"We consider the quantum search problem with a continuous time quantum walk for networks of finite spectral dimension d_{s} of the network Laplacian. For general networks of fractal (integer or non-integer) dimension d_{f}, for which in general d_{f}\\not=d_{s}, it suggests that d_{s} is the scaling exponent that determines the computational complexity of the search. Our results are consistent with those of Childs and Goldstone [Phys. Rev. A 70 (2004), 022314] for lattices of integer dimension, where d=d_{f}=d_{s}. For general fractals, we find that the Grover limit of quantum search can be obta"},"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":"1607.05317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-18T20:41:49Z","cross_cats_sorted":[],"title_canon_sha256":"3c2113ab8b9753f25c62f047537c824e9b805432c65aaa766416de38482e9980","abstract_canon_sha256":"581d739e2b82bd9fd19cd4cc8febbf1b119556411d70b6d4a64da1a519571744"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:16.546109Z","signature_b64":"SAqRjYwgwqahfLIfP8BLmUBh7qQOtyO7qKfAXtUqivsLUWScg7BXNB74qr1cM7coSApUMwPoeVzxOl2stfVzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb4aeff1c71c8090dff7a779409f2c68c7a5498529086b4642cc86233c9cab13","last_reissued_at":"2026-05-18T00:49:16.545662Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:16.545662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Time Quantum Walks in finite Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shanshan Li, Stefan Boettcher","submitted_at":"2016-07-18T20:41:49Z","abstract_excerpt":"We consider the quantum search problem with a continuous time quantum walk for networks of finite spectral dimension d_{s} of the network Laplacian. For general networks of fractal (integer or non-integer) dimension d_{f}, for which in general d_{f}\\not=d_{s}, it suggests that d_{s} is the scaling exponent that determines the computational complexity of the search. Our results are consistent with those of Childs and Goldstone [Phys. Rev. A 70 (2004), 022314] for lattices of integer dimension, where d=d_{f}=d_{s}. For general fractals, we find that the Grover limit of quantum search can be obta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05317","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":""},"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":"1607.05317","created_at":"2026-05-18T00:49:16.545745+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.05317v1","created_at":"2026-05-18T00:49:16.545745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05317","created_at":"2026-05-18T00:49:16.545745+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNFO74OHDSAJ","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNFO74OHDSAJBX7X","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNFO74OH","created_at":"2026-05-18T12:30:51.357362+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/XNFO74OHDSAJBX7XU54UBHZMND","json":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND.json","graph_json":"https://pith.science/api/pith-number/XNFO74OHDSAJBX7XU54UBHZMND/graph.json","events_json":"https://pith.science/api/pith-number/XNFO74OHDSAJBX7XU54UBHZMND/events.json","paper":"https://pith.science/paper/XNFO74OH"},"agent_actions":{"view_html":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND","download_json":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND.json","view_paper":"https://pith.science/paper/XNFO74OH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.05317&json=true","fetch_graph":"https://pith.science/api/pith-number/XNFO74OHDSAJBX7XU54UBHZMND/graph.json","fetch_events":"https://pith.science/api/pith-number/XNFO74OHDSAJBX7XU54UBHZMND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND/action/storage_attestation","attest_author":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND/action/author_attestation","sign_citation":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND/action/citation_signature","submit_replication":"https://pith.science/pith/XNFO74OHDSAJBX7XU54UBHZMND/action/replication_record"}},"created_at":"2026-05-18T00:49:16.545745+00:00","updated_at":"2026-05-18T00:49:16.545745+00:00"}