5 papers
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…
Compilation Pipeline for Predicting Algorithmic Break-Even in an Early-Fault-Tolerant Surface Code Architecture
Tianyi Hao, Joseph Sullivan, Sivaprasad Omanakuttan +2
Recent experimental progress in realizing surface code on hardware, including demonstrations of break-even logical memory on devices with up to hundreds of physical qubits, has mat…
Certified randomness amplification by dynamically probing remote random quantum states
Minzhao Liu, Pradeep Niroula, Matthew DeCross +49
Cryptography depends on truly unpredictable numbers, but physical sources emit biased or correlated bits. Quantum mechanics enables the amplification of imperfect randomness into n…
End-to-end quantum algorithms for tensor problems
Enrico Fontana, Sivaprasad Omanakuttan, Junhyung Lyle Kim +4
We present a comprehensive end-to-end quantum algorithm for tensor problems, including tensor PCA and planted kXOR, that achieves potential superquadratic quantum speedups over cla…
Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm
Sivaprasad Omanakuttan, Zichang He, Zhiwei Zhang +9
Optimization is often cited as a promising application of quantum computers. However, the low degree of provable quantum speedups has led prior rigorous end-to-end resource analyse…