相关论文: Circuit complexity in quantum field theory

Quantum General Relativity (QGR), sometimes called Loop Quantum Gravity, has matured over the past fifteen years to a mathematically rigorous candidate quantum field theory of the gravitational field. The features that distinguish it from…

Adaptive quantum circuits, leveraging measurements and classical feedback, significantly expand the landscape of realizable quantum states compared to their non-adaptive counterparts, enabling the preparation of long-range entangled states…

We present a quantum-classical hybrid algorithm that simulates electronic structures of periodic systems such as ground states and quasiparticle band structures. By extending the unitary coupled cluster (UCC) theory to describe crystals in…

Circuit optimization is a fundamental task for practical applications of near-term quantum computers. In this work we address this challenge through the powerful lenses of tensor network theory. Our approach involves the full…

The unitary dynamics of quantum systems can be modeled as a trajectory on a Riemannian manifold. This theoretical framework naturally yields a purely geometric interpretation of computational complexity for quantum algorithms, a notion…

We compute the quantum circuit complexity of the evolution of scalar curvature perturbations on expanding backgrounds, using the language of squeezed vacuum states. In particular, we construct a simple cosmological model consisting of an…

We give a very concise review of the group field theory formalism for non-perturbative quantum gravity, a higher dimensional generalisation of matrix models. We motivate it as a simplicial and local realisation of the idea of 3rd…

We propose that holographic spacetimes can be regarded as collections of quantum circuits based on path-integrals. We relate a codimension one surface in a gravity dual to a quantum circuit given by a path-integration on that surface with…

For chaotic quantum dynamics modeled by random unitary circuits, we study the complexity of reduced density matrices of subsystems as a function of evolution time where the initial global state is a product pure state. The state complexity…

Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…

The kinematical setting of spherically symmetric quantum geometry, derived from the full theory of loop quantum gravity, is developed. This extends previous studies of homogeneous models to inhomogeneous ones where interesting field theory…

We propose a modification to Nielsen's circuit complexity for Hamiltonian simulation using the Suzuki-Trotter (ST) method, which provides a network like structure for the quantum circuit. This leads to an optimized gate counting linear in…

Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…

A link between canonical quantum gravity and fermionic quantum field theory is established in this paper. From a spectral triple construction which encodes the kinematics of quantum gravity semi-classical states are constructed which, in a…

The paper presents a computational study of the ground-state properties of a quantum nanomagnet possessing the shape of a finite two-legged ladder composed of 12 spins $S=1/2$. The system is described with isotropic quantum Heisenberg model…

We reconsider the Rovelli-Smolin model of gravity coupled to the Klein-Gordon time field with an eye towards capturing the degrees of freedom of the scalar field lost in the framework in which time is deparametrized by the scalar field.…

In the presence of chemical potential and temperature, we holographically study subregion complexity in a non-conformal quantum field theory with a critical point. We propose a new interpretation according to which the states, needing…

We study the relation between quantum computational complexity and general relativity. The quantum computational complexity is proposed to be quantified by the shortest length of geodesic quantum curves. We examine the complexity/volume…

While quantum state tomography is notoriously hard, most states hold little interest to practically-minded tomographers. Given that states and unitaries appearing in Nature are of bounded gate complexity, it is natural to ask if efficient…

During the last 30 years, stimulated by the quest to build superconducting quantum processors, a theory of quantum electrical circuits has emerged and this theory goes under the name of circuit quantum electrodynamics or circuit-QED. The…