Game of arrivals at a two queue network with heterogeneous customer
  routes

By: Agniv Bandyopadhyay, Sandeep Juneja

We consider a queuing network that opens at a specified time, where customers are non-atomic and belong to different classes. Each class has its own route, and as is typical in the literature, the costs are a linear function of waiting and service completion time. We restrict ourselves to a two class, two queue network: this simplification is well motivated as the diversity in solution structure as a function of problem parameters is substa... more
We consider a queuing network that opens at a specified time, where customers are non-atomic and belong to different classes. Each class has its own route, and as is typical in the literature, the costs are a linear function of waiting and service completion time. We restrict ourselves to a two class, two queue network: this simplification is well motivated as the diversity in solution structure as a function of problem parameters is substantial even in this simple setting (e.g., a specific routing structure involves eight different regimes), suggesting a combinatorial blow up as the number of queues, routes and customer classes increase. We identify the unique Nash equilibrium customer arrival profile when the customer linear cost preferences are different. This profile is a function of problem parameters including the size of each class, service rates at each queue, and customer cost preferences. When customer cost preferences match, under certain parametric settings, the equilibrium arrival profiles may not be unique and may lie in a convex set. We further make a surprising observation that in some parametric settings, customers in one class may arrive in disjoint intervals. Further, the two classes may arrive in contiguous intervals or in overlapping intervals, and at varying rates within an interval, depending upon the problem parameters. less
Exploring the Potential of Flexible 8-bit Format: Design and Algorithm

By: Zhuoyi Zhang, Yunchen Zhang, Gonglei Shi, Yu Shen, Xiuying Wei, Ruihao Gong, Xiaoxu Xia, Qi Zhang, Lewei Lu, Xianglong Liu

Neural network quantization is widely used to reduce model inference complexity in real-world deployments. However, traditional integer quantization suffers from accuracy degradation when adapting to various dynamic ranges. Recent research has focused on a new 8-bit format, FP8, with hardware support for both training and inference of neural networks but lacks guidance for hardware design. In this paper, we analyze the benefits of using FP8... more
Neural network quantization is widely used to reduce model inference complexity in real-world deployments. However, traditional integer quantization suffers from accuracy degradation when adapting to various dynamic ranges. Recent research has focused on a new 8-bit format, FP8, with hardware support for both training and inference of neural networks but lacks guidance for hardware design. In this paper, we analyze the benefits of using FP8 quantization and provide a comprehensive comparison of FP8 with INT quantization. Then we propose a flexible mixed-precision quantization framework that supports various number systems, enabling optimal selection of the most appropriate quantization format for different neural network architectures. Experimental results demonstrate that our proposed framework achieves competitive performance compared to full precision on various tasks, including image classification, object detection, segmentation, and natural language understanding. Our work furnishes critical insights into the tangible benefits and feasibility of employing FP8 quantization, paving the way for heightened neural network efficiency in tangible scenarios. Our code is available in the supplementary material. less
Application Performance Benchmarks for Quantum Computers

By: Krzysztof Kurowski, Piotr Rydlichowski, Konrad Wojciechowski, Tomasz Pecyna, Mateusz Slysz

Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is even around one percent and the number of qubits is still limited to a few or several dozen, naturally, we need to propose rather small algorithms instances taken from key promising application areas, suc... more
Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is even around one percent and the number of qubits is still limited to a few or several dozen, naturally, we need to propose rather small algorithms instances taken from key promising application areas, such as quantum chemistry, combinatorial optimisation or machine learning. While many techniques for assessing the performance of logical components such as gate fidelity and qubit coherence exist, it is often challenging to extrapolate those values onto the performance of different quantum algorithms and subroutines. This work aims to introduce a series of initial quantum application benchmarks together with a methodology of execution for measuring performance and fidelity of the results. The proposed suite refers to several variational algorithms, widely-used on current NISQ devices, but also includes examples of quantum circuits designed for a fault-tolerant quantum computer. less
Collaborative Precoding Design for Adjacent Integrated Sensing and
  Communication Base Stations

By: Wangjun Jiang, Zhiqing Wei, Fan Liu, Zhiyong Feng, Ping Zhang

Integrated sensing and communication (ISAC) base stations can provide communication and wide range sensing information for vehicles via downlink (DL) transmission, thus enhancing vehicle driving safety. One major challenge for realizing high performance communication and sensing is how to deal with the DL mutual interference among adjacent ISAC base stations, which includes not only communication related interference, but also radar sensing... more
Integrated sensing and communication (ISAC) base stations can provide communication and wide range sensing information for vehicles via downlink (DL) transmission, thus enhancing vehicle driving safety. One major challenge for realizing high performance communication and sensing is how to deal with the DL mutual interference among adjacent ISAC base stations, which includes not only communication related interference, but also radar sensing related interference. In this paper, we establish a DL mutual interference model of adjacent ISAC base stations, and analyze the relationship for mutual interference channels between communications and radar sensing. To improve the sensing and communication performance, we propose a collaborative precoding design for coordinated adjacent base stations to mitigate the mutual interference under the transmit power constraint and constant modulus constraint, which is formulated as a non-convex optimization problem. We first relax the problem into a convex programming by omitting the rank constraint, and propose a joint optimization algorithm to solve the problem. We furthermore propose a sequential optimization algorithm, which divides the collaborative precoding design problem into four subproblems and finds the optimum via a gradient descent algorithm. Finally, we evaluate the collaborative precoding design algorithms by considering sensing and communication performance via numerical results. less