Rohit Goswami

Senior Project Associate

Education / Work History

  • Doctoral Researcher, University of Iceland (2020–present)
  • Senior Project Associate, IIT Kanpur (2019-2020)
  • Project Associate, IIT Kanpur, (2018-2019)
  • B. Tech., HBTU Kanpur, (2014-2018)

Research Interests

  • Machine Learning
  • Structure Determination
  • Algorithmic approaches to computational complexity reduction

Other Duties

  • Site Admin

Things I do

  • I am an avid open source supporter (FOSS). I am rather active on Github.
  • Sites I manage actively can be verified on keybase

Other projects are not relevant to this site.

Publications

These include only those published in our lab.

  1. Intermediate Representations for Quantum Computing. R. Goswami, S. Goswami, and D. Goswami, in Bulletin of the American Physical Society (American Physical Society, n.d.) [Abstract] [PDF] [BibTeX]

    Abstract: The proliferation of qubit manipulation and generation methods (ranging from optical to topological qubits) has now been matched by an explosion in terms of user-level libraries (Q#, Qiskit, etc.) which have somehow been termed "quantum programming languages". We will develop on this theme by contrasting the classical computing programming languages and the algorithms / computational model therein (von Neumann machines) and demonstrate the gap manifest between what are essentially libraries and not programming languges. In particular we will cover the closest analogs in existing libraries to formal language, grammars, parsers and finally type safety. We will explore some programming paradigms (functional, imperative, object oriented) for typical quantum algoritms (Shor’s, Grovers, Simmulated Annealing). Finally, we will posit test suites for a true quantum computing language, one which has strict correspondence to the formal theory of compilers and can express algorithms compactly (grammar) while also ensuring correctness (compilation). We note that the core of compiler development has been execution independence, the ability to run on multiple platforms, and to this end, rather than describing an entire language down to a specific qubit generation method, we will instead focus on developing a quantum intermediate representation akin to LLVM compiler project. *DG, SG acknowledge support from MEITY, ISRO-STC. RG is partially supported by the Icelandic Research Fund, grant no. 217436-052.

     BibTeX: @inproceedings{goswamiIntermediateRepresentationsQuantum,
      title = {Intermediate {{Representations}} for {{Quantum Computing}}},
      booktitle = {Bulletin of the {{American Physical Society}}},
      author = {Goswami, Rohit and Goswami, Sonaly and Goswami, Debabrata},
      publisher = {{American Physical Society}},
      url = {https://meetings.aps.org/Meeting/MAR23/Session/RR08.5},
      urldate = {2022-12-31},
      eventtitle = {{{APS March Meeting}} 2023}
    }
    
  2. Quantum Distributed Computing with Shaped Laser Pulses. R. Goswami and D. Goswami, in 13th International Conference on Fiber Optics and Photonics (OSA, 2016), p. W4C.3 [Abstract] [BibTeX]

    Abstract: Shaped laser pulses can control decoherence under quantum adiabatic method of logic operations to result in a possible scalable quantum computer by distributing the computing load on a set of optically adiabatic quantum computing nodes.

     BibTeX: @inproceedings{goswamiQuantumDistributedComputing2016,
      title = {Quantum {{Distributed Computing}} with {{Shaped Laser Pulses}}},
      booktitle = {13th {{International Conference}} on {{Fiber Optics}} and {{Photonics}}},
      author = {Goswami, Rohit and Goswami, Debabrata},
      date = {2016},
      pages = {W4C.3},
      publisher = {{OSA}},
      location = {{Kanpur}},
      doi = {10/gf5mrr},
      eventtitle = {International {{Conference}} on {{Fibre Optics}} and {{Photonics}}},
      isbn = {978-1-943580-22-4}
    }
    
  3. Qubit Network Barriers to Deep Learning. R. Goswami, A. Goswami, and D. Goswami, in 2019 Workshop on Recent Advances in Photonics (WRAP) (2019), pp. 1–3 [Abstract] [BibTeX]

    Abstract: The popularity of artificial neural networks (ANNs) of great depth and Quantum computing have led to many speculations as to their convergence. We enumerate barriers to utilizing qubit networks for deep learning architectures. We also describe the criteria for an effective usage of qubit networks and then assert that the bottleneck in their implementation is a lack of quantum algorithms for utilizing the topology of a deep neural network.

     BibTeX: @inproceedings{goswamiQubitNetworkBarriers2019,
      title = {Qubit {{Network Barriers}} to {{Deep Learning}}},
      booktitle = {2019 {{Workshop}} on {{Recent Advances}} in {{Photonics}} ({{WRAP}})},
      author = {Goswami, Rohit and Goswami, Amrita and Goswami, Debabrata},
      date = {2019-12},
      pages = {1--3},
      issn = {null},
      doi = {10.1109/WRAP47485.2019.9013687},
      eventtitle = {2019 {{Workshop}} on {{Recent Advances}} in {{Photonics}} ({{WRAP}})}
    }
    
  4. Reproducible High Performance Computing without Redundancy with Nix. R. Goswami, R. S., A. Goswami, S. Goswami, and D. Goswami, in 2022 Seventh International Conference on Parallel, Distributed and Grid Computing (PDGC) (2022), pp. 238–242 [Abstract] [BibTeX]

    Abstract: High performance computing (HPC) clusters are typically managed in a restrictive manner; the large user base makes cluster administrators unwilling to allow privilege escalation. Here we discuss existing methods of package management, including those which have been developed with scalability in mind, and enumerate the drawbacks and advantages of each management methodology. We contrast the paradigms of containerization via docker, virtualization via KVM, pod-infrastructures via Kubernetes, and specialized HPC packaging systems via Spack and identify key areas of neglect. We demonstrate how functional programming due to reliance on immutable states has been leveraged for deterministic package management via the nix-language expressions. We show its associated ecosystem is a prime candidate for HPC package management. We further develop guidelines and identify bottlenecks in the existing structure and present the methodology by which the nix ecosystem should be developed further as an optimal tool for HPC package management. We assert that the caveats of the nix ecosystem can easily mitigated by considerations relevant only to HPC systems, without compromising on functional methodology and features of the nix-language. We show that benefits of adoption in terms of generating reproducible derivations in a secure manner allow for workflows to be scaled across heterogeneous clusters. In particular, from the implementation hurdles faced during the compilation and running of the d-SEAMS scientific software engine, distributed as a nix-derivation on an HPC cluster, we identify communication protocols for working with SLURM and TORQUE user resource allocation queues. These protocols are heuristically defined and described in terms of the reference implementation required for queue-efficient nix builds.

     BibTeX: @inproceedings{goswamiReproducibleHighPerformance2022,
      title = {Reproducible {{High Performance Computing}} without {{Redundancy}} with {{Nix}}},
      booktitle = {2022 {{Seventh International Conference}} on {{Parallel}}, {{Distributed}} and {{Grid Computing}} ({{PDGC}})},
      author = {Goswami, Rohit and S., Ruhila and Goswami, Amrita and Goswami, Sonaly and Goswami, Debabrata},
      date = {2022-11},
      pages = {238--242},
      issn = {2573-3079},
      doi = {10.1109/PDGC56933.2022.10053342},
      eventtitle = {2022 {{Seventh International Conference}} on {{Parallel}}, {{Distributed}} and {{Grid Computing}} ({{PDGC}})}
    }
    
  5. Semi-Supervised Approaches to Ultrafast Pulse Shaping. R. Goswami, A. Goswami, and D. Goswami, in ICOL-2019, K. Singh, A. K. Gupta, S. Khare, N. Dixit, and K. Pant, eds., Springer Proceedings in Physics (Springer, 2021), pp. 747–749 [Abstract] [PDF] [BibTeX]

    Abstract: Spatiotemporal control aspects of pulsed laser experiments rely on the ability to modulate the shape of the generated pulses efficiently. Drawing from current state-of-the-art theoretical aspects of computational simulations to reduce the sim-to-real bottlenecks, we devise a novel schematic for the generation of on-the-fly calibrated pulse trains with more accountability than existing techniques under the domain of optimal control theory. The techniques presented further diminish the divide between experiment and theory.

     BibTeX: @inproceedings{goswamiSemiSupervisedApproachesUltrafast2021,
      title = {Semi-{{Supervised Approaches}} to {{Ultrafast Pulse Shaping}}},
      booktitle = {{{ICOL-2019}}},
      author = {Goswami, Rohit and Goswami, Amrita and Goswami, Debabrata},
      editor = {Singh, Kehar and Gupta, A. K. and Khare, Sudhir and Dixit, Nimish and Pant, Kamal},
      date = {2021},
      series = {Springer {{Proceedings}} in {{Physics}}},
      pages = {747--749},
      publisher = {{Springer}},
      location = {{Singapore}},
      doi = {10.1007/978-981-15-9259-1_172},
      url = {10.1007/978-981-15-9259-1_172},
      isbn = {9789811592591}
    }
    
  6. Space Filling Curves: Heuristics For Semi Classical Lasing Computations. R. Goswami, A. Goswami, and D. Goswami, in 2019 URSI Asia-Pacific Radio Science Conference (AP-RASC) (IEEE, 2019), pp. 1–4 [Abstract] [PDF] [BibTeX]

    Abstract: For semi classical lasing, the FDTD (finite difference time domain) formulation including nonlinearities is often used. We determine the computational efficiency of such schemes quantitatively and present a hueristic based on space filling curves to minimize complexity. The sparse matrix kernel is shown to be optimized by the utilization of Bi-directional Incremental Compressed Row Storage (BICRS). Extensions to high performance clusters and parallelization are also derived.

     BibTeX: @inproceedings{goswamiSpaceFillingCurves2019,
      title = {Space {{Filling Curves}}: {{Heuristics For Semi Classical Lasing Computations}}},
      shorttitle = {Space {{Filling Curves}}},
      booktitle = {2019 {{URSI Asia-Pacific Radio Science Conference}} ({{AP-RASC}})},
      author = {Goswami, Rohit and Goswami, Amrita and Goswami, Debabrata},
      date = {2019-03},
      pages = {1--4},
      publisher = {{IEEE}},
      location = {{New Delhi, India}},
      doi = {10/gf5mqk},
      url = {https://my.pcloud.com/publink/show?code=XZ8vxr7ZHFxXSXuD2J4ntMcQoyPGXFodmegy},
      urldate = {2019-08-01},
      eventtitle = {2019 {{URSI Asia-Pacific Radio Science Conference}} ({{AP-RASC}})},
      isbn = {978-90-825987-5-9}
    }
    
  7. Ultrafast Insights for Predictive Fragrance Compounding. D. Goswami, R. Goswami, A. Kumar Rawat, and D. Chakrabarty, in (2020) [PDF] [BibTeX]
     BibTeX: @inproceedings{goswamiUltrafastInsightsPredictive2020,
      title = {Ultrafast Insights for Predictive Fragrance Compounding},
      author = {Goswami, Debabrata and Goswami, Rohit and Kumar Rawat, Ashwini and Chakrabarty, Debojit},
      date = {2020-04-29},
      doi = {10.1021/scimeetings.0c03998},
      url = {https://www.morressier.com/article/5e73d6ce139645f83c2299c8},
      urldate = {2020-07-11},
      eventtitle = {{{ACS Spring}} 2020 {{National Meeting}} \& {{Expo}}}
    }
    
  8. Unified Software Design Patterns for Simulated Annealing. R. Goswami, R. S., A. Goswami, S. Goswami, and D. Goswami, (2023) [Abstract] [PDF] [BibTeX]

    Abstract: Any optimization alogrithm programming interface can be seen as a black-box function with additional free parameters. In this spirit, simulated annealing (SA) can be implemented in pseudo-code within the dimensions of single slide with free parameters relating to the annealing schedule. Such an implementation however, neglects necessarily much of the structure necessary to take advantage of advances in computing resources, and algorithmic breakthroughs. Simulated annealing is often introduced in myriad disciplines, from discrete examples like the Traveling Salesman Problem (TSP) to molecular cluster potential energy exploration or even explorations of a protein’s configurational space. Theoretical guarantees also demand a stricter structure in terms of statistical quantities, which cannot simply be left to the user. We will introduce several standard paradigms and demonstrate how these can be "lifted" into a unified framework using object oriented programming in Python. We demonstrate how clean, interoperable, reproducible programming libraries can be used to access and rapidly iterate on variants of Simulated Annealing in a manner which can be extended to serve as a best practices blueprint or design pattern for a data-driven optimization library.

     BibTeX: @online{goswamiUnifiedSoftwareDesign2023,
      title = {Unified {{Software Design Patterns}} for {{Simulated Annealing}}},
      author = {Goswami, Rohit and S., Ruhila and Goswami, Amrita and Goswami, Sonaly and Goswami, Debabrata},
      date = {2023-02-06},
      eprint = {2302.02811},
      eprinttype = {arxiv},
      eprintclass = {physics},
      url = {http://arxiv.org/abs/2302.02811},
      urldate = {2023-02-10},
      pubstate = {preprint}
    }
    
  9. Space Filling Curves: Heuristics For Semi Classical Lasing Computations. R. Goswami, A. Goswami, and D. Goswami, in 2019 URSI Asia-Pacific Radio Science Conference (AP-RASC) (IEEE, 2019), pp. 1–4 [Abstract] [PDF] [BibTeX]

    Abstract: For semi classical lasing, the FDTD (finite difference time domain) formulation including nonlinearities is often used. We determine the computational efficiency of such schemes quantitatively and present a hueristic based on space filling curves to minimize complexity. The sparse matrix kernel is shown to be optimized by the utilization of Bi-directional Incremental Compressed Row Storage (BICRS). Extensions to high performance clusters and parallelization are also derived.

     BibTeX: @inproceedings{goswamiSpaceFillingCurves2020,
      langid = {english},
      location = {{New Delhi, India}},
      title = {Space {{Filling Curves}}: {{Heuristics For Semi Classical Lasing Computations}}},
      isbn = {978-90-825987-5-9},
      url = {https://my.pcloud.com/publink/show?code=XZ8vxr7ZHFxXSXuD2J4ntMcQoyPGXFodmegy},
      doi = {10/gf5mqk},
      shorttitle = {Space {{Filling Curves}}},
      eventtitle = {2019 {{URSI Asia}}-{{Pacific Radio Science Conference}} ({{AP}}-{{RASC}})},
      booktitle = {2019 {{URSI Asia}}-{{Pacific Radio Science Conference}} ({{AP}}-{{RASC}})},
      publisher = {{IEEE}},
      urldate = {2019-08-01},
      date = {2019-03},
      pages = {1-4},
      author = {Goswami, Rohit and Goswami, Amrita and Goswami, Debabrata}
    }
    
  10. Quantum Distributed Computing with Shaped Laser Pulses. R. Goswami and D. Goswami, in 13th International Conference on Fiber Optics and Photonics (OSA, 2016), p. W4C.3 [Abstract] [BibTeX]

    Abstract: Shaped laser pulses can control decoherence under quantum adiabatic method of logic operations to result in a possible scalable quantum computer by distributing the computing load on a set of optically adiabatic quantum computing nodes.

     BibTeX: @inproceedings{goswamiQuantumDistributedComputing2017,
      langid = {english},
      location = {{Kanpur}},
      title = {Quantum {{Distributed Computing}} with {{Shaped Laser Pulses}}},
      isbn = {978-1-943580-22-4},
      doi = {10/gf5mrr},
      eventtitle = {International {{Conference}} on {{Fibre Optics}} and {{Photonics}}},
      booktitle = {13th {{International Conference}} on {{Fiber Optics}} and {{Photonics}}},
      publisher = {{OSA}},
      date = {2016},
      pages = {W4C.3},
      author = {Goswami, Rohit and Goswami, Debabrata}
    }