arXiv · 2203.15832
Computational Complexity in Analogue Gravity
Abstract
Analogue gravity helps to find some gravitational systems which are similar to the evolution of perturbation in condensed matter systems. These analogies provide a very good tool for either side. In other words, some aspects of gravity could be simulated in condensed matter laboratories. In this study, we are going to find an interpretation for computational complexity in condensed matter systems and the analogue of the uncertainty principle as the Lloyd bound. We show that this inequality roughly is equivalent to the KSS bound in the fluid/gravity duality and provides some experimental criteria to test the Lloyd bound in the laboratory.
Explore related subjects
Keep this discovery
Shahrokh Parvizi, Mojtaba Shahbazi. 2022-03-29. Computational Complexity in Analogue Gravity. https://doi.org/10.1088/1361-6382/ad1eb0
Cite the original work for its findings. Save a collection to share your selection of sources.