相关论文: Benchmarking simulation of hybrid decoding scheme …
In this paper, Sphere Decoding (SD) algorithms for Spatial Modulation (SM) are developed to reduce the computational complexity of Maximum-Likelihood (ML) detectors. Two SDs specifically designed for SM are proposed and analysed in terms of…
It was recently demonstrated that a simple Monte Carlo (MC) algorithm involving the swap of particle pairs dramatically accelerates the equilibrium sampling of simulated supercooled liquids. We propose two numerical schemes integrating the…
This work proposes a hybrid framework combining classical computers with quantum annealers for structural optimisation. At each optimisation iteration of an iterative process, two minimisation problems are formulated one for the underlying…
This paper describes a new fast and implicitly parallel approach to neighbour-finding in multi-resolution Smoothed Particle Hydrodynamics (SPH) simulations. This new approach is based on hierarchical cell decompositions and sorted…
In this paper, we propose a methodology for partitioning and mapping computational intensive applications in reconfigurable hardware blocks of different granularity. A generic hybrid reconfigurable architecture is considered so as the…
Quantum metrology plays a fundamental role in many scientific areas. However, the complexity of engineering entangled probes and the external noise raise technological barriers for realizing the expected precision of the to-be-estimated…
An exercise in implementing Scale Invariant Feature Transform using CKKS Fully Homomorphic encryption quickly reveals some glaring limitations in the current FHE paradigm. These limitations include the lack of a standard comparison operator…
Complex quantum simulation workflows are often hindered by incompatible wavefunction representations adopted across different algorithmic frameworks. In particular, the mismatch between the first- and second-quantization formalisms prevents…
Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to…
In massive MIMO systems, fully digital precoding offers high performance but has significant implementation complexity and energy consumption, particularly at millimeter frequencies and beyond. Hybrid analog-digital architectures provide a…
This paper investigates the hybrid precoding design in millimeter-wave (mmWave) systems with a fully-adaptive-connected precoding structure, where a switch-controlled connection is deployed between every antenna and every radio frequency…
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines…
Quantum computers have emerged as a promising platform to simulate the strong electron correlation that is crucial to catalysis and photochemistry. However, owing to the choice of a trial wave function employed in the popular hybrid…
Recent work has shown that a simple chain of interacting spins can be used as a medium for high-fidelity quantum communication. We describe a scheme for quantum communication using a spin system that conserves z-spin, but otherwise is…
With unprecedented increases in traffic load in today's wireless networks, design challenges shift from the wireless network itself to the computational support behind the wireless network. In this vein, there is new interest in…
A new parallel algorithm for simulating Ising spin systems is presented. The sequential prototype is the n-fold way algorithm cite{BKL75}, which is efficient but is hard to parallelize using conservative methods. Our parallel algorithm is…
We propose and experimentally demonstrate a near-optimal discrimination scheme for the quadrature phase shift keying protocol (QPSK). We show in theory that the performance of our hybrid scheme is superior to the standard scheme -…
Resource scheduling is critical in many industries, especially in power systems. The Unit Commitment problem determines the on/off status and output levels of generators under many constraints. Traditional exact methods, such as…
Recently, supervised hashing methods have attracted much attention since they can optimize retrieval speed and storage cost while preserving semantic information. Because hashing codes learning is NP-hard, many methods resort to some form…
In this paper, we study quantum algorithms of matrix multiplication from the viewpoint of inputting quantum/classical data to outputting quantum/classical data. The main target is trying to overcome the input and output problem, which are…