Related papers: Complexity of fermionic states
Problem of classification of all the set of entangled states is considered. Invariance of entangled states relative to transformations from a group of symmetry of qubit space leads to classification of all states of the system through…
The study of the entanglement properties of systems of N fermions has attracted considerable interest during the last few years. Various separability criteria for pure states of N identical fermions have been recently discussed but,…
We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of…
The fast changing reality in technical and natural domains perceived by always more accurate observations has drawn attention on new and very broad class of systems with specific behaviour represented under the common wording complexity.…
The theoretical limits of 'lossy' data compression algorithms are considered. The complexity of an object as seen by a macroscopic observer is the size of the perceptual code which discards all information that can be lost without altering…
We review the properties of reduced density matrices for free fermionic or bosonic many-particle systems in their ground state. Their basic feature is that they have a thermal form and thus lead to a quasi-thermodynamic problem with a…
Entangled many-body states are an essential resource for quantum computing and interferometry. Determining the type of entanglement present in a system usually requires access to an exponential number of parameters. We show that in the case…
Entanglement criteria for general (pure or mixed) states of systems consisting of two identical fermions are introduced. These criteria are based on appropriate inequalities involving the entropy of the global density matrix describing the…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
This paper defines a complexity between states in quantum field theory by introducing a Finsler structure based on ladder operators (the generalization of creation and annihilation operators). Two simple models are shown as examples to…
A general notion of information-related complexity applicable to both natural and man-made systems is proposed. The overall approach is to explicitly consider a rational agent performing a certain task with a quantifiable degree of success.…
We present analytic and numerical calculations on the bipartite entanglement entropy in fractional quantum Hall states of the fermionic Laughlin sequence. The partitioning of the system is done both by dividing Landau level orbitals and by…
Quantum entanglement of pure states of a bipartite system is defined as the amount of local or marginal ({\em i.e.}referring to the subsystems) entropy. For mixed states this identification vanishes, since the global loss of information…
A measure of complexity based on a probabilistic description of physical systems is proposed. This measure incorporates the main features of the intuitive notion of such a magnitude. It can be applied to many physical situations and to…
Highly excited many-particle states in quantum systems such as nuclei, atoms, quantum dots, spin systems, quantum computers etc., can be considered as ``chaotic'' superpositions of mean-field basis states (Slater determinants, products of…
We define correlational (von Neumann) entropy for an individual quantum state of a system whose time-independent hamiltonian contains random parameters and is treated as a member of a statistical ensemble. This entropy is representation…
We analytically model a one-dimensional lattice with periodic impurities representing a photonic crystal from first principles. We then investigate bound states in the continuum by computing the transmission and reflection coefficients. It…
We address the task of compression of fermionic quantum information. Due to the parity superselection rule, differently from the case of encoding of quantum information in qubit states, part of the information carried by fermionic systems…
Beyond computer science, quantum complexity theory can potentially revolutionize multiple branches of physics, ranging from quantum many-body systems to quantum field theory. In this paper, we investigate the relationship between the sample…
We study the capacity of entanglement as an alternative to entanglement entropies in estimating the degree of entanglement of quantum bipartite systems over fermionic Gaussian states. In particular, we derive the exact and asymptotic…