scholarly journals Implementation of a Hamming distance–like genomic quantum classifier using inner products on ibmqx2 and ibmq_16_melbourne

2020 ◽  
Vol 2 (1) ◽  
Author(s):  
Kunal Kathuria ◽  
Aakrosh Ratan ◽  
Michael McConnell ◽  
Stefan Bekiranov

Abstract Motivated by the problem of classifying individuals with a disease versus controls using a functional genomic attribute as input, we present relatively efficient general purpose inner product–based kernel classifiers to classify the test as a normal or disease sample. We encode each training sample as a string of 1 s (presence) and 0 s (absence) representing the attribute’s existence across ordered physical blocks of the subdivided genome. Having binary-valued features allows for highly efficient data encoding in the computational basis for classifiers relying on binary operations. Given that a natural distance between binary strings is Hamming distance, which shares properties with bit-string inner products, our two classifiers apply different inner product measures for classification. The active inner product (AIP) is a direct dot product–based classifier whereas the symmetric inner product (SIP) classifies upon scoring correspondingly matching genomic attributes. SIP is a strongly Hamming distance–based classifier generally applicable to binary attribute-matching problems whereas AIP has general applications as a simple dot product–based classifier. The classifiers implement an inner product between N = 2n dimension test and train vectors using n Fredkin gates while the training sets are respectively entangled with the class-label qubit, without use of an ancilla. Moreover, each training class can be composed of an arbitrary number m of samples that can be classically summed into one input string to effectively execute all test–train inner products simultaneously. Thus, our circuits require the same number of qubits for any number of training samples and are $O(\log {N})$ O ( log N ) in gate complexity after the states are prepared. Our classifiers were implemented on ibmqx2 (IBM-Q-team 2019b) and ibmq_16_melbourne (IBM-Q-team 2019a). The latter allowed encoding of 64 training features across the genome.

Author(s):  
Yi Tay ◽  
Anh Tuan Luu ◽  
Siu Cheung Hui

Co-Attentions are highly effective attention mechanisms for text matching applications. Co-Attention enables the learning of pairwise attentions, i.e., learning to attend based on computing word-level affinity scores between two documents. However, text matching problems can exist in either symmetrical or asymmetrical domains. For example, paraphrase identification is a symmetrical task while question-answer matching and entailment classification are considered asymmetrical domains. In this paper, we argue that Co-Attention models in asymmetrical domains require different treatment as opposed to symmetrical domains, i.e., a concept of word-level directionality should be incorporated while learning word-level similarity scores. Hence, the standard inner product in real space commonly adopted in co-attention is not suitable. This paper leverages attractive properties of the complex vector space and proposes a co-attention mechanism based on the complex-valued inner product (Hermitian products). Unlike the real dot product, the dot product in complex space is asymmetric because the first item is conjugated. Aside from modeling and encoding directionality, our proposed approach also enhances the representation learning process. Extensive experiments on five text matching benchmark datasets demonstrate the effectiveness of our approach. 


2015 ◽  
Vol 13 (1) ◽  
Author(s):  
Augustyn Markiewicz ◽  
Simo Puntanen

Abstract For an n x m real matrix A the matrix A⊥ is defined as a matrix spanning the orthocomplement of the column space of A, when the orthogonality is defined with respect to the standard inner product ⟨x, y⟩ = x'y. In this paper we collect together various properties of the ⊥ operation and its applications in linear statistical models. Results covering the more general inner products are also considered. We also provide a rather extensive list of references


1997 ◽  
Vol 20 (2) ◽  
pp. 219-224
Author(s):  
Shih-Sen Chang ◽  
Yu-Qing Chen ◽  
Byung Soo Lee

The purpose of this paper is to introduce the concept of semi-inner products in locally convex spaces and to give some basic properties.


Author(s):  
Katherine Jones-Smith

Dyson analysed the low-energy excitations of a ferromagnet using a Hamiltonian that was non-Hermitian with respect to the standard inner product. This allowed for a facile rendering of these excitations (known as spin waves) as weakly interacting bosonic quasi-particles. More than 50 years later, we have the full denouement of the non-Hermitian quantum mechanics formalism at our disposal when considering Dyson’s work, both technically and contextually. Here, we recast Dyson’s work on ferromagnets explicitly in terms of two inner products, with respect to which the Hamiltonian is always self-adjoint, if not manifestly ‘Hermitian’. Then we extend his scheme to doped anti-ferromagnets described by the t – J model, with hopes of shedding light on the physics of high-temperature superconductivity.


2013 ◽  
Vol 717 ◽  
pp. 466-474
Author(s):  
Yao Yuan Zeng ◽  
Wen Tao Zhao ◽  
Zheng Hua Wang

Multilevel hypergraph partitioning is an significant and extensively researched problem in combinatorial optimization. Nevertheless, as the primary component of multilevel hypergraph partitioning, coarsening phase has not yet attracted sufficient attention. Meanwhile, the performance of coarsening algorithm is not very satisfying. In this paper, we present a new coarsening algorithm based on multilevel framework to reduce the number of vertices more rapidly. The main contribution is introducing the matching mechanism of weighted inner product and establishing two priority rules of vertices. Finally, the effectiveness of our coarsening algorithm was indicated by experimental results compared with those produced by the combination of different sort algorithms and hMETIS in most of the ISPD98 benchmark suite.


2017 ◽  
Vol 6 (4) ◽  
pp. 349-388 ◽  
Author(s):  
Petros T Boufounos ◽  
Shantanu Rane ◽  
Hassan Mansour

Abstract Approaches to signal representation and coding theory have traditionally focused on how to best represent signals using parsimonious representations that incur the lowest possible distortion. Classical examples include linear and nonlinear approximations, sparse representations and rate-distortion theory. Very often, however, the goal of processing is to extract specific information from the signal, and the distortion should be measured on the extracted information. The corresponding representation should, therefore, represent that information as parsimoniously as possible, without necessarily accurately representing the signal itself. In this article, we examine the problem of encoding signals such that sufficient information is preserved about their pairwise distances and their inner products. For that goal, we consider randomized embeddings as an encoding mechanism and provide a framework to analyze their performance. We also demonstrate that it is possible to design the embedding such that it represents different ranges of distances with different precision. These embeddings also allow the computation of kernel inner products with control on their inner product-preserving properties. Our results provide a broad framework to design and analyze embeddings and generalize existing results in this area, such as random Fourier kernels and universal embeddings.


2011 ◽  
Vol 2011 ◽  
pp. 1-12 ◽  
Author(s):  
Adam Towsley ◽  
Jonathan Pakianathan ◽  
David H. Douglass

Covariance is used as an inner product on a formal vector space built on random variables to define measures of correlation across a set of vectors in a -dimensional space. For , one has the diameter; for , one has an area. These concepts are directly applied to correlation studies in climate science.


2020 ◽  
Vol 44 (4) ◽  
pp. 571-579
Author(s):  
T. TEIMOURI-AZADBAKHT ◽  
A. G GHAZANFARI

Let X be a Hilbert C∗-module on C∗-algebra A and p ∈ A. We denote by Dp(A,X) the set of all continuous functions f : A → X, which are Fréchet differentiable on a open neighborhood U of p. Then, we introduce some generalized semi-inner products on Dp(A,X), and using them some Grüss type inequalities in semi-inner product C∗-module Dp(A,X) and Dp(A,Xn) are established.


Fluids ◽  
2020 ◽  
Vol 5 (4) ◽  
pp. 189
Author(s):  
Xuping Xie ◽  
Peter J. Nolan ◽  
Shane D. Ross  ◽  
Changhong Mou  ◽  
Traian Iliescu

There are two main strategies for improving the projection-based reduced order model (ROM) accuracy—(i) improving the ROM, that is, adding new terms to the standard ROM; and (ii) improving the ROM basis, that is, constructing ROM bases that yield more accurate ROMs. In this paper, we use the latter. We propose two new Lagrangian inner products that we use together with Eulerian and Lagrangian data to construct two new Lagrangian ROMs, which we denote α-ROM and λ-ROM. We show that both Lagrangian ROMs are more accurate than the standard Eulerian ROMs, that is, ROMs that use standard Eulerian inner product and data to construct the ROM basis. Specifically, for the quasi-geostrophic equations, we show that the new Lagrangian ROMs are more accurate than the standard Eulerian ROMs in approximating not only Lagrangian fields (e.g., the finite time Lyapunov exponent (FTLE)), but also Eulerian fields (e.g., the streamfunction). In particular, the α-ROM can be orders of magnitude more accurate than the standard Eulerian ROMs. We emphasize that the new Lagrangian ROMs do not employ any closure modeling to model the effect of discarded modes (which is standard procedure for low-dimensional ROMs of complex nonlinear systems). Thus, the dramatic increase in the new Lagrangian ROMs’ accuracy is entirely due to the novel Lagrangian inner products used to build the Lagrangian ROM basis.


Author(s):  
Leiba Rodman

This chapter fixes a nonstandard involution φ‎. It introduces indefinite inner products defined on Hn×1 of the symmetric and skewsymmetric types associated with φ‎ and matrices having symmetry properties with respect to one of these indefinite inner products. The development in this chapter is often parallel to that of Chapter 10, but here the indefinite inner products are with respect to a nonstandard involution, rather with respect to the conjugation as in Chapter 10. This chapter develops canonical forms for (H,φ‎)-symmetric and (H,φ‎)-kewsymmetric matrices (when the inner product is of the symmetric-type), and canonical forms of (H,φ‎)-Hamiltonian and (H,φ‎)-skew-Hamiltonian matrices (when the inner product is of the skewsymmetric-type). Applications include invariant Lagrangian subspaces and systems of differential equations with symmetries.


Sign in / Sign up

Export Citation Format

Share Document