A fermionic operator circuit is a product of fermionic operators of usually different and partially overlapping support. Further elements of fermionic operator circuits (FOCs) are partial traces and partial projections. The presented framework allows for the introduction of fermionic versions of known qudit operator circuits (QUOC), important for the simulation of strongly correlated -dimensional systems: the multiscale entanglement renormalization ansätze (MERA), tree tensor networks (TTN), projected entangled pair states (PEPS), or their infinite-size versions (iPEPS etc.). After the definition of a FOC, we present a method to contract it with the same computation and memory requirements as a corresponding QUOC, for which all fermionic operators are replaced by qudit operators of identical dimension. A given scheme for contracting the QUOC relates to an analogous scheme for the corresponding fermionic circuit, where additional marginal computational costs arise only from reordering of modes for operators occurring in intermediate stages of the contraction. Our result hence generalizes efficient schemes for the simulation of -dimensional spin systems, as MERA, TTN, or PEPS to the fermionic case.
We introduce a scheme for efficiently describing pure states of strongly correlated fermions in higher dimensions using unitary circuits featuring a causal cone. A local way of computing local expectation values is presented. We formulate a dynamical reordering scheme, corresponding to time-adaptive Jordan-Wigner transformation, that avoids nonlocal string operators. Primitives of such a reordering scheme are highlighted. Fermionic unitary circuits can be contracted with the same complexity as in the spin case. The scheme gives rise to a variational description of fermionic models not suffering from a sign problem. We present numerical examples in a 9\ifmmode\times\else\texttimes\fi{}9 and 6\ifmmode\times\else\texttimes\fi{}6 fermionic lattice model to show the functioning of the approach.
The channel induced by a complex system interacting strongly with a qubit is calculated exactly under the assumption of randomness of its eigenvectors. The resulting channel is represented as an isotropic time-dependent oscillation of the Bloch ball, leading to non-Markovian behavior, even in the limit of infinite environments. Two contributions are identified: one due to the density of states and the other due to correlations in the spectrum. Prototype examples, one for chaotic and the other for regular dynamics are explored.
Virtually anything can be and is ranked; people, institutions, countries, words, genes. Rankings reduce complex systems to ordered lists, reflecting the ability of their elements to perform relevant functions, and are being used from socioeconomic policy to knowledge extraction. A century of research has found regularities when temporal rank data is aggregated. Far less is known, however, about how rankings change in time. Here we explore the dynamics of 30 rankings in natural, social, economic, and infrastructural systems, comprising millions of elements and timescales from minutes to centuries. We find that the flux of new elements determines the stability of a ranking: for high flux only the top of the list is stable, otherwise top and bottom are equally stable. We show that two basic mechanisms — displacement and replacement of elements — capture empirical ranking dynamics. The model uncovers two regimes of behavior; fast and large rank changes, or slow diffusion. Our results indicate that the balance between robustness and adaptability in ranked systems might be governed by simple random processes irrespective of system details.
We construct measures for the non-Markovianity of quantum evolution with a physically meaningful interpretation. We first provide a general setting in the framework of channel capacities and propose two families of meaningful quantitative measures, based on the largest revival of a channel capacity, avoiding some drawbacks of other non-Markovianity measures. We relate the proposed measures to the task of information screening. This shows that the non-Markovianity of a quantum process may be used as a resource. Under these considerations, we analyze two paradigmatic examples, a qubit in a quantum environment with classically mixed dynamics and the Jaynes-Cummings model.
Statistical studies of languages have focused on the rank-frequency distribution of words. Instead, we introduce here a measure of how word ranks change in time and call this distribution rank diversity. We calculate this diversity for books published in six European languages since 1800, and find that it follows a universal lognormal distribution. Based on the mean and standard deviation associated with the lognormal distribution, we define three different word regimes of languages: “heads” consist of words which almost do not change their rank in time, “bodies” are words of general use, while “tails” are comprised by context-specific words and vary their rank considerably in time. The heads and bodies reflect the size of language cores identified by linguists for basic communication. We propose a Gaussian random walk model which reproduces the rank variation of words in time and thus the diversity. Rank diversity of words can be understood as the result of random variations in rank, where the size of the variation depends on the rank itself. We find that the core size is similar for all languages studied.