{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YKY6K2HFWDMV3CHHWBP6THYGRD","short_pith_number":"pith:YKY6K2HF","schema_version":"1.0","canonical_sha256":"c2b1e568e5b0d95d88e7b05fe99f0688f963a3e2434096ae80cb7156f9ce1798","source":{"kind":"arxiv","id":"1412.3489","version":2},"attestation_state":"computed","paper":{"title":"Quantum Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"quant-ph","authors_text":"Ashish Kapoor, Krysta M. Svore, Nathan Wiebe","submitted_at":"2014-12-10T23:05:16Z","abstract_excerpt":"In recent years, deep learning has had a profound impact on machine learning and artificial intelligence. At the same time, algorithms for quantum computers have been shown to efficiently solve some problems that are intractable on conventional, classical computers. We show that quantum computing not only reduces the time required to train a deep restricted Boltzmann machine, but also provides a richer and more comprehensive framework for deep learning than classical computing and leads to significant improvements in the optimization of the underlying objective function. Our quantum methods al"},"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":"1412.3489","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-10T23:05:16Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"5d0fbe9caaa321005791ddba4b4576af28dd788e8c77c0f8ff21ec565db143d8","abstract_canon_sha256":"6980a11fd39437d6ad640d51bca485aa6dfa87b8bf2fab0332d6a5f1a6d25a74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:50.694057Z","signature_b64":"+q/NsHy0gDBjXpsvHKK167Z5dwIiw0uBt50CuQ3H+j0KLvRWDc+cN9XgaLX58036WukbyUIR6aKLxBR3P6trAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b1e568e5b0d95d88e7b05fe99f0688f963a3e2434096ae80cb7156f9ce1798","last_reissued_at":"2026-05-18T02:03:50.693350Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:50.693350Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"quant-ph","authors_text":"Ashish Kapoor, Krysta M. Svore, Nathan Wiebe","submitted_at":"2014-12-10T23:05:16Z","abstract_excerpt":"In recent years, deep learning has had a profound impact on machine learning and artificial intelligence. At the same time, algorithms for quantum computers have been shown to efficiently solve some problems that are intractable on conventional, classical computers. We show that quantum computing not only reduces the time required to train a deep restricted Boltzmann machine, but also provides a richer and more comprehensive framework for deep learning than classical computing and leads to significant improvements in the optimization of the underlying objective function. Our quantum methods al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3489","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":""},"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":"1412.3489","created_at":"2026-05-18T02:03:50.693462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3489v2","created_at":"2026-05-18T02:03:50.693462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3489","created_at":"2026-05-18T02:03:50.693462+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKY6K2HFWDMV","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKY6K2HFWDMV3CHH","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKY6K2HF","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.06949","citing_title":"Quantum Data Fitting Algorithm for Non-sparse Matrices","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"1907.08267","citing_title":"Implementation of a Hamming-Distance-Like Genomic Quantum Classifier Using Inner Products on IBMQX4 and IBMQX16","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07473","citing_title":"Breaking QAOA's Fixed Target Hamiltonian Barrier: A Fully Connected Quantum Boltzmann Machine via Bilevel Optimization","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD","json":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD.json","graph_json":"https://pith.science/api/pith-number/YKY6K2HFWDMV3CHHWBP6THYGRD/graph.json","events_json":"https://pith.science/api/pith-number/YKY6K2HFWDMV3CHHWBP6THYGRD/events.json","paper":"https://pith.science/paper/YKY6K2HF"},"agent_actions":{"view_html":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD","download_json":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD.json","view_paper":"https://pith.science/paper/YKY6K2HF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3489&json=true","fetch_graph":"https://pith.science/api/pith-number/YKY6K2HFWDMV3CHHWBP6THYGRD/graph.json","fetch_events":"https://pith.science/api/pith-number/YKY6K2HFWDMV3CHHWBP6THYGRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD/action/storage_attestation","attest_author":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD/action/author_attestation","sign_citation":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD/action/citation_signature","submit_replication":"https://pith.science/pith/YKY6K2HFWDMV3CHHWBP6THYGRD/action/replication_record"}},"created_at":"2026-05-18T02:03:50.693462+00:00","updated_at":"2026-05-18T02:03:50.693462+00:00"}