Physical consequences of P NP and the density matrix renormalization group annealing conjecture

DOI10.1088/1742-5468/2014/07/P07006zbMATH Open1456.82383arXiv1010.0128WikidataQ122960805 ScholiaQ122960805MaRDI QIDQ3301992FDOQ3301992

Authors: Silvia N. Santalla, J. Rodriguez-Laguna 

Publication date: 11 August 2020

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Abstract: Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {em need not} be a Turing machine and, thus, these theorems do not apply directly to it. But {em classical simulations} of physical processes are programs running on Turing machines and, as such, are subject to them. In this work, computational complexity theory is applied to classical simulations of systems performing an adiabatic quantum computation (AQC), based on an annealed extension of the density matrix renormalization group (DMRG). We conjecture that the computational time required for those classical simulations is controlled solely by the {em maximal entanglement} found during the process. Thus, lower bounds on the growth of entanglement with the system size can be provided. In some cases, quantum phase transitions can be predicted to take place in certain inhomogeneous systems. Concretely, physical conclusions are drawn from the assumption that the complexity classes {�f P} and {�f NP} differ. As a by-product, an alternative measure of entanglement is proposed which, via Chebyshev's inequality, allows to establish strict bounds on the required computational time.

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

Recommendations

• Publication:4939149
• P/NP , and the quantum field computer
• Computing quantum discord is NP-complete
• Physical portrayal of computational complexity
• Computational Complexity of Projected Entangled Pair States

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Phase transitions (general) in equilibrium statistical mechanics (82B26)

Cites Work

• Title not available (Why is that?)
• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Title not available (Why is that?)
• Colloquium: Quantum annealing and analog quantum computation
• The complexity of theorem-proving procedures
• Title not available (Why is that?)
• Entropy and area
• An area law for one-dimensional quantum systems
• Anderson localization makes adiabatic quantum optimization fail
• Two-dimensional tensor product variational formulation
• Colloquium: area laws for the entanglement entropy
• Computational Complexity of Projected Entangled Pair States
• The density-matrix renormalization group in the age of matrix product states
• Matrix product state representations
• A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
• Quantum annealing and related optimization methods
• Density matrix renormalization on random graphs and the quantum spin-glass transition

Cited In (2)

• Physical portrayal of computational complexity
• Title not available (Why is that?)

This page was built for publication: Physical consequences of \(P \neq\) NP and the density matrix renormalization group annealing conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301992)