{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XQEXIKF3LTNRJ6HPTUI77NW5CG","short_pith_number":"pith:XQEXIKF3","schema_version":"1.0","canonical_sha256":"bc097428bb5cdb14f8ef9d11ffb6dd1183d191d3fdd3b5639cb7ecb03bbe1daf","source":{"kind":"arxiv","id":"2412.19090","version":2},"attestation_state":"computed","paper":{"title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yu-xi Liu, Zi-Ming Li","submitted_at":"2024-12-26T07:04:34Z","abstract_excerpt":"Vector set orthogonal normalization and matrix QR decomposition are fundamental problems in matrix analysis with important applications in many fields. We know that Gram-Schmidt process is a widely used method to solve these two problems. However, the existing methods, including Gram-Schmidt process have problems of high complexity, scaling $O(N^3)$ in the system dimension $N$, which leads to difficulties when calculating large-scale or ill-conditioned problems. With the development of quantum information processing, a series of quantum algorithms have been proposed, providing advantages and s"},"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":"2412.19090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-12-26T07:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"7461e3d57736f8a26f6a8d694e86db0dc7c3b59001740df51e28c9cac5695dc1","abstract_canon_sha256":"8a60a6252c9d6b1873cf7f0490d2e0b4cddcfaec97a4c4a79f3df9aec09f18ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:04.486538Z","signature_b64":"SA6SwTSSJgVzHwy48dZLXLjznFj8SOKQByG9g2Mw8NjENbg/jwyyAiDtoe6M+RcV0WGXwyi8aQSUchKQmZXOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc097428bb5cdb14f8ef9d11ffb6dd1183d191d3fdd3b5639cb7ecb03bbe1daf","last_reissued_at":"2026-07-05T09:56:04.486075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:04.486075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm for Vector Set Orthogonal Normalization and Matrix QR Decomposition with Polynomial Speedup","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yu-xi Liu, Zi-Ming Li","submitted_at":"2024-12-26T07:04:34Z","abstract_excerpt":"Vector set orthogonal normalization and matrix QR decomposition are fundamental problems in matrix analysis with important applications in many fields. We know that Gram-Schmidt process is a widely used method to solve these two problems. However, the existing methods, including Gram-Schmidt process have problems of high complexity, scaling $O(N^3)$ in the system dimension $N$, which leads to difficulties when calculating large-scale or ill-conditioned problems. With the development of quantum information processing, a series of quantum algorithms have been proposed, providing advantages and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.19090","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/2412.19090/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":"2412.19090","created_at":"2026-07-05T09:56:04.486134+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.19090v2","created_at":"2026-07-05T09:56:04.486134+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.19090","created_at":"2026-07-05T09:56:04.486134+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQEXIKF3LTNR","created_at":"2026-07-05T09:56:04.486134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQEXIKF3LTNRJ6HP","created_at":"2026-07-05T09:56:04.486134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQEXIKF3","created_at":"2026-07-05T09:56:04.486134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22125","citing_title":"Quantum complexity phase transition in fermionic quantum circuits","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG","json":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG.json","graph_json":"https://pith.science/api/pith-number/XQEXIKF3LTNRJ6HPTUI77NW5CG/graph.json","events_json":"https://pith.science/api/pith-number/XQEXIKF3LTNRJ6HPTUI77NW5CG/events.json","paper":"https://pith.science/paper/XQEXIKF3"},"agent_actions":{"view_html":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG","download_json":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG.json","view_paper":"https://pith.science/paper/XQEXIKF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.19090&json=true","fetch_graph":"https://pith.science/api/pith-number/XQEXIKF3LTNRJ6HPTUI77NW5CG/graph.json","fetch_events":"https://pith.science/api/pith-number/XQEXIKF3LTNRJ6HPTUI77NW5CG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG/action/storage_attestation","attest_author":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG/action/author_attestation","sign_citation":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG/action/citation_signature","submit_replication":"https://pith.science/pith/XQEXIKF3LTNRJ6HPTUI77NW5CG/action/replication_record"}},"created_at":"2026-07-05T09:56:04.486134+00:00","updated_at":"2026-07-05T09:56:04.486134+00:00"}