US 12,277,510 B2
Systems and method for solving Quadratic Unconstrained D-ary Optimization (QUDO) problems by quantum computing
Sayantan Pramanik, Bangalore (IN); and Mariswamy Girish Chandra, Bangalore (IN)
Assigned to Tata Consultancy Services Limited, Mumbai (IN)
Filed by Tata Consultancy Services Limited, Mumbai (IN)
Filed on Apr. 2, 2021, as Appl. No. 17/221,468.
Claims priority of application No. 202121007143 (IN), filed on Feb. 19, 2021.
Prior Publication US 2022/0269961 A1, Aug. 25, 2022
Int. Cl. G06N 7/00 (2023.01); G06F 17/17 (2006.01); G06N 10/00 (2022.01)
CPC G06N 7/00 (2013.01) [G06F 17/17 (2013.01); G06N 10/00 (2019.01)] 12 Claims
OG exemplary drawing
 
1. A processor implemented method for solving Quadratic Unconstrained D-ary Optimization (QUDO) problems, comprising:
receiving, via one or more hardware processors, an input graph comprising a plurality of nodes and a plurality of edges, wherein the input graph comprises a d-ary problem to be solved;
mapping, via the one or more hardware processors, the d-ary problem to an Ising Model to obtain a d-ary Quantum Ising Hamiltonian, wherein the d-ary Quantum Ising Hamiltonian is indicative of a cost function, wherein the d-ary Quantum Ising Hamiltonian is obtained by replacing Pauli X and Z matrices comprising a binary Quantum Ising Hamiltonian by d-dimensional shift and clock matrices respectively, and corresponding tensor products, and wherein the Pauli X and Z matrices correspond to an ith node of the input graph;
executing, via the one or more hardware processors, the d-ary Quantum Ising Hamiltonian indicative of the cost function on one or more qudit processors to obtain one or more resultant quantum states, wherein the one or more resultant quantum states correspond to the identified d-ary problem; and
measuring, via the one or more hardware processors, the one or more resultant quantum states in a qudit computational basis to obtain at least one solution.