SearcharxivSearch

arXiv subjects

Shivani Singh

Publications and source records attributed to Shivani Singh.

18 recordsLinked to original sources

Robust phase sensitivity in Mach-Zehnder interferometer using photon added and subtracted squeezed coherent state

For the precision-based measurements, Mach-Zehnder interferometry is a widely used technique. There are various ways to enhance the precision of Mach-Zehnder interferometer (MZI), e.g., having a non-classical input state is one of the ways to enhance the precision of the phase estimation performed by MZI. The phase estimation performed by MZI is investigated here by considering that the input states of MZI are different combinations of photon added and subtracted squeezed coherent states (PASCS and PSSCS). Using quantum Fisher information, it is shown that the use of PASCS in both the input modes of MZI, provides the most precise estimate of the unknown phase. This system is also analyzed in two different measurement scenarios -- single intensity detection (SID) and intensity difference detection (IDD). Systematic analysis has established that the intensity measurement might not be an optimal measurement scheme for phase estimation in MZI as phase and intensity correspond to non-commuting observables. The impact of the photon loss on the MZI-based phase estimation setup is also studied and it is found that PASCS is robust against photon loss, when the loss in MZI is low.

quant-ph

Load Balanced ISAC Systems for URLLC Users

This paper presents an energy-efficient downlink cell-free massive multiple-input multiple-output (CF-mMIMO) integrated sensing and communication (ISAC) network that serves ultra-reliable low-latency communication (URLLC) users while simultaneously detecting a target. We propose a load-balancing algorithm that minimizes the total network power consumption; including transmit power, fixed static power, and traffic-dependent fronthaul power at the access points (APs) without degrading system performance. To this end, we formulate a mixed-integer non-convex optimization problem and introduce an iterative joint power allocation and AP load balancing (JPALB) algorithm. The algorithm aims to reduce total power usage while meeting both the communication quality-of-service (QoS) requirements of URLLC users and the sensing QoS needed for target detection. Proposed JPALB algorithm for ISAC systems was simulated with maximum-ratio transmission (MRT) and regularized zero-forcing (RZF) precoders. Simulation results show approximately 33% reduction in power consumption, using JPALB algorithm compared to a baseline with no load balancing, without compromising communication and sensing QoS requirements.

cs.IT

Quantum metrology in a nonlinear-interferometer with feedback

In this paper, we propose a nonlinear interferometer with feedback loops and explore its efficiency for phase estimation. We analyse two feedback schemes, one where both modes of the interferometer are fed-back into the device and another where only one mode is fed-back. The quantum Fisher information (QFI) for phase estimation in each feedback scheme increases with each feedback loop, and similar to the standard SU(1,1) nonlinear interferometer, phase estimation in this scheme is sensitive to photon loss when the inputs are vacuum state. In terms of resources, we show that, in the low-loss regime, our scheme performs better than standard nonlinear interferometer. The feedback scheme provides the minimum phase variance when the unknown phase is small. We have also provided a special case where feedback scheme provided enhanced QFI even for large phase values. This is achieved by switching between squeezing and anti-squeezing operators after every few loops.

quant-ph

Target Detection for OTFS-Aided Cell-Free MIMO ISAC System

This letter focuses on enhancing target detection performance for a multi-user integrated sensing and communication (ISAC) system using orthogonal time frequency space (OTFS)-aided cell-free multiple-input multiple-output (MIMO) technology in high-speed vehicular environments. We propose a sensing-centric (SC) approach for target detection using communication signals with or without sensing signals. Power allocation is optimized to maximize the sensing signal-to-noise ratio (SNR) of the proposed SC scheme while ensuring a required quality-of-service (QoS) for the communication user equipment (UEs), and adhering to each access points (APs) power budget. Numerical results show that the proposed SC scheme vastly outperforms a communication-centric method that minimizes the total power consumed at the APs subject to the same constraints.

cs.IT

Exploring the Cookieverse: A Multi-Perspective Analysis of Web Cookies

Web cookies have been the subject of many research studies over the last few years. However, most existing research does not consider multiple crucial perspectives that can influence the cookie landscape, such as the client's location, the impact of cookie banner interaction, and from which operating system a website is being visited. In this paper, we conduct a comprehensive measurement study to analyze the cookie landscape for Tranco top-10k websites from different geographic locations and analyze multiple different perspectives. One important factor which influences cookies is the use of cookie banners. We develop a tool, BannerClick, to automatically detect, accept, and reject cookie banners with an accuracy of 99%, 97%, and 87%, respectively. We find banners to be 56% more prevalent when visiting websites from within the EU region. Moreover, we analyze the effect of banner interaction on different types of cookies (i.e., first-party, third-party, and tracking). For instance, we observe that websites send, on average, 5.5x more third-party cookies after clicking ``accept'', underlining that it is critical to interact with banners when performing Web measurements. Additionally, we analyze statistical consistency, evaluate the widespread deployment of consent management platforms, compare landing to inner pages, and assess the impact of visiting a website on a desktop compared to a mobile phone. Our study highlights that all of these factors substantially impact the cookie landscape, and thus a multi-perspective approach should be taken when performing Web measurement studies.

cs.NI

Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware

Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves to the multiqubit states of a quantum processor, we present different configurations of quantum circuits for the implementation of DTQWs in one-dimensional position space. We provide example circuits for a five-qubit processor and address scalability to higher dimensions as well as larger quantum processors.

quant-ph

Multi-qubit quantum computing using discrete-time quantum walks on closed graphs

Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover's algorithm, quantum Fourier transformation and quantum phase estimation algorithms. An elementary implementation of error detection and correction is also presented. Analysis of space and time complexity of the scheme highlights the advantages of quantum walk based model for quantum computation on systems where implementation of quantum walk evolution operations is an inherent feature of the system.

quant-ph

Universal quantum computing using single-particle discrete-time quantum walk

Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal set of quantum gates on two- and three-qubit systems. The idea is to utilize the effective Hilbert space of the single qubit and the position space on which it evolves in order to realize multi-qubit states and universal set of quantum gates on them. Realization of many non-trivial gates and engineering arbitrary states is simpler in the proposed quantum walk model when compared to the circuit based model of computation. We will also discuss the scalability of the model and some propositions for using lesser number of qubits in realizing larger qubit systems.

quant-ph

Quantum interference and coherence in one-dimensional disordered and localized quantum walk

One-dimensional discrete-time quantum walk has played an important role in development of quantum algorithms and protocols for different quantum simulations. The speedup observed in quantum walk algorithms is attributed to quantum interference and coherence of the wave packet in position space. Similarly, localization in quantum walk due to disorder is also attributed to quantum interference effect. Therefore, it is intriguing to have a closer look and understand the way quantum interference manifests in different forms of quantum walk dynamics. Quantum coherence in the system is responsible for quantum interference in the system. Here we will use coherence measure to quantify the interference in the discrete-time quantum walk. We show coherence in the position and coin space, together and independently, and present the contribution of coherence to the quantum interference in the system. This study helps us to differentiate the localization seen in one dimensional discrete-time quantum walks due to different forms of disorders and topological effects.

quant-ph

Distributed Algorithm for Dynamic Cognitive Ad-hoc Networks

Cognitive ad-hoc networks allow users to access an unlicensed/shared spectrum without the need for any coordination via a central controller and are being envisioned for futuristic ultra-dense wireless networks. The ad-hoc nature of networks require each user to learn and regularly update various network parameters such as channel quality and the number of users, and use learned information to improve the spectrum utilization and minimize collisions. For such a learning and coordination task, we propose a distributed algorithm based on a multi-player multi-armed bandit approach and novel signaling scheme. The proposed algorithm does not need prior knowledge of network parameters (users, channels) and its ability to detect as well as adapt to the changes in the network parameters thereby making it suitable for static as well as dynamic networks. The theoretical analysis and extensive simulation results validate the superiority of the proposed algorithm over existing state-of-the-art algorithms.

eess.SP

On the Probability of Erasure for MIMO-OFDM

Detecting the presence of a valid signal is an important task of a telecommunication receiver. When the receiver is unable to detect the presence of a valid signal, due to noise and fading, it is referred to as an erasure. This work deals with the probability of erasure computation for orthogonal frequency division multiplexed (OFDM) signals used by multiple input multiple output (MIMO) systems. The theoretical results are validated by computer simulations. OFDM is widely used in present day wireless communication systems due to its ability to mitigate intersymbol interference (ISI) caused by frequency selective fading channels. MIMO systems offer the advantage of spatial multiplexing, resulting in increased bit-rate, which is the main requirement of the recent wireless standards like 5G and beyond.

cs.IT

Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer

The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.

quant-ph

Accelerated quantum walk, two-particle entanglement generation and localization

We present a scheme to describe the dynamics of accelerating discrete-time quantum walk for one- and two-particle in position space. We show the effect of acceleration in enhancing the entanglement between the particle and position space in one-particle quantum walk and in generation of entanglement between the two unentangled particle in two-particle quantum walk. By introducing the disorder in the form of phase operator we study the transition from localization to delocalization as a function of acceleration. These inter-winding connection between acceleration, entanglement generation and localization along with well established connection of quantum walks with Dirac equation can be used to probe further in the direction of understanding the connection between acceleration, mass and entanglement in relativistic quantum mechanics and quantum field theory. Expansion of operational tools for quantum simulations and for modelling quantum dynamics of accelerated particle using quantum walks is an other direction where these results can play an important role.

quant-ph

Quantum walker as a probe for its coin parameter

In discrete-time quantum walk (DTQW) the walker's coin space entangles with the position space after the very first step of the evolution. This phenomenon may be exploited to obtain the value of the coin parameter $θ$ by performing measurements on the sole position space of the walker. In this paper, we evaluate the ultimate quantum limits to precision for this class of estimation protocols, and use this result to assess measurement schemes having limited access to the position space of the walker in one dimension. We find that the quantum Fisher information (QFI) of the walker's position space $H_w(θ)$ increases with $θ$ and with time which, in turn, may be seen as a metrological resource. We also find a difference in the QFI of {\em bounded} and {\em unbounded} DTQWs, and provide an interpretation of the different behaviors in terms of interference in the position space. Finally, we compare $H_w(θ)$ to the full QFI $H_f(θ)$, i.e., the QFI of the walkers position plus coin state, and find that their ratio is dependent on $θ$, but saturates to a constant value, meaning that the walker may probe its coin parameter quite faithfully.

quant-ph

Data Detection in Single User Massive MIMO Using Re-Transmissions

Single user massive multiple input multiple output (MIMO) can be used to increase the spectral efficiency, since the data is transmitted simultaneously from a large number of antennas located at both the base station and mobile. It is feasible to have a large number of antennas in the mobile, in the millimeter wave frequencies. However, the major drawback of single user massive MIMO is the high complexity of data recovery at the receiver. In this work, we propose a low complexity method of data detection with the help of re-transmissions. A turbo code is used to improve the bit-error-rate (BER). Simulation results indicate significant improvement in BER with just two re-transmissions as compared to the single transmission case. We also show that the minimum average SNR per bit required for error free propagation over a massive MIMO channel with re-transmissions is identical to that of the additive white Gaussian noise (AWGN) channel, which is equal to $-1.6$ dB.

cs.IT

Quantum probes for quantum wells

We seek for the optimal strategy to infer the width $a$ of an infinite potential wells by performing measurements on the particle(s) contained in the well. In particular, we address quantum estimation theory as the proper framework to formulate the problem and find the optimal quantum measurement, as well as to evaluate the ultimate bounds to precision. Our results show that in a static framework the best strategy is to measure position on a delocalized particle, corresponding to a width-independent quantum signal-to-noise ratio (QSNR), which increases with delocalisation. Upon considering time-evolution inside the well, we find that QSNR increases as $t^2$. On the other hand, it decreases with $a$ and thus time-evolution is a metrological resource only when the width is not too large compared to the available time evolution. Finally, we consider entangled probes placed into the well and observe super-additivity of the QSNR: it is the sum of the single-particle QSNRs, plus a positive definite term, which depends on their preparation and may increase with the number of entangled particles. Overall, entanglement represents a resource for the precise characterization of potential wells.

quant-ph

Novel Hard Link-Switching Scheme using Pre-Scanning for Indoor VLC Networks

VLC is attracting a lot of attention as an emerging potential technology for deployment in next generation indoor wireless networks. Use of efficient link switching scheme among VLC access points is critical in indoor environment to provide seamless connectivity to mobile users. This paper presents a novel position prediction link switching scheme for indoor visible light communication systems. The method exploits the fact that indoor scenario (light fixtures/furniture) mostly remains unchanged, therefore, this information can be stored at the coordinator end. Thus, the user is not required to search for the best transmitter when RSS is reduced to a threshold value as in conventional methods which cause substantial delay in switching process. Simulation results show that the proposed scheme for indoor VLC System achieves the dual purpose of adequate illumination and mobility to user in considered indoor scenario.

eess.SP

Second Order Perturbative Effects on the Acoustic Geometry

In this work, we have studied the effect of higher order perturbations, particularly the second order in details, on the sonic horizon. We have considered two different schemes of perturbations which are velocity potential perturbation and mass acceleration rate perturbation. These two schemes give us qualitatively similar behaviour. We have found that the analogue gravity formalism also holds for the higher order perturbations.

gr-qc