Related papers: Circuit Complexity in $U(1)$ Gauge Theory
In recent years, the quantum computing method has been used to address the sign problem in traditional Monte Carlo lattice gauge theory (LGT) simulations. We propose that the Coulomb gauge (CG) should be used in quantum simulations of LGT.…
We initiate quantitative studies of complexity in (1+1)-dimensional conformal field theories with a view that they provide the simplest setting to find a gravity dual to complexity. Our work pursues a geometric understanding of complexity…
Quantum circuit complexity has played a central role in recent advances in holography and many-body physics. Within quantum field theory, it has typically been studied in a Lorentzian (real-time) framework. In a departure from standard…
Computation of circuit complexity has gained much attention in the Theoretical Physics community in recent times to gain insights into the chaotic features and random fluctuations of fields in the quantum regime. Recent studies of circuit…
As a first step towards a nonperturbative investigation of the gauge-fixing (Rome) approach to lattice chiral gauge theories we study a U(1) model with an action that includes a local gauge-fixing term and a mass counterterm for the gauge…
We propose a superconducting-circuit architecture that realizes a compact U(1) lattice gauge theory using the intrinsic infinite-dimensional Hilbert space of phase and charge variables. The gauge and matter fields are encoded directly in…
Quantum complexity of conformal field theory (CFT) states has recently gained significant attention, both as a diagnostic tool in condensed matter systems and in connection with holographic observables probing black hole interiors. Previous…
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…
We present a tensor formulation for free compact electrodynamics in three Euclidean dimensions and use this formulation to construct a quantum Hamiltonian in the continuous-time limit. Gauge-invariance is maintained at every step and the…
An important challenge in loop quantum gravity is to find semiclassical states - states that are as close to classical as quantum theory allows. This is difficult because the states in the Hilbert space used in LQG are excitations over a…
We initiate the study of state complexity for continuous-variable quantum systems. Concretely, we consider a setup with bosonic modes and auxiliary qubits, where available operations include Gaussian one- and two-mode operations, single-…
Lattice gauge theories in varying dimensions, lattice volumes, and truncations offer a rich family of targets for Hamiltonian simulation on quantum devices. In return, formulating quantum simulations can provide new ways of thinking about…
A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian, replacing the Wilson gauge links with a bilinear of fermionic qubits, later generalized to D-theory. This formalism provides a general…
Based on general and minimal properties of the {\it discrete} circuit complexity, we define the complexity in {\it continuous} systems in a geometrical way. We first show that the Finsler metric naturally emerges in the geometry of the…
Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite…
We investigate the variation of holographic complexity for two nearby target states. Based on Nielsen's geometric approach, we find the variation only depends on the end point of the optimal trajectory, a result which we designate the first…
Quantum computation represents an emerging framework to solve lattice gauge theories (LGT) with arbitrary gauge groups, a general and long-standing problem in computational physics. While quantum computers may encode LGT using only…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
By using a recent approach proposed by Hackl $et\, al.$ to evaluate the complexity of the free fermionic Gaussian state, we compute the complexity of the Dirac vacuum state as well as the excited state of the Fermi system with a mass…
Holographic complexity proposals have sparked interest in quantifying the cost of state preparation in quantum field theories and its possible dual gravitational manifestations. The most basic ingredient in defining complexity is the notion…