18
collaborators
2019–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
2 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
|
Optimal Qubit Purification and Unitary Schur Sampling via Random SWAP Tests
Best Student Paper Award
|
TQC 2026 | regular | ▸Shrigyan Brahmachari, Austin Hulse, Iman Marvian |
The goal of qubit purification is to combine multiple noisy copies of an unknown pure quantum state to obtain one or more copies that are closer to the pure state. We show that a simple protocol based solely on random SWAP tests achieves the same fidelity as the Schur transform, which is optimal. This protocol relies only on elementary two-qubit SWAP tests, which project a pair of qubits onto the singlet or triplet subspaces, to identify and isolate singlet pairs, and then proceeds with the remaining qubits. For a system of $n$ qubits, we show that after approximately $T \approx n \ln n$ random SWAP tests, a sharp transition occurs: the probability of detecting any new singlet decreases exponentially with $T$. Similarly, the fidelity of each remaining qubit approaches the optimal value given by the Schur transform, up to an error that is exponentially small in $T$. More broadly, this protocol achieves what is known as weak Schur sampling and unitary Schur sampling with error $\epsilon$, after only $2n \ln(n \epsilon^{-1})$ SWAP tests. That is, it provides a lossless method for extracting any information invariant under permutations of qubits, making it a powerful subroutine for tasks such as quantum state tomography and metrology. |
|||
| On Optimality of CSS Codes for Transversal T | QIP 2020 | regular | Narayanan Rengaswamy, Robert Calderbank, Michael Newman |
10 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Quantum Peeling with Guessing: Fast Stabilizer-Assisted Decoding for Quantum Erasures | QIP 2026 | Giulio Pech, Mert Gökduman |
| Reed-Muller Codes and the Holevo Capacity | QIP 2025 | Avijit Mandal |
| Cluser Decomposition for Improved Erasure Decoding of Quantum LDPC Codes | QIP 2025 | Hanwen Yao, Mert Gökduman |
| Revealing the Waterfall Phenomenon of Long Random LDPC Hypergraph Product Codes | QIP 2025 | Mert Gökduman, Hanwen Yao |
| Belief Propagation Decoding of Quantum LDPC Codes without Post-Processing using an Ensemble of Sparsified Factor Graphs | QIP 2025 | Boqing Zhang, Hanwen Yao |
| Belief-Propagation with Quantum Messages on Pure-State Channels | QIP 2020 | Narayanan Rengaswamy, Kaushik Seshadreesan, Saikat Guha |
| Symplectic Matrices for Logical Clifford Synthesis and Diagonal Unitaries in the Clifford Hierarchy | QIP 2019 | Narayanan Rengaswamy, Robert Calderbank, Swanand Kadhe |
| Adaptive Procedures for Discrimination of Arbitrary Tensor-Product Quantum States | TQC 2019 | Sarah Brandsen, Mengke Lian, Kevin Stubbs, Narayanan Rengaswamy |
| Unifying the Clifford Hierarchy via Symmetric Matrices over Rings | TQC 2019 | Narayanan Rengaswamy, Robert Calderbank |
| Kerdock Codes Determine Unitary 2-Designs | TQC 2019 | Trung Can, Narayanan Rengaswamy, Robert Calderbank |
Collaborators
| Co-author | Joint talks |
|---|---|
| Narayanan Rengaswamy | 6 |
| Robert Calderbank | 4 |
| Hanwen Yao | 3 |
| Mert Gökduman | 3 |
| Austin Hulse | 1 |
| Avijit Mandal | 1 |
| Boqing Zhang | 1 |
| Giulio Pech | 1 |
| Iman Marvian | 1 |
| Kaushik Seshadreesan | 1 |
| Kevin Stubbs | 1 |
| Mengke Lian | 1 |
| Michael Newman | 1 |
| Saikat Guha | 1 |
| Sarah Brandsen | 1 |
| Shrigyan Brahmachari | 1 |
| Swanand Kadhe | 1 |
| Trung Can | 1 |