Systems and methods employing new evolution schedules in an analog computer with applications to determining isomorphic graphs and post-processing solutions

A system for use in quantum processing, comprising:

• at least one non-transitory processor-readable medium that stores at least one of processor executable instructions or data;
• and
• at least one processor communicatively coupled to the least one non-transitory processor-readable medium, and which, in response to execution of the at least one of processor executable instructions or data:
• for a first computational problem defined by a problem Hamiltonian, during a first iteration on the first computational problem:
• initializes the analog processor to a zeroth state via application of a local bias value to a plurality of quantum devices in the analog processor;
• evolves the analog processor to a first state under an instant Hamiltonian that includes a problem Hamiltonian wherein:
• the problem Hamiltonian has no local biases on the plurality of quantum devices, and
• the problem Hamiltonian has no couplings between the devices in the plurality of quantum devices;
• evolves the analog processor under a first linear evolution schedule;
• and
• reads out a first final state of the analog processor.

A computational method, comprising:

• for a first computational problem defined by a problem Hamiltonian, during a first iteration by at least one processor on the first computational problem:
• initializing the analog processor to a zeroth state via application of a local bias value to a plurality of quantum devices in the analog processor;
• evolving the analog processor to a first state under an instant Hamiltonian that includes a problem Hamiltonian wherein:
• the problem Hamiltonian has no local biases on the plurality of quantum devices, and
• the problem Hamiltonian has no couplings between the devices in the plurality of quantum devices;
• evolving the analog processor under a first non-linear evolution schedule;
• and
• reading out a first final state of the analog processor.

A computational method, comprising:

• for a first computational problem defined by a problem Hamiltonian, during a first iteration by at least one processor on the first computational problem:
• initializing the analog processor to a zeroth state via application of a local bias value to a plurality of quantum devices in the analog processor;
• evolving the analog processor to a first state under an instant Hamiltonian that includes a problem Hamiltonian wherein:
• the problem Hamiltonian has no local biases on the plurality of quantum devices, and
• the problem Hamiltonian has no couplings between the devices in the plurality of quantum devices;
• evolving the analog processor under a first linear evolution schedule;
• and
• reading out a first final state of the analog processor.