COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > wm266's list > The complexity of antiferromagnetic 2-qubit interactions and 2D lattices
The complexity of antiferromagnetic 2-qubit interactions and 2D latticesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact William Matthews. Estimation of the minimum eigenvalue of a quantum Hamiltonian can be formalised as the Local Hamiltonian problem. In one natural special case of the Local Hamiltonian problem, the same 2-local interaction, with differing weights, is applied across each pair of qubits. I will talk about some recent work classifying the computational complexity of this problem when some additional physically motivated restrictions are made to these weights. In particular we consider the case where these weights are all positive and/or that the interactions are restricted to the edges of a 2D square (or triangular) lattice. For most interactions we are able to classify the complexity as either QMA -complete or contained in StoqMA. This talk is part of the wm266's list series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsLucy Cavendish College public lecture series Hitachi Cambridge Laboratory Computer Laboratory Systems Research Group Seminar Marxist Discussion Group Talks Talks in Architecture Stem Cells & Regenerative MedicineOther talksAnglo-Ottoman encounter in the Age of the Beloveds Kolmogorov Complexity and Gödel’s Incompleteness Theorems Adaptive Stochastic Galerkin Finite Element Approximation for Elliptic PDEs with Random Coefficients Propagation of Very Low Frequency Emissions from Lightning |