activity
19982022
most citedBraiding Operators are Universal Quantum Gates

176 citations · 590 across the 34 of their papers we have counts for

collaborators

36 papers

quant-ph2022★ 6 cited

How viable is quantum annealing for solving linear algebra problems?

Ajinkya Borle, Samuel J. Lomonaco

With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in line…

quant-ph2020

Quantum Approximate Optimization for Hard Problems in Linear Algebra

Ajinkya Borle, Vincent E. Elfving, Samuel J. Lomonaco

The Quantum Approximate Optimization Algorithm (QAOA) by Farhi et al. is a quantum computational framework for solving quantum or classical optimization tasks. Here, we explore usi…

math.GT2019

Quantum knots and knotted zeros

Louis H Kauffman, Samuel J Lomonaco

In this paper we show how to place Michael Berry's discovery of knotted zeros in the quantum states of hydrogen in the context of general knot theory and in the context of our form…

quant-ph2018★ 1 cited

Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems

Ajinkya Borle, Samuel J. Lomonaco

With the advent of quantum computers, researchers are exploring if quantum mechanics can be leveraged to solve important problems in ways that may provide advantages not possible w…

quant-ph2017★ 1 cited

Quantum Fourier Sampling is Guaranteed to Fail to Compute Automorphism Groups of Easy Graphs

Omar Shehab, Samuel J. Lomonaco

The quantum hidden subgroup approach is an actively studied approach to solve combinatorial problems in quantum complexity theory. With the success of the Shor's algorithm, it was…

cond-mat.str-el2016★ 4 cited

Braiding Majorana Fermions

Louis H. Kauffman, Samuel J. Lomonaco

In this paper we study a Clifford algebra generalization of the quaternions and its relationship with braid group representations related to Majorana fermions. The Fibonacci model…