{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:H6WPJWQV35QMVPWQZ5VTQC7CIN","short_pith_number":"pith:H6WPJWQV","schema_version":"1.0","canonical_sha256":"3facf4da15df60cabed0cf6b380be24373cc74b64ae0442c9cd795035e9245d1","source":{"kind":"arxiv","id":"2405.14765","version":2},"attestation_state":"computed","paper":{"title":"A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Ronald de Wolf, Yanlin Chen","submitted_at":"2024-05-23T16:33:13Z","abstract_excerpt":"Finding a good approximation of the top eigenvector of a given $d\\times d$ matrix $A$ is a basic and important computational problem, with many applications. We give two different quantum algorithms that, given query access to the entries of a Hermitian matrix $A$ and assuming a constant eigenvalue gap, output a classical description of a good approximation of the top eigenvector: one algorithm with time complexity $\\mathcal{\\tilde{O}}(d^{1.75})$ and one with time complexity $d^{1.5+o(1)}$ (the first algorithm has a slightly better dependence on the $\\ell_2$-error of the approximating vector 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":"2405.14765","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-05-23T16:33:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0b990c89539c926ab660998365d0e9ff9726c7900a508e6726355a037793b188","abstract_canon_sha256":"662c12f723f46ee8209e618880036e219c6a0d35d520c6454d8a1675db32e763"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:10.124009Z","signature_b64":"lSxtXPBkxvKgOmjsNtR9NAMhr22nBYrREAJt+GEuUSotQ3Z3YQh9fON/OpKRSHOF4izVwClfJq9cC1yxddTsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3facf4da15df60cabed0cf6b380be24373cc74b64ae0442c9cd795035e9245d1","last_reissued_at":"2026-07-05T09:35:10.123580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:10.123580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Ronald de Wolf, Yanlin Chen","submitted_at":"2024-05-23T16:33:13Z","abstract_excerpt":"Finding a good approximation of the top eigenvector of a given $d\\times d$ matrix $A$ is a basic and important computational problem, with many applications. We give two different quantum algorithms that, given query access to the entries of a Hermitian matrix $A$ and assuming a constant eigenvalue gap, output a classical description of a good approximation of the top eigenvector: one algorithm with time complexity $\\mathcal{\\tilde{O}}(d^{1.75})$ and one with time complexity $d^{1.5+o(1)}$ (the first algorithm has a slightly better dependence on the $\\ell_2$-error of the approximating vector t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14765","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/2405.14765/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":"2405.14765","created_at":"2026-07-05T09:35:10.123635+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14765v2","created_at":"2026-07-05T09:35:10.123635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14765","created_at":"2026-07-05T09:35:10.123635+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6WPJWQV35QM","created_at":"2026-07-05T09:35:10.123635+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6WPJWQV35QMVPWQ","created_at":"2026-07-05T09:35:10.123635+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6WPJWQV","created_at":"2026-07-05T09:35:10.123635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20265","citing_title":"A distillation-teleportation protocol for fault-tolerant QRAM","ref_index":101,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN","json":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN.json","graph_json":"https://pith.science/api/pith-number/H6WPJWQV35QMVPWQZ5VTQC7CIN/graph.json","events_json":"https://pith.science/api/pith-number/H6WPJWQV35QMVPWQZ5VTQC7CIN/events.json","paper":"https://pith.science/paper/H6WPJWQV"},"agent_actions":{"view_html":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN","download_json":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN.json","view_paper":"https://pith.science/paper/H6WPJWQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14765&json=true","fetch_graph":"https://pith.science/api/pith-number/H6WPJWQV35QMVPWQZ5VTQC7CIN/graph.json","fetch_events":"https://pith.science/api/pith-number/H6WPJWQV35QMVPWQZ5VTQC7CIN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN/action/storage_attestation","attest_author":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN/action/author_attestation","sign_citation":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN/action/citation_signature","submit_replication":"https://pith.science/pith/H6WPJWQV35QMVPWQZ5VTQC7CIN/action/replication_record"}},"created_at":"2026-07-05T09:35:10.123635+00:00","updated_at":"2026-07-05T09:35:10.123635+00:00"}