English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We propose a scheme for solving mixed-integer programming problems in whichthe optimization problem is translated to a ground-state preparation problem ona set of bosonic quantum field modes (qumodes). We perform numericaldemonstrations by simulating a circuit-based optical quantum computer with eachindividual qumode prepared in a Gaussian state. We simulate an adiabaticevolution from an initial mixing Hamiltonian, written in terms of the momentumoperators of the qumodes, to a final Hamiltonian which is a polynomial of theposition and boson number operators. In these demonstrations, we solve avariety of small non-convex optimization problems in integer programming,continuous non-convex optimization, and mixed-integer programming.

Mixed-Integer Programming Using a Bosonic Quantum Computer