scholarly journals Quantum-inspired learning vector quantizers for prototype-based classification

Author(s):  
Thomas Villmann ◽  
Alexander Engelsberger ◽  
Jensun Ravichandran ◽  
Andrea Villmann ◽  
Marika Kaden

AbstractPrototype-based models like the Generalized Learning Vector Quantization (GLVQ) belong to the class of interpretable classifiers. Moreover, quantum-inspired methods get more and more into focus in machine learning due to its potential efficient computing. Further, its interesting mathematical perspectives offer new ideas for alternative learning scenarios. This paper proposes a quantum computing-inspired variant of the prototype-based GLVQ for classification learning. We start considering kernelized GLVQ with real- and complex-valued kernels and their respective feature mapping. Thereafter, we explain how quantum space ideas could be integrated into a GLVQ using quantum bit vector space in the quantum state space $${\mathcal {H}}^{n}$$ H n and show the relations to kernelized GLVQ. In particular, we explain the related feature mapping of data into the quantum state space $${\mathcal {H}}^{n}$$ H n . A key feature for this approach is that $${\mathcal {H}}^{n}$$ H n is an Hilbert space with particular inner product properties, which finally restrict the prototype adaptations to be unitary transformations. The resulting approach is denoted as Qu-GLVQ. We provide the mathematical framework and give exemplary numerical results.

Quantum ◽  
2017 ◽  
Vol 1 ◽  
pp. 41 ◽  
Author(s):  
Pawel Horodecki ◽  
Michal Horodecki ◽  
Ryszard Horodecki

Consider two parties: Alice and Bob and suppose that Bob is given a qubit system in a quantum state ϕ, unknown to him. Alice knows ϕ and she is supposed to convince Bob that she knows ϕ sending some test message. Is it possible for her to convince Bob providing him "zero knowledge" i. e. no information about ϕ he has? We prove that there is no "zero knowledge" protocol of that kind. In fact it turns out that basing on Alice message, Bob (or third party - Eve - who can intercept the message) can synthetize a copy of the unknown qubit state ϕ with nonzero probability. This "no-go" result puts general constrains on information processing where information about quantum state is involved.


2011 ◽  
Author(s):  
Christopher A. Fuchs ◽  
Timothy Ralph ◽  
Ping Koy Lam
Keyword(s):  

2015 ◽  
Vol 13 (06) ◽  
pp. 1550039 ◽  
Author(s):  
A. Plastino ◽  
G. Bellomo ◽  
A. R. Plastino

We argue that the dimensionality of the space of quantum systems’ states should be considered as a legitimate resource for quantum information tasks. The assertion is supported by the fact that quantum states with discord-like capacities can be obtained from classically-correlated states in spaces of dimension large enough. We illustrate things with some simple examples that justify our claim.


2020 ◽  
Vol 135 (10) ◽  
Author(s):  
Akio Fujiwara

AbstractThe notion of dually flatness is of central importance in information geometry. Nevertheless, little is known about dually flat structures on quantum statistical manifolds except that the Bogoliubov metric admits a global dually flat structure on a quantum state space $${{\mathcal {S}}}({{\mathbb {C}}}^d)$$ S ( C d ) for any $$d\ge 2$$ d ≥ 2 . In this paper, we show that every monotone metric on a two-level quantum state space $${{\mathcal {S}}}({{\mathbb {C}}}^2)$$ S ( C 2 ) admits a local dually flat structure.


2016 ◽  
Vol 16 (5&6) ◽  
pp. 483-497
Author(s):  
Brittany Corn ◽  
Jun Jing ◽  
Ting Yu

The fully quantized model of double qubits coupled to a common bath is solved using the quantum state diffusion (QSD) approach in the non-Markovian regime. We have established the explicit time-local non-Markovian QSD equations for the two-qubit dissipative and dephasing models. Diffusive quantum trajectories are applied to the entanglement estimation of two-qubit systems in a non-Markovian regime. In both cases, non-Markovian features of entanglement evolution are revealed through quantum diffusive unravellings in the system state space.


Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca

In this section we introduce the framework of quantum mechanics as it pertains to the types of systems we will consider for quantum computing. Here we also introduce the notion of a quantum bit or ‘qubit’, which is a fundamental concept for quantum computing. At the beginning of the twentieth century, it was believed by most that the laws of Newton and Maxwell were the correct laws of physics. By the 1930s, however, it had become apparent that these classical theories faced serious problems in trying to account for the observed results of certain experiments. As a result, a new mathematical framework for physics called quantum mechanics was formulated, and new theories of physics called quantum physics were developed in this framework. Quantum physics includes the physical theories of quantum electrodynamics and quantum field theory, but we do not need to know these physical theories in order to learn about quantum information. Quantum information is the result of reformulating information theory in this quantum framework. We saw in Section 1.6 an example of a two-state quantum system: a photon that is constrained to follow one of two distinguishable paths. We identified the two distinguishable paths with the 2-dimensional basis vectors and then noted that a general ‘path state’ of the photon can be described by a complex vector with |α0|2 +|α1|2 = 1. This simple example captures the essence of the first postulate, which tells us how physical states are represented in quantum mechanics. Depending on the degree of freedom (i.e. the type of state) of the system being considered, H may be infinite-dimensional. For example, if the state refers to the position of a particle that is free to occupy any point in some region of space, the associated Hilbert space is usually taken to be a continuous (and thus infinite-dimensional) space. It is worth noting that in practice, with finite resources, we cannot distinguish a continuous state space from one with a discrete state space having a sufficiently small minimum spacing between adjacent locations. For describing realistic models of quantum computation, we will typically only be interested in degrees of freedom for which the state is described by a vector in a finite-dimensional (complex) Hilbert space.


Sign in / Sign up

Export Citation Format

Share Document