Experimental Violation of Two-Party Leggett-Garg Inequalities with Semi-weak Measurements

We generalize the derivation of Leggett-Garg inequalities to systematically treat a larger class of experimental situations by allowing multi-particle correlations, invasive detection, and ambiguous detector results. Furthermore, we show how many such inequalities may be tested simultaneously with a single setup. As a proof of principle, we violate several such two-particle inequalities with data obtained from a polarization-entangled biphoton state and a semi-weak polarization measurement based on Fresnel reflection. We also point out a non- trivial connection between specific two-party Leggett-Garg inequality violations and convex sums of strange weak values.Comment: 4 pages, 6 figure

Percolation and jamming in random sequential adsorption of linear segments on square lattice

We present the results of study of random sequential adsorption of linear segments (needles) on sites of a square lattice. We show that the percolation threshold is a nonmonotonic function of the length of the adsorbed needle, showing a minimum for a certain length of the needles, while the jamming threshold decreases to a constant with a power law. The ratio of the two thresholds is also nonmonotonic and it remains constant only in a restricted range of the needles length. We determine the values of the correlation length exponent for percolation, jamming and their ratio

Generalized Flow and Determinism in Measurement-based Quantum Computation

We extend the notion of quantum information flow defined by Danos and Kashefi for the one-way model and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the X-Y, X-Z and Y-Z planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly essential for the study of the algorithms and complexity in the one-way model.Comment: 16 pages, 10 figure

A computational study on altered theta-gamma coupling during learning and phase coding

There is considerable interest in the role of coupling between theta and gamma oscillations in the brain in the context of learning and memory. Here we have used a neural network model which is capable of producing coupling of theta phase to gamma amplitude firstly to explore its ability to reproduce reported learning changes and secondly to memory-span and phase coding effects. The spiking neural network incorporates two kinetically different GABAA receptor-mediated currents to generate both theta and gamma rhythms and we have found that by selective alteration of both NMDA receptors and GABAA,slow receptors it can reproduce learning-related changes in the strength of coupling between theta and gamma either with or without coincident changes in theta amplitude. When the model was used to explore the relationship between theta and gamma oscillations, working memory capacity and phase coding it showed that the potential storage capacity of short term memories, in terms of nested gamma-subcycles, coincides with the maximal theta power. Increasing theta power is also related to the precision of theta phase which functions as a potential timing clock for neuronal firing in the cortex or hippocampus

Genetic contributions to visuospatial cognition in Williams syndrome: insights from two contrasting partial deletion patients

Background Williams syndrome (WS) is a rare neurodevelopmental disorder arising from a hemizygotic deletion of approximately 27 genes on chromosome 7, at locus 7q11.23. WS is characterised by an uneven cognitive profile, with serious deficits in visuospatial tasks in comparison to relatively proficient performance in some other cognitive domains such as language and face processing. Individuals with partial genetic deletions within the WS critical region (WSCR) have provided insights into the contribution of specific genes to this complex phenotype. However, the combinatorial effects of different genes remain elusive. Methods We report on visuospatial cognition in two individuals with contrasting partial deletions in the WSCR: one female (HR), aged 11 years 9 months, with haploinsufficiency for 24 of the WS genes (up to GTF2IRD1), and one male (JB), aged 14 years 2 months, with the three most telomeric genes within the WSCR deleted, or partially deleted. Results Our in-depth phenotyping of the visuospatial domain from table-top psychometric, and small- and large-scale experimental tasks reveal a profile in HR in line with typically developing controls, albeit with some atypical features. These data are contrasted with patient JB’s atypical profile of strengths and weaknesses across the visuospatial domain, as well as with more substantial visuospatial deficits in individuals with the full WS deletion. Conclusions Our findings point to the contribution of specific genes to spatial processing difficulties associated with WS, highlighting the multifaceted nature of spatial cognition and the divergent effects of genetic deletions within the WSCR on different components of visuospatial ability. The importance of general transcription factors at the telomeric end of the WSCR, and their combinatorial effects on the WS visuospatial phenotype are also discussed

Random Resistor-Diode Networks and the Crossover from Isotropic to Directed Percolation

By employing the methods of renormalized field theory we show that the percolation behavior of random resistor-diode networks near the multicritical line belongs to the universality class of isotropic percolation. We construct a mesoscopic model from the general epidemic process by including a relevant isotropy-breaking perturbation. We present a two-loop calculation of the crossover exponent $\phi$. Upon blending the $\epsilon$-expansion result with the exact value $\phi =1$ for one dimension by a rational approximation, we obtain for two dimensions $\phi = 1.29\pm 0.05$. This value is in agreement with the recent simulations of a two-dimensional random diode network by Inui, Kakuno, Tretyakov, Komatsu, and Kameoka, who found an order parameter exponent $\beta$ different from those of isotropic and directed percolation. Furthermore, we reconsider the theory of the full crossover from isotropic to directed percolation by Frey, T\"{a}uber, and Schwabl and clear up some minor shortcomings.Comment: 24 pages, 2 figure

Unboundedness and downward closures of higher-order pushdown automata

We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words accepted by a given HOPDA. This also means we can construct the downward closure of the Parikh image of a HOPDA. Both of these consequences play an important role in verifying concurrent higher-order programs expressed as HOPDA or safe higher-order recursion schemes

Vortex dynamics in a three-state model under cyclic dominance

The evolution of domain structure is investigated in a two-dimensional voter model with three states under cyclic dominance. The study focus on the dynamics of vortices, defined by the points where three states (domains) meet. We can distinguish vortices and antivortices which walk randomly and annihilate each other. The domain wall motion can create vortex-antivortex pairs at a rate which is increased by the spiral formation due to the cyclic dominance. This mechanism is contrasted with a branching annihilating random walk (BARW) in a particle antiparticle system with density dependent pair creation rate. Numerical estimates for the critical indices of the vortex density ($\beta=0.29(4)$) and of its fluctuation ($\gamma=0.34(6)$) improve an earlier Monte Carlo study [Tainaka and Itoh, Europhys. Lett. 15, 399 (1991)] of the three-state cyclic voter model in two dimensions.Comment: 5 pages, 6 figures, to appear in PR

Limitations on information-theoretically-secure quantum homomorphic encryption

Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has raised the question of whether quantum mechanics may be used to achieve information-theoretically-secure fully homomorphic encryption. Here we show, via an information localization argument, that deterministic fully homomorphic encryption necessarily incurs exponential overhead if perfect security is required