Related papers: Reply to comments on "Weak value amplification is …
Non-statistical weak measurements yield weak values that are outside the range of eigenvalues and are not rare, suggesting that weak values are a property of every pre-and-post-selected ensemble. They also extend the applicability and valid…
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to…
We consider the gravitational correction to the coupling of the scalar fields. Weak gravity conjecture says that the gravitational correction to the running of scalar coupling should be less than the contribution from scalar fields. For…
The extraordinary concept of weak value amplification and a number of other seemingly counter-intuitive wave phenomena are manifestations of fine interference effects. Taking example of one such intriguing wave interference phenomenon,…
We show the utility of the weak value amplification to observe the quantum interference between two close lying atomic coherent states in a post-selected atomic cat state, produced in a system of $N$ identical two-level atoms weakly…
We investigate four key issues with using a nonzero weak value of the spatial projection operator to infer the past path of an individual quantum particle. First, we note that weak measurements disturb a system, so any approach relying on…
In the late 80s, a curious effect suggested by Aharanov, Albert and Vaidman opened up new vistas regarding quantum measurements on weakly coupled systems. There, a combination of a "weak" finite interaction together with a "strong"…
I present a novel formulation of substitution, where facts about substitution that previously required tens or hundreds of lines to justify in a proof assistant now follow immediately - they can be justified by writing the four letters…
This paper introduces a notion of equivalence for higher-dimensional automata, called weak equivalence. Weak equivalence focuses mainly on a traditional trace language and a new homology language, which captures the overall independence…
In this chapter we offer an introduction to weak values from a three-fold perspective: first, outlining the protocols that enable their experimental determination; next, deriving their correlates in the quantum formalism and, finally,…
We show that the recently proposed weak gravity conjecture\cite{AMNV0601} can be extended to a class of scalar field theories. Taking gravity into account, we find an upper bound on the gravity interaction strength, expressed in terms of…
The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers. We show that similar methods can be used to characterize the…
Counterfactual explanations are emerging as an attractive option for providing recourse to individuals adversely impacted by algorithmic decisions. As they are deployed in critical applications (e.g. law enforcement, financial lending), it…
Hundreds of defenses have been proposed to make deep neural networks robust against minimal (adversarial) input perturbations. However, only a handful of these defenses held up their claims because correctly evaluating robustness is…
A protocol employing weak values (WVs) to obtain ultra sensitive amplification of weak signals in the context of a solid state setup is proposed. We consider an Aharonov-Bohm interferometer where both the orbital and the spin degrees of…
Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several…
The weak value of a variable O is a description of an effective interaction with that variable in the limit of weak coupling. It is particularly important for a pre- and post-selected quantum system.
Text generation has received a lot of attention in computational argumentation research as of recent. A particularly challenging task is the generation of counter-arguments. So far, approaches primarily focus on rebutting a given…
We propose an experimental setup for the implementation of weak measurements in the context of the gedankenexperiment known as Hardy's Paradox. As Aharonov et al. showed, these weak values form a language with which the paradox can be…
Making classifiers robust to adversarial examples is hard. Thus, many defenses tackle the seemingly easier task of detecting perturbed inputs. We show a barrier towards this goal. We prove a general hardness reduction between detection and…