Related papers: Towards Complexity for Quantum Field Theory States
Complexity in quantum physics measures how difficult a state can be reached from a reference state and more precisely it is the number of fundamental unitary gates we have to operate to transform the reference state to the state we are…
We present a description of finite dimensional quantum entanglement, based on a study of the space of all convex decompositions of a given density matrix. On this space we construct a system of real polynomial equations describing separable…
Rapidly growing capabilities of quantum simulators to probe quantum many-body phenomena require new methods to characterize increasingly complex states. We present a protocol that constrains quantum states by experimentally measured…
In this paper, we construct 2-dimensional bipartite cluster states and perform single-qubit measurements on the bulk qubits. We explore the entanglement scaling of the unmeasured 1-dimensional boundary state and show that under certain…
We define generalised Gaussian states for quantum cosmological models based on the $\mathfrak{su(1,1)}$ algebra, with particular emphasis on its realisation in group field theory for a single field mode, and study their semiclassical…
A successful approach to understand field theories is to resolve the physics into different length or energy scales using the renormalization group framework. We propose a quantum simulation of quantum field theory which encodes field…
Field mediated entanglement experiments probe the quantum superposition of macroscopically distinct field configurations. We show that this phenomenon can be described by using a transparent quantum field theoretical formulation of…
We study Nielsen complexity and Fubini-Study complexity for a class of exactly solvable one dimensional spin systems. Our examples include the transverse XY spin chain and its natural extensions, the quantum compass model with and without…
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…
We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…
We derive an explicit expressions for geometric description of state manifold obtained from evolution governed by a three parameter family of Hamiltonians covering most cases related to real interacting two-qubit systems. We discuss types…
A simple, general and practically exact method is developed to calculate the ground states of 1D macroscopic quantum systems with translational symmetry. Applied to the Hubbard model, a modest calculation reproduces the Bethe Ansatz…
We propose a qubit efficient scheme to study ground state properties of quantum many-body systems on near-term noisy intermediate scale quantum computers. One can obtain a tensor network representation of the ground state using a number of…
Gaussian states hold a fundamental place in quantum mechanics, quantum information, and quantum computing. Many subfields, including quantum simulation of continuous-variable systems, quantum chemistry, and quantum machine learning, rely on…
There are at least a number of ways to formally define complexity. Most of them relate to some kind of minimal description of the studied object. Being this one in form of minimal resources of minimal effort needed to generate the object…
We develop a theory of Gaussian states over general quantum kinematical systems with finitely many degrees of freedom. The underlying phase space is described by a locally compact abelian (LCA) group $G$ with a symplectic structure…
We provide a graphical method to describe and analyze non-Gaussian quantum states using a hypergraph framework. These states are pivotal resources for quantum computing, communication, and metrology, but their characterization is hindered…
We present a statistical mechanics description to study the ground state of quantum systems. In this approach, averages for the complete system are calculated over the non-interacting energy levels. Taking different interaction parameter,…
Entanglement is a unique nature of quantum theory and has tremendous potential for application. Nevertheless, the complexity of quantum entanglement grows exponentially with an increase in the number of entangled particles. Here we…
We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon…