{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EE7ITLAXIW4PIKXVHFWPW4VLYN","short_pith_number":"pith:EE7ITLAX","schema_version":"1.0","canonical_sha256":"213e89ac1745b8f42af5396cfb72abc3592cfc28bb147e8dcfc8f1b74d025e70","source":{"kind":"arxiv","id":"2210.07894","version":1},"attestation_state":"computed","paper":{"title":"Optimal storage capacity of quantum Hopfield neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Eliana Fiorelli, Lukas B\\\"odeker, Markus M\\\"uller","submitted_at":"2022-10-14T15:21:21Z","abstract_excerpt":"Quantum neural networks form one pillar of the emergent field of quantum machine learning. Here, quantum generalisations of classical networks realizing associative memories - capable of retrieving patterns, or memories, from corrupted initial states - have been proposed. It is a challenging open problem to analyze quantum associative memories with an extensive number of patterns, and to determine the maximal number of patterns the quantum networks can reliably store, i.e. their storage capacity. In this work, we propose and explore a general method for evaluating the maximal storage capacity "},"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":"2210.07894","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-10-14T15:21:21Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"6f54637edf9643a778aa96dc4e06b1e2318f99e0624f8205d92bce5159ff96e0","abstract_canon_sha256":"5433042cfd62af7c56cc94f1af1273c84b819d0c6fa17ad398b7150a6594cfb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:58.166933Z","signature_b64":"vOIFmOiLtY/4MkyB5P2hlb+CUQKzuqqvAw/5Y1dgkN/gDjvz+MriN2IcW+C5KSlL/JeQsTHhaLlSwXs2hBzSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213e89ac1745b8f42af5396cfb72abc3592cfc28bb147e8dcfc8f1b74d025e70","last_reissued_at":"2026-07-05T10:39:58.166455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:58.166455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal storage capacity of quantum Hopfield neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Eliana Fiorelli, Lukas B\\\"odeker, Markus M\\\"uller","submitted_at":"2022-10-14T15:21:21Z","abstract_excerpt":"Quantum neural networks form one pillar of the emergent field of quantum machine learning. Here, quantum generalisations of classical networks realizing associative memories - capable of retrieving patterns, or memories, from corrupted initial states - have been proposed. It is a challenging open problem to analyze quantum associative memories with an extensive number of patterns, and to determine the maximal number of patterns the quantum networks can reliably store, i.e. their storage capacity. In this work, we propose and explore a general method for evaluating the maximal storage capacity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.07894","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/2210.07894/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":"2210.07894","created_at":"2026-07-05T10:39:58.166508+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.07894v1","created_at":"2026-07-05T10:39:58.166508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.07894","created_at":"2026-07-05T10:39:58.166508+00:00"},{"alias_kind":"pith_short_12","alias_value":"EE7ITLAXIW4P","created_at":"2026-07-05T10:39:58.166508+00:00"},{"alias_kind":"pith_short_16","alias_value":"EE7ITLAXIW4PIKXV","created_at":"2026-07-05T10:39:58.166508+00:00"},{"alias_kind":"pith_short_8","alias_value":"EE7ITLAX","created_at":"2026-07-05T10:39:58.166508+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08226","citing_title":"High-Capacity Generalized Hopfield Networks","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN","json":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN.json","graph_json":"https://pith.science/api/pith-number/EE7ITLAXIW4PIKXVHFWPW4VLYN/graph.json","events_json":"https://pith.science/api/pith-number/EE7ITLAXIW4PIKXVHFWPW4VLYN/events.json","paper":"https://pith.science/paper/EE7ITLAX"},"agent_actions":{"view_html":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN","download_json":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN.json","view_paper":"https://pith.science/paper/EE7ITLAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.07894&json=true","fetch_graph":"https://pith.science/api/pith-number/EE7ITLAXIW4PIKXVHFWPW4VLYN/graph.json","fetch_events":"https://pith.science/api/pith-number/EE7ITLAXIW4PIKXVHFWPW4VLYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN/action/storage_attestation","attest_author":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN/action/author_attestation","sign_citation":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN/action/citation_signature","submit_replication":"https://pith.science/pith/EE7ITLAXIW4PIKXVHFWPW4VLYN/action/replication_record"}},"created_at":"2026-07-05T10:39:58.166508+00:00","updated_at":"2026-07-05T10:39:58.166508+00:00"}