1,720,983 research outputs found
Concise guide to quantum machine learning
This book offers a brief but effective introduction to quantum machine learning (QML). QML is not merely a translation of classical machine learning techniques into the language of quantum computing, but rather a new approach to data representation and processing. Accordingly, the content is not divided into a “classical part” that describes standard machine learning schemes and a “quantum part” that addresses their quantum counterparts. Instead, to immerse the reader in the quantum realm from the outset, the book starts from fundamental notions of quantum mechanics and quantum computing. Avoiding unnecessary details, it presents the concepts and mathematical tools that are essential for the required quantum formalism. In turn, it reviews those quantum algorithms most relevant to machine learning. Later chapters highlight the latest advances in this field and discuss the most promising directions for future research.
To gain the most from this book, a basic grasp of statistics and linear algebra is sufficient; no previous experience with quantum computing or machine learning is needed. The book is aimed at researchers and students with no background in quantum physics and is also suitable for physicists looking to enter the field of QML
Quantum annealing learning search for solving QUBO problems
In this paper, we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO problems. The proposed algorithm implements an iterative structure where the representation of an objective function into the annealer architecture is learned and already visited solutions are penalized by a tabu-inspired search. The result is a heuristic search equipped with a learning mechanism to improve the encoding of the problem into the quantum architecture. We prove the convergence of the algorithm to a global optimum in the case of general QUBO problems. Our technique is an alternative to the direct reduction of a given optimization problem into the sparse annealer graph
Local Approach to Quantum-inspired Classification
In the context of quantum-inspired machine learning, remarkable mathematical tools for solving classification problems are given by some methods of quantum state discrimination. In this respect, quantum-inspired classifiers based on nearest centroid and Helstrom discrimination have been efficiently implemented on classical computers. We present a local approach combining the kNN algorithm to some quantum-inspired classifiers
Ensembles of quantum classifiers
In the current era, known as Noisy Intermediate-Scale Quantum (NISQ), encoding large amounts of data in the quantum devices is challenging and the impact of noise significantly affects the quality of the obtained results. A viable approach for the execution of quantum classification algorithms is the introduction of a well-known machine learning paradigm, namely, the ensemble methods. Indeed, the ensembles combine multiple internal classifiers, which are characterized by compact sizes due to the smaller data subsets used for training, to achieve more accurate and robust prediction performance. In this way, it is possible to reduce the qubit requirements with respect to a single larger classifier while achieving comparable or improved performance. In this work, we present an implementation and an extensive empirical evaluation of ensembles of quantum instance-based classifiers for binary classification, with the purpose of providing insights into their effectiveness, limitations, and potential for enhancing the performance of basic quantum models. In particular, three classical ensemble methods and three quantum instance-based classifiers have been taken into account here. Hence, the scheme that has been implemented (in Python) has a hybrid nature. The results (obtained on real-world datasets) have shown an accuracy advantage for the ensemble techniques with respect to the single quantum classifiers, and also an improvement in robustness. In fact, ensembles have proven effective not only in mitigating unsuitable data normalizations but also in reducing the impact of noise on quantum classifiers, enhancing their stability
Bell-inequality violation by entangled single-photon states generated from a laser, an LED, or a halogen lamp
In single-particle or intraparticle entanglement, two degrees of freedom of a single particle, e.g., momentum and polarization of a single photon, are entangled. Single-particle entanglement is a resource that can be exploited both in quantum communication protocols and in experimental tests of noncontextuality based on the Kochen-Specker theorem. Here we show that single-particle entangled states of single photons can be produced from attenuated classical sources of light. To experimentally certify the single-particle entanglement, we perform a Bell test, observing a violation of the Clauser, Horne, Shimony, and Holt inequality. We show that single-particle entanglement can be achieved even in a classical light beam, provided that first-order coherence is maintained between the degrees of freedom involved in the entanglement. This demonstrates that cheap, compact, and lowpower photon sources can be used to generate single-particle entangled photons which could be a resource for quantum technology applications
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
