Locality and universality of quantum memory effects.
Ontology highlight
ABSTRACT:
SUBMITTER: Liu BH
PROVIDER: S-EPMC4160715 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Quasiperiodic systems are aperiodic but deterministic, so their critical behavior differs from that of clean systems and disordered ones as well. Quasiperiodic criticality was previously understood only in the special limit where the couplings follow discrete quasiperiodic sequences. Here we consider generic quasiperiodic modulations; we find, remarkably, that for a wide class of spin chains, generic quasiperiodic modulations flow to discrete sequences under a real-space renormalization-group transformation. These discrete sequences are therefore fixed points of a functional renormalization group. This observation allows for an asymptotically exact treatment of the critical points. We use this approach to analyze the quasiperiodic Heisenberg, Ising, and Potts spin chains, as well as a phenomenological model for the quasiperiodic many-body localization transition.
| S-EPMC7203221 | biostudies-literature
Project description:In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class1. Here we apply this viewpoint to geometry and initiate a program of classifying homogeneous metrics on group manifolds2 by their long-distance properties. We show that many metrics on low-dimensional Lie groups have markedly different short-distance properties but nearly identical distance functions at long distances, and provide evidence that this phenomenon is even more robust in high dimensions. An application of these ideas of particular interest to physics and computer science is complexity geometry3-7-the study of quantum computational complexity using Riemannian geometry. We argue for the existence of a large universality class of definitions of quantum complexity, each linearly related to the other, a much finer-grained equivalence than typically considered. We conjecture that a new effective metric emerges at larger complexities that describes a broad class of complexity geometries, insensitive to various choices of microscopic penalty factors. We discuss the implications for recent conjectures in quantum gravity.
| S-EPMC10550822 | biostudies-literature
Project description:The launch of a satellite capable of distributing entanglement through long distances and the first loophole-free violation of Bell inequalities are milestones indicating a clear path for the establishment of quantum networks. However, nonlocality in networks with independent entanglement sources has only been experimentally verified in simple tripartite networks, via the violation of bilocality inequalities. Here, by using a scalable photonic platform, we implement star-shaped quantum networks consisting of up to five distant nodes and four independent entanglement sources. We exploit this platform to violate the chained n-locality inequality and thus witness, in a device-independent way, the emergence of nonlocal correlations among the nodes of the implemented networks. These results open new perspectives for quantum information processing applications in the relevant regime where the observed correlations are compatible with standard local hidden variable models but are non-classical if the independence of the sources is taken into account.
| S-EPMC7235259 | biostudies-literature
Project description:A pure quantum state can fully describe thermal equilibrium as long as one focuses on local observables. The thermodynamic entropy can also be recovered as the entanglement entropy of small subsystems. When the size of the subsystem increases, however, quantum correlations break the correspondence and mandate a correction to this simple volume law. The elucidation of the size dependence of the entanglement entropy is thus essentially important in linking quantum physics with thermodynamics. Here we derive an analytic formula of the entanglement entropy for a class of pure states called cTPQ states representing equilibrium. We numerically find that our formula applies universally to any sufficiently scrambled pure state representing thermal equilibrium, i.e., energy eigenstates of non-integrable models and states after quantum quenches. Our formula is exploited as diagnostics for chaotic systems; it can distinguish integrable models from non-integrable models and many-body localization phases from chaotic phases.
| S-EPMC5915398 | biostudies-literature
Project description:A physical theory is called non-local when observers can produce instantaneous effects over distant systems. Non-local theories rely on two fundamental effects: local uncertainty relations and steering of physical states at a distance. In quantum mechanics, the former one dominates the other in a well-known class of non-local games known as XOR games. In particular, optimal quantum strategies for XOR games are completely determined by the uncertainty principle alone. This breakthrough result has yielded the fundamental open question whether optimal quantum strategies are always restricted by local uncertainty principles, with entanglement-based steering playing no role. In this work, we provide a negative answer to the question, showing that both steering and uncertainty relations play a fundamental role in determining optimal quantum strategies for non-local games. Our theoretical findings are supported by an experimental implementation with entangled photons.
| S-EPMC6185979 | biostudies-literature
Project description:We examined the effects of argument-head distance in SVO and SOV languages (Spanish and German), while taking into account readers' working memory capacity and controlling for expectation (Levy, 2008) and other factors. We predicted only locality effects, that is, a slowdown produced by increased dependency distance (Gibson, 2000; Lewis and Vasishth, 2005). Furthermore, we expected stronger locality effects for readers with low working memory capacity. Contrary to our predictions, low-capacity readers showed faster reading with increased distance, while high-capacity readers showed locality effects. We suggest that while the locality effects are compatible with memory-based explanations, the speedup of low-capacity readers can be explained by an increased probability of retrieval failure. We present a computational model based on ACT-R built under the previous assumptions, which is able to give a qualitative account for the present data and can be tested in future research. Our results suggest that in some cases, interpreting longer RTs as indexing increased processing difficulty and shorter RTs as facilitation may be too simplistic: The same increase in processing difficulty may lead to slowdowns in high-capacity readers and speedups in low-capacity ones. Ignoring individual level capacity differences when investigating locality effects may lead to misleading conclusions.
| S-EPMC4782223 | biostudies-literature
Project description:We propose a new quantum numerical scheme to control the dynamics of a quantum walker in a two dimensional space-time grid. More specifically, we show how, introducing a quantum memory for each of the spatial grid, this result can be achieved simply by acting on the initial state of the whole system, and therefore can be exactly controlled once for all. As example we prove analytically how to encode in the initial state any arbitrary walker's mean trajectory and variance. This brings significantly closer the possibility of implementing dynamically interesting physics models on medium term quantum devices, and introduces a new direction in simulating aspects of quantum field theories (QFTs), notably on curved manifold.
| S-EPMC7721887 | biostudies-literature
Project description:Majorana fermions (MFs) are exotic particles that are their own anti-particles. Recently, the search for the MFs occurring as quasi-particle excitations in solid-state systems has attracted widespread interest, because of their fundamental importance in fundamental physics and potential applications in topological quantum computation based on solid-state devices. Here we study the quantum correlations between two spatially separate quantum dots induced by a pair of MFs emerging at the two ends of a semiconductor nanowire, in order to develop a new method for probing the MFs. We find that without the tunnel coupling between these paired MFs, quantum entanglement cannot be induced from an unentangled (i.e., product) state, but quantum discord is observed due to the intrinsic nonlocal correlations of the paired MFs. This finding reveals that quantum discord can indeed demonstrate the intrinsic non-locality of the MFs formed in the nanowire. Also, quantum discord can be employed to discriminate the MFs from the regular fermions. Furthermore, we propose an experimental setup to measure the onset of quantum discord due to the nonlocal correlations. Our approach provides a new, and experimentally accessible, method to study the Majorana bound states by probing their intrinsic non-locality signature.
| S-EPMC4017219 | biostudies-other
Project description:A quantum learning machine for binary classification of qubit states that does not require quantum memory is introduced and shown to perform with the minimum error rate allowed by quantum mechanics for any size of the training set. This result is shown to be robust under (an arbitrary amount of) noise and under (statistical) variations in the composition of the training set, provided it is large enough. This machine can be used an arbitrary number of times without retraining. Its required classical memory grows only logarithmically with the number of training qubits, while its excess risk decreases as the inverse of this number, and twice as fast as the excess risk of an "estimate-and-discriminate" machine, which estimates the states of the training qubits and classifies the data qubit with a discrimination protocol tailored to the obtained estimates.
| S-EPMC3464493 | biostudies-other
Project description:With the accumulation of MS/MS spectra collected in spectral libraries, the spectral library searching approach emerges as an important approach for peptide identification in proteomics, complementary to the commonly used protein database searching approach, in particular for the proteomic analyses of well-studied model organisms, such as human. Existing spectral library searching algorithms compare a query MS/MS spectrum with each spectrum in the library with matched precursor mass and charge state, which may become computationally intensive with the rapidly growing library size. Here, the software msSLASH, which implements a fast spectral library searching algorithm based on the Locality-Sensitive Hashing (LSH) technique, is presented. The algorithm first converts the library and query spectra into bit-strings using LSH functions, and then computes the similarity between the spectra with highly similar bit-string. Using the spectral library searching of large real-world MS/MS spectra datasets, it is demonstrated that the algorithm significantly reduced the number of spectral comparisons, and as a result, achieved 2-9X speedup in comparison with existing spectral library searching algorithm SpectraST. The spectral searching algorithm is implemented in C/C++, and is ready to be used in proteomic data analyses.
| S-EPMC7669687 | biostudies-literature