{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6Z3CYQFMCLLITF74BIJ3AJLRYO","short_pith_number":"pith:6Z3CYQFM","schema_version":"1.0","canonical_sha256":"f6762c40ac12d68997fc0a13b02571c3ab0b6cc51235b836381d172c1d600d43","source":{"kind":"arxiv","id":"2104.01410","version":2},"attestation_state":"computed","paper":{"title":"Hamiltonian singular value transformation and inverse block encoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bobak T. Kiani, David R.M. Arvidsson-Shukur, Giacomo De Palma, Milad Marvian, Samuel Bosch, Seth Lloyd, William M. Kaminsky, Zi-Wen Liu","submitted_at":"2021-04-03T13:58:27Z","abstract_excerpt":"The quantum singular value transformation is a powerful quantum algorithm that allows one to apply a polynomial transformation to the singular values of a matrix that is embedded as a block of a unitary transformation. This paper shows how to perform the quantum singular value transformation for a matrix that can be embedded as a block of a Hamiltonian. The transformation can be implemented in a purely Hamiltonian context by the alternating application of Hamiltonians for chosen intervals: it is an example of the Quantum Alternating Operator Ansatz (generalized QAOA). We also show how to use t"},"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":"2104.01410","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-04-03T13:58:27Z","cross_cats_sorted":[],"title_canon_sha256":"47ef613b92693027bda658863bb49fee78f3c38669703336513bb64923378ce8","abstract_canon_sha256":"e46f62b444ef4780cc1b61c7178dbef444822b331460100def9da82b69369108"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:36.658815Z","signature_b64":"4rAGIOFQJLp8EOAOcaluCYN744HdFEMDrdBiTxmLT88Ewwgo3g0dMOCWS8ejD6qSzukS3MeIgsW7nhcA1KLhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6762c40ac12d68997fc0a13b02571c3ab0b6cc51235b836381d172c1d600d43","last_reissued_at":"2026-07-05T02:44:36.658224Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:36.658224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonian singular value transformation and inverse block encoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bobak T. Kiani, David R.M. Arvidsson-Shukur, Giacomo De Palma, Milad Marvian, Samuel Bosch, Seth Lloyd, William M. Kaminsky, Zi-Wen Liu","submitted_at":"2021-04-03T13:58:27Z","abstract_excerpt":"The quantum singular value transformation is a powerful quantum algorithm that allows one to apply a polynomial transformation to the singular values of a matrix that is embedded as a block of a unitary transformation. This paper shows how to perform the quantum singular value transformation for a matrix that can be embedded as a block of a Hamiltonian. The transformation can be implemented in a purely Hamiltonian context by the alternating application of Hamiltonians for chosen intervals: it is an example of the Quantum Alternating Operator Ansatz (generalized QAOA). We also show how to use t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.01410","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/2104.01410/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":"2104.01410","created_at":"2026-07-05T02:44:36.658288+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.01410v2","created_at":"2026-07-05T02:44:36.658288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.01410","created_at":"2026-07-05T02:44:36.658288+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Z3CYQFMCLLI","created_at":"2026-07-05T02:44:36.658288+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Z3CYQFMCLLITF74","created_at":"2026-07-05T02:44:36.658288+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Z3CYQFM","created_at":"2026-07-05T02:44:36.658288+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17357","citing_title":"Pulse-optimised circuit elements for scalable and noise-resilient quantum chemistry","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO","json":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO.json","graph_json":"https://pith.science/api/pith-number/6Z3CYQFMCLLITF74BIJ3AJLRYO/graph.json","events_json":"https://pith.science/api/pith-number/6Z3CYQFMCLLITF74BIJ3AJLRYO/events.json","paper":"https://pith.science/paper/6Z3CYQFM"},"agent_actions":{"view_html":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO","download_json":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO.json","view_paper":"https://pith.science/paper/6Z3CYQFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.01410&json=true","fetch_graph":"https://pith.science/api/pith-number/6Z3CYQFMCLLITF74BIJ3AJLRYO/graph.json","fetch_events":"https://pith.science/api/pith-number/6Z3CYQFMCLLITF74BIJ3AJLRYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO/action/storage_attestation","attest_author":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO/action/author_attestation","sign_citation":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO/action/citation_signature","submit_replication":"https://pith.science/pith/6Z3CYQFMCLLITF74BIJ3AJLRYO/action/replication_record"}},"created_at":"2026-07-05T02:44:36.658288+00:00","updated_at":"2026-07-05T02:44:36.658288+00:00"}