1
program role
32
collaborators
2009–2024
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
7 Talks
7 Posters
| Title | Conference | Co-authors |
|---|---|---|
| A quantum computational approach to linear magnetohydrodynamic stability analysis | QIP 2024 | Abtin Ameri, Patrick Rall, Paola Cappellaro, Nuno Loureiro |
| Sub-exponential rate versus distance with time multiplexed quantum repeaters | QCRYPT 2021 | Prajit Dhara, Ashlesha Patil, Saikat Guha |
Shared entanglement between two remote parties is a key resource for Quantum Cryptography. Quantum communications capacity using direct transmission over length-$L$ optical fiber scales as $R \sim e^{-\alpha L}$, where $\alpha$ is the fiber's loss coefficient. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs) and switches used for spatial multiplexing, but no quantum error correction was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., $R \sim e^{-s{\alpha L}}$, with $s < 1$. We show that the introduction of temporal multiplexing---i.e., the ability to perform BSMs among qubits at a repeater node that were successfully entangled with qubits at distinct neighboring nodes at {\em different} time steps---leads to a sub-exponential rate-vs.-distance scaling, i.e., $R \sim e^{-t\sqrt{\alpha L}}$, which is not attainable with just spatial or spectral multiplexing. We evaluate analytical upper and lower bounds to this rate and obtain the exact rate by numerically optimizing the time-multiplexing block length and the number of repeater nodes. We further demonstrate that incorporating losses in the optical switches used to implement time-multiplexing degrades the rate-vs.-distance performance, eventually falling back to exponential scaling for very lossy switches. We also examine models for quantum memory decoherence and describe optimal regimes of operation to preserve the desired boost from temporal multiplexing. QM decoherence is seen to be more detrimental to the repeater's performance over switching losses. |
||
| A continuous variable quantum repeater based on entanglement distillation with quantum scissors | QCRYPT 2019 | Kaushik Seshadreesan, Saikat Guha |
| Exact analysis of long distance quantum communication over a lossy optical channel using entanglement swapping with a quantum repeater chain and noisy detectors | QCRYPT 2014 | Zachary Dutton, Christopher Fuchs, Saikat Guha |
| Quantum enigma machines and the locking capacity of a quantum channel | QIP 2014 | Saikat Guha, Patrick Hayden, Seth Lloyd, Cosmo Lupo, Jeffrey H. Shapiro, Masahiro Takeoka, Mark M. Wilde |
| An adiabatic quantum algorithm for finding marked vertices in a graph | QIP 2010 | Maris Ozols, Jeremie Roland |
| An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups | QIP 2009 | Martin Rötteler |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QCRYPT 2017 | program | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Saikat Guha | 8 |
| Jeremie Roland | 3 |
| Christopher Fuchs | 2 |
| Cosmo Lupo | 2 |
| Dirk Englund | 2 |
| Jeffrey H. Shapiro | 2 |
| Maris Ozols | 2 |
| Mark M. Wilde | 2 |
| Masahiro Takeoka | 2 |
| Mihir Pant | 2 |
| Patrick Hayden | 2 |
| Seth Lloyd | 2 |
| Zachary Dutton | 2 |
| Abtin Ameri | 1 |
| Alexander Russell | 1 |
| Andreas Winter | 1 |
| Ashlesha Patil | 1 |
| Boris Altshuler | 1 |
| Christoph Simon | 1 |
| Don Towsley | 1 |