US 12,259,942 B2
Systems and methods for optimization of time evolution for quantum computer-based eigenvalue estimation
Pierre Minssen, New York, NY (US); Romina Yalovetzky, Buenos Aires (AR); Dylan Herman, Woodcliff Lake, NJ (US); Marco Pistoia, Amawalk, NY (US); Alexander Buts, Vernon Hills, IL (US); and Shaohan Hu, Yorktown Heights, NY (US)
Assigned to JPMORGAN CHASE BANK, N.A., New York, NY (US)
Filed by JPMORGAN CHASE BANK, N.A., New York, NY (US)
Filed on May 26, 2021, as Appl. No. 17/331,472.
Prior Publication US 2022/0382830 A1, Dec. 1, 2022
Int. Cl. G06F 17/16 (2006.01); G06F 7/22 (2006.01); G06N 10/00 (2022.01)
CPC G06F 17/16 (2013.01) [G06F 7/22 (2013.01); G06N 10/00 (2019.01)] 18 Claims
OG exemplary drawing
 
1. A method for optimization of time evolution of quantum computer-based eigenvalue estimation comprising:
receiving, by a classical computer program executed by a classical computer, input data;
populating, by the classical computer program, a Hermitian matrix A with the input data;
calculating, by the classical computer program, an upper bound a for a maximum eigenvalue (in modulo) for the Hermitian matrix A;
initializing, by the classical computer program, a time evolution value t, wherein t=1/a;
generating, by the classical computer program, a first quantum computer program using the time evolution value t;
communicating, by the classical computer program, the first quantum computer program to a quantum computer, wherein the quantum computer is configured to execute the first quantum computer program;
receiving, by the classical computer program, a result of the execution of the first quantum computer program, wherein the result comprises a binary value for each n-bit string and a probability for each binary value;
determining, by the classical computer program, an infidelity level for each gate in the quantum computer;
discarding, by the classical computer program, the n-bit strings having a probability that is less than a threshold that is based on the infidelity level;
converting, by the classical computer program, each binary value into an integer;
identifying, by the classical computer program, a maximum absolute value of the integers;
determining, by the classical computer program, a value x for the maximum absolute value of all of the integers;
updating, by the classical computer program, the time evolution value t based on the value of x;
generating, by the classical computer program, a second quantum computer program using the updated time evolution value t; and
communicating, by the classical computer program, the second quantum computer program to the quantum computer, wherein the quantum computer is configured to execute the second quantum computer program.