collaborators
Showing quant-phShow all

5 papers · 1 filter

quant-ph2026

Instantiating Microcrypt: Obstacles and opportunities via tailored state certification

Jose Carrasco, Jens Eisert, Soumik Ghosh +3

Recent work has introduced the Hamiltonian phase state (HPS) assumptions, which postulate that Hamiltonian phase states can be used to instantiate pseudorandom and one-way state ge…

quant-ph2026

Sampling hard circuits with verifiably high fidelity

Simon Martiel, Jay-U Chung, Alireza Seif +9

Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine the…

quant-ph2026

Sample-efficient benchmarking of shallow all-to-all random quantum circuits

Gregory Bentsen, Bill Fefferman, Soumik Ghosh +2

Random circuit sampling (RCS) remains one of the most competitive frameworks for demonstrating quantum advantage in near-term noisy intermediate-scale quantum (NISQ) hardware. Unfo…

quant-ph2026

Digital signatures with classical shadows on near-term quantum computers

Pradeep Niroula, Minzhao Liu, Sivaprasad Omanakuttan +15

Quantum mechanics provides cryptographic primitives whose security is grounded in hardness assumptions independent of those underlying classical cryptography. However, existing pro…

quant-ph2025

Unconditional Pseudorandomness against Shallow Quantum Circuits

Soumik Ghosh, Sathyawageeswar Subramanian, Wei Zhan

Quantum computational pseudorandomness has emerged as a fundamental notion that spans connections to complexity theory, cryptography and fundamental physics. However, all known con…