arXiv subjects

Sagnik Saha

Publications and source records attributed to Sagnik Saha.

15 recordsLinked to original sources

arXiv2026

Tripartite entanglement of remote atomic qubits

Distributed entanglement across multi-node quantum networks is essential for a wide range of quantum technologies, including modular quantum computers, distributed sensing and metrology, and multi-party secure communication protocols. Such large-scale quantum networks will require photonic interconnects to generate and sustain entangled states across localized nodes. Previously, three-node distributed Greenberger-Horne-Zeilinger (GHZ) states have been generated between solid-state qubits and atomic ensembles, but not yet in the platform of individual atomic qubits, which can be replicated, detected, and individually controlled with high fidelity. Here we report the first fully-distributed GHZ state of qubits across a three-node quantum network of single atomic memories, using photonic interconnects. We achieve a bounded fidelity of $0.841(17) \leq \mathcal{F} \leq 0.881(17)$ at an entanglement generation rate of 0.095(5)/sec and measure a clear violation of Mermin's inequality while closing the detection loophole for the first time in a fully-distributed multipartite entangled state.

quant-ph↗

arXiv2025

Quasinormal modes of Kerr-Newman black holes: revisiting the Dudley-Finley approximation

We present a comprehensive study of the Kerr-Newman quasinormal mode spectrum in the Dudley-Finley approximation, where the linear gravitoelectromagnetic perturbations are decoupled by "freezing" either one of the fields to its background value. First, we reassess the accuracy of this approximation by comparing it to calculations that solve the coupled system of gravitoelectromagnetic perturbation equations across the subextremal spin-charge parameter space. We find that for the $(\ell,m,n) = (2,2,0)$, $(2,2,1)$, and $(3,3,0)$ modes, the agreement is typically within $10\%$ and $1\%$ for the real and imaginary parts of the frequencies, respectively. Next, we investigate the spectrum in the near-extremal limit, and study the family of long-lived ("zero-damped") gravitational modes. We find that the near-extremal parameter space consists of subregions containing either only zero-damped modes, or zero-damped modes alongside modes that retain nonzero damping. We derive analytic expressions for the boundaries between these regions. Moreover, we discuss the connection between the zero-damped and damped modes in the Dudley-Finley approximation and the "near-horizon/photon-sphere" modes of the full Kerr-Newman spectrum. Finally, we analyze the behavior of the quadrupolar gravitational modes with large overtone numbers $n$, and study their trajectories in the complex plane.

gr-qc↗

arXiv2025

Photonic Networking of Quantum Memories in High-Dimensions

Quantum networking enables the exchange of quantum information between physically separated quantum systems, which has applications ranging from quantum computing to unconditionally secure communication. Such quantum information is generally represented by two-level quantum systems or qubits. Here, we demonstrate a quantum network of high-dimensional (HD) quantum memories or ``qudits" stored in individual atoms. The interference and detection of HD time-bin encoded single photons emitted from atomic qudit memories heralds maximally-entangled Bell states across pairs of atomic qudit levels. This approach expands the quantum information capacity of a quantum network while improving the entanglement success fraction beyond the standard 50\% limit of qubit-based measurement protocols.

quant-ph↗

arXiv2025

Non-invasive mid-circuit measurement and reset on atomic qubits

Mid-circuit measurement and reset of subsets of qubits is a crucial ingredient of quantum error correction and many quantum information applications. Measurement of atomic qubits is accomplished through resonant fluorescence, which typically disturbs neighboring atoms due to photon scattering. We propose and prototype a new scheme for measurement that provides both spatial and spectral isolation by using tightly-focused individual laser beams and narrow atomic transitions. The unique advantage of this scheme is that all operations are applied exclusively to the read-out qubit, with negligible disturbance to the other qubits of the same species and little overhead. In this letter, we pave the way for non-invasive and high fidelity mid-circuit measurement and demonstrate all key building blocks on a single trapped barium ion.

quant-ph↗

arXiv2025

Entanglement fidelity limits of photonically-networked atomic qubits from recoil and timing

The remote entanglement of two atomic quantum memories through photonic interactions is accompanied by atomic momentum recoil. When the interactions occur at different times, such as from the random emission over the lifetime of the atomic excited state, the difference in recoil timing can expose ``which-path'' information and ultimately lead to decoherence. Time-bin encoded photonic qubits can be particularly sensitive to asynchronous recoil timing. In this paper we study the limits of entanglement fidelity in atomic systems due to recoil and other timing imbalances and show how these effects can be suppressed or even eliminated through proper experimental design.

quant-ph↗

arXiv2024

High-fidelity remote entanglement of trapped atoms mediated by time-bin photons

Photonic interconnects between quantum processing nodes are likely the only way to achieve large-scale quantum computers and networks. The bottleneck in such an architecture is the interface between well-isolated quantum memories and flying photons. We establish high-fidelity entanglement between remotely separated trapped atomic qubit memories, mediated by photonic qubits stored in the timing of their pulses. Such time-bin encoding removes sensitivity to polarization errors, enables long-distance quantum communication, and is extensible to quantum memories with more than two states. Using a measurement-based error detection process and suppressing a fundamental source of error due to atomic recoil, we achieve an entanglement fidelity of 97% and show that fidelities beyond 99.9% are feasible.

quant-ph↗

arXiv2024

Fast photon-mediated entanglement of continuously-cooled trapped ions for quantum networking

We entangle two co-trapped atomic barium ion qubits by collecting single visible photons from each ion through in-vacuo 0.8 NA objectives, interfering them through an integrated fiber-beamsplitter and detecting them in coincidence. This projects the qubits into an entangled Bell state with an observed fidelity lower bound of F > 94%. We also introduce an ytterbium ion for sympathetic cooling to remove the need for recooling interruptions and achieve a continuous entanglement rate of 250 1/s.

quant-ph↗

arXiv2024

Ion Trap with In-Vacuum High Numerical Aperture Imaging for a Dual-Species Modular Quantum Computer

Photonic interconnects between quantum systems will play a central role in both scalable quantum computing and quantum networking. Entanglement of remote qubits via photons has been demonstrated in many platforms; however, improving the rate of entanglement generation will be instrumental for integrating photonic links into modular quantum computers. We present an ion trap system that has the highest reported free-space photon collection efficiency for quantum networking. We use a pair of in-vacuum aspheric lenses, each with a numerical aperture of 0.8, to couple 10% of the 493 nm photons emitted from a $^{138}$Ba$^+$ ion into single-mode fibers. We also demonstrate that proximal effects of the lenses on the ion position and motion can be mitigated.

quant-ph↗

arXiv2023

$k$-SUM in the Sparse Regime

In the average-case $k$-SUM problem, given $r$ integers chosen uniformly at random from $\{0,\dots,M-1\}$, the objective is to find a ``solution'' set of $k$ numbers that sum to $0$ modulo $M$. In the dense regime of $M \leq r^k$, where solutions exist with high probability, the complexity of these problems is well understood. Much less is known in the sparse regime of $M\gg r^k$, where solutions are unlikely to exist. In this work, we initiate the study of the sparse regime for $k$-SUM and its variant $k$-XOR, especially their planted versions, where a random solution is planted in a randomly generated instance and has to be recovered. We provide evidence for the hardness of these problems and suggest new applications to cryptography. Complexity. First we study the complexity of these problems in the sparse regime and show: - Conditional Lower Bounds. Assuming established conjectures about the hardness of average-case (non-planted) $k$-SUM/$k$-XOR when $M = r^k$, we provide non-trivial lower bounds on the running time of algorithms for planted $k$-SUM when $r^k\leq M\leq r^{2k}$. - Hardness Amplification. We show that for any $M \geq r^k$, if an algorithm running in time $T$ solves planted $k$-SUM/$k$-XOR with success probability $Ω(1/\text{polylog}(r))$, then there is an algorithm running in time $\tilde{O}(T)$ that solves it with probability $(1-o(1))$. - New Reductions and Algorithms. We provide reductions for $k$-SUM/$k$-XOR from search to decision, as well as worst-case and average-case reductions to the Subset Sum problem from $k$-SUM, as well as a new algorithm for average-case $k$-XOR at low densities. Cryptography. We show that by additionally assuming mild hardness of $k$-XOR, we can construct Public Key Encryption (PKE) from a weaker variant of the Learning Parity with Noise (LPN) problem than was known before.

cs.CC↗

arXiv2023

Automated Attribute Extraction from Legal Proceedings

The escalating number of pending cases is a growing concern world-wide. Recent advancements in digitization have opened up possibilities for leveraging artificial intelligence (AI) tools in the processing of legal documents. Adopting a structured representation for legal documents, as opposed to a mere bag-of-words flat text representation, can significantly enhance processing capabilities. With the aim of achieving this objective, we put forward a set of diverse attributes for criminal case proceedings. We use a state-of-the-art sequence labeling framework to automatically extract attributes from the legal documents. Moreover, we demonstrate the efficacy of the extracted attributes in a downstream task, namely legal judgment prediction.

cs.IR↗

arXiv2021

ZHED is NP-complete

We prove that the 2017 puzzle game ZHED is NP-complete, even with just 1 tiles. Such a puzzle is defined by a set of unit-square 1 tiles in a square grid, and a target square of the grid. A move consists of selecting an unselected 1 tile and then filling the next unfilled square in a chosen direction from that tile (similar to Tipover and Cross Purposes). We prove NP-completeness of deciding whether the target square can be filled, by a reduction from rectilinear planar monotone 3SAT.

cs.CC↗

arXiv2021

NP-completeness of the Active Time Scheduling Problem

In this paper, we study the active time scheduling problem. We are given n jobs with integral processing times each of which has an integral release time and deadline. The goal is to schedule all the jobs on a machine that can work on b jobs simultaneously, and the objective is to minimize the number of time slots for which the machine is active. The active time scheduling model was introduced by Chang et al. in the context of energy-efficient scheduling. Surprisingly, despite the development of a number of constant factor approximation algorithms for the problem, the complexity of this fundamental problem had remained open. In this paper, we resolve this open problem and show that the active time scheduling problem is indeed NP-complete.

cs.CC↗

arXiv2020

Fermat's polygonal number theorem for repeated generalized polygonal numbers

In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required to represent every positive integer and we furthermore generalize this result to obtain optimal bounds when many of the generalized $m$-gonal numbers are repeated $r$ times, where $r\in\mathbb{N}$ is fixed.

math.NT↗

arXiv2020

Development of planar microstrip resonators for electron spin resonance spectroscopy

This work focuses on the development of planar microwave resonators which are to be used in electron spin resonance spectroscopic studies. Two half wavelength microstrip resonators of different geometrical shapes, namely straight ribbon and omega, are fabricated on commercially available copper clad microwave laminates. Both resonators have a characteristic impedance of 50 Ω. We have performed electromagnetic field simulations for the two microstrip resonators and have extracted practical design parameters which were used for fabrication. The effect of the geometry of the resonators on the quasi-transverse electromagnetic (quasi-TEM) modes of the resonators is noted from simulation results. The fabrication is done using optical lithography technique in which laser printed photomasks are used. This rapid prototyping technique allows us to fabricate resonators in a few hours with accuracy up to 6 mils. The resonators are characterized using a Vector Network Analyzer. The fabricated resonators are used to standardize a home built low-temperature continuous wave electron spin resonance (CW-ESR) spectrometer which operates in S-band, by capturing the absorption spectrum of the free radical DPPH, at both room temperature and 77 K. The measured value of g-factor using our resonators is consistent with the values reported in literature. The designed half wavelength planar resonators will be eventually used in setting up a pulsed electron spin resonance spectrometer by suitably modifying the CW-ESR spectrometer.

physics.app-ph↗

arXiv2018

Bloch-Siegert Shift in a Hybrid Quantum Register: Quantification and Compensation

Quantum registers that combine the attractive properties of different types of qubits are useful for many different applications. They also pose a number of challenges, often associated with the large differences in coupling strengths between the different types of qubits. One example is the non-resonant effect that alternating electromagnetic fields have on the transitions of qubits that are not targeted by the specific gate operation. The example being studied here is known as Bloch-Siegert shift. Unless these shifts are accounted for and, if possible, compensated, they can completely destroy the information contained in the quantum register. Here we study this effect quantitatively in the important example of the nitrogen vacancy (NV) center in diamond and demonstrate how it can be eliminated.

quant-ph↗