A bstract Motivated by recent studies of holographic complexity, we examine the question of
circuit complexity in quantum field theory. We provide a quantum circuit model for the …

A bstract We study circuit complexity for free fermionic field theories and Gaussian states.
Our definition of circuit complexity is based on the notion of geodesic distance on the Lie …

Despite the recent advancements by deep learning methods such as AlphaFold2, in silico
protein structure prediction remains a challenging problem in biomedical research. With the …

A bstract In the context of relating AdS/CFT to quantum information theory, we propose a
holographic dual of Fisher information metric for mixed states in the boundary field theory …

The art of quantum algorithm design is highly nontrivial. Grover's search algorithm
constitutes a masterpiece of quantum computational software. In this article, we use methods …

We use geometric concepts originally proposed by Anandan and Aharonov [Phys. Rev. Lett.
65, 1697 (1990) PRLTAO 0031-9007 10.1103/PhysRevLett. 65.1697] to show that the Farhi …

For any quantum algorithm given by a path in the space of unitary operators we define the
computational complexity as the typical computational time associated with the path. This …

We present an information geometric characterization of Grover's quantum search algorithm.
First, we quantify the notion of quantum distinguishability between parametric density …

The relevance of the concept of Fisher information is increasing in both statistical physics
and quantum computing. From a statistical mechanical standpoint, the application of Fisher …

We present a unifying variational calculus derivation of Groverian geodesics for both
quantum state vectors and quantum probability amplitudes. In the first case, we show that …