{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:B2LB4G5RTATZYJRGRVBRE2DVOR","short_pith_number":"pith:B2LB4G5R","canonical_record":{"source":{"id":"1804.02321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-06T15:18:11Z","cross_cats_sorted":[],"title_canon_sha256":"dc56a1ce8db43622cd3d14a877b25d51e68c6495056c1e10857a20107c331d51","abstract_canon_sha256":"2af23cdf4221e55c00269fcb21a4df6e6df06133e9af1ab7f07b6abddb6169af"},"schema_version":"1.0"},"canonical_sha256":"0e961e1bb198279c26268d431268757468974ea7a7de9bba1cac89d07466087c","source":{"kind":"arxiv","id":"1804.02321","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02321","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02321v2","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02321","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"B2LB4G5RTATZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2LB4G5RTATZYJRG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2LB4G5R","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:B2LB4G5RTATZYJRGRVBRE2DVOR","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02321","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-06T15:18:11Z","cross_cats_sorted":[],"title_canon_sha256":"dc56a1ce8db43622cd3d14a877b25d51e68c6495056c1e10857a20107c331d51","abstract_canon_sha256":"2af23cdf4221e55c00269fcb21a4df6e6df06133e9af1ab7f07b6abddb6169af"},"schema_version":"1.0"},"canonical_sha256":"0e961e1bb198279c26268d431268757468974ea7a7de9bba1cac89d07466087c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:42.935409Z","signature_b64":"sCnjLydOWYEE1Z6LpN/QMtUZSZ3rM7M6bkqsEBabANzbPFFjK+0perOIUmai4EHc6B1KGTiurWuSEQGtfJb9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e961e1bb198279c26268d431268757468974ea7a7de9bba1cac89d07466087c","last_reissued_at":"2026-05-17T23:55:42.934434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:42.934434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02321","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kxpt11F3ijVhc9UAw8N1yfGKMWz0b/Q2HpWBDb5EMYKMf0NQ5f1NBgzJfHK/e8iI2pLPG//+zIHmRWyk2FPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:12:11.189679Z"},"content_sha256":"5a20cb530da0cfe7de0ac87652fa4acceba0cc98b2df5814d50c7af344a15f03","schema_version":"1.0","event_id":"sha256:5a20cb530da0cfe7de0ac87652fa4acceba0cc98b2df5814d50c7af344a15f03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:B2LB4G5RTATZYJRGRVBRE2DVOR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Fast-Forwarding: Markov Chains and Graph Property Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alain Sarlette, Simon Apers","submitted_at":"2018-04-06T15:18:11Z","abstract_excerpt":"We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition matrix and $D = \\sqrt{P\\circ P^T}$ its discriminant matrix ($D=P$ if $P$ is symmetric), we construct a quantum walk algorithm that for any quantum state $|v\\rangle$ and integer $t$ returns a quantum state $\\epsilon$-close to the state $D^t|v\\rangle/\\|D^t|v\\rangle\\|$. The algorithm uses $O\\Big(\\|D^t|v\\rangle\\|^{-1}\\sqrt{t\\log(\\epsilon\\|D^t|v\\rangle\\|)^{-1}}\\Big)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02321","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DvAy94Zo/r2PfkZi8bbkDTOIE+nlkypIgWdKN6D4cgLqjVQ0Ljhpw+JmKlEmehqEn28Njgg1FkQeyngAlTctAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:12:11.190030Z"},"content_sha256":"a2de5d540a82e8b1ba4dbded4f9bd9b1ebb88b6a4a815a55a6957f60f3d09d30","schema_version":"1.0","event_id":"sha256:a2de5d540a82e8b1ba4dbded4f9bd9b1ebb88b6a4a815a55a6957f60f3d09d30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2LB4G5RTATZYJRGRVBRE2DVOR/bundle.json","state_url":"https://pith.science/pith/B2LB4G5RTATZYJRGRVBRE2DVOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2LB4G5RTATZYJRGRVBRE2DVOR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T09:12:11Z","links":{"resolver":"https://pith.science/pith/B2LB4G5RTATZYJRGRVBRE2DVOR","bundle":"https://pith.science/pith/B2LB4G5RTATZYJRGRVBRE2DVOR/bundle.json","state":"https://pith.science/pith/B2LB4G5RTATZYJRGRVBRE2DVOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2LB4G5RTATZYJRGRVBRE2DVOR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:B2LB4G5RTATZYJRGRVBRE2DVOR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2af23cdf4221e55c00269fcb21a4df6e6df06133e9af1ab7f07b6abddb6169af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-06T15:18:11Z","title_canon_sha256":"dc56a1ce8db43622cd3d14a877b25d51e68c6495056c1e10857a20107c331d51"},"schema_version":"1.0","source":{"id":"1804.02321","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02321","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02321v2","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02321","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"B2LB4G5RTATZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"B2LB4G5RTATZYJRG","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"B2LB4G5R","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:a2de5d540a82e8b1ba4dbded4f9bd9b1ebb88b6a4a815a55a6957f60f3d09d30","target":"graph","created_at":"2026-05-17T23:55:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We introduce a new tool for quantum algorithms called quantum fast-forwarding (QFF). The tool uses quantum walks as a means to quadratically fast-forward a reversible Markov chain. More specifically, with $P$ the Markov chain transition matrix and $D = \\sqrt{P\\circ P^T}$ its discriminant matrix ($D=P$ if $P$ is symmetric), we construct a quantum walk algorithm that for any quantum state $|v\\rangle$ and integer $t$ returns a quantum state $\\epsilon$-close to the state $D^t|v\\rangle/\\|D^t|v\\rangle\\|$. The algorithm uses $O\\Big(\\|D^t|v\\rangle\\|^{-1}\\sqrt{t\\log(\\epsilon\\|D^t|v\\rangle\\|)^{-1}}\\Big)","authors_text":"Alain Sarlette, Simon Apers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-06T15:18:11Z","title":"Quantum Fast-Forwarding: Markov Chains and Graph Property Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02321","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5a20cb530da0cfe7de0ac87652fa4acceba0cc98b2df5814d50c7af344a15f03","target":"record","created_at":"2026-05-17T23:55:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2af23cdf4221e55c00269fcb21a4df6e6df06133e9af1ab7f07b6abddb6169af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-06T15:18:11Z","title_canon_sha256":"dc56a1ce8db43622cd3d14a877b25d51e68c6495056c1e10857a20107c331d51"},"schema_version":"1.0","source":{"id":"1804.02321","kind":"arxiv","version":2}},"canonical_sha256":"0e961e1bb198279c26268d431268757468974ea7a7de9bba1cac89d07466087c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e961e1bb198279c26268d431268757468974ea7a7de9bba1cac89d07466087c","first_computed_at":"2026-05-17T23:55:42.934434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:42.934434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sCnjLydOWYEE1Z6LpN/QMtUZSZ3rM7M6bkqsEBabANzbPFFjK+0perOIUmai4EHc6B1KGTiurWuSEQGtfJb9Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:42.935409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02321","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a20cb530da0cfe7de0ac87652fa4acceba0cc98b2df5814d50c7af344a15f03","sha256:a2de5d540a82e8b1ba4dbded4f9bd9b1ebb88b6a4a815a55a6957f60f3d09d30"],"state_sha256":"bf19f6371dbf439a278e901a0e617c8c15288fbdb06f268bb22be7d811ab487b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+t+WE3NWPR3hmbdaodijXm/2Ve+Y1sjuZztCJC9p9osE3O19yEvxwyxizFp6tseCx+pZal2nM9ax/oM94DG1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:12:11.192080Z","bundle_sha256":"5d8b2381b6ca1759d303db4450abc0825484ceaf6bd0ffca2784d138492dd374"}}