WHITE PAPERS
Our white papers outline how our research can be applied to address industry challenges
Finding Optimal Arbitrage Opportunities Using a Quantum Annealer
By Gili Rosenberg
We present two formulations for finding optimal arbitrage opportunities as a quadratic unconstrained binary optimization problem, which can be solved using a quantum annealer. The formulations are based on finding the most profitable cycle in a graph in which the nodes are the assets and the edge weights are the conversion rates…
Cognitive Radio Optimization
By Arman Zaribafiyan & Jaspreet Oberoi
This research proposes a new approach for tackling cognitive radio asset allocation optimization problems. The cognitive radio optimization problem is generally an NP-hard mixed-integer programming problem due to its convoluted constraints…
Quantum Approaches to Graph Similarity
By Maritza Hernandez, Arman Zaribafiyan, & Mohammad Naghibi
At 1QBit we have developed a method of measuring similarity between graphs with the aid of a quantum annealer. In contrast to conventional methods, our method is capable of identifying the reasons for determining that two arbitrary graphs are similar, and can illustrate how much each component of each graph contributes to the decision…
Simulated Annealing via Quantum Annealing
By Pooya Ronagh
This paper describes a general method developed by 1QBit for solving continuous optimization problems inspired by different types of simulated annealing and genetic algorithms. This method works under the assumption of the existence of a computation model with a Turing reduction of problems to either quadratic unconstrained binary optimization (QUBO) problems or to an Ising spin problem…
Integer Optimization Toolbox
By Pooya Ronagh
We describe how the Integer Optimization Toolbox approaches the problem of minimization of a (low-degree) polynomial over an integer lattice. In theory, the method illustrated here can be used for arbitrarily large polynomials with a large enough quantum annealing oracle…