{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:D3AZVENYETJLVKY4B2JOOMGXWK","short_pith_number":"pith:D3AZVENY","schema_version":"1.0","canonical_sha256":"1ec19a91b824d2baab1c0e92e730d7b2af6cea7f6d731838e90bcae8ef21c165","source":{"kind":"arxiv","id":"1601.02036","version":1},"attestation_state":"computed","paper":{"title":"Quantum Boltzmann Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bohdan Kulchytskyy, Evgeny Andriyash, Jason Rolfe, Mohammad H. Amin, Roger Melko","submitted_at":"2016-01-08T21:42:03Z","abstract_excerpt":"Inspired by the success of Boltzmann Machines based on classical Boltzmann distribution, we propose a new machine learning approach based on quantum Boltzmann distribution of a transverse-field Ising Hamiltonian. Due to the non-commutative nature of quantum mechanics, the training process of the Quantum Boltzmann Machine (QBM) can become nontrivial. We circumvent the problem by introducing bounds on the quantum probabilities. This allows us to train the QBM efficiently by sampling. We show examples of QBM training with and without the bound, using exact diagonalization, and compare the results"},"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":"1601.02036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-01-08T21:42:03Z","cross_cats_sorted":[],"title_canon_sha256":"106e0986bbdfca12508400e313785747d17bb158ba5cd27c7778d71fa18e29bb","abstract_canon_sha256":"fe674310ae568bb0804690e6abb3d714249ba7556b653dda5f184a05b8c46e07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:47.929794Z","signature_b64":"71Uu8oQEO7aJVgSTidR1D+3P4afmtTH2+5GjSt/QG/krtKQ+QPPn9qVm8f/W27M3GKc7XNr13VXM1QkbysI2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ec19a91b824d2baab1c0e92e730d7b2af6cea7f6d731838e90bcae8ef21c165","last_reissued_at":"2026-05-18T00:14:47.929409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:47.929409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Boltzmann Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Bohdan Kulchytskyy, Evgeny Andriyash, Jason Rolfe, Mohammad H. Amin, Roger Melko","submitted_at":"2016-01-08T21:42:03Z","abstract_excerpt":"Inspired by the success of Boltzmann Machines based on classical Boltzmann distribution, we propose a new machine learning approach based on quantum Boltzmann distribution of a transverse-field Ising Hamiltonian. Due to the non-commutative nature of quantum mechanics, the training process of the Quantum Boltzmann Machine (QBM) can become nontrivial. We circumvent the problem by introducing bounds on the quantum probabilities. This allows us to train the QBM efficiently by sampling. We show examples of QBM training with and without the bound, using exact diagonalization, and compare the results"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02036","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":""},"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":"1601.02036","created_at":"2026-05-18T00:14:47.929467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02036v1","created_at":"2026-05-18T00:14:47.929467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02036","created_at":"2026-05-18T00:14:47.929467+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3AZVENYETJL","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3AZVENYETJLVKY4","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3AZVENY","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06857","citing_title":"Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16718","citing_title":"Potential Energy Savings from Quantum Computing-Based Route Optimization","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK","json":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK.json","graph_json":"https://pith.science/api/pith-number/D3AZVENYETJLVKY4B2JOOMGXWK/graph.json","events_json":"https://pith.science/api/pith-number/D3AZVENYETJLVKY4B2JOOMGXWK/events.json","paper":"https://pith.science/paper/D3AZVENY"},"agent_actions":{"view_html":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK","download_json":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK.json","view_paper":"https://pith.science/paper/D3AZVENY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02036&json=true","fetch_graph":"https://pith.science/api/pith-number/D3AZVENYETJLVKY4B2JOOMGXWK/graph.json","fetch_events":"https://pith.science/api/pith-number/D3AZVENYETJLVKY4B2JOOMGXWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK/action/storage_attestation","attest_author":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK/action/author_attestation","sign_citation":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK/action/citation_signature","submit_replication":"https://pith.science/pith/D3AZVENYETJLVKY4B2JOOMGXWK/action/replication_record"}},"created_at":"2026-05-18T00:14:47.929467+00:00","updated_at":"2026-05-18T00:14:47.929467+00:00"}