{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SMRRKFQAPF7EFVNUZ5ZJTX7I3Z","short_pith_number":"pith:SMRRKFQA","schema_version":"1.0","canonical_sha256":"9323151600797e42d5b4cf7299dfe8de6bc6d09f4073c89528269e4eb97d53a2","source":{"kind":"arxiv","id":"2108.09004","version":4},"attestation_state":"computed","paper":{"title":"Step-by-Step HHL Algorithm Walkthrough to Enhance the Understanding of Critical Quantum Computing Concepts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.ed-ph"],"primary_cat":"quant-ph","authors_text":"Anika Zaman, Hector Jose Morrell Jr, Hiu Yung Wong","submitted_at":"2021-08-20T05:24:07Z","abstract_excerpt":"After learning basic quantum computing concepts, it is desirable to reinforce the learning using an important and relatively complex algorithm through which the students can observe and appreciate how the qubits evolve and interact with each other. Harrow-Hassidim-Lloyd (HHL) quantum algorithm, which can solve Linear System Problems with exponential speed-up over the classical method and is the basic of many important quantum computing algorithms, is used to serve this purpose. The HHL algorithm is explained analytically followed by a 4-qubit numerical example in bra-ket notation. Matlab code "},"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":"2108.09004","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-08-20T05:24:07Z","cross_cats_sorted":["physics.ed-ph"],"title_canon_sha256":"2c134b87e42321f0e08c6d1cd8a7cfe4a40fb03536fa652578c14c86833616fb","abstract_canon_sha256":"642383c4aea88b8b7ce1fb978116700684e7a8cecdea9a500d31857dc2d5c3ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:28:42.028044Z","signature_b64":"zcpfEPVxe0OUixiDRqVSibE8rzpL6rz3ZozObdNVrv4J2xj/5Tm+PCzBHIJLTo3BnCLDfI08VJyVVJabOA/4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9323151600797e42d5b4cf7299dfe8de6bc6d09f4073c89528269e4eb97d53a2","last_reissued_at":"2026-07-05T07:28:42.027599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:28:42.027599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Step-by-Step HHL Algorithm Walkthrough to Enhance the Understanding of Critical Quantum Computing Concepts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.ed-ph"],"primary_cat":"quant-ph","authors_text":"Anika Zaman, Hector Jose Morrell Jr, Hiu Yung Wong","submitted_at":"2021-08-20T05:24:07Z","abstract_excerpt":"After learning basic quantum computing concepts, it is desirable to reinforce the learning using an important and relatively complex algorithm through which the students can observe and appreciate how the qubits evolve and interact with each other. Harrow-Hassidim-Lloyd (HHL) quantum algorithm, which can solve Linear System Problems with exponential speed-up over the classical method and is the basic of many important quantum computing algorithms, is used to serve this purpose. The HHL algorithm is explained analytically followed by a 4-qubit numerical example in bra-ket notation. Matlab code "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.09004","kind":"arxiv","version":4},"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/2108.09004/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":"2108.09004","created_at":"2026-07-05T07:28:42.027655+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.09004v4","created_at":"2026-07-05T07:28:42.027655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09004","created_at":"2026-07-05T07:28:42.027655+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMRRKFQAPF7E","created_at":"2026-07-05T07:28:42.027655+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMRRKFQAPF7EFVNU","created_at":"2026-07-05T07:28:42.027655+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMRRKFQA","created_at":"2026-07-05T07:28:42.027655+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.10406","citing_title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25148","citing_title":"Extending UNIQuE: Quantum Simulation Speedup for the HHL Algorithm","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z","json":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z.json","graph_json":"https://pith.science/api/pith-number/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/graph.json","events_json":"https://pith.science/api/pith-number/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/events.json","paper":"https://pith.science/paper/SMRRKFQA"},"agent_actions":{"view_html":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z","download_json":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z.json","view_paper":"https://pith.science/paper/SMRRKFQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.09004&json=true","fetch_graph":"https://pith.science/api/pith-number/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/action/storage_attestation","attest_author":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/action/author_attestation","sign_citation":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/action/citation_signature","submit_replication":"https://pith.science/pith/SMRRKFQAPF7EFVNUZ5ZJTX7I3Z/action/replication_record"}},"created_at":"2026-07-05T07:28:42.027655+00:00","updated_at":"2026-07-05T07:28:42.027655+00:00"}