{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UMEPMXGA2LH7XH5ZY7CPZ23BMH","short_pith_number":"pith:UMEPMXGA","schema_version":"1.0","canonical_sha256":"a308f65cc0d2cffb9fb9c7c4fceb6161f99cd9d034f949923dc68089216d1fe0","source":{"kind":"arxiv","id":"2411.04240","version":2},"attestation_state":"computed","paper":{"title":"Randomly Compiled Quantum Simulation with Exponentially Reduced Circuit Depths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"James D. Watson","submitted_at":"2024-11-06T20:08:42Z","abstract_excerpt":"The quantum stochastic drift protocol, also known as qDRIFT, has become a popular algorithm for implementing time-evolution of quantum systems using randomised compiling. In this work we develop qFLO, a higher order randomised algorithm for time-evolution. To estimate an observable expectation value at time $T$ to precision $\\epsilon$, we show it is sufficient to use circuit depths of $O(T^2\\log(1/\\epsilon))$ -- an exponential improvement over standard qDRIFT requirements with respect to $\\epsilon$. The protocol achieves this using $O(1/\\epsilon^2)$ repeated runs of the standard qDRIFT protoco"},"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":"2411.04240","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-06T20:08:42Z","cross_cats_sorted":[],"title_canon_sha256":"0cc525f5c14d29d31d4f2c4a92eb13606c2f5f49254474ac964b011391cf1a47","abstract_canon_sha256":"69052c1bfcc2097b777f817fe11fc0f515ee6c0db4e6e48aba50b8bc5f554e0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:14.449751Z","signature_b64":"p3EOKIylve7nQU/ewlAvMsGOxxwoCC4ANRxLIMSZcsZ5wI1EfXRg9Dxi+vVenhZl48ZqF9bXu+Umgth0vgxPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a308f65cc0d2cffb9fb9c7c4fceb6161f99cd9d034f949923dc68089216d1fe0","last_reissued_at":"2026-07-05T10:05:14.449251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:14.449251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomly Compiled Quantum Simulation with Exponentially Reduced Circuit Depths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"James D. Watson","submitted_at":"2024-11-06T20:08:42Z","abstract_excerpt":"The quantum stochastic drift protocol, also known as qDRIFT, has become a popular algorithm for implementing time-evolution of quantum systems using randomised compiling. In this work we develop qFLO, a higher order randomised algorithm for time-evolution. To estimate an observable expectation value at time $T$ to precision $\\epsilon$, we show it is sufficient to use circuit depths of $O(T^2\\log(1/\\epsilon))$ -- an exponential improvement over standard qDRIFT requirements with respect to $\\epsilon$. The protocol achieves this using $O(1/\\epsilon^2)$ repeated runs of the standard qDRIFT protoco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.04240","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/2411.04240/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":"2411.04240","created_at":"2026-07-05T10:05:14.449321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.04240v2","created_at":"2026-07-05T10:05:14.449321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.04240","created_at":"2026-07-05T10:05:14.449321+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMEPMXGA2LH7","created_at":"2026-07-05T10:05:14.449321+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMEPMXGA2LH7XH5Z","created_at":"2026-07-05T10:05:14.449321+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMEPMXGA","created_at":"2026-07-05T10:05:14.449321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07389","citing_title":"Circuit Depth Reduction of One-Ancilla Quantum Differential Equation Solver via Extrapolation","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2604.26865","citing_title":"MLMC-qDRIFT: Multilevel Variance Reduction for Randomized Quantum Hamiltonian Simulation","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2604.02854","citing_title":"Continuous-time evolution via probabilistic angle interpolation and its applications","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26865","citing_title":"MLMC-qDRIFT: Multilevel Variance Reduction for Randomized Quantum Hamiltonian Simulation","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH","json":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH.json","graph_json":"https://pith.science/api/pith-number/UMEPMXGA2LH7XH5ZY7CPZ23BMH/graph.json","events_json":"https://pith.science/api/pith-number/UMEPMXGA2LH7XH5ZY7CPZ23BMH/events.json","paper":"https://pith.science/paper/UMEPMXGA"},"agent_actions":{"view_html":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH","download_json":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH.json","view_paper":"https://pith.science/paper/UMEPMXGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.04240&json=true","fetch_graph":"https://pith.science/api/pith-number/UMEPMXGA2LH7XH5ZY7CPZ23BMH/graph.json","fetch_events":"https://pith.science/api/pith-number/UMEPMXGA2LH7XH5ZY7CPZ23BMH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH/action/storage_attestation","attest_author":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH/action/author_attestation","sign_citation":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH/action/citation_signature","submit_replication":"https://pith.science/pith/UMEPMXGA2LH7XH5ZY7CPZ23BMH/action/replication_record"}},"created_at":"2026-07-05T10:05:14.449321+00:00","updated_at":"2026-07-05T10:05:14.449321+00:00"}