activity
20202026
most citedThe Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth

2 citations · 7 across the 9 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph2026

Quantum Algorithms for OPI Variants Beyond Locality and Classical Decodability

Seyoon Ragavan, Noah Shutty

Regev's reduction quantumly finds codewords satisfying nonlinear constraints by decoding the dual code. To date, applications that have not been dequantized have relied on efficien…

quant-ph2026

A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms

Aparna Gupte, Seyoon Ragavan, Mark Zhandry

We establish a no-go theorem for a broad class of quantum algorithms for the dihedral coset problem (DCP). We consider the Fourier-sampling and subset-sum-measurement template prop…

quant-ph2026

Efficient Unclonable Encryption from Pauli Eigenstates

Seyoon Ragavan

We give, to our knowledge, the first plain-model, one-time information-theoretically secure, efficient unclonable encryption scheme for one classical bit. Previous work by Bhattach…

quant-ph2026

Optimization Using Locally-Quantum Decoders

Noah Shutty, Avijit Mandal, Seyoon Ragavan +8

It was pointed out in [JSW+25] that widely-studied optimization problems such as D-regular max-k-XORSAT can be reduced to decoding of LDPC codes, using quantum algorithms related t…

quant-ph2025★ 1 cited

Parallel Spooky Pebbling Makes Regev Factoring More Practical

Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Katherine Van Kirk

Pebble games, an abstraction from classical reversible computing, have found use in the design of quantum circuits for inherently sequential tasks. Gidney showed that allowing Hada…

quant-ph2024★ 2 cited

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth

Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Vinod Vaikuntanathan +1

We present a compact quantum circuit for factoring a large class of integers, including some whose classical hardness is expected to be equivalent to RSA (but not including RSA int…

quant-ph2024★ 1 cited

Cloning Games, Black Holes and Cryptography

Alexander Poremba, Seyoon Ragavan, Vinod Vaikuntanathan

In this work, we introduce a new toolkit for analyzing cloning games, a notion that captures stronger and more quantitative versions of the celebrated quantum no-cloning theorem. T…

quant-ph2023★ 2 cited

Space-Efficient and Noise-Robust Quantum Factoring

Seyoon Ragavan, Vinod Vaikuntanathan

We provide two improvements to Regev's recent quantum factoring algorithm (Journal of the ACM 2025), addressing its space efficiency and its noise-tolerance. Our first contribution…