التفاصيل البيبلوغرافية
| العنوان: |
Contracting projected entangled pair states is average-case hard |
| المؤلفون: |
Jens Eisert, Jonas Haferkamp, Marek Gluza, Dominik Hangleiter |
| بيانات النشر: |
Freie Universit��t Berlin, 2020. |
| سنة النشر: |
2020 |
| مصطلحات موضوعية: |
Quantum Physics, Work (thermodynamics), 500 Naturwissenschaften und Mathematik::530 Physik::539 Moderne Physik, Computation, Mathematical analysis, FOS: Physical sciences, Many-body techniques, Quantum entanglement, Computational complexity, Tensor network methods, Stepping stone, Development (differential geometry), Quantum Information, Tensor, Computational problem, Quantum Physics (quant-ph), Contraction (operator theory), Quantum, Mathematics |
| الوصف: |
An accurate calculation of the properties of quantum many-body systems is one of the most important yet intricate challenges of modern physics and computer science. In recent years, the tensor network ansatz has established itself as one of the most promising approaches enabling striking efficiency of simulating static properties of one-dimensional systems and abounding numerical applications in condensed matter theory. In higher dimensions, however, a connection to the field of computational complexity theory has shown that the accurate normalization of the two-dimensional tensor networks called projected entangled pair states (PEPS) is #P-complete. Therefore, an efficient algorithm for PEPS contraction would allow to solve exceedingly difficult combinatorial counting problems, which is considered highly unlikely. Due to the importance of understanding two- and three-dimensional systems the question currently remains: Are the known constructions typical of states relevant for quantum many-body systems? In this work, we show that an accurate evaluation of normalization or expectation values of PEPS is as hard to compute for typical instances as for special configurations of highest computational hardness. We discuss the structural property of average-case hardness in relation to the current research on efficient algorithms attempting tensor network contraction, hinting at a wealth of possible further insights into the average-case hardness of important problems in quantum many-body theory. |
| DOI: |
10.17169/refubium-30079 |
| URL الوصول: |
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9da026919b48ddd72a6d7f4ce5e00c25 |
| Rights: |
OPEN |
| رقم الانضمام: |
edsair.doi.dedup.....9da026919b48ddd72a6d7f4ce5e00c25 |
| قاعدة البيانات: |
OpenAIRE |