• Corpus ID: 226237299

Picking Efficient Portfolios from 3,171 US Common Stocks with New Quantum and Classical Solvers

  title={Picking Efficient Portfolios from 3,171 US Common Stocks with New Quantum and Classical Solvers},
  author={Jeffrey Cohen and Clark Alexander},
  journal={arXiv: Quantum Physics},
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 incorporate quantum annealing. We add a simulated bifurcator as a new classical solver and the new D-Wave Advantage(TM) quantum annealing computer as our new quantum solver. 
1 Citations

Figures from this paper

An Optimal Constraint for QUBO Models
This work shows how to add a constraint to a quadratic binary unconstrained optimization model to force a particular size solution.


Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models
It is shown how many different types of constraining relationships arising in practice can be embodied within the "unconstrained" QUBO formulation in a very natural manner using penalty functions, yielding exact model representations in contrast to the approximate representations produced by customary uses of penalty functions.
Finding Maximum Cliques on the D-Wave Quantum Annealer
It is demonstrated that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms, and for instances specifically designed to fit well the DW qubit interconnection network, substantial speed-ups in computing time over classical approaches are observed.
Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Implementing SB with a field-programmable gate array, it is demonstrated that the SB machine can obtain good approximate solutions of an all-to-all connected 2000-node MAX-CUT problem in 0.5 ms, which is about 10 times faster than a state-of-the-art laser-based machine called a coherent Ising machine.
Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer
A general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices is studied and several pruning and reduction techniques are proposed to speed up the recursive decomposition.
The D-Wave Advantage System : An Overview
  • Business
  • 2020
This report presents a high-level overview of the D-Wave AdvantageTM quantum computer, with a comparison to its predecessor, the D-Wave 2000QTM system. The Advantage quantum processing unit (QPU) can
Next-Generation Topology of D-Wave Quantum Processors
This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new
Simulated Annealer Documentation
    Trying out the new D-Wave Advantage on the stock picking problem
      Quantum Annealer Documentation