{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4WU4GHTOQUHEACMBBHNHPBVZQR","short_pith_number":"pith:4WU4GHTO","schema_version":"1.0","canonical_sha256":"e5a9c31e6e850e40098109da7786b9844a8d188ff2028977c567a3a53bf1ffc4","source":{"kind":"arxiv","id":"2502.11239","version":2},"attestation_state":"computed","paper":{"title":"Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Dmitry Ryashchentsev, Ekaterina Riashchentceva, Jinglei Cheng, Junyu Liu, Mark Dubynskyi, Mohammadhossein Mohammadisiahroudi, Tam\\'as Terlaky, Yue Tu","submitted_at":"2025-02-16T19:12:32Z","abstract_excerpt":"Quantum computing, a prominent non-Von Neumann paradigm beyond Moore's law, can offer superpolynomial speedups for certain problems. Yet its advantages in efficiency for tasks like machine learning remain under investigation, and quantum noise complicates resource estimations and classical comparisons. We provide a detailed estimation of space, time, and energy resources for fault-tolerant superconducting devices running the Harrow-Hassidim-Lloyd (HHL) algorithm, a quantum linear system solver relevant to linear algebra and machine learning. Excluding memory and data transfer, possible quantum"},"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":"2502.11239","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-16T19:12:32Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC"],"title_canon_sha256":"159c262ccfdf8f37be1fc6cb4a9ba3e8549edfcbd6e4f9fb6250447e2d0e1b4b","abstract_canon_sha256":"0280ff80fa999fc9a09a5a2c28377bb0992f0110db95a58b736122274969e408"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:49.787099Z","signature_b64":"3NmzrbjD787jxEMGSI5167r96dpf+/7C2pXdrHDTiBvC1UWRqzJ06HBS32Uyi5qDFDPPofKfHODLTHqi4jgaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5a9c31e6e850e40098109da7786b9844a8d188ff2028977c567a3a53bf1ffc4","last_reissued_at":"2026-07-05T10:15:49.786591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:49.786591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC"],"primary_cat":"quant-ph","authors_text":"Dmitry Ryashchentsev, Ekaterina Riashchentceva, Jinglei Cheng, Junyu Liu, Mark Dubynskyi, Mohammadhossein Mohammadisiahroudi, Tam\\'as Terlaky, Yue Tu","submitted_at":"2025-02-16T19:12:32Z","abstract_excerpt":"Quantum computing, a prominent non-Von Neumann paradigm beyond Moore's law, can offer superpolynomial speedups for certain problems. Yet its advantages in efficiency for tasks like machine learning remain under investigation, and quantum noise complicates resource estimations and classical comparisons. We provide a detailed estimation of space, time, and energy resources for fault-tolerant superconducting devices running the Harrow-Hassidim-Lloyd (HHL) algorithm, a quantum linear system solver relevant to linear algebra and machine learning. Excluding memory and data transfer, possible quantum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11239","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/2502.11239/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":"2502.11239","created_at":"2026-07-05T10:15:49.786653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.11239v2","created_at":"2026-07-05T10:15:49.786653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11239","created_at":"2026-07-05T10:15:49.786653+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WU4GHTOQUHE","created_at":"2026-07-05T10:15:49.786653+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WU4GHTOQUHEACMB","created_at":"2026-07-05T10:15:49.786653+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WU4GHTO","created_at":"2026-07-05T10:15:49.786653+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12066","citing_title":"Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent","ref_index":78,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR","json":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR.json","graph_json":"https://pith.science/api/pith-number/4WU4GHTOQUHEACMBBHNHPBVZQR/graph.json","events_json":"https://pith.science/api/pith-number/4WU4GHTOQUHEACMBBHNHPBVZQR/events.json","paper":"https://pith.science/paper/4WU4GHTO"},"agent_actions":{"view_html":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR","download_json":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR.json","view_paper":"https://pith.science/paper/4WU4GHTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.11239&json=true","fetch_graph":"https://pith.science/api/pith-number/4WU4GHTOQUHEACMBBHNHPBVZQR/graph.json","fetch_events":"https://pith.science/api/pith-number/4WU4GHTOQUHEACMBBHNHPBVZQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR/action/storage_attestation","attest_author":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR/action/author_attestation","sign_citation":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR/action/citation_signature","submit_replication":"https://pith.science/pith/4WU4GHTOQUHEACMBBHNHPBVZQR/action/replication_record"}},"created_at":"2026-07-05T10:15:49.786653+00:00","updated_at":"2026-07-05T10:15:49.786653+00:00"}