A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations

10/02/2018
by   Raouf Dridi, et al.
1

Adiabatic Quantum Computing (AQC) is an attractive paradigm for solving hard integer polynomial optimization problems. Available hardware restricts the Hamiltonians to be of a structure that allows only pairwise interactions. This requires that the original optimization problem to be first converted – from its polynomial form – to a quadratic unconstrained binary optimization (QUBO) problem, which we frame as a problem in algebraic geometry. Additionally, the hardware graph where such a QUBO-Hamiltonian needs to be embedded – assigning variables of the problem to the qubits of the physical optimizer – is not a complete graph, but rather one with limited connectivity. This "problem graph to hardware graph" embedding can also be framed as a problem of computing a Groebner basis of a certain specially constructed polynomial ideal. We develop a systematic computational approach to prepare a given polynomial optimization problem for AQC in three steps. The first step reduces an input polynomial optimization problem into a QUBO through the computation of the Groebner basis of a toric ideal generated from the monomials of the input objective function. The second step computes feasible embeddings. The third step computes the spectral gap of the adiabatic Hamiltonian associated to a given embedding. These steps are applicable well beyond the integer polynomial optimization problem. Our paper provides the first general purpose computational procedure that can be used directly as a translator to solve polynomial integer optimization. Alternatively, it can be used as a test-bed (with small size problems) to help design efficient heuristic quantum compilers by studying various choices of reductions and embeddings in a systematic and comprehensive manner. An added benefit of our framework is in designing Ising architectures through the study of Y-minor universal graphs.

READ FULL TEXT
research
02/12/2018

Quantum Algorithms for Optimization and Polynomial Systems Solving over Finite Fields

In this paper, we give quantum algorithms for two fundamental computatio...
research
10/05/2019

Template-based Minor Embedding for Adiabatic Quantum Optimization

Quantum Annealing (QA) can be used to quickly obtain near-optimal soluti...
research
12/05/2018

Hard combinatorial problems and minor embeddings on lattice graphs

Today, hardware constraints are an important limitation on quantum adiab...
research
02/08/2023

Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time

One of the central applications for quantum annealers is to find the sol...
research
01/04/2022

Test and Evaluation of Quadrupedal Walking Gaits through Sim2Real Gap Quantification

In this letter, the authors propose a two-step approach to evaluate and ...
research
01/14/2019

Quadratization in discrete optimization and quantum mechanics

A book about turning high-degree optimization problems into quadratic op...
research
06/22/2020

Constructing Driver Hamiltonians for Several Linear Constraints

Recent advances in the field of adiabatic quantum computing and the clos...

Please sign up or login with your details

Forgot password? Click here to reset