Reducing resources in quantum circuits
A method of minimizing a cost function of a quantum computation is provided. The method comprises receiving input of an initial state of a quantum problem instance comprising a Hamiltonian with an associated cost function. The Hamiltonian is converted into a number of Pauli strings, which are used to form an operator pool. The Pauli strings in the operator pool are ranked according to how much they lower a value of the cost function with respect to the initial state. Pauli strings are iteratively added from the operator pool to a parameterized quantum circuit, in a manner to minimize circuit depth, until a variational quantum eigensolver (VQE) algorithm converges to an approximate ground state wave function generated by the parameterized quantum circuit.
1. A computer-implemented method of minimizing a cost function of a quantum computation, the method comprising:
using a number of processors to perform the steps of:
receiving input of an initial state of a quantum problem instance comprising a Hamiltonian with an associated cost function;
converting the Hamiltonian into a number of Pauli strings;
forming an operator pool from the Pauli strings;
ranking the Pauli strings in the operator pool according to how much they lower a value of the cost function with respect to the initial state; and
iteratively adding Pauli strings from the operator pool to a parameterized quantum circuit, in a manner to minimize circuit depth, until a variational quantum eigensolver (VQE) algorithm converges to an approximate ground state wave function generated by the parameterized quantum circuit.
2. The method of claim 1 , wherein the Pauli strings in the operator pool are further ranked according to non-identity operator path length.
3. The method of claim 2 , wherein Pauli strings with the same non-identity operator path length are grouped within a same equivalence class.
4. The method of claim 3 , wherein Pauli strings within the same equivalence class are ranked according to maximum exterior identity path length.
5. The method of claim 1 , wherein iteratively adding Pauli strings from the operator pool to the parameterized quantum circuit comprises:
adding a Pauli string from the operator pool to the parameterized quantum circuit according to rank;
running the VQE algorithm with the parameterized quantum circuit to determine if the VQE algorithm has reached convergence;
responsive to a determination that the VQE algorithm has not reached convergence, adding another Pauli string from the operator pool to the parameterized quantum circuit; and
responsive to a determination that the VQE algorithm has reached convergence or no Pauli strings remain in the operator pool, stopping iteration.
6. The method of claim 5 , wherein a new Pauli string added to the parameterized quantum circuit from the operator pool is selected to:
maximize overlap of identity operators in the new Pauli string with non-identity operators in the last added Pauli string; and
maximize overlap of non-identity operators in the new Pauli string with identity operators in the last added Pauli string.
7. The method of claim 5 , wherein running the VQE comprises:
generating, by the parameterized quantum circuit, a trial wave function;
calculating an expectation value for the cost function based on the trial wave function; and
optimizing, by a classical optimizer, a number of parameters of the parameterized quantum circuit, wherein optimal parameters correspond to values that generate a minimal value of the cost function.
8. The method of claim 1 , wherein after a Pauli string from the operator pool is added to the parameterized quantum circuit it is discarded from the operator pool and not used again in future iterations.
9. The method of claim 1 , wherein quantum gates in the parameterized quantum circuit correspond to non-identity operators in the Pauli strings.
10. A system for minimizing a cost function of a quantum computation, the system comprising:
a storage device configured to store program instructions; and
one or more processors operably connected to the storage device and configured to execute the program instructions to cause the system to:
receive input of an initial state of a quantum problem instance comprising a Hamiltonian with an associated cost function;
convert the Hamiltonian into a number of Pauli strings;
form an operator pool from the Pauli strings;
rank the Pauli strings in the operator pool according to how much they lower a value of the cost function with respect to the initial state; and
iteratively add Pauli strings from the operator pool to a parameterized quantum circuit, in a manner to minimize circuit depth, until a variational quantum eigensolver (VQE) algorithm converges to an approximate ground state wave function generated by the parameterized quantum circuit.
11. The system of claim 10 , wherein the Pauli strings in the operator pool are further ranked according to non-identity operator path length.
12. The system of claim 11 , wherein Pauli strings with the same non-identity operator path length are grouped within a same equivalence class.
13. The system of claim 12 , wherein Pauli strings within the same equivalence class are ranked according to maximum exterior identity path length.
14. The system of claim 10 , wherein iteratively adding Pauli strings from the operator pool to the parameterized quantum circuit comprises:
adding a Pauli string from the operator pool to the parameterized quantum circuit according to rank;
running the VQE algorithm with the parameterized quantum circuit to determine if the VQE algorithm has reached convergence;
responsive to a determination that the VQE algorithm has not reached convergence, adding another Pauli string from the operator pool to the parameterized quantum circuit; and
responsive to a determination that the VQE algorithm has reached convergence or no Pauli strings remain in the operator pool, stopping iteration.
15. The system of claim 14 , wherein a new Pauli string added to the parameterized quantum circuit from the operator pool is selected to:
maximize overlap of identity operators in the new Pauli string with non-identity operators in the last added Pauli string; and
maximize overlap of non-identity operators in the new Pauli string with identity operators in the last added Pauli string.
16. The system of claim 14 , wherein running the VQE comprises:
generating, by the parameterized quantum circuit, a trial wave function;
calculating an expectation value for the cost function based on the trial wave function; and
optimizing, by a classical optimizer, a number of parameters of the parameterized quantum circuit, wherein optimal parameters correspond to values that generate a minimal value of the cost function.
17. The system of claim 10 , wherein after a Pauli string from the operator pool is added to the parameterized quantum circuit it is discarded from the operator pool and not used again in future iterations.
18. The system of claim 10 , wherein quantum gates in the parameterized quantum circuit correspond to non-identity operators in the Pauli strings.
19. A computer program product for minimizing a cost function of a quantum computation, the computer program product comprising:
a computer-readable storage medium having program instructions embodied thereon to perform the steps of:
receiving input of an initial state of a quantum problem instance comprising a Hamiltonian with an associated cost function;
converting the Hamiltonian into a number of Pauli strings;
forming an operator pool from the Pauli strings;
ranking the Pauli strings in the operator pool according to how much they lower a value of the cost function with respect to the initial state; and
iteratively adding Pauli strings from the operator pool to a parameterized quantum circuit, in a manner to minimize circuit depth, until a variational quantum eigensolver (VQE) algorithm converges to an approximate ground state wave function generated by the parameterized quantum circuit.
20. The computer program product of claim 19 , wherein the Pauli strings in the operator pool are further ranked according to non-identity operator path length.
21. The computer program product of claim 20 , wherein Pauli strings with the same non-identity operator path length are grouped within a same equivalence class.
22. The computer program product of claim 21 , wherein Pauli strings within the same equivalence class are ranked according to maximum exterior identity path length.
23. The computer program product of claim 19 , wherein iteratively adding Pauli strings from the operator pool to the parameterized quantum circuit comprises:
adding a Pauli string from the operator pool to the parameterized quantum circuit according to rank;
running the VQE algorithm with the parameterized quantum circuit to determine if the VQE algorithm has reached convergence;
responsive to a determination that the VQE algorithm has not reached convergence, adding another Pauli string from the operator pool to the parameterized quantum circuit; and
responsive to a determination that the VQE algorithm has reached convergence or no Pauli strings remain in the operator pool, stopping iteration.
24. The computer program product of claim 23 , wherein a new Pauli string added to the parameterized quantum circuit from the operator pool is selected to:
maximize overlap of identity operators in the new Pauli string with non-identity operators in the last added Pauli string; and
maximize overlap of non-identity operators in the new Pauli string with identity operators in the last added Pauli string.
25. The computer program product of claim 23 , wherein running the VQE comprises:
generating, by the parameterized quantum circuit, a trial wave function;
calculating an expectation value for the cost function based on the trial wave function; and
optimizing, by a classical optimizer, a number of parameters of the parameterized quantum circuit, wherein optimal parameters correspond to values that generate a minimal value of the cost function.
26. The computer program product of claim 19 , wherein after a Pauli string from the operator pool is added to the parameterized quantum circuit it is discarded from the operator pool and not used again in future iterations.
27. The computer program product of claim 19 , wherein quantum gates in the parameterized quantum circuit correspond to non-identity operators in the Pauli strings.