6 papers
A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code
Ankith Mohan, Jamie Sikora, Sarvagya Upadhyay
Quantum state discrimination is a fundamental primitive in quantum information processing, underpinning tasks in quantum communication, sensing, and learning. We consider the gener…
Local strategies are pretty good at computing Boolean properties of quantum sequences
Tathagata Gupta, Ankith Mohan, Shayeef Murshid +3
Quantum memory is a scarce and costly resource, yet little is known about which learning tasks remain feasible under severe memory constraints. We study the problem of computing gl…
Hierarchical quantum decoders
Nirupam Basak, Ankith Mohan, Andrew Tanggara +3
Decoders are a critical component of fault-tolerant quantum computing. They must identify errors based on syndrome measurements to correct quantum states. While finding the optimal…
Quantum heuristics for linear optimization over large separable operators
Ankith Mohan, Tobias Haug, Kishor Bharti +1
Optimizing over separable quantum objects is challenging for two key reasons: determining separability is NP-hard, and the dimensionality of the problem grows exponentially with th…
Approximate Dynamical Quantum Error-Correcting Codes
Nirupam Basak, Andrew Tanggara, Ankith Mohan +2
Quantum error correction plays a critical role in enabling fault-tolerant quantum computing by protecting fragile quantum information from noise. While general-purpose quantum erro…
The pretty bad measurement
Caleb McIrvin, Ankith Mohan, Jamie Sikora
The quantum state discrimination problem has Alice sending a quantum state to Bob who wins if he correctly identifies the state. The pretty good measurement, also known as the squa…