اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدWhat particles that never met know of one another?
40
0
0.0
(
0
)
تأليف
Sofia Wechsler
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An experiment proposed by Yurke and Stoler, and similar to that realized experimentally by Sciarrino et al., is analyzed. In Sciarrinos realization, identical photons from a degenerated down-conversion pair are used, i.e. the photons met in the past. In the experiment analyzed here the particles are also identical, but from different sources. As long as one can tell from which source came each particle, the joint wave function remains factorizable. However, a configuration is created in which one cannot tell anymore which particle came from which source. As a result, the wave function becomes non-factorizable, symmetrical (for bosons) or antisymmetrical (for fermions). In part of the cases the situation is even more surprising: the particles never meet, s.t. the symmetry (antisymmetry) is produced at-a-distance without the particles having had the possibility to interact in any way.
قيم البحث
اقرأ أيضاً
Quantum systems that have never interacted can become nonlocally correlated through a process called entanglement swapping. To characterize nonlocality in this context, we introduce local models where quantum systems that are initially uncorrelated a
re described by uncorrelated local variables. While a pair of maximally entangled qubits prepared in the usual way (i.e., emitted from a common source) requires a visibility close to 70% to violate a Bell inequality, we show that an entangled pair generated through entanglement swapping will already violate a Bell inequality for visibilities as low as 50% under our assumption.
Deep generative models have been demonstrated as state-of-the-art density estimators. Yet, recent work has found that they often assign a higher likelihood to data from outside the training distribution. This seemingly paradoxical behavior has caused
concerns over the quality of the attained density estimates. In the context of hierarchical variational autoencoders, we provide evidence to explain this behavior by out-of-distribution data having in-distribution low-level features. We argue that this is both expected and desirable behavior. With this insight in hand, we develop a fast, scalable and fully unsupervised likelihood-ratio score for OOD detection that requires data to be in-distribution across all feature-levels. We benchmark the method on a vast set of data and model combinations and achieve state-of-the-art results on out-of-distribution detection.
We propose a number of powerful dynamic-epistemic logics for multi-agent information sharing and acts of publicly or privately accessing other agents information databases. The static base of our logics is obtained by adding to standard epistemic log
ic comparative epistemic assertions, that can express epistemic superiority between groups or individuals, as well as a common distributed knowledge operator (that combines features of both common knowledge and distributed knowledge). On the dynamic side, we introduce actions by which epistemic superiority can be acquired: sharing all one knows (by e.g. giving access to ones information database to all or some of the other agents), as well as more complex informational events, such as hacking. We completely axiomatize several such logics and prove their decidability.
Recent work has presented intriguing results examining the knowledge contained in language models (LM) by having the LM fill in the blanks of prompts such as Obama is a _ by profession. These prompts are usually manually created, and quite possibly s
ub-optimal; another prompt such as Obama worked as a _ may result in more accurately predicting the correct profession. Because of this, given an inappropriate prompt, we might fail to retrieve facts that the LM does know, and thus any given prompt only provides a lower bound estimate of the knowledge contained in an LM. In this paper, we attempt to more accurately estimate the knowledge contained in LMs by automatically discovering better prompts to use in this querying process. Specifically, we propose mining-based and paraphrasing-based methods to automatically generate high-quality and diverse prompts, as well as ensemble methods to combine answers from different prompts. Extensive experiments on the LAMA benchmark for extracting relational knowledge from LMs demonstrate that our methods can improve accuracy from 31.1% to 39.6%, providing a tighter lower bound on what LMs know. We have released the code and the resulting LM Prompt And Query Archive (LPAQA) at https://github.com/jzbjyb/LPAQA.
Temperature, the central concept of thermal physics, is one of the most frequently employed physical quantities in common practice. Even though the operative methods of the temperature measurement are described in detail in various practical instruct
ions and textbooks, the rigorous treatment of this concept is almost lacking in the current literature. As a result, the answer to a simple question of what the temperature is is by no means trivial and unambiguous. There is especially an appreciable gap between the temperature as introduced in the frame of statistical theory and the only experimentally observable quantity related to this concept, phenomenological temperature. Just the logical and epistemological analysis of the present concept of phenomenological temperature is the kernel of the contribution.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
