Zobrazeno 1 - 10
of 2 315
pro vyhledávání: '"Thompson, Kevin A."'
Autor:
MILLER, PAUL ALLEN
Publikováno v:
The Comparatist, 2022 Oct 01. 46, 317-319.
Externí odkaz:
https://www.jstor.org/stable/27181594
Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefinite programming relaxations have been fruitful in designing theoretic
Externí odkaz:
http://arxiv.org/abs/2411.04120
Recent successes in producing rigorous approximation algorithms for local Hamiltonian problems such as Quantum Max Cut have exploited connections to unconstrained classical discrete optimization problems. We initiate the study of approximation algori
Externí odkaz:
http://arxiv.org/abs/2409.04433
Product states, unentangled tensor products of single qubits, are a ubiquitous ansatz in quantum computation, including for state-of-the-art Hamiltonian approximation algorithms. A natural question is whether we should expect to efficiently solve pro
Externí odkaz:
http://arxiv.org/abs/2401.06725
Understanding and approximating extremal energy states of local Hamiltonians is a central problem in quantum physics and complexity theory. Recent work has focused on developing approximation algorithms for local Hamiltonians, and in particular the `
Externí odkaz:
http://arxiv.org/abs/2307.15688
We give a classical $1/(qk+1)$-approximation for the maximum eigenvalue of a $k$-sparse fermionic Hamiltonian with strictly $q$-local terms, as well as a $1/(4k+1)$-approximation when the Hamiltonian has both $2$-local and $4$-local terms. More gener
Externí odkaz:
http://arxiv.org/abs/2301.04627
Autor:
Parekh, Ojas, Thompson, Kevin
We resolve the approximability of the maximum energy of the Quantum Max Cut (QMC) problem using product states. A classical 0.498-approximation, using a basic semidefinite programming relaxation, is known for QMC, paralleling the celebrated 0.878-app
Externí odkaz:
http://arxiv.org/abs/2206.08342