{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ECDCDF5DNGEGXXWZ3XVTRZPC2R","short_pith_number":"pith:ECDCDF5D","schema_version":"1.0","canonical_sha256":"20862197a369886bded9ddeb38e5e2d4552b60d91d20300c4917778fa87c435c","source":{"kind":"arxiv","id":"2304.08937","version":2},"attestation_state":"computed","paper":{"title":"Hamiltonian simulation using quantum singular value transformation: complexity analysis and application to the linearized Vlasov-Poisson equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.plasm-ph"],"primary_cat":"quant-ph","authors_text":"Kazuo Hoshino, Kiichiro Toyoizumi, Naoki Yamamoto","submitted_at":"2023-04-18T12:26:18Z","abstract_excerpt":"Quantum computing can be used to speed up the simulation time (more precisely, the number of queries of the algorithm) for physical systems; one such promising approach is the Hamiltonian simulation (HS) algorithm. Recently, it was proven that the quantum singular value transformation (QSVT) achieves the minimum simulation time for HS. An important subroutine of the QSVT-based HS algorithm is the amplitude amplification operation, which can be realized via the oblivious amplitude amplification or the fixed-point amplitude amplification in the QSVT framework. In this work, we execute a detailed"},"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":"2304.08937","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-04-18T12:26:18Z","cross_cats_sorted":["physics.plasm-ph"],"title_canon_sha256":"8b72e512babffad3ccefc43aac3c1317f7c6d7caadc885e3028114075924e74a","abstract_canon_sha256":"44a0ed179ad18d20913ee9a69724712d8b3ac17a98dc57c0b3a2176bd3c228f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:04:14.493497Z","signature_b64":"yokHuSZY+7gMpNa3zoiQfbAPJplm7TfoFB1cf73rujCNzvwdsdgFkqZPVvzNwEWU5/yCg6fuZIppALRU2+qZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20862197a369886bded9ddeb38e5e2d4552b60d91d20300c4917778fa87c435c","last_reissued_at":"2026-07-05T07:04:14.493150Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:04:14.493150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian simulation using quantum singular value transformation: complexity analysis and application to the linearized Vlasov-Poisson equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.plasm-ph"],"primary_cat":"quant-ph","authors_text":"Kazuo Hoshino, Kiichiro Toyoizumi, Naoki Yamamoto","submitted_at":"2023-04-18T12:26:18Z","abstract_excerpt":"Quantum computing can be used to speed up the simulation time (more precisely, the number of queries of the algorithm) for physical systems; one such promising approach is the Hamiltonian simulation (HS) algorithm. Recently, it was proven that the quantum singular value transformation (QSVT) achieves the minimum simulation time for HS. An important subroutine of the QSVT-based HS algorithm is the amplitude amplification operation, which can be realized via the oblivious amplitude amplification or the fixed-point amplitude amplification in the QSVT framework. In this work, we execute a detailed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.08937","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/2304.08937/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":"2304.08937","created_at":"2026-07-05T07:04:14.493204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.08937v2","created_at":"2026-07-05T07:04:14.493204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08937","created_at":"2026-07-05T07:04:14.493204+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECDCDF5DNGEG","created_at":"2026-07-05T07:04:14.493204+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECDCDF5DNGEGXXWZ","created_at":"2026-07-05T07:04:14.493204+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECDCDF5D","created_at":"2026-07-05T07:04:14.493204+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.25042","citing_title":"Stabilizers for Compiling Logical Circuits under Hardware Constraints","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R","json":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R.json","graph_json":"https://pith.science/api/pith-number/ECDCDF5DNGEGXXWZ3XVTRZPC2R/graph.json","events_json":"https://pith.science/api/pith-number/ECDCDF5DNGEGXXWZ3XVTRZPC2R/events.json","paper":"https://pith.science/paper/ECDCDF5D"},"agent_actions":{"view_html":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R","download_json":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R.json","view_paper":"https://pith.science/paper/ECDCDF5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.08937&json=true","fetch_graph":"https://pith.science/api/pith-number/ECDCDF5DNGEGXXWZ3XVTRZPC2R/graph.json","fetch_events":"https://pith.science/api/pith-number/ECDCDF5DNGEGXXWZ3XVTRZPC2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R/action/storage_attestation","attest_author":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R/action/author_attestation","sign_citation":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R/action/citation_signature","submit_replication":"https://pith.science/pith/ECDCDF5DNGEGXXWZ3XVTRZPC2R/action/replication_record"}},"created_at":"2026-07-05T07:04:14.493204+00:00","updated_at":"2026-07-05T07:04:14.493204+00:00"}