{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EJLU4KPCTJZ3VVFI5QLMHUFTSM","short_pith_number":"pith:EJLU4KPC","schema_version":"1.0","canonical_sha256":"22574e29e29a73bad4a8ec16c3d0b393197c13171ae2e4fd6042f85dbd153b18","source":{"kind":"arxiv","id":"2312.00723","version":1},"attestation_state":"computed","paper":{"title":"Generalized Quantum Singular Value Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christoph S\\\"underhauf","submitted_at":"2023-12-01T16:59:14Z","abstract_excerpt":"The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity and real coefficients, and finding the circuit (the phase factors) has proven difficult in practice. Recent work has removed these restrictions and enabled faster computation of phase factors, yet only for unitary matrices. Here we propose two generalisations. The generalised quantum singular value transformation allows complex polynomials for arbitrary matri"},"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":"2312.00723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-12-01T16:59:14Z","cross_cats_sorted":[],"title_canon_sha256":"163fac7781c35e2d22d0c9d1a80ef0cc011383cb34fafc972ad551878bdeee9b","abstract_canon_sha256":"ccabf25dc11e585cf7c870038ebcda5078518e793f4d54ad3f81a851bbda94e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:13.496173Z","signature_b64":"ngiaf1quHdBA3EAo1PNYoW+O2aKk88D+3JEJgNIHoI4AfM0b20dQaLjpkmRl6QjAfIN9z9+XwBmO1bLHvoXtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22574e29e29a73bad4a8ec16c3d0b393197c13171ae2e4fd6042f85dbd153b18","last_reissued_at":"2026-07-05T07:19:13.495566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:13.495566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Quantum Singular Value Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christoph S\\\"underhauf","submitted_at":"2023-12-01T16:59:14Z","abstract_excerpt":"The quantum singular value transformation has revolutionised quantum algorithms. By applying a polynomial to an arbitrary matrix, it provides a unifying picture of quantum algorithms. However, polynomials are restricted to definite parity and real coefficients, and finding the circuit (the phase factors) has proven difficult in practice. Recent work has removed these restrictions and enabled faster computation of phase factors, yet only for unitary matrices. Here we propose two generalisations. The generalised quantum singular value transformation allows complex polynomials for arbitrary matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.00723","kind":"arxiv","version":1},"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/2312.00723/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":"2312.00723","created_at":"2026-07-05T07:19:13.495638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.00723v1","created_at":"2026-07-05T07:19:13.495638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.00723","created_at":"2026-07-05T07:19:13.495638+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJLU4KPCTJZ3","created_at":"2026-07-05T07:19:13.495638+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJLU4KPCTJZ3VVFI","created_at":"2026-07-05T07:19:13.495638+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJLU4KPC","created_at":"2026-07-05T07:19:13.495638+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.26584","citing_title":"Quantum Fast-Forwarding Beyond Reversibility: The $\\alpha$-Perturbed $n$-Cycle","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29848","citing_title":"Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation: A Weyl Calculus Approach","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2606.26584","citing_title":"Quantum Fast-Forwarding Beyond Reversibility: The $\\alpha$-Perturbed $n$-Cycle","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2511.01736","citing_title":"Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra","ref_index":52,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18249","citing_title":"Hermitian Matrix Function Synthesis without Block-Encoding","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18276","citing_title":"Block-encodings as programming abstractions: The Eclipse Qrisp BlockEncoding Interface","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19688","citing_title":"Quantum Eigenvalue Transformations for Arbitrary Matrices","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM","json":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM.json","graph_json":"https://pith.science/api/pith-number/EJLU4KPCTJZ3VVFI5QLMHUFTSM/graph.json","events_json":"https://pith.science/api/pith-number/EJLU4KPCTJZ3VVFI5QLMHUFTSM/events.json","paper":"https://pith.science/paper/EJLU4KPC"},"agent_actions":{"view_html":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM","download_json":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM.json","view_paper":"https://pith.science/paper/EJLU4KPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.00723&json=true","fetch_graph":"https://pith.science/api/pith-number/EJLU4KPCTJZ3VVFI5QLMHUFTSM/graph.json","fetch_events":"https://pith.science/api/pith-number/EJLU4KPCTJZ3VVFI5QLMHUFTSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM/action/storage_attestation","attest_author":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM/action/author_attestation","sign_citation":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM/action/citation_signature","submit_replication":"https://pith.science/pith/EJLU4KPCTJZ3VVFI5QLMHUFTSM/action/replication_record"}},"created_at":"2026-07-05T07:19:13.495638+00:00","updated_at":"2026-07-05T07:19:13.495638+00:00"}