4 papers · 1 filter
Quantum Algorithms for Approximate Graph Isomorphism Testing
Prateek P. Kulkarni
The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applica…
One Key Good, L Keys Better: List Decoding Meets Quantum Privacy Amplification
Prateek P. Kulkarni
We introduce list privacy amplification (LPA), a relaxation of the final step of quantum key distribution (QKD) in which Alice and Bob extract a list of candidate keys from a r…
Entanglement-Dependent Error Bounds for Hamiltonian Simulation
Prateek P. Kulkarni
We establish tight connections between entanglement entropy and the approximation error in Trotter-Suzuki product formulas for Hamiltonian simulation. Product formulas remain the w…
A theoretical treatment of optical metasurfaces as an efficient basis for quantum correlations
Ramaseshan R, Prateek P. Kulkarni, Sharanya Madhusudhan +1
Entanglement is a cornerstone of quantum technology, playing a key role in quantum computing, cryptography, and information processing. Conventional methods for generating entangle…