From the 1 of 7 linked papers with an AI index.
6 papers · 1 filter
Quantum Memory Advantage from Contextuality
Shiroman Prakash
The paper shows that quantum contextuality can give quantum finite automata a memory advantage over classical automata for recognizing formal languages, using graph‑theoretic exclu…
Invariant Theory, Magic State Distillation, and Bounds on Classical Codes
Amolak Ratan Kalra, Shiroman Prakash
We show that the physical consistency of magic state distillation imposes new constraints on the weight enumerators of classical error-correcting codes. We establish that for $|T\r…
A Search for High-Threshold Qutrit Magic State Distillation Routines
Shiroman Prakash, Rishabh Singhal
Determining the best attainable threshold for qudit magic state distillation is directly related to the question of whether or not contextuality is sufficient for universal quantum…
Sublogarithmic Distillation in all Prime Dimensions using Punctured Reed-Muller Codes
Tanay Saha, Shiroman Prakash
Magic state distillation is a leading but costly approach to fault-tolerant quantum computation, and it is important to explore all possible ways of minimizing its overhead cost. T…
Fault-Tolerant Implementation of the Deutsch-Jozsa Algorithm
Divyanshu Singh, Shiroman Prakash
We show that one can implement the Deutsch-Josza algorithm, one of the first and simplest quantum algorithms, in a fault-tolerant manner using the smallest quantum error-detecting…
Low Overhead Qutrit Magic State Distillation
Shiroman Prakash, Tanay Saha
We show that using qutrits rather than qubits leads to a substantial reduction in the overhead cost associated with an approach to fault-tolerant quantum computing known as magic s…