activity
20102026
most citedNew Hardness Results in Rainbow Connectivity

19 citations · 56 across the 28 of their papers we have counts for

collaborators
Showing 2023 · quant-phShow all

5 papers · 2 filters

quant-ph2023

Pseudorandom Isometries

Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu +1

We introduce a new notion called -secure pseudorandom isometries (PRI). A pseudorandom isometry is an efficient quantum circuit that maps an -qubit state to an …

quant-ph2023

Pseudorandom Strings from Pseudorandom Quantum States

Prabhanjan Ananth, Yao-Ting Lin, Henry Yuen

We study the relationship between notions of pseudorandomness in the quantum and classical worlds. Pseudorandom quantum state generator (PRSG), a pseudorandomness notion in the qua…

quant-ph2023★ 1 cited

Cloning Games: A General Framework for Unclonable Primitives

Prabhanjan Ananth, Fatih Kaleoglu, Qipeng Liu

The powerful no-cloning principle of quantum mechanics can be leveraged to achieve interesting primitives, referred to as unclonable primitives, that are impossible to achieve clas…

quant-ph2023★ 1 cited

Revocable Cryptography from Learning with Errors

Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan

Quantum cryptography leverages many unique features of quantum information in order to construct cryptographic primitives that are oftentimes impossible classically. In this work,…

quant-ph2023★ 1 cited

On the (Im)plausibility of Public-Key Quantum Money from Collision-Resistant Hash Functions

Prabhanjan Ananth, Zihan Hu, Henry Yuen

Public-key quantum money is a cryptographic proposal for using highly entangled quantum states as currency that is publicly verifiable yet resistant to counterfeiting due to the la…