This article explores the current state and future prospects of quantum computing in industrial environments. Firstly, it describes three main paradigms in this field of knowledge: gate-based quantum computers, quantum annealers, and tensor networks. The article also examines specific industrial applications, such as bin packing, job shop scheduling, and route planning for robots and vehicles. These applications demonstrate the potential of quantum computing to solve complex problems in the industry. The article concludes by presenting a vision of the directions the field will take in the coming years, also discussing the current limitations of quantum technology. Despite these limitations, quantum computing is emerging as a powerful tool to address industrial challenges in the future.

We present a series of algorithms in tensor networks for anomaly detection in datasets, by using data compression in a Tensor Train representation. These algorithms consist of preserving the structure of normal data in compression and deleting the structure of anomalous data. The algorithms can be applied to any tensor network representation. We test the effectiveness of the methods with digits and Olivetti faces datasets and a cybersecurity dataset to determine cyber-attacks.

In this paper we present a study of the applicability and feasibility of quantum-inspired algorithms and techniques in tensor networks for industrial environments and contexts, with a compilation of the available literature and an analysis of the use cases that may be affected by such methods. In addition, we explore the limitations of such techniques in order to determine their potential scalability.

In this paper we present a study of the applicability and feasibility of quantum-inspired algorithms and techniques in tensor networks for industrial environments and contexts, with a compilation of the available literature and an analysis of the use cases that may be affected by such methods. In addition, we explore the limitations of such techniques in order to determine their potential scalability.

There is a growing need for solutions that can improve the communication between anomaly detection algorithms and human operators. In the context of real-time monitoring of networked systems, it is crucial that new solutions do not increase the burden on an already overloaded visual channel. Sonification can be leveraged as a peripheral monitoring tool that complements current visualization systems. We conceptualized, designed, and prototyped Datascapes, a framework project that explores the potential of sound-based applications for the monitoring of cyber-attacks on AI-supported networked environments. Within Datascapes, two Design Actions were realized that applied sonification on the monitoring and detection of anomalies in (1) water distribution networks and (2) Internet networks. Two series of prototypes were implemented and evaluated in a real-world environment with eight experts in network management and cybersecurity. This paper presents experimental results on the use of sonification to disclose anomalous behavior and assess both its gravity and the location within the network. Furthermore, we define and present a design methodology and evaluation protocol that, albeit grounded in sonification for anomaly detection, can support designers in the definition, development, and validation of real-world sonification applications.

We present two algorithms to initialize layers of tensorized neural networks and general tensor network algorithms using partial computations of their Frobenius norms and lineal entrywise norms, depending on the type of tensor network involved. The core of this method is the use of the norm of subnetworks of the tensor network in an iterative way, so that we normalize by the finite values of the norms that led to the divergence or zero norm. In addition, the method benefits from the reuse of intermediate calculations. We have also applied it to the Matrix Product State/Tensor Train (MPS/TT) and Matrix Product Operator/Tensor Train Matrix (MPO/TT-M) layers and have seen its scaling versus the number of nodes, bond dimension, and physical dimension. All code is publicly available.

We present a novel method for task optimization in industrial plants using quantum-inspired tensor network technology. This method allows us to obtain the best possible combination of tasks on a set of machines with a set of constraints without having to evaluate all possible combinations. We will simulate a quantum system with all possible combinations, perform an imaginary time evolution and a series of projections to satisfy the constraints. We improve its scalability by means of a compression method, an iterative algorithm, and a genetic algorithm, and show the results obtained on simulated cases.

We present a new approach for solving systems of linear equations with tensor networks based on the quantum HHL algorithm. We first develop a novel HHL in the qudits formalism, the generalization of qubits, and then transform its operations into an equivalent classical HHL, taking advantage of the non-unitary operations that they can apply. The main novelty of this proposal is to perform a classical simulation as efficiently as possible of the HHL to benchmark the algorithm steps according to its input parameters and the input matrix. We apply this algorithm to three simulation problems, comparing it with an exact inversion algorithm, and we compare its performance against an implementation of the original HHL simulated in the Qiskit framework, providing both codes. Our results show that our approach can achieve a promising performance in computational efficiency to simulate HHL process without quantum noise, providing a lower bound.

We present a novel quantum-inspired algorithm for solving the Traveling Salesman Problem (TSP) and some of its variations using tensor networks. This approach consists on the simulated initialization of a quantum system with superposition of all possible combinations, an imaginary time evolution, a projection, and lastly a partial trace to search for solutions. We adapt it to different generalizations of the TSP and apply it to the job reassignment problem, a real productive industrial case.

We present an algorithm for solving systems of linear equations based on the HHL algorithm with a novel qudits methodology, a generalization of the qubits with more states, to reduce the number of gates to be applied and the amount of resources. Based on this idea, we will perform a quantum-inspired version on tensor networks, taking advantage of their ability to perform non-unitary operations such as projection. Finally, we will use this algorithm to obtain a solution for the harmonic oscillator with an external force, the forced damped oscillator and the 2D static heat equation differential equations.

In usual restriction terms of the Quadratic Unconstrained Binary Optimization (QUBO) hamiltonians, a integer number of logical qubits R, called the Integer Restriction Coefficient (IRC), are forced to stay active. In this paper we gather the well-known methods of implementing these restrictions, as well as some novel methods that show to be more efficient in some frequently implemented cases. Moreover, it is mathematically allowed to ask for fractional values of $R$. For these Fractionary Restriction Coefficients (FRC) we show how they can reduce the number of qubits needed to implement the restriction hamiltonian even further. Lastly, we characterize the response of DWave's Advantage$\_$system4.1 Quantum Annealer (QA) when faced with the implementation of FRCs, and offer a summary guide of the presented methods and the situations each of them is to be used.

We present a subproblemation scheme for heuristical solving of the JSP (Job Reassignment Problem). The cost function of the JSP is described via a QUBO hamiltonian to allow implementation in both gate-based and annealing quantum computers. For a job pool of $K$ jobs, $\mathcal{O}(K^2)$ binary variables -- qubits -- are needed to solve the full problem, for a runtime of $\mathcal{O}(2^{K^2})$. With the presented heuristics, the average variable number of each of the $D$ subproblems to solve is $\mathcal{O}(K^2/2D)$, and the expected total runtime $\mathcal{O}(D2^{K^2/2D})$, achieving an exponential speedup.

We present an algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and Quadratic Unconstrained Discrete Optimization (QUDO) problems with one-neighbor interactions using the quantum-inspired technology of tensor networks. Our method is based on the simulation of a quantum state to which we will apply an imaginary time evolution and perform a series of partial traces to obtain the state of maximum amplitude, since it will be the optimal state. We will also deal with the degenerate case and check the polynomial complexity of the algorithm.

In the last years, MLOps (Machine Learning Operations) paradigm is attracting the attention from the community, extrapolating the DevOps (Development and Operations) paradigm to the artificial intelligence (AI) development life-cycle. In this area, some challenges must be addressed to successfully deliver solutions since there are specific nuances when dealing with AI operationalization such as the model packaging or monitoring. Fortunately, interesting and helpful approaches, both from the research community and industry have emerged. However, further research is still necessary to fulfil key gaps. This paper presents a tool, MLPacker, for addressing some of them. Concretely, this tool provides mechanisms to package and deploy analytic pipelines both in REST APIs and in streaming mode. In addition, the analytic pipelines can be deployed atomically (i.e., the whole pipeline in the same machine) or in a distributed fashion (i.e., deploying each stage of the pipeline in distinct machines). In this way, users can take advantage from the cloud continuum paradigm considering edge-fog-cloud computing layers. Finally, the tool is decoupled from the training stage to avoid data scientists the integration of blocks of code in their experiments for the operationalization. Besides the package mode (REST API or streaming), the tool can be configured to perform the deployments in local or in remote machines and by using or not containers. For this aim, this paper describes the gaps this tool addresses, the detailed components and flows supported, as well as an scenario with three different case studies to better explain the research conducted.

In this paper, we present an implementation of a Job Selection Problem (JSP) — a generalization of the well-known Travelling Salesperson Problem (TSP)— of $N=9$ jobs on its Quadratic Unconstrained Binary Optimization (QUBO) form, using $\mathrm{O}(N)$ qubits on DWave's Advantage_system4.1 quantum annealing device. The best known quantum algorithm for TSP to date uses $\mathcal{O}(N^{2})$ qubits. A solution is found using the quantum method. However, since hardware is not yet able to compensate the increase in search-space size, no present overall advantage is achieved when comparing the quantum results with either exhaustive or equiprobably sampled classical solutions of the problem.

Using implicit responses to determine consumers’ response to different stimuli is becoming a popular approach, but research is still needed to understand the outputs of the different technologies used to collect data. During the present research, electroencephalography (EEG) responses and self-reported liking and emotions were collected on different stimuli (odor, taste, flavor samples) to better understand sweetness perception. Artificial intelligence analytics were used to classify the implicit responses, identifying decision trees to discriminate the stimuli by activated sensory system (odor/taste/flavor) and by nature of the stimuli (‘sweet’ vs. ‘non-sweet’ odors; ‘sweet-taste’, ‘sweet-flavor’, and ‘non-sweet flavor’; and ‘sweet stimuli’ vs. ‘non-sweet stimuli’). Significant differences were found among self-reported-liking of the stimuli and the emotions elicited by the stimuli, but no clear relationship was identified between explicit and implicit data. The present research sums interesting data for the EEG-linked research as well as for EEG data analysis, although much is still unknown about how to properly exploit implicit measurement technologies and their data.

Quantum Computing is considered as the next frontier in computing, and it is attracting a lot of attention from the current scientific community. This kind of computation provides to researchers with a revolutionary paradigm for addressing complex optimization problems, offering a significant speed advantage and an efficient search ability. Anyway, Quantum Computing is still in an incipient stage of development. For this reason, present architectures show certain limitations, which have motivated the carrying out of this paper. In this paper, we introduce a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm. Main pillars of operation of the proposed method are a greater control over the access to quantum resources, and a considerable reduction of non-profitable accesses. To assess the quality of our method, we have used 7 different Traveling Salesman Problem instances as benchmarking set. The obtained outcomes support the preliminary conclusion that our algorithm is an approach which offers promising results for solving partitioning problems while it drastically reduces the access to quantum computing resources. We also contribute to the field of Transfer Optimization by developing an evolutionary multiform multitasking algorithm as initialization method.

BACKGROUND:Alzheimer's is a degenerative dementing disorder that starts with a mild memory impairment and progresses to a total loss of mental and physical faculties. The sooner the diagnosis is made, the better for the patient, as preventive actions and treatment can be started. Although tests such as the Mini-Mental State Tests Examination are usually used for early identification, diagnosis relies on magnetic resonance imaging (MRI) brain analysis.METHODS:Public initiatives such as the OASIS (Open Access Series of Imaging Studies) collection provide neuroimaging datasets openly available for research purposes. In this work, a new method based on deep learning and image processing techniques for MRI-based Alzheimer's diagnosis is proposed and compared with previous literature works.RESULTS:Our method achieves a balance accuracy (BAC) up to 0.93 for image-based automated diagnosis of the disease, and a BAC of 0.88 for the establishment of the disease stage (healthy tissue, very mild and severe stage).CONCLUSIONS:Results obtained surpassed the state-of-the-art proposals using the OASIS collection. This demonstrates that deep learning-based strategies are an effective tool for building a robust solution for Alzheimer's-assisted diagnosis based on MRI data.

INTRODUCTION: We present early results of an ongoing investigation into the use of sound for real-time monitoring of anomalous behaviour in digital and digital/physical systems. OBJECTIVES: We aim to define design guidelines to both support authors in the process of creating sonifications that are both efficient and engaging and the transition of sonification into a mass medium for the representation of data in everyday life. METHODS: Through two Design Actions, we apply Design Research to the definition of the use case, the interaction paradigm and the experimental protocol for real-world evaluation of sonification tools. RESULTS: Two Design Actions are described. Methodologies and results of the first experimental phase are presented in detail along with their influence on the second phase, currently ongoing. CONCLUSION: We sketch a tentative design-driven process for sonifications for the real-time monitoring of anomalous behaviour in digital and digital/physical systems.

Recently, there have been big leaps of advances in key natural language processing tasks that support semantic analysis, achieving some success in real-world clinical tasks. However, there is still a gap between the development of advanced semantical annotation resources for real-world plain text electronic health records (EHRs), generated by Language Annotating Systems (LASs), and their utilization in clinical settings. One common obstacle is that medical staff have no time to assess the quality of the annotations due to their workload. This paper introduces a novel method to tackle the quality assessment problem overcoming the limitations of classical approaches (i.e the need of manual annotations, which are unfeasible in real-life clinical environments), providing a mechanism to obtain quantitative accuracy indicators of the semantic annotations generated by a LAS from EHRs as a previous step to a human validation. The method is supported by a statistical analysis, and we demonstrate in real cases that a LAS previously introduced by our research group is competitive or even better regarding the state-of-the-art LAS approaches, needing less computational resources because no pre-annotations are needed in our case.