Abstract: A method of training a quantum computer employs quantum algorithms. The method comprises loading, into the quantum computer, a description of a quantum Boltzmann machine, and training the quantum Boltzmann machine according to a protocol, wherein a classification error is used as a metric for the protocol.

Abstract: Embodiments of a new approach for training a class of quantum neural networks called quantum Boltzmann machines are disclosed. in particular examples, methods for supervised training of a quantum Boltzmann machine are disclosed using an ensemble of quantum states that the Boltzmann machine is trained to replicate. Unlike existing approaches to Boltzmann training, example embodiments as disclosed herein allow for supervised training even in cases where only quantum examples are known (and not probabilities from quantum measurements of a set of states). Further, this approach does not require the use of approximations such as the Golden-Thompson inequality.

Abstract: A processing unit can determine multiple representations associated with a statement, e.g., subject or predicate representations. In some examples, the representations can lack representation of semantics of the statement. The computing device can determine a computational model of the statement based at least in part on the representations. The computing device can receive a query, e.g., via a communications interface. The computing device can determine at least one query representation, e.g., a subject, predicate, or entity representation. The computing device can then operate the model using the query representation to provide a model output. The model output can represent a relationship between the query representations and information in the model. The computing device can, e.g., transmit an indication of the model output via the communications interface.

Abstract: A processing unit can determine multiple representations associated with a statement, e.g., subject or predicate representations. In some examples, the representations can lack representation of semantics of the statement. The computing device can determine a computational model of the statement based at least in part on the representations. The computing device can receive a query, e.g., via a communications interface. The computing device can determine at least one query representation, e.g., a subject, predicate, or entity representation. The computing device can then operate the model using the query representation to provide a model output. The model output can represent a relationship between the query representations and information in the model. The computing device can, e.g., transmit an indication of the model output via the communications interface.