Abstract: There is presented a method of driving a quantum computer to find one or more states of interest of a network. In one example, the network comprising a plurality of players. The method determines a set of adjacent graphs by determining, for each graph, whether each of the other graphs are adjacent. The method defines a cost function associated with a Hamiltonian operator of the quantum computer; the cost function comprising a set of parameters determined by analysing the utilities of vertices in the set of adjacent graphs. The method further comprises outputting a plurality of control signals for driving the quantum computer wherein the control signals are associated with the set of parameters and comprise: one or more control signals for controlling the states of qubits in the quantum computer; and, one or more control signals for controlling the entanglement of qubits in the quantum computer.

Abstract: Disclosed are systems and computer implemented methods for providing quantum computing as a service. According to one embodiment the system includes a frontend computing system storing a frontend computer program, a backend computing system, and a quantum computer, the frontend computer program being a spreadsheet application configured to receive a service request from a user, the service request comprising service request parameters and input data. The frontend computing system sends the service request to the backend computing system, which is configured to encode it to a service job in a format suitable for the quantum computer to execute, and to submit the service job to the quantum computer. The quantum computer is configured to execute the service job and to provide service job results to the backend computing system, which translates them into results data and sends them to the frontend computing system.