Conventional and Enhanced Canonical Quantizations, Application to Some Simple Manifolds

It is well known that the representations over an arbitrary configuration space related to a physical system of the Heisenberg algebra allow to distinguish the simply and non simply-connected manifolds [arXiv:quant-ph/9908.014, arXiv:hep-th/0608.023]. In the light of this classification, the dynamics of a quantum particle on the line is studied in the framework of the conventional quantization scheme as well as that of the enhanced quantization recently introduced by J. R. Klauder [arXiv:quant-ph/1204.2870]. The quantum action functional restricted to the phase space coherent states is obtained from the enhanced quantization procedure, showing the coexistence of classical and quantum theories, a fundamental advantage offered by this new approach. The example of the one dimensional harmonic oscillator is given. Next, the spectrum of a free particle on the two-sphere is recognized from the covariant diffeomorphic representations of the momentum operator in the configuration space. Our results based on simple models also point out the already-known link between interaction and topology at quantum level.

The Enhanced Period Map and Equivariant Deformation Quantizations of Nilpotent Orbits

In a previous paper,the author and his collaborator studied the problem of lifting Hamil-tonian group actions on symplectic varieties and Lagrangian subvarieties to their graded deformation quantizations and apply the general results to coadjoint orbit method for semisimple Lie groups.Only even quantizations were considered there.In this paper,these results are generalized to the case of general quantizations with arbitrary periods.The key step is to introduce an enhanced version of the(truncated)period map defined by Bezrukavnikov and Kaledin for quantizations of any smooth sym-plectic variety X,with values in the space of Picard Lie algebroid over X.As an application,we study quantizations of nilpotent orbits of real semisimple groups satisfying certain codimension condition.

Activation Redistribution Based Hybrid Asymmetric Quantization Method of Neural Networks

The demand for adopting neural networks in resource-constrained embedded devices is continuously increasing.Quantization is one of the most promising solutions to reduce computational cost and memory storage on embedded devices.In order to reduce the complexity and overhead of deploying neural networks on Integeronly hardware,most current quantization methods use a symmetric quantization mapping strategy to quantize a floating-point neural network into an integer network.However,although symmetric quantization has the advantage of easier implementation,it is sub-optimal for cases where the range could be skewed and not symmetric.This often comes at the cost of lower accuracy.This paper proposed an activation redistribution-based hybrid asymmetric quantizationmethod for neural networks.The proposedmethod takes data distribution into consideration and can resolve the contradiction between the quantization accuracy and the ease of implementation,balance the trade-off between clipping range and quantization resolution,and thus improve the accuracy of the quantized neural network.The experimental results indicate that the accuracy of the proposed method is 2.02%and 5.52%higher than the traditional symmetric quantization method for classification and detection tasks,respectively.The proposed method paves the way for computationally intensive neural network models to be deployed on devices with limited computing resources.Codes will be available on https://github.com/ycjcy/Hybrid-Asymmetric-Quantization.

Distributed Nash Equilibrium Seeking Strategies Under Quantized Communication

This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.

Quantizations of the Extended Affine Lie Algebra Sl2（Cq）

In this paper, the extended affine Lie algebra sl2（Cq） is quantized from three different points of view, which produces three non-commutative and non-cocommutative Hopf algebra structures, and yields other three quantizations by an isomorphism of sl2 （Cq） correspondingly. Moreover, two of these quantizations can be restricted to the extended affine Lie algebra sl2（Cq）.

A Tutorial on Quantized Feedback Control

In this tutorial paper, we explore the field of quantized feedback control, which has gained significant attention due to the growing prevalence of networked control systems. These systems require the transmission of feedback information, such as measurements and control signals, over digital networks, presenting novel challenges in estimation and control design. Our examination encompasses various topics, including the minimal information needed for effective feedback control, the design of quantizers, strategies for quantized control design and estimation,achieving consensus control with quantized data, and the pursuit of high-precision tracking using quantized measurements.

In situ calibrated angle between the quantization axis and the propagating direction of the light field for trapping neutral atoms

The recently developed magic-intensity trapping technique of neutral atoms efficiently mitigates the detrimental effect of light shifts on atomic qubits and substantially enhances the coherence time. This technique relies on applying a bias magnetic field precisely parallel to the wave vector of a circularly polarized trapping laser field. However, due to the presence of the vector light shift experienced by the trapped atoms, it is challenging to precisely define a parallel magnetic field, especially at a low bias magnetic field strength, for the magic-intensity trapping of85Rb qubits. In this work, we present a method to calibrate the angle between the bias magnetic field and the trapping laser field with the compensating magnetic fields in the other two directions orthogonal to the bias magnetic field direction. Experimentally, with a constantdepth trap and a fixed bias magnetic field, we measure the respective resonant frequencies of the atomic qubits in a linearly polarized trap and a circularly polarized one via the conventional microwave Rabi spectra with different compensating magnetic fields and obtain the corresponding total magnetic fields via the respective resonant frequencies using the Breit–Rabi formula. With known total magnetic fields, the angle is a function of the other two compensating magnetic fields.Finally, the projection value of the angle on either of the directions orthogonal to the bias magnetic field direction can be reduced to 0(4)° by applying specific compensating magnetic fields. The measurement error is mainly attributed to the fluctuation of atomic temperature. Moreover, it also demonstrates that, even for a small angle, the effect is strong enough to cause large decoherence of Rabi oscillation in a magic-intensity trap. Although the compensation method demonstrated here is explored for the magic-intensity trapping technique, it can be applied to a variety of similar precision measurements with trapped neutral atoms.

Lamellar water induced quantized interlayer spacing of nanochannels walls

The nanoscale confinement is of great important for the industrial applications of molecular sieve,desalination,and also essential in bio-logical transport systems.Massive efforts have been devoted to the influence of restricted spaces on the properties of confined fluids.However,the situation of channel-wall is crucial but attracts less attention and remains unknown.To fundamentally understand the mechanism of channel-walls in nanoconfinement,we investigated the interaction between the counter-force of the liquid and interlamellar spacing of nanochannel walls by considering the effect of both spatial confinement and surface wettability.The results reveal that the nanochannel stables at only a few discrete spacing states when its confinement is within 1.4 nm.The quantized interlayer spacing is attributed to water molecules becoming laminated structures,and the stable states are corresponding to the monolayer,bilayer and trilayer water configurations,respectively.The results can potentially help to understand the characterized interlayers spacing of graphene oxide membrane in water.Our findings are hold great promise in design of ion filtration membrane and artificial water/ion channels.

Reinforcement Learning Based Quantization Strategy Optimal Assignment Algorithm for Mixed Precision

The quantization algorithm compresses the original network by reducing the numerical bit width of the model,which improves the computation speed. Because different layers have different redundancy and sensitivity to databit width. Reducing the data bit width will result in a loss of accuracy. Therefore, it is difficult to determinethe optimal bit width for different parts of the network with guaranteed accuracy. Mixed precision quantizationcan effectively reduce the amount of computation while keeping the model accuracy basically unchanged. In thispaper, a hardware-aware mixed precision quantization strategy optimal assignment algorithm adapted to low bitwidth is proposed, and reinforcement learning is used to automatically predict the mixed precision that meets theconstraints of hardware resources. In the state-space design, the standard deviation of weights is used to measurethe distribution difference of data, the execution speed feedback of simulated neural network accelerator inferenceis used as the environment to limit the action space of the agent, and the accuracy of the quantization model afterretraining is used as the reward function to guide the agent to carry out deep reinforcement learning training. Theexperimental results show that the proposed method obtains a suitable model layer-by-layer quantization strategyunder the condition that the computational resources are satisfied, and themodel accuracy is effectively improved.The proposed method has strong intelligence and certain universality and has strong application potential in thefield of mixed precision quantization and embedded neural network model deployment.

A Novel Quantization and Model Compression Approach for Hardware Accelerators in Edge Computing

Massive computational complexity and memory requirement of artificial intelligence models impede their deploy-ability on edge computing devices of the Internet of Things(IoT).While Power-of-Two(PoT)quantization is pro-posed to improve the efficiency for edge inference of Deep Neural Networks(DNNs),existing PoT schemes require a huge amount of bit-wise manipulation and have large memory overhead,and their efficiency is bounded by the bottleneck of computation latency and memory footprint.To tackle this challenge,we present an efficient inference approach on the basis of PoT quantization and model compression.An integer-only scalar PoT quantization(IOS-PoT)is designed jointly with a distribution loss regularizer,wherein the regularizer minimizes quantization errors and training disturbances.Additionally,two-stage model compression is developed to effectively reduce memory requirement,and alleviate bandwidth usage in communications of networked heterogenous learning systems.The product look-up table(P-LUT)inference scheme is leveraged to replace bit-shifting with only indexing and addition operations for achieving low-latency computation and implementing efficient edge accelerators.Finally,comprehensive experiments on Residual Networks(ResNets)and efficient architectures with Canadian Institute for Advanced Research(CIFAR),ImageNet,and Real-world Affective Faces Database(RAF-DB)datasets,indicate that our approach achieves 2×∼10×improvement in the reduction of both weight size and computation cost in comparison to state-of-the-art methods.A P-LUT accelerator prototype is implemented on the Xilinx KV260 Field Programmable Gate Array(FPGA)platform for accelerating convolution operations,with performance results showing that P-LUT reduces memory footprint by 1.45×,achieves more than 3×power efficiency and 2×resource efficiency,compared to the conventional bit-shifting scheme.

Quantized Decoders that Maximize Mutual Information for Polar Codes

In this paper,we innovatively associate the mutual information with the frame error rate(FER)performance and propose novel quantized decoders for polar codes.Based on the optimal quantizer of binary-input discrete memoryless channels(BDMCs),the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information(MMI)between source bits and quantized symbols.The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage.Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error(MMSE)with 4 quantization bits,and yield even better performance than uniform MMI quantized decoders with 5 quantization bits.Furthermore,the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.

Image Steganography by Pixel-Value Differencing Using General Quantization Ranges

A new steganographic method by pixel-value differencing(PVD)using general quantization ranges of pixel pairs’difference values is proposed.The objective of this method is to provide a data embedding technique with a range table with range widths not limited to powers of 2,extending PVD-based methods to enhance their flexibility and data-embedding rates without changing their capabilities to resist security attacks.Specifically,the conventional PVD technique partitions a grayscale image into 1×2 non-overlapping blocks.The entire range[0,255]of all possible absolute values of the pixel pairs’grayscale differences in the blocks is divided into multiple quantization ranges.The width of each quantization range is a power of two to facilitate the direct embedding of the bit information with high embedding rates.Without using power-of-two range widths,the embedding rates can drop using conventional embedding techniques.In contrast,the proposed method uses general quantization range widths,and a multiple-based number conversion mechanism is employed skillfully to implement the use of nonpower-of-two range widths,with each pixel pair being employed to embed a digit in the multiple-based number.All the message bits are converted into a big multiple-based number whose digits can be embedded into the pixel pairs with a higher embedding rate.Good experimental results showed the feasibility of the proposed method and its resistance to security attacks.In addition,implementation examples are provided,where the proposed method adopts non-power-of-two range widths and employsmultiple-based number conversion to expand the data-hiding and steganalysis-resisting capabilities of other PVD methods.

Learning Vector Quantization-Based Fuzzy Rules Oversampling Method

Imbalanced datasets are common in practical applications,and oversampling methods using fuzzy rules have been shown to enhance the classification performance of imbalanced data by taking into account the relationship between data attributes.However,the creation of fuzzy rules typically depends on expert knowledge,which may not fully leverage the label information in training data and may be subjective.To address this issue,a novel fuzzy rule oversampling approach is developed based on the learning vector quantization(LVQ)algorithm.In this method,the label information of the training data is utilized to determine the antecedent part of If-Then fuzzy rules by dynamically dividing attribute intervals using LVQ.Subsequently,fuzzy rules are generated and adjusted to calculate rule weights.The number of new samples to be synthesized for each rule is then computed,and samples from the minority class are synthesized based on the newly generated fuzzy rules.This results in the establishment of a fuzzy rule oversampling method based on LVQ.To evaluate the effectiveness of this method,comparative experiments are conducted on 12 publicly available imbalance datasets with five other sampling techniques in combination with the support function machine.The experimental results demonstrate that the proposed method can significantly enhance the classification algorithm across seven performance indicators,including a boost of 2.15%to 12.34%in Accuracy,6.11%to 27.06%in G-mean,and 4.69%to 18.78%in AUC.These show that the proposed method is capable of more efficiently improving the classification performance of imbalanced data.

Stochastic Gradient Compression for Federated Learning over Wireless Network

As a mature distributed machine learning paradigm,federated learning enables wireless edge devices to collaboratively train a shared AI-model by stochastic gradient descent(SGD).However,devices need to upload high-dimensional stochastic gradients to edge server in training,which cause severe communication bottleneck.To address this problem,we compress the communication by sparsifying and quantizing the stochastic gradients of edge devices.We first derive a closed form of the communication compression in terms of sparsification and quantization factors.Then,the convergence rate of this communicationcompressed system is analyzed and several insights are obtained.Finally,we formulate and deal with the quantization resource allocation problem for the goal of minimizing the convergence upper bound,under the constraint of multiple-access channel capacity.Simulations show that the proposed scheme outperforms the benchmarks.

Cambricon-QR:a sparse and bitwise reproducible quantized training accelerator

Quantized training has been proven to be a prominent method to achieve deep neural network training under limited computational resources.It uses low bit-width arithmetics with a proper scaling factor to achieve negligible accuracy loss.Cambricon-Q is the ASIC design proposed to efficiently support quantized training,and achieves significant performance improvement.However,there are still two caveats in the design.First,Cambricon-Q with different hardware specifications may lead to different numerical errors,resulting in non-reproducible behaviors which may become a major concern in critical applications.Second,Cambricon-Q cannot leverage data sparsity,where considerable cycles could still be squeezed out.To address the caveats,the acceleration core of Cambricon-Q is redesigned to support fine-grained irregular data processing.The new design not only enables acceleration on sparse data,but also enables performing local dynamic quantization by contiguous value ranges(which is hardware independent),instead of contiguous addresses(which is dependent on hardware factors).Experimental results show that the accuracy loss of the method still keeps negligible,and the accelerator achieves 1.61×performance improvement over Cambricon-Q,with about 10%energy increase.

UV,five wavelengths fusion and electrochemical fingerprints combined with antioxidant activity for quality control of antiviral mixture

Aiming to ensure the consistency of quality control of Traditional Chinese Medicines(TCMs),a combination method of high-performance liquid chromatography(HPLC),ultraviolet(UV),electrochemical(EC)was developed in this study to comprehensively evaluate the quality of Antiviral Mixture(AM),and Comprehensive Linear Quantification Fingerprint Method(CLQFM)was used to process the data.Quantitative analysis of three active substances in TCM was conducted.A fivewavelength fusion fingerprint(FWFF)was developed,using second-order derivatives of UV spectral data to differentiate sample levels effectively.The combination of HPLC and UV spectrophotometry,along with electrochemical fingerprinting(ECFP),successfully evaluated total active substances.Ultimately,a multidimensional profiling analytical system for TCM was developed.

Planck Quantised General Relativity Theory Written on Different Forms

This paper is a brief review of our work on the Planck quantized version of general relativity theory. It demonstrates several straightforward methods to rewrite the same equations that we have already presented in other papers. We also explore a relatively new general relativity-inspired field equation based on the original Newtonian mass, which is very different from today’s kilogram mass. Additionally, we examine two other field equations based on collision space-time, where both energy and matter can be described simply as space and time. We are thereby fulfilling Einstein’s dream of a theory where energy and mass are not needed, or are just aspects of space and time. If this is extended beyond the 4-dimensional space-time formalism of general relativity theory to a 6-dimensional framework with 3 space dimensions and 3 time dimensions, this ultimately reveals that they are two sides of the same coin. In reality, it is a three-dimensional space-time theory, where space and time are just two sides of the same coin.

Quantizations of the W-Algebra W（2, 2）

We quantize the W-algebra W（2,2）, whose Verma modules, Harish-Chandra modules, irreducible weight modules and Lie bialgebra structures have been investigated and determined in a series of papers recently.

Quasi-synchronization of fractional-order complex networks with random coupling via quantized control

We investigate the quasi-synchronization of fractional-order complex networks(FCNs) with random coupling via quantized control. Firstly, based on the logarithmic quantizer theory and the Lyapunov stability theory, a new quantized feedback controller, which can make all nodes of complex networks quasi-synchronization and eliminate the disturbance of random coupling in the system state, is designed under non-delay conditions. Secondly, we extend the theoretical results under non-delay conditions to time-varying delay conditions and design another form of quantization feedback controller to ensure that the network achieves quasi-synchronization. Furthermore, the error bound of quasi-synchronization is obtained.Finally, we verify the accuracy of our results using two numerical simulation examples.

Finite-time H_(∞) filtering for Markov jump systems with uniform quantization

This paper is concerned with finite-time H_(∞) filtering for Markov jump systems with uniform quantization. The objective is to design quantized mode-dependent filters to ensure that the filtering error system is not only mean-square finite-time bounded but also has a prescribed finite-time H_(∞) performance. First, the case where the switching modes of the filter align with those of the MJS is considered. A numerically tractable filter design approach is proposed utilizing a mode-dependent Lyapunov function, Schur’s complement, and Dynkin’s formula. Then, the study is extended to a scenario where the switching modes of the filter can differ from those of the MJS. To address this situation, a mode-mismatched filter design approach is developed by leveraging a hidden Markov model to describe the asynchronous mode switching and the double expectation formula. Finally, a spring system model subject to a Markov chain is employed to validate the effectiveness of the quantized filter design approaches.