The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Apr. 14, 2025

Filed:

Apr. 01, 2021
Applicant:

Tata Consultancy Services Limited, Mumbai, IN;

Inventors:

Sayantan Pramanik, Bangalore, IN;

Mariswamy Girish Chandra, Bangalore, IN;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06N 7/00 (2022.12); G06F 17/17 (2005.12); G06N 10/00 (2021.12);
U.S. Cl.
CPC ...
G06N 7/00 (2012.12); G06F 17/17 (2012.12); G06N 10/00 (2018.12);
Abstract

Quantum Information Processing (QIP) with the availability of Noisy Intermediate-Scale Quantum (NISQ) device(s) are available to work on quantum algorithms. Different problems, which are hard to solve by classical computation, but can be sped up (significantly in some cases) are also being populated. However, current approaches solve only two cluster max-cut problems. Mining the two cluster Max-Cut problem within the framework of quantum Ising model, embodiments of the present disclosure solve Quadratic Unconstrained D-ary Optimization (QUDO) problems by quantum computing with the identification of an appropriate Hamiltonian. More specifically, the problem is mapped to an Ising model to obtain a d-ray Quantum Ising Hamiltonian. The d-ray Quantum Ising Hamiltonian is then executed on one or more qudit processors, to obtain one or more resultant quantum states which are measured in a qudit computational basis to obtain at least one solution.


Find Patent Forward Citations

Pramanik, Sayantan. (2025). Systems and method for solving quadratic unconstrained d-ary optimization (qudo) problems by quantum computing (U.S. Patent No. 12277510). U.S. Patent and Trademark Office. https://idiyas.com/patent/badge/12277510

Data source: USPTO (United States Patent and Trademark Office) public patent records. Weekly synchronization. How IDiyas builds this profile

Loading…