Method and apparatus for evolving a quantum system using a mixed initial Hamiltonian comprising both diagonal and off-diagonal terms
View Patent ↗Various adaptations to adiabatic quantum computation and quantum annealing are described. These adaptations generally involve tailoring an initial Hamiltonian so that a local minimum is avoided when a quantum processor is evolved from the initial Hamiltonian to a problem Hamiltonian. The initial Hamiltonian may represent a mixed Hamiltonian that includes both diagonal and off-diagonal terms, where the diagonal terms at least partially define a center point of a first computation space that is at least partially contained within a second computation space. A problem Hamiltonian may be evolved into a low energy state by inhomogeneously inducing disorder in the qubits of the quantum processor. A higher degree of disorder may be induced in a subset of qubits predicted to contribute to a local minimum of the problem Hamiltonian.
1. A method of solving a problem by evolving a quantum processor from a first configuration that represents an initial Hamiltonian including off-diagonal terms to a second configuration that represents a problem Hamiltonian including diagonal terms, the method comprising:
configuring the problem Hamiltonian to encode the problem;
pre-processing the problem Hamiltonian by a processor system;
configuring the initial Hamiltonian based on a result of pre-processing the problem Hamiltonian such that a state of a quantum processor avoids a local minimum during an evolution from the initial Hamiltonian to the problem Hamiltonian;
initializing the quantum processor in the first configuration, wherein the first configuration represents the initial Hamiltonian;
evolving the quantum processor to the second configuration, wherein the second configuration represents the problem Hamiltonian, and wherein a state of the quantum processor avoids a local minimum during the evolution; and
reading out the state of the quantum processor.
2. The method of claim 1 wherein pre-processing the problem Hamiltonian includes pre-processing the problem Hamiltonian using a classical digital computer.
3. The method of claim 1 wherein configuring the initial Hamiltonian includes adapting the initial Hamiltonian to include off-diagonal and diagonal terms.
4. The method of claim 3 wherein the diagonal terms at least partially define a center point of a first computation space that is at least partially contained within a second computation space, and wherein the second computation space is larger than the first computation space and the state of the quantum processor remains within the first computation space throughout the evolution.
5. The method of claim 4 , further comprising repeating the initializing the quantum processor, evolving the quantum processor, and reading out the state of the quantum processor in a plurality of iterations.
6. The method of claim 5 wherein at least one iteration involves initializing the quantum processor with a center point that is different from a center point in at least one other iteration.
7. The method of claim 6 wherein each iteration includes evolving within a unique first computation space, thereby defining a set of first computation spaces.
8. The method of claim 7 wherein the set of first computation spaces covers the second computation space.
9. The method of claim 1 wherein configuring the initial Hamiltonian includes adapting the initial Hamiltonian to include inhomogeneous off-diagonal terms.
10. The method of claim 9 wherein the quantum processor includes a plurality of qubits and the inhomogeneous off-diagonal terms are realized by applying a respective disordering signal to each qubit, each disordering signal inducing a quantum tunneling in the respective qubit to which the disordering signal is applied.
11. The method of claim 10 wherein the problem Hamiltonian is at least partially defined by a configuration of inter-couplings between the qubits in the plurality of qubits, and furthering comprising:
applying a respective total coupling value to each qubit in the plurality of qubits.
12. The method of claim 11 wherein applying a respective disordering signal to each qubit in the plurality of qubits includes applying a respective disordering signal that is dependent on the respective total coupling value applied to each qubit.