9 citations · 21 across the 16 of their papers we have counts for
17 papers
On Near Optimal Spectral Expander Graphs of Fixed Size
Clark Alexander
We present a pair of heuristic algorithms. The first is to generate a random regular graph of fixed size. The second is the introduction of the Metropolis Coupled Simulated Anneale…
How to Teach a Quantum Computer a Probability Distribution
Clark Alexander
Currently there are three major paradigms of quantum computation, the gate model, annealing, and walks on graphs. The gate model and quantum walks on graphs are universal computati…
Consistent Rotation Maps Induce a Unitary Shift Operator in Discrete Time Quantum Walks
Clark Alexander
In this work we explain the necessity for consistently labeled rotation maps for efficiently computing coined discrete time quantum walks on regular graphs.
A Note on Consistent Rotation Maps of Graph Cartesian Products
Clark Alexander
Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a si…
An Optimal Constraint for QUBO Models
Clark Alexander
A quadratic binary unconstrained optimization model, hereafter QUBO, by definition is unconstrained. This, however, is not ideal if one needs to select a model containing only a fi…
Picking Efficient Portfolios from 3,171 US Common Stocks with New Quantum and Classical Solvers
Jeffrey Cohen, Clark Alexander
We analyze 3,171 US common stocks to create an efficient portfolio based on the Chicago Quantum Net Score (CQNS) and portfolio optimization. We begin with classical solvers and inc…