The connection between the maximum entropy (MaxEnt) formalism and restricted Boltzmann machines (RBMs) is natural as both give rise to a Boltzmann-like distribution with constraints enforced by Lagrange multipliers, which correspond to RBM parameters. We integrate RBMs into quantum state tomography by using them as probabilistic models to approximate quantum states while satisfying MaxEnt constraints. Additionally, we employ polynomially efficient quantum sampling techniques to enhance RBM training, enabling scalable and high-fidelity quantum state reconstruction. This approach provides a computationally efficient framework for applying RBMs to MaxEnt-based quantum tomography. Furthermore, our method applies to the general and previously unaddressed case of reconstructing arbitrary mixed quantum states from incomplete and potentially noncommuting sets of expectations of observables while still ensuring maximal entropy.
The connection between the maximum entropy (MaxEnt) formalism and restricted Boltzmann machines (RBMs) is natural as both give rise to a Boltzmann-like distribution with constraints enforced by Lagrange multipliers, which correspond to RBM parameters. We integrate RBMs into quantum state tomography by using them as probabilistic models to approximate quantum states while satisfying MaxEnt constraints. Additionally, we employ polynomially efficient quantum sampling techniques to enhance RBM training, enabling scalable and high-fidelity quantum state reconstruction. This approach provides a computationally efficient framework for applying RBMs to MaxEnt-based quantum tomography. Furthermore, our method applies to the general and previously unaddressed case of reconstructing arbitrary mixed quantum states from incomplete and potentially noncommuting sets of expectations of observables while still ensuring maximal entropy.
Quantum state tomography is an integral part of quantum computation and offers the starting point for the validation of various quantum devices. One of the central tasks in the field of state tomography is to reconstruct, with high fidelity, the quantum states of a quantum system. From an experiment on a real quantum device, one can obtain the mean measurement values of different operators. With such data as input, in this report we employ the maximal entropy formalism to construct the least biased mixed quantum state that is consistent with the given set of expectation values. Even though, in principle, the reported formalism is quite general and should work for an arbitrary set of observables, in practice we shall demonstrate the efficacy of the algorithm on an informationally complete (IC) set of Hermitian operators. Such a set possesses the advantage of uniquely specifying a single quantum state from which the experimental measurements have been sampled and hence renders the rare opportunity not only to construct a least-biased quantum state but even replicate the exact state prepared experimentally within a preset tolerance. The primary workhorse of the algorithm is reconstructing an energy function which we designate as the effective Hamiltonian of the system, and parameterizing it with Lagrange multipliers, according to the formalism of maximal entropy. These parameters are thereafter optimized variationally so that the reconstructed quantum state of the system converges to the true quantum state within an error threshold. To this end, we employ a parameterized quantum circuit and a hybrid quantum-classical variational algorithm to obtain such a target state, making our recipe easily implementable on a near-term quantum device.
Quantum state tomography provides a fundamental framework for reconstructing quantum states. When the measurement data are not informationally complete, the observed statistics admit multiple compatible density matrices, making the reconstruction problem inherently underdetermined and calling for the selection of a meaningful estimator. Two well-established approaches to address this ambiguity are Maximum Entropy (MaxEnt) and Variational Quantum Tomography (VQT). A variant of VQT, named VQT∞, has been introduced to reproduce MaxEnt-like solutions. In this work, we generalize this approach by introducing a parametrized cost function that interpolates between the 1-norm and the infinity norm, thereby unifying VQT and VQT∞ within a single framework. By tuning the associated hyperparameters, the proposed method enables controlled exploration of the set of compatible density matrices. We show that this interplay yields reconstructed states with higher fidelity to the MaxEnt solution than those obtained via VQT∞ while preserving computational tractability.
We propose a Restricted Boltzmann Machine (RBM) neural network using a quantum thermodynamics formalism and the maximization of entropy as the cost function for the optimization problem. We verify the possibility of using an entropy maximization approach for modeling physical systems by applying it to the Inverse Ising Problem, which describes a system of interacting spins. The temperature-dependent behaviors of physical quantities, such as magnetization and Gibbs energy, were calculated from the Ising Hamiltonian whose coefficients were obtained through entropy maximization and were found to be in good agreement to literature results. These results suggest that RBM neural networks using the principle of maximum entropy can be applied to modeling physical systems that can be described by discrete states, including fundamental quantum physics such as topological systems, and biological systems such as the correlated spiking of neurons.
Whenever we do not have an informationally complete set of measurements, the estimate of a quantum state cannot be uniquely determined. In this case, among the density matrices compatible with the available data, the one commonly preferred is the one which is the most uncommitted to the missing information. This is the purpose of the maximum entropy estimation (MaxEnt) and the variational quantum tomography (VQT). Here, we propose a variant of VQT and show its relationship with MaxEnt methods in quantum tomographies with an incomplete set of measurements. We prove their equivalence in the case of eigenbasis measurements, and through numerical simulations we stress their similar behavior. Hence, in the modified VQT formulation we have an estimate of a quantum state as unbiased as in MaxEnt and with the benefit that VQT can be more efficiently solved by means of linear semidefinite programs.
Quantum computers offer the potential for efficiently sampling from complex probability distributions, attracting increasing interest in generative modeling within quantum machine learning. This surge in interest has driven the development of numerous generative quantum models, yet their trainability and scalability remain significant challenges. A notable example is a quantum restricted Boltzmann machine (QRBM), which is based on the Gibbs state of a parameterized non-commuting Hamiltonian. While QRBMs are expressive, their non-commuting Hamiltonians make gradient evaluation computationally demanding, even on fault-tolerant quantum computers. In this work, we propose a semi-quantum restricted Boltzmann machine (sqRBM), a model designed for classical data that mitigates the challenges associated with previous QRBM proposals. The sqRBM Hamiltonian is commuting in the visible subspace while remaining non-commuting in the hidden subspace. This structure allows us to derive closed-form expressions for both output probabilities and gradients. Leveraging these analytical results, we demonstrate that sqRBMs share a close relationship with classical restricted Boltzmann machines (RBM). Our theoretical analysis predicts that, to learn a given probability distribution, an RBM requires three times as many hidden units as an sqRBM, while both models have the same total number of parameters. We validate these findings through numerical simulations involving up to 100 units. Our results suggest that sqRBMs could enable practical quantum machine learning applications in the near future by significantly reducing quantum resource requirements.
Quantum Boltzmann machines are natural quantum generalizations of Boltzmann machines that are expected to be more expressive than their classical counterparts, as evidenced both numerically for small systems and asymptotically under various complexity theoretic assumptions. However, training quantum Boltzmann machines using gradient-based methods requires sampling observables in quantum thermal distributions, a problem that is NP-hard. In this work, we find that the locality of the gradient observables gives rise to an efficient sampling method based on the Eigenstate Thermalization Hypothesis, and thus through Hamiltonian simulation an efficient method for training quantum Boltzmann machines on near-term quantum devices. Furthermore, under realistic assumptions on the moments of the data distribution to be modeled, the distribution sampled using our algorithm is approximately the same as that of an ideal quantum Boltzmann machine. We demonstrate numerically that under the proposed training scheme, quantum Boltzmann machines capture multimodal Bernoulli distributions better than classical restricted Boltzmann machines with the same connectivity structure. We also provide numerical results on the robustness of our training scheme with respect to noise.