No-signalling attacks and implications for (quantum) nonlocality distillation

The phenomenon of nonlocality, which can arise when entangled quantum systems are suitably measured, is perhaps one of the most puzzling features of quantum theory to the philosophical mind. It implies that these measurement statistics cannot be explained by hidden variables, as requested by Einstein, and it thus suggests that our universe may not be, in principle, a well-determined entity where the uncertainty we perceive in physical observations stems only from our lack of knowledge of the whole. Besides its philosophical impact, nonlocality is also a resource for information- theoretic tasks since it implies secrecy: If nonlocality limits the predictive power that any hidden variable (in the universe) can have about some observations, then it limits in particular the predictive power of a hidden variable held by an adversary in a cryptographic scenario. We investigate whether nonlocality alone can empower two parties to perform unconditionally secure communication in a feasible manner when only a provably minimal set of assumptions are made for such a task to be possible — independently of the validity of any physical theory (such as quantum theory). Nonlocality has also been of interest in the study of foundations of quantum theory and the principles that stand beyond its mathematical formalism. In an attempt to single out quantum theory within a broader set of theories, the study of nonlocality may help to point out intuitive principles that distinguish it from the rest. In theories where the limits by which quantum theory constrains the strength of nonlocality are surpassed, many “principles” on which an information theorist would rely on are shattered — one example is the hierarchy of communication complexity as the latter becomes completely trivial once a certain degree of nonlocality is overstepped. In order to study the structure of such super-quantum theories — beyond their aforementioned secrecy aspects — we investigate the phenomenon of distillation of nonlocality, the ability to distill stronger forms of nonlocality from weaker ones. By exploiting the inherent connection between nonlocality and secrecy, we provide a novel way of deriving bounds on nonlocality-distillation protocols through an ad versarial view to the problem

Design and Evaluation of a Scalable Engine for 3D-FFT Computation in an FPGA Cluster

The Three Dimensional Fast Fourier Transform (3D-FFT) is commonly used to solve the partial differential equations describing the system evolution in several physical phenomena, such as the motion of viscous fluids described by the Navier–Stokes equations. Simulation of such problems requires the use of a parallel High-Performance Computing architecture since the size of the problem grows with the cube of the FFT size, and the representation of the single point comprises several double precision floating- point complex numbers. Modern High-Performance Computing (HPC) systems are considering the inclusion of FPGAs as components of this computing architecture because they can combine effective hardware acceleration capabilities and dedicated communication facilities. Furthermore, the network topology can be optimized for the specific calculation that the cluster must perform, especially in the case of algorithms limited by the data exchange delay between the processors. In this paper, we explore an HPC design that uses FPGA accelerators to compute the 3DFFT. We devise a scalable FFT engine based on a custom radix-2 double-precision core that is used to implement the Decimation in Frequency version of the Cooley–Tukey FFT algorithm. The FFT engine can be adapted to different technology constraints and networking topologies by adjusting the number of cores and configuration parameters in order to minimize the overall calculation time. We compare the various possible configurations with the technological limits of available hardware. Finally, we evaluate the bandwidth required for continuous FFT execution in the APEnet toroidal mesh network.

COVERT COMMUNICATIONS IN CONTINUOUS-TIME SYSTEMS

This dissertation studies covert wireless communications where a transmitter (Alice) intends to transmit messages to a legitimate receiver (Bob) such that the presence of the message is hidden from an attentive warden (Willie). Here we consider pertinent aspects of covert communications that focus on moving such systems closer to implementation. For example, previous studies use the standard discrete-time communication model when analyzing covert communications, since this is commonly assumed without loss of generality in standard communication theory. However, it is not clear that such a model captures the salient aspects of the continuous-time covert communications problem. A power detector that is optimal for the warden in a discrete-time covert communications scenario may not be optimal on a continuous- time model. Thus, it is of interest to consider this more realistic model for physical channels. After analyzing a power optimization problem using the standard discrete-time model, we move to the key part of system implementation: the instantiation in true continuous-time systems of the discrete-time models studied to this point in the literature. A key goal is to examine Willie’s detection capability on a continuous-time model and study how the limits of covert communications change from the discrete-time case. In particular, we show that detectors for Willie can benefit from the continuous-time setting and outperform detectors based on the discrete-time model; not surprisingly, this has a significant impact on the true covert throughput of the system. Nevertheless, we establish constructions such that efficient covert communications can still be achieved in a continuous-time model, and prove the fundamental limit on the covert communication rate. After considering the continuous-time problem in detail, we then turn to addressing another limitation of previous work - the requirement for an intentional jammer to facilitate efficient covert communication. Instead, we consider how to exploit a pre-existing interference source – a radar - to achieve covert communication. We establish a covert communication scheme in such an environment, and analyze the corresponding covert rate. Finally, we consider the use of a detection technique similar to that in the covert communications problem, in the area of quantized signal detection