Approximation algorithms for quantum many-body problems

DOI10.1063/1.5085428zbMath1428.82039arXiv1808.01734OpenAlexW3098816768WikidataQ128151491 ScholiaQ128151491MaRDI QIDQ5379355

Kristan Temme, David Gosset, Sergey Bravyi, Robert Koenig

Publication date: 28 May 2019

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.01734

zbMATH Keywords

quantum many-body systemsbinary quadratic functionsqubit Hamiltonianssystems of qubits

Mathematics Subject Classification ID

Interacting particle systems in time-dependent statistical mechanics (82C22) Estimates of eigenvalues in context of PDEs (35P15) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Spinor and twistor methods applied to problems in quantum theory (81R25) Many-body theory; quantum Hall effect (81V70) Statistical mechanics of solids (82D20) Approximation algorithms (68W25)

Related Items (2)

Measurements of quantum Hamiltonians with locally-biased classical shadows ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Moment inequalities for sums of random matrices and their applications in optimization
• Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
• Generalized Hartree-Fock theory and the Hubbard model
• Complexity of quantum impurity problems
• The classical limit of quantum spin systems
• Complexity Classification of Local Hamiltonian Problems
• Colloquium: Exactly solvable Richardson-Gaudin models for many-body quantum systems
• Approximation Algorithms for QMA-Complete Problems
• Quantum Hamiltonian Complexity
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Entanglement Breaking Channels
• Qubit Entanglement Breaking Channels

This page was built for publication: Approximation algorithms for quantum many-body problems