QOPTLib
收藏资源简介:
QOPTLib是一个面向量子计算的组合优化问题基准数据集,由巴斯克研究和科技联盟创建。该数据集包含40个实例,均匀分布在四个知名问题上:旅行商问题、车辆路径问题、一维装箱问题和最大割问题。数据集的大小和复杂度设计为既包含小型示例,也包含更复杂的实例,以便于量子处理单元(QPU)处理。QOPTLib的创建旨在为量子优化领域提供一个通用的测试平台,解决量子算法评估和比较的问题。
QOPTLib is a benchmark dataset for combinatorial optimization problems in quantum computing, developed by the Basque Research and Technology Alliance. It contains 40 instances evenly distributed across four well-known problem categories: the Traveling Salesman Problem (TSP), Vehicle Routing Problem (VRP), One-Dimensional Bin Packing Problem, and Max-Cut Problem. The dataset's size and complexity are designed to cover both small-scale test cases and more complex instances, facilitating processing by Quantum Processing Units (QPUs). QOPTLib was created to provide a universal test platform for the quantum optimization field, addressing the challenges associated with the evaluation and comparison of quantum algorithms.

- 1QOPTLib: a Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems巴斯克研究和科技联盟 · 2024年



