{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RLAVN7WMNXGOA4WIA4JSTSQ26R","short_pith_number":"pith:RLAVN7WM","schema_version":"1.0","canonical_sha256":"8ac156fecc6dcce072c8071329ca1af473c7330568ef254abc0cff6e29390526","source":{"kind":"arxiv","id":"2106.08076","version":2},"attestation_state":"computed","paper":{"title":"Quantum Algorithms based on the Block-Encoding Framework for Matrix Functions by Contour Integrals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asuka Ohashi, Souichi Takahira, Tomohiro Sogabe, Tsuyoshi Sasaki Usuda","submitted_at":"2021-06-15T12:10:35Z","abstract_excerpt":"The matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we show a concrete construction of a framework to implement the linear combination of the inverses on quantum computers and propose a quantum algorithm for matrix functions based on the framework. Compared with the previous study [S. Takahira, A. Ohashi, T. Sogabe, and T.S. Usuda, Quant. Inf. Comput., 20, 1&2, 14--36, (Feb. 2020)] that proposed a quantum algorithm to compute a quantum state for the matrix f"},"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":"2106.08076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-06-15T12:10:35Z","cross_cats_sorted":[],"title_canon_sha256":"b6fba8c6f57125bc9e8dee93bf95ec62b4cfb0f4ee87c9ce476ed25c291275ae","abstract_canon_sha256":"13966a195ea9bb3ee3b790f901ee009591a590c8f5bfd62ee9bfc228885db420"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:56.644755Z","signature_b64":"SGbzKY6n0iMLeLRGpmEUCucF5b7Wknrm/8olXqst/UlBOhmI9w9i0trijczFszqRVhqy8kD5ReYUnoNSU4kyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ac156fecc6dcce072c8071329ca1af473c7330568ef254abc0cff6e29390526","last_reissued_at":"2026-07-05T02:49:56.644278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:56.644278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms based on the Block-Encoding Framework for Matrix Functions by Contour Integrals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Asuka Ohashi, Souichi Takahira, Tomohiro Sogabe, Tsuyoshi Sasaki Usuda","submitted_at":"2021-06-15T12:10:35Z","abstract_excerpt":"The matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we show a concrete construction of a framework to implement the linear combination of the inverses on quantum computers and propose a quantum algorithm for matrix functions based on the framework. Compared with the previous study [S. Takahira, A. Ohashi, T. Sogabe, and T.S. Usuda, Quant. Inf. Comput., 20, 1&2, 14--36, (Feb. 2020)] that proposed a quantum algorithm to compute a quantum state for the matrix f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.08076","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/2106.08076/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":"2106.08076","created_at":"2026-07-05T02:49:56.644355+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.08076v2","created_at":"2026-07-05T02:49:56.644355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.08076","created_at":"2026-07-05T02:49:56.644355+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLAVN7WMNXGO","created_at":"2026-07-05T02:49:56.644355+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLAVN7WMNXGOA4WI","created_at":"2026-07-05T02:49:56.644355+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLAVN7WM","created_at":"2026-07-05T02:49:56.644355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07691","citing_title":"Faster quantum linear system solver beyond the condition number","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2604.02874","citing_title":"A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R","json":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R.json","graph_json":"https://pith.science/api/pith-number/RLAVN7WMNXGOA4WIA4JSTSQ26R/graph.json","events_json":"https://pith.science/api/pith-number/RLAVN7WMNXGOA4WIA4JSTSQ26R/events.json","paper":"https://pith.science/paper/RLAVN7WM"},"agent_actions":{"view_html":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R","download_json":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R.json","view_paper":"https://pith.science/paper/RLAVN7WM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.08076&json=true","fetch_graph":"https://pith.science/api/pith-number/RLAVN7WMNXGOA4WIA4JSTSQ26R/graph.json","fetch_events":"https://pith.science/api/pith-number/RLAVN7WMNXGOA4WIA4JSTSQ26R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R/action/storage_attestation","attest_author":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R/action/author_attestation","sign_citation":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R/action/citation_signature","submit_replication":"https://pith.science/pith/RLAVN7WMNXGOA4WIA4JSTSQ26R/action/replication_record"}},"created_at":"2026-07-05T02:49:56.644355+00:00","updated_at":"2026-07-05T02:49:56.644355+00:00"}