Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization
Javier Lopez-Piqueres, Jing Chen, Alejandro Perdomo-Ortiz
备注:
v2. Improved version: restructured the paper; corrected complexity analysis and put more details of the encoding algorithm; added new, and improved some existing figures for clarity; added a few extra refs. v3. Shortened captions, added new table with outline of algorithm
Constrained combinatorial optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In some heuristic solvers, these are typically addressed by introducing certain Lagrange multipliers in the cost function, by relaxing them in some way, or worse yet, by generating many samples and only keeping valid ones, which leads to very expensive and inefficient searches. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric tensor networks (TNs) and leverage their applicability as quantum-inspired generative models to assist in the search of solutions to combinatorial optimization problems. This allows us to exploit the generalization capabilities of TN generative models while constraining them so that they only output valid samples. Our constrained TN generative model efficiently captures the constraints by reducing number of parameters and computational costs. We find that at tasks with constraints given by arbitrary equalities, symmetric Matrix Product States outperform their standard unconstrained counterparts at finding novel and better solutions to combinatorial optimization problems.
Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver
National Institute of Advanced Industrial Science and Technology(日本先进工业科学技术研究所);NVIDIA Corporation(英伟达公司);University of Toronto(多伦多大学);Vector Institute for Artificial Intelligence(向量人工智能研究所);DENSO CORPORATION(电装公司)
Variational Quantum Algorithm for Constrained Combinatorial Optimization Problems
College of Science, North China Institute of Science and Technology(华北科技学院理学院);School of Mathematical Sciences, Capital Normal University(首都师范大学数学科学学院)
All-valid-state HOBO encoding for constrained combinatorial optimization on NISQ devices
Tokyo University of Agriculture and Technology(东京农工大学);The Institute of Medical Science, The University of Tokyo(东京大学医学科学研究所);The University of Tokyo(东京大学)
Constrained Quantum Optimization at Utility Scale: Application to the Knapsack Problem
E.ON Digital Technology GmbH(E.ON数字技术有限公司);University of Calgary(卡尔加里大学);Université de Sherbrooke(舍布鲁克大学);IBM Quantum, Thomas J. Watson Research Center(IBM量子,托马斯·J·沃森研究中心)