Abstract

We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.Comment: 5 pages, 1 figure, see also http://rugth30.phys.rug.nl/compphys/qce.ht

    Similar works