1.7k citations · 1.9k across the 33 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Metric Self-Dual Completion and Optimal Additive Hardness for Quantum and Graph-State Distance
Rafail Ostrovsky
We prove that the quantum code distance is NP-hard to approximate within an additive error of , for some constant , where is the number of qubits. Our reductions are…
quant-ph2010★ 85 cited
Position-Based Quantum Cryptography: Impossibility and Constructions
Harry Buhrman, Nishanth Chandran, Serge Fehr +4
In this work, we study position-based cryptography in the quantum setting. The aim is to use the geographical position of a party as its only credential. On the negative side, we s…
quant-ph2010★ 2 cited
Position-Based Quantum Cryptography
Nishanth Chandran, Serge Fehr, Ran Gelles +2
This paper is replaced by arXiv:1009.2490. The new paper includes a general impossibility result and restricted possibility results, and it has two additional authors.