Abstract

In this work, we develop upper bounds on key rates for device-independent quantum key distribution (DI-QKD) protocols and devices. We study the reduced cc-squashed entanglement and show that it is a convex functional. As a result, we show that the convex hull of the currently known bounds is a tighter upper bound on the device-independent key rates of the standard Clauser-Horne-Shimony-Holt (CHSH)- based protocol. We further provide tighter bounds for DI-QKD key rates achievable by any protocol applied to the CHSH-based device. This bound is based on reduced relative entropy of entanglement optimized over decompositions into local and nonlocal parts. In the dynamical scenario of quantum channels, we obtain upper bounds for device-independent private capacity for the CHSH-based protocols. We show that the device-independent private capacity for the CHSH-based protocols on depolarizing and erasure channels is limited by the secret key capacity of dephasing channels.

Abstract

No Results Found

Abstract

arXiv preprint arXiv:2210.16579 Description Generating videos is a complex task that is accomplished by generating a set of temporally coherent images frame-by-frame. This limits the expressivity of videos to only image-based operations on the individual video frames needing network designs to obtain temporally coherent trajectories in the underlying image space. We propose INR-V, a video representation network that learns a continuous space for video-based generative tasks. INR-V parameterizes videos using implicit neural representations (INRs), a multi-layered perceptron that predicts an RGB value for each input pixel location of the video. The INR is predicted using a meta-network which is a hypernetwork trained on neural representations of multiple video instances. Later, the meta-network can be sampled to generate diverse novel videos enabling many downstream video-based generative tasks. Interestingly, we find that conditional regularization and progressive weight initialization play a crucial role in obtaining INR-V. The representation space learned by INR-V is more expressive than an image space showcasing many interesting properties not possible with the existing works. For instance, INR-V can smoothly interpolate intermediate videos between known video instances (such as intermediate identities, expressions, and poses in face videos). It can also in-paint missing portions in videos to recover temporally coherent full videos. In this work, we evaluate the space learned by INR-V on diverse generative tasks such as video interpolation, novel video generation, video inversion, and video inpainting against the existing baselines. INR-V significantly outperforms the …

Abstract

At the LHC, the gluon-initiated processes are considered to be the primary source of di-Higgs production. However, in the presence of a new resonance, the light-quark initiated processes can also contribute significantly. In this letter, we look at the di-Higgs production mediated by a new singlet scalar. The singlet is produced in both quark-antiquark and gluon fusion processes through loops involving a scalar leptoquark and right-handed neutrinos. With benchmark parameters inspired from the recent resonant di-Higgs searches by the ATLAS collaboration, we examine the prospects of such a resonance in the TeVrange at the High-Luminosity LHC (HL-LHC) in the b¯ bτ +τ − mode with a multivariate analysis. We obtain the 5σ and 2σ contours and find that a significant part of the parameter space is within the reach of the HL-LHC.

Abstract

In the left-right symmetric models, a heavy charged gauge boson W0 can decay to a lepton and a righthanded neutrino (RHN). If the neutrino masses are generated through the standard type-I seesaw mechanism, the Yukawa couplings controlling two-body decays of the RHN become very small. As a result, the RHN decays to another lepton and a pair of jets via an off-shell W0 . This is the basis of the Keung-Senjanović (KS) process, which was originally proposed as a probe of lepton number violation at the LHC. However, if a different mechanism like the inverse seesaw generates the neutrino masses, a TeV-scale RHN can have large Yukawa couplings and hence dominantly decay to a lepton and a W boson, leading to a kinematically different process from the KS one. We investigate the prospect of this unexplored process as a probe of the inverse seesaw mechanism in the left-right symmetric models at the High Luminosity LHC (HL-LHC). Our signal arises from the Drell-Yan production of a W0 and leads to two high-pT same-flavour-opposite-sign leptons and a boosted W-like fatjet in the final state. We find that a sequential W0 with mass up to ∼6 TeV along with a TeV-scale RHN can be discovered at the HL-LHC.

Abstract

The possibility of a vectorlike top partner decaying to a new colorless weak-singlet scalar or pseudoscalar has attracted some attention in the literature. We investigate the production of a weaksinglet charge-2=3 T quark that can decay to a spinless boson (Φ) and a top quark at the LHC. Earlier [A. Bhardwaj et al., Roadmap to explore vectorlike quarks decaying to a new scalar or pseudoscalar, arXiv:2203.13753.], we showed that in a large part of the parameter space, the T → tΦ and the loopinduced Φ → gg decays become the dominant decay modes for these particles. Here, we investigate the discovery prospects of the T quark in this region through the above decays. In particular, we focus on the pp → TT → ðtΦÞðtΦÞ → ðtðggÞÞðtðggÞÞ channel. Separating this signal from the huge Standard Model background is a challenging task, forcing us to employ a multivariate machine-learning technique. We find that the above channel can be a discovery channel of the top partner in the large part of the parameter space where the above decay chain dominates. Our analysis is largely model independent, and hence our results would be useful in a broad class of new physics models.

Abstract

The previous fine-grained datasets mainly focus on classification and are often captured in a controlled setup, with the camera focusing on the objects. We introduce the first Fine-Grained Vehicle Detection (FGVD) dataset in the wild, captured from a moving camera mounted on a car. It contains 5502 scene images with 210 unique fine-grained labels of multiple vehicle types organized in a three-level hierarchy. While previous classification datasets also include makes for different kinds of cars, the FGVD dataset introduces new class labels for categorizing two-wheelers, autorickshaws, and trucks. The FGVD dataset is challenging as it has vehicles in complex traffic scenarios with intra-class and inter-class variations in types, scale, pose, occlusion, and lighting conditions. The current object detectors like yolov5 and faster RCNN perform poorly on our dataset due to a lack of hierarchical modeling. Along with providing baseline results for existing object detectors on FGVD Dataset, we also present the results of a combination of an existing detector and the recent Hierarchical Residual Network (HRN) classifier for the FGVD task. Finally, we show that FGVD vehicle images are the most challenging to classify among the fine-grained datasets.

Abstract

Unmanned Aerial Vehicle (UAV) based remote sensing system incorporated with computer vision has demonstrated potential for assisting building construction and in disaster management like damage assessment during earthquakes. The vulnerability of a building to earthquake can be assessed through inspection that takes into account the expected damage progression of the associated component and the component’s contribution to structural system performance. Most of these inspections are done manually, leading to high utilization of manpower, time, and cost. This paper proposes a methodology to automate these inspections through UAV-based image data collection and a software library for post-processing that helps in estimating the seismic structural parameters. The key parameters considered here are the distances between adjacent buildings, building plan-shape, building plan area, objects on the rooftop and rooftop layout. The accuracy of the proposed methodology in estimating the above-mentioned parameters is verified through field measurements taken using a distance measuring sensor and also from the data obtained through Google Earth. Additional details and code can be accessed from h

Abstract

Transformers, which were introduced for solving the task of machine translation, have expanded their utility in multiple domains. A recent application of transformers is in solving elementary mathematics problems. In this paper, we use a hybrid tokenization technique for encoding the mathematics and science problems and answers, which is used to train the transformer. We compare the performance of our tokenization with that of the char-to-char tokenzation in solving various types of mathematics and science problems. We discuss the accuracy, memory usage, and time to train the model with proposed tokenization. The proposed tokenization shows higher accuracy for some problems, and requires lesser memory compared to char-to-char tokenization. We propose an extended dataset of science and mathematics problems that consists of billions of samples in questionanswer format in raw text. Code and Dataset: https: //github.com/misterpawan/scimat2

Abstract

Alzheimer’s disease (AD) and Mild Cognitive Impairment (MCI) are neurogenerative impairments with similar symptoms and risk factors. Sulcal width and depth are known biomarkers for discriminating between AD and MCI. This paper presents a novel 2D image representation for a brain mesh surface, called a height map. The basic idea behind the height map is to represent the surface as a function of spherical coordinates of the mesh vertices. We present a method to derive a height map from a given neuroimage (MRI) and extract sulcal regions from the height map. We demonstrate the height map’s utility for classifying a given neuroimage into healthy, MCI and AD classes. Two approaches for extracting sulcal regions are explored. The proposed method is computationally light, and obtaining sulcal regions from a brain surface mesh takes about 24 seconds on a standard Intel i5-7200 CPU. The proposed method achieves 76.1% accuracy, and 76.3% F1-score for healthy, MCI, AD classification on a publicly available dataset.