z-logo
open-access-imgOpen Access
Beating Random Assignment for Approximating Quantum 2-Local Hamiltonian Problems.
Author(s) -
Ojas Parekh,
Kevin Thompson
Publication year - 2021
Publication title -
osti oai (u.s. department of energy office of scientific and technical information)
Language(s) - Uncategorized
Resource type - Conference proceedings
DOI - 10.2172/1884207
Subject(s) - approximation algorithm , hamiltonian (control theory) , mathematics , quantum algorithm , quantum computer , quantum , hardness of approximation , bipartite graph , quadratic equation , generalization , discrete mathematics , combinatorics , quantum mechanics , mathematical optimization , mathematical analysis , physics , graph , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom