activity
20182026
most citedOn the Hardness of the Minimum Distance Problem of Quantum Codes

10 citations · 16 across the 9 of their papers we have counts for

collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph2026

Hardness of Approximating Quantum Code Distance Beyond

Upendra Kapshikar

We study the computational complexity of approximating the minimum distance of a stabilizer code. Classically, the minimum distance problem is NP-hard to approximate even to within…

quant-ph2026

Keyless secrecy against bounded adversaries

Anne Broadbent, Upendra Kapshikar, Denis Rochette

We introduce a keyless coding/cryptographic primitive that asks for two guarantees at once: the receiver is never fooled into accepting a message other than the one sent, and the a…

quant-ph2026

A Framework for Ruling Out Quantum Speedups

Thomas Huffstutler, Upendra Kapshikar, David Miloschewsky +1

We study when partial Boolean functions can (and cannot) exhibit superpolynomial quantum query speedups, and develop a general framework for ruling out such speedups via two comple…

quant-ph2025

Towards Universal Quantum Tamper Detection

Anne Broadbent, Upendra Kapshikar, Denis Rochette

Tamper-resilient cryptography studies how to protect data against adversaries who can physically manipulate codewords before they are decoded. The notion of tamper detection codes…

quant-ph2024★ 1 cited

A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model

Rishabh Batra, Sayantan Chakraborty, Rahul Jain +1

We present a robust and composable device-independent (DI) quantum protocol between two parties for oblivious transfer (OT) using Magic Square devices in the bounded storage model…

quant-ph2022★ 10 cited

On the Hardness of the Minimum Distance Problem of Quantum Codes

Upendra Kapshikar, Srijita Kundu

We study the hardness of the problem of finding the distance of quantum error-correcting codes. The analogous problem for classical codes is known to be NP-hard, even in approximat…

quant-ph2021★ 2 cited

The Diagonal Distance of CWS Codes

Upendra S. Kapshikar

Quantum degeneracy in error correction is a feature unique to quantum error correcting codes, unlike their classical counterpart. It allows a quantum error correcting code to corre…