Tensor network annealing method and system for optimization of machine learning tasks

TW202640435APending Publication Date: 2026-10-01MULTIVERSE COMPUTING SL
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
TW114151839
Authority / Receiving Office
TW · TW
Patent Type
Applications
Current Assignee / Owner
Priority Date
2024-12-31
Filing Date
2025-12-30
Publication Date
2026-10-01

Smart Images

  • Figure TWG2TA001078914_001
    Figure TWG2TA001078914_001
  • Figure TWG2TA001078914_002
    Figure TWG2TA001078914_002
  • Figure TWG2TA001078914_003
    Figure TWG2TA001078914_003
Patent Text Reader

Abstract

A computer-implemented method for performing computational optimization in machine learning and data science involves a system equipped with at least one processor and memory. This method encompasses storing vectors, defining vector-scalar multiplication, and configuring the processor to operate as an annealer. Key steps include transforming a multi-variable binary function into a matrix product state (MPS) format, constructing the MPS with a specific bond dimension, and decomposing vectors for optimal efficiency. The method employs a maximal bond dimension for the tensor train, determining its final state, and utilizes tensor network compression techniques to compress the matrix product state. It addresses Quadratic Unconstrained Binary Optimization (QUBO), frequently used in machine learning, to optimize binary functions. Additionally, the system includes a computer program product and a computer-readable data carrier for executing this method, providing a robust framework for annealing tasks and optimization using memory and processor configurations designed for matrix product state representation and compression.
Need to check novelty before this filing date? Find Prior Art