About

I was born and raised in the southern Indian coastal city named Chennai (fondly called Madras). I am currently pursuing my doctoral studies in the Department of Electrical and Computer Engineering at Duke University, Durham, NC, USA, under the supervision of Prof. Henry Pfister and
Prof. Robert Calderbank in the Information Initiative at Duke (iiD). Prior to this, I completed my Master of Science (M.S.) degree at Texas A&M University, where I worked on the construction of Cyclic Polar Codes. I was a graduate research intern during the summer of 2015 at Alcatel-Lucent Bell Labs, Stuttgart, Germany, where I worked on the analysis of Spatially-Coupled LDPC ensembles over burst erasure channels, under the supervision of Dr. Laurent Schmalen and Dr. Vahid Aref.

My research interests are in the realms of information and coding theory (both classical and quantum), compressed sensing, and general inference problems. Currently, I am working on the construction of quantum codes and synthesis of their fault-tolerant logical operators for quantum computing. I am also interested in codes and decoding algorithms for quantum communications. I am a Student Member of the IEEE and the Information Theory Society.

I love pencil sketching and like to read about science, philosophy and life. I play cricket, volleyball and bowling. I am a novice writer and hope to disseminate productive thought and knowledge through this powerful platform called internet. My old blog is here.

This website is powered by Jekyll and this theme is an open source contribution by Panos Sakkos. This website is still under construction and all suggestions are most welcome.

Updates

Dec. 2019: Our paper on adaptive strategies for discriminating tensor-product quantum states is now posted on ArXiv.

Oct. 2019: Our paper characterizing all stabilizer codes that support physical transversal T is now posted on ArXiv. I presented this work as a poster earlier in the 5th International Conference on Quantum Error Correction (QEC ‘19). It has now been accepted for a talk in Quantum Information Processing (QIP ‘20)!

Aug. 2019: Our paper on Quadratic Form Diagonal (QFD) gates in the Clifford hierarchy has been published in Physical Review A.

July 2019: I presented our work on Kerdock unitary 2-designs in ISIT 2019.

June 2019: Our shorter paper on logical Clifford synthesis is now posted on ArXiv. The source code for our algorithms is available on GitHub.

I presented our work on Kerdock unitary 2-design and diagonal gates as posters in TQC 2019.

Apr. 2019: Our paper on Kerdock unitary 2-designs is now on ArXiv. Code is available on GitHub.

Jan. 2019: We have unified certain diagonal gates in the Clifford hierarchy (arXiv) with the symplectic representation of the Clifford group by extending binary symplectic matrices to rings of integers.

Using the automorphism group of classical Kerdock codes, we have simplified the construction of the unitary 2-design by Cleve et al. (2016).

I presented both papers as posters in QIP 2019; the Kerdock paper is in preparation.

July 2018: I participated in TQC 2018, and presented a poster on logical Clifford synthesis.

June 2018: I presented our logical Clifford synthesis work in ISIT 2018.

June 2018: I mentored three Duke Math undergraduates, as part of the Duke Opportunities in Mathematics (DOmath) program, on a quantum computing project lead by
Prof. Robert Calderbank and Prof. Henry Pfister. The students performed randomized benchmarking experiments on the IBMQX4 machine. Report available here.

Timeline

Publications

A list of my publications is below. You can also follow me on Google Scholar and ResearchGate (which includes unpublished notes and research).

Here is my most recent Curriculum Vitae.

Journal Articles and Preprints

  1. S. Brandsen, M. Lian, K. D. Stubbs, N. Rengaswamy, and H. D. Pfister, “Adaptive Procedures for Discrimination Between Arbitrary Tensor-Product Quantum States,” arXiv preprint arXiv:1912.05087, Dec. 2019 [Online]. Available at: http://arxiv.org/abs/1912.05087

  2. N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, “On Optimality of CSS Codes for Transversal T,” arXiv preprint arXiv:1910.09333, Oct. 2019 [Online]. Available at:
    http://arxiv.org/abs/1910.09333


  3. N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister, “Logical Clifford Synthesis for Stabilizer Codes,” arXiv preprint arXiv:1907.00310, Jul. 2019 [Online]. Available at:
    http://arxiv.org/abs/1907.00310


  4. T. Can, N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Kerdock Codes Determine Unitary 2-Designs,” arXiv preprint arXiv:1904.07842, Apr. 2019 [Online]. Available at: http://arxiv.org/abs/1904.07842

  5. N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Unifying the Clifford Hierarchy via Symmetric Matrices over Rings,” Phys. Rev. A, vol. 100, no. 2, p. 022304, 2019 [Online]. Available at:
    http://arxiv.org/abs/1902.04022 (or) https://journals.aps.org/pra/abstract/10.1103/PhysRevA.100.022304


  6. N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister, “Synthesis of Logical Clifford Operators via Symplectic Geometry,” arXiv preprint arXiv:1803.06987, 2018 [Online]. Available at:
    http://arxiv.org/abs/1803.06987


  7. V. Aref, N. Rengaswamy, and L. Schmalen, “Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels,” IEEE Trans. Inform. Theory, vol. 64, no. 5, pp. 3431–3449, 2018 [Online]. Available at: http://arxiv.org/abs/1611.08267 (or) http://ieeexplore.ieee.org/document/8272426/

Conference Articles

  1. T. Can, N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Kerdock Codes Determine Unitary 2-Designs,” in Proc. IEEE Int. Symp. Inform. Theory, 2019, pp. 2908–2912. Slides

  2. N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister, “Synthesis of Logical Clifford Operators via Symplectic Geometry,” in Proc. IEEE Int. Symp. Inform. Theory, 2018, pp. 791–795. Slides

  3. N. Rengaswamy, L. Schmalen, and V. Aref, “On the Burst Erasure Correctability of Spatially Coupled LDPC Ensembles,” in Proc. IEEE Intl. Zurich Seminar on Commun., 2016, pp. 155–159.

  4. V. Aref, N. Rengaswamy, and L. Schmalen, “Spatially Coupled LDPC Codes Affected by a Single Random Burst of Erasures,” in Proc. Int. Symp. on Turbo Codes & Iterative Inform. Proc., 2016, pp. 166–170.

  5. N. Rengaswamy and H. D. Pfister, “Cyclic Polar Codes,” in Proc. IEEE Int. Symp. Inform. Theory, 2015, pp. 1287–1291. Slides

Theses

  1. N. Rengaswamy, “On Cyclic Polar Codes and the Burst Erasure Performance of Spatially-Coupled LDPC Codes,” Master's thesis, Texas A&M University, 2015
    [Online]. Available at: http://hdl.handle.net/1969.1/156244


Contact

Drop me an email if you are interested in my work or want to collaborate or to even say hello!