University of Cambridge > Talks.cam > wm266's list > The complexity of antiferromagnetic 2-qubit interactions and 2D lattices

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The complexity of antiferromagnetic 2-qubit interactions and 2D lattices

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 lists

Online via zoom & Queen Edith Room Light Centre for Animal Welfare & Anthrozoology Seminar Room, Vet Scho, Veterinary Medicine, Department of

Other talks

Title abstract tbc Title TBC Title and abstract tba Am I a Member? Auditing Private Machine Learning Bacterial Physiology During Growth Arrest: Can It Be Targeted by Anti-Bacterial Therapeutics? Title TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity