DeepAI AI Chat
Log In Sign Up

Quadratization in discrete optimization and quantum mechanics

by   Nike Dattani, et al.

A book about turning high-degree optimization problems into quadratic optimization problems that maintain the same global minimum (ground state). This book explores quadratizations for pseudo-Boolean optimization, perturbative gadgets used in QMA completeness theorems, and also non-perturbative k-local to 2-local transformations used for quantum mechanics, quantum annealing and universal adiabatic quantum computing. The book contains 70 different Hamiltonian transformations, each of them on a separate page, where the cost (in number of auxiliary binary variables or auxiliary qubits, or number of sub-modular terms, or in graph connectivity, etc.), pros, cons, examples, and references are given. One can therefore look up a quadratization appropriate for the specific term(s) that need to be quadratized, much like using an integral table to look up the integral that needs to be done. This book is therefore useful for writing compilers to transform general optimization problems, into a form that quantum annealing or universal adiabatic quantum computing hardware requires; or for transforming quantum chemistry problems written in the Jordan-Wigner or Bravyi-Kitaev form, into a form where all multi-qubit interactions become 2-qubit pairwise interactions, without changing the desired ground state. Applications cited include computer vision problems (e.g. image de-noising, un-blurring, etc.), number theory (e.g. integer factoring), graph theory (e.g. Ramsey number determination), and quantum chemistry. The book is open source, and anyone can make modifications here:


PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form

We present PyQUBO, an open-source, Python library for constructing quadr...

Breaking limitation of quantum annealer in solving optimization problems under constraints

Quantum annealing is a generic solver for optimization problems that use...

A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations

Adiabatic Quantum Computing (AQC) is an attractive paradigm for solving ...

Quantum Topology Optimization via Quantum Annealing

We present a quantum annealing-based solution method for topology optimi...

Pegasus: The second connectivity graph for large-scale quantum annealing hardware

Pegasus is a graph which offers substantially increased connectivity bet...

Quantum Advantage for All

We show how to translate a subset of RISC-V machine code compiled from a...

Writing and Editing Complexity Theory: Tales and Tools

Each researcher should have a full shelf—physical or virtual—of books on...