1 citations · 1 across the 15 of their papers we have counts for
6 papers · 2 filters
Lifted surgery for non-Abelian two-block group-algebra codes
Tushar Pandey
Code surgery measures a logical operator of a quantum LDPC code with rounds of syndrome extraction. Lifted surgery amortises this cost on Abelian group-algebra codes by meas…
When Classical Baselines Are Tuned as Carefully as the Quantum Model, Does Quantum Reservoir Computing Still Win?
Tushar Pandey
Can a small quantum computer forecast a changing signal better than an ordinary classical method? Many studies say yes, but the classical methods they compare against are often lef…
A Quantum Reservoir Architecture for Chaotic Forecasting and a Test of Whether Its High Dimension Helps
Tushar Pandey
Quantum reservoir computing uses a fixed quantum circuit as a feature generator and trains only a simple linear readout on top of it. This makes it cheap to train and free of the o…
Quantum Kernels for Parity-Structured Classification: A Hybrid Pipeline
Tushar Pandey
Parity (XOR) classification requires detecting discrete, high-order feature interactions that smooth classical kernels cannot efficiently capture. We study how quantum kernel advan…
Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel
Tushar Pandey
Fair threshold estimation for bivariate bicycle (BB) codes on the quantum erasure channel runs into two recurring problems: decoder-baseline unfairness and the conflation of finite…
An architectural capacity ceiling, not a barren plateau: why a fixed-encoding variational quantum circuit cannot fit the Lorenz-63 attractor
Tushar Pandey
Variational quantum circuits train poorly on chaotic forecasting, usually blamed on barren plateaus (exponentially vanishing gradients). Using an exactly simulable four-qubit varia…