Efficient Characterization of Quantum Evolutions via a Recommender System

Abstract

We demonstrate characterizing quantum evolutions via matrix factorization algorithm, a particular type of the recommender system (RS). A system undergoing a quantum evolution can be characterized in several ways. Here we choose (i) quantum correlations quantified by measures such as entropy, negativity, or discord, and (ii) state-fidelity. Using quantum registers with up to 10 qubits, we demonstrate that an RS can efficiently characterize both unitary and nonunitary evolutions. After carrying out a detailed performance analysis of the RS in two qubits, we show that it can be used to distinguish a clean database of quantum correlations from a noisy or a fake one. Moreover, we find that the RS brings about a significant computational advantage for building a large database of quantum discord, for which no simple closed-form expression exists. Also, RS can efficiently characterize systems undergoing nonunitary evolutions in terms of quantum discord reduction as well as state-fidelity. Finally, we utilize RS for the construction of discord phase space in a nonlinear quantum system.

A Holistic Approach to Quantum Ethics Education

“…At the core of this second quantum revolution is the shift from quantum-as-fundamental-physics to quantum-asinformation-science: technologies that leverage the laws of quantum mechanics to circumvent classical limits on information processing. While the range of quantum information technologies is vast, at least three quantum information technologies have demonstrable possibility for significant market and societal disruption should they achieve commercialization, namely computers, communication networks, and sensors [21,22].…”

Recommender System Expedited Quantum Control Optimization

“…Here we use the matrix factorization algorithm for collaborative filtering [35,36]. It involves setting up a database R in the form of a rating matrix, wherein each row represents a particular consumer and each column represents a particular product that is being recommended [30,37]. The rating matrix can be decomposed in terms of latent vectors of the same dimension f , known as the number of features.…”