Nonclassicality Criteria from Phase-Space Representations and Information-Theoretical Constraints Are Maximally Inequivalent

We consider two celebrated criteria for defining the nonclassicality of bipartite bosonic quantum systems, the first stemming from information theoretic concepts and the second from physical constraints on the quantum phase space. Consequently, two sets of allegedly classical states are singled out: (i) the set C composed of the so-called classical-classical (CC) states—separable states that are locally distinguishable and do not possess quantum discord; (ii) the set P of states endowed with a positive P representation (P-classical states)—mixtures of Glauber coherent states that, e.g., fail to show negativity of their Wigner function. By showing that C and P are almost disjoint, we prove that the two defining criteria are maximally inequivalent. Thus, the notions of classicality that they put forward are radically different. In particular, generic CC states show quantumness in their P representation, and vice versa, almost all P-classical states have positive quantum discord and, hence, are not CC. This inequivalence is further elucidated considering different applications of P-classical and CC states. Our results suggest that there are other quantum correlations in nature than those revealed by entanglement and quantum discord.

Intermittency, quasiperiodicity and chaos in probe-induced ferroelectric domain switching

Memristive materials and devices, which enable information storage and processing on one and the same physical platform, offer an alternative to conventional von Neumann computation architectures. Their continuous spectra of states with intricate field-history dependence give rise to complex dynamics, the spatial aspect of which has not been studied in detail yet. Here, we demonstrate that ferroelectric domain switching induced by a scanning probe microscopy tip exhibits rich pattern dynamics, including intermittency, quasiperiodicity and chaos. These effects are due to the interplay between tip-induced polarization switching and screening charge dynamics, and can be mapped onto the logistic map. Our findings may have implications for ferroelectric storage, nanostructure fabrication and transistor-less logic.

Spin-wave modes in Ni nanorod arrays studied by Brillouin light scattering

Dynamic magnetic properties of arrays of Ni nanorods with a low aspect ratio have been investigated. It has been shown that the spectra of spin-wave resonances localized on nanorods with a low aspect ratio typically feature the presence of zones with high density of states resulting in a characteristic two-peak pattern of Stokes and anti-Stokes lines of magneto-optical (MO) Brillouin light scattering with pronounced Stokes–anti-Stokes (S-AS) asymmetry. A simple theoretical model based on the analysis of the elliptic character of the polarization of the optical wave interacting with a dipole magnetostatic wave has been proposed. It has been shown that the S-AS asymmetry is due entirely to the asymmetry of the MO interaction efficiency with respect to time reversal of the magnetic precession in a magnon.

Updating Credal Networks is Approximable in Polynomial Time

Credal networks relax the precise probability requirement of Bayesian networks, enabling a richer representation of uncertainty in the form of closed convex sets of probability measures. The increase in expressiveness comes at the expense of higher computational costs. In this paper, we present a new variable elimination algorithm for exactly computing posterior inferences in extensively specified credal networks, which is empirically shown to outperform a state-of-the-art algorithm. The algorithm is then turned into a provably good approximation scheme, that is, a procedure that for any input is guaranteed to return a solution not worse than the optimum by a given factor. Remarkably, we show that when the networks have bounded treewidth and bounded number of states per variable the approximation algorithm runs in time polynomial in the input size and in the inverse of the error factor, thus being the first known fully polynomial-time approximation scheme for inference in credal networks.

Solving Limited Memory Influence Diagrams

We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions and limited information. The algorithm is empirically shown to outperform a state-of-the-art algorithm on randomly generated problems of up to 150 variables and 10^64 solutions. We show that these problems are NP-hard even if the underlying graph structure of the problem has low treewidth and the variables take on a bounded number of states, and that they admit no provably good approximation if variables can take on an arbitrary number of states.

New Complexity Results for MAP in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. It is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure), which extends previous complexity results. Furthermore, a Fully Polynomial Time Approximation Scheme for MAP in networks with bounded treewidth and bounded number of states per variable is developed. Approximation schemes were thought to be impossible, but here it is shown otherwise under the assumptions just mentioned, which are adopted in most applications.

Solving Limited Memory Influence Diagrams

We present a new algorithm for exactly solving decision making problems represented as influence diagrams. We do not require the usual assumptions of no forgetting and regularity; this allows us to solve problems with simultaneous decisions and limited information. The algorithm is empirically shown to outperform a state-of-the-art algorithm on randomly generated problems of up to 150 variables and 10^64 solutions. We show that the problem is NP-hard even if the underlying graph structure of the problem has small treewidth and the variables take on a bounded number of states, but that a fully polynomial time approximation scheme exists for these cases. Moreover, we show that the bound on the number of states is a necessary condition for any efficient approximation scheme.

New Results for the MAP Problem in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. First, it is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure). Such proofs extend previous complexity results for the problem. Inapproximability results are also derived in the case of trees if the number of states per variable is not bounded. Although the problem is shown to be hard and inapproximable even in very simple scenarios, a new exact algorithm is described that is empirically fast in networks of bounded treewidth and bounded number of states per variable. The same algorithm is used as basis of a Fully Polynomial Time Approximation Scheme for MAP under such assumptions. Approximation schemes were generally thought to be impossible for this problem, but we show otherwise for classes of networks that are important in practice. The algorithms are extensively tested using some well-known networks as well as random generated cases to show their effectiveness.

Single- and two-mode quantumness at a beam splitter

In the context of bipartite bosonic systems, two notions of classicality of correlations can be defined: P-classicality, based on the properties of the Glauber-Sudarshan P-function; and C-classicality, based on the entropic quantum discord. It has been shown that these two notions are maximally inequivalent in a static (metric) sense -- as they coincide only on a set of states of zero measure. We extend and reinforce quantitatively this inequivalence by addressing the dynamical relation between these types of non-classicality in a paradigmatic quantum-optical setting: the linear mixing at a beam splitter of a single-mode Gaussian state with a thermal reference state. Specifically, we show that almost all P-classical input states generate outputs that are not C-classical. Indeed, for the case of zero thermal reference photons, the more P-classical resources at the input the less C-classicality at the output. In addition, we show that the P-classicality at the input -- as quantified by the non-classical depth -- does instead determine quantitatively the potential of generating output entanglement. This endows the non-classical depth with a new operational interpretation: it gives the maximum number of thermal reference photons that can be mixed at a beam splitter without destroying the output entanglement.

Deglacial mesophotic reef demise on the Great Barrier Reef

Submerged reefs are important recorders of palaeo-environments and sea-level change, and provide a substrate for modern mesophotic (deep-water, light-dependent) coral communities. Mesophotic reefs are rarely, if ever, described from the fossil record and nothing is known of their long-term record on Great Barrier Reef (GBR). Sedimentological and palaeo-ecological analyses coupled with 67 14C AMS and U–Th radiometric dates from dredged coral, algae and bryozoan specimens, recovered from depths of 45 to 130 m, reveal two distinct generations of fossil mesophotic coral community development on the submerged shelf edge reefs of the GBR. They occurred from 13 to 10 ka and 8 ka to present. We identified eleven sedimentary facies representing both autochthonous (in situ) and allochthonous (detrital) genesis, and their palaeo-environmental settings have been interpreted based on their sedimentological characteristics, biological assemblages, and the distribution of similar modern biota within the dredges. Facies on the shelf edge represent deep sedimentary environments, primarily forereef slope and open platform settings in palaeo-water depths of 45–95 m. Two coral–algal assemblages and one non-coral encruster assemblage were identified: 1) Massive and tabular corals including Porites, Montipora and faviids associated with Lithophylloids and minor Mastophoroids, 2) platy and encrusting corals including Porites, Montipora and Pachyseris associated with melobesioids and Sporolithon, and 3) Melobesiods and Sporolithon with acervulinids (foraminifera) and bryozoans. Based on their modern occurrence on the GBR and Coral Sea and modern specimens collected in dredges, these are interpreted as representing palaeo-water depths of < 60 m, < 80–100 m and > 100 m respectively. The first mesophotic generation developed at modern depths of 85–130 m from 13 to 10.2 ka and exhibit a deepening succession of < 60 to > 100 m palaeo-water depth through time. The second generation developed at depths of 45–70 m on the shelf edge from 7.8 ka to present and exhibit stable environmental conditions through time. The apparent hiatus that interrupted the mesophotic coral communities coincided with the timing of modern reef initiation on the GBR as well as a wide-spread flux of siliciclastic sediments from the shelf to the basin. For the first time we have observed the response of mesophotic reef communities to millennial scale environmental perturbations, within the context of global sea-level rise and environmental changes.

State History, Historical Legitimacy and Modern Ethnic Diversity

How much does the antiquity of states, and the sometimes arbitrary nature of colonial boundaries, explain the modern degree of ethnic diversity? It is shown that states with greater historical legitimacy (more continuity between the pre-colonial and post-colonial state) have less ethnic diversity. Historical legitimacy is more strongly correlated with ethnic diversity than are the antiquity of states, genetic diversity or the duration of human settlement. Although historical legitimacy is particularly pertinent to Africa, the correlation also holds outside Africa.