Related papers: A Reed Muller-based approach for optimization of g…
As a new color image representation tool, quaternion has achieved excellent results in the color image processing, because it treats the color image as a whole rather than as a separate color space component, thus it can make full use of…
Low-precision arithmetic operations to accelerate deep-learning applications on field-programmable gate arrays (FPGAs) have been studied extensively, because they offer the potential to save silicon area or increase throughput. However,…
Kernel methods are a highly effective and widely used collection of modern machine learning algorithms. A fundamental limitation of virtually all such methods are computations involving the kernel matrix that naively scale quadratically…
This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit…
The growing demand for solving large-scale, data-intensive linear and conic optimization problems, particularly in applications such as artificial intelligence and machine learning, has highlighted the limitations of classical interior…
Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its frame expansion. This means that the encoding is a partial ordering…
In this work, quantum transformers are designed and analysed in detail by extending the state-of-the-art classical transformer neural network architectures known to be very performant in natural language processing and image analysis.…
This paper proposes a design of low complexity, reconfigurable and narrow transition band (NTB) filter bank (FB). In our proposed Modified Frequency Response Masking (ModFRM) architecture, the modal filter and complementary filter in…
This paper considers decentralized consensus optimization problems where nodes of a network have access to different summands of a global objective function. Nodes cooperate to minimize the global objective by exchanging information with…
We introduce Scale Factorized-Quantum Field Theory (SF-QFT), a framework performing path-integral factorization of ultraviolet and infrared momentum modes at a physical scale $Q^*$ before perturbative expansion through Effective Dynamical…
We introduce the notion of fault-tolerant quantum metrology to overcome noise beyond our control -- associated with sensing the parameter, by reducing the noise in operations under our control -- associated with preparing and measuring…
The optimal phase covariant cloning machine (PQCM) broadcasts the information associated to an input qubit into a multi-qubit systems, exploiting a partial a-priori knowledge of the input state. This additional a priori information leads to…
We prove several results about integers represented by positive definite quadratic forms, using a Fourier analysis approach. In particular, for an integer $\ell\geq 1$, we improve the error term in the partial sums of the number of…
Classical simulations of quantum circuits are essential for verifying and benchmarking quantum algorithms, particularly for large circuits, where computational demands increase exponentially with the number of qubits. Among available…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
The Discrete Fourier Transform (DFT) is central to the analysis of uniformly sampled signals, yet many practical applications involve non-uniform sampling, requiring the Non-Uniform Discrete Fourier Transform (NUDFT). While quantum…
Quantum comparators and modular arithmetic are fundamental in many quantum algorithms. Current research mainly focuses on operations between two quantum states. However, various applications, such as integer factorization, optimization,…
Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to…
Fewer-qubit quantum logic gate, serving as a basic unit for constructing universal multiqubit gates, has been widely applied in quantum computing and quantum information. However, traditional constructions for fewer-qubit gates often…
This paper presents key enhancements to our previous work~\cite{naghmouchi2024mixed} on a hybrid Benders decomposition (HBD) framework for solving mixed integer linear programs (MILPs). In our approach, the master problem is reformulated as…