39 citations · 78 across the 10 of their papers we have counts for
11 papers
Tripartite entanglement of remote atomic qubits
Isabella Goetting, Ashish Kalakuntla, Mikhail Shalaev +6
Distributed entanglement across multi-node quantum networks is essential for a wide range of quantum technologies, including modular quantum computers, distributed sensing and metr…
Photonic Networking of Quantum Memories in High-Dimensions
Mikhail Shalaev, Sagnik Saha, George Toh +6
Quantum networking enables the exchange of quantum information between physically separated quantum systems, which has applications ranging from quantum computing to unconditionall…
Non-invasive mid-circuit measurement and reset on atomic qubits
Zuo-Yao Chen, Isabella Goetting, George Toh +8
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 i…
Entanglement fidelity limits of photonically-networked atomic qubits from recoil and timing
Yichao Yu, Sagnik Saha, Mikhail Shalaev +5
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…
High-fidelity remote entanglement of trapped atoms mediated by time-bin photons
Sagnik Saha, Mikhail Shalaev, Jameson O'Reilly +5
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…
Fast photon-mediated entanglement of continuously-cooled trapped ions for quantum networking
Jameson O'Reilly, George Toh, Isabella Goetting +8
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 fi…
Ion Trap with In-Vacuum High Numerical Aperture Imaging for a Dual-Species Modular Quantum Computer
Allison L. Carter, Jameson O'Reilly, George Toh +4
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 bee…
-SUM in the Sparse Regime
Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach +2
In the average-case -SUM problem, given integers chosen uniformly at random from , the objective is to find a ``solution'' set of numbers that sum to $0…
ZHED is NP-complete
Sagnik Saha, Erik D. Demaine
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 th…
NP-completeness of the Active Time Scheduling Problem
Sagnik Saha, Manish Purohit
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…
Fermat's polygonal number theorem for repeated generalized polygonal numbers
Soumyarup Banerjee, Manav Batavia, Ben Kane +5
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 t…