diff --git a/CUSTOMIZE.md b/CUSTOMIZE.md index 6f6e3c1..dfb6e2b 100644 --- a/CUSTOMIZE.md +++ b/CUSTOMIZE.md @@ -62,7 +62,7 @@ Here we will give you some tips on how to customize the website. One important t - [How it works](#how-it-works) - [Configuration](#configuration-1) - [Disable related posts for a specific post](#disable-related-posts-for-a-specific-post) - - [Additional configuration in _config.yml](#additional-configuration-in-_configyml) + - [Additional configuration in \_config.yml](#additional-configuration-in-_configyml) - [Managing publication display](#managing-publication-display) - [Adding a Google Calendar](#adding-a-google-calendar) - [Basic usage](#basic-usage) diff --git a/_bibliography/papers.bib b/_bibliography/papers.bib index 8143293..d3b1b32 100644 --- a/_bibliography/papers.bib +++ b/_bibliography/papers.bib @@ -1,115 +1,353 @@ --- --- -@string{aps = {American Physical Society,}} - -@book{einstein1920relativity, - title = {Relativity: the Special and General Theory}, - author = {Einstein, Albert}, - year = {1920}, - publisher = {Methuen & Co Ltd}, - html = {relativity.html} +@article{gupta2026local, + title={Local strategies are pretty good at computing Boolean properties of quantum sequences}, + author={Gupta, Tathagata and Mohan, Ankith and Murshid, Shayeef and Russo, Vincent and Sikora, Jamie and Zheng, Alice}, + arxiv={2603.05452}, + year={2026}, + journal={Preprint}, + + abstract={Quantum memory is a scarce and costly resource, yet little is known + about which learning tasks remain feasible under severe memory constraints. + We study the problem of computing global properties of quantum sequences when + quantum systems must be measured individually, without storing or jointly + processing them. In our setting, a bit string $x \in \{0, 1\}^n$ is encoded into + an n-qubit product state $\ket{\psi_{x_1}} \otimes \cdots \otimes \ket{\psi_{x_n}}$ , and + the goal is to infer $f(x) \in \{0, 1\}$ from measurements of this quantum encoding. + We consider a simple local strategy, which we call the greedy strategy, that + applies the same optimal single-system measurement independently to each + subsystem and then infers $f(x)$ from the outcomes. Our main result gives a complete + characterization of when the greedy strategy is optimal: it achieves the same + maximum success probability as an unrestricted global measurement if and only + if the target Boolean function is affine (in all but finitely many cases). We + establish a universal performance guarantee for general Boolean functions, + showing that the success probability of the greedy strategy is always at least + the square of the optimal global success probability, in direct analogy with the + Barnum-Knill bound for the pretty good measurement. These results demonstrate + that even under extreme memory constraints, simple local measurement strategies + can remain provably competitive for learning global properties of quantum sequences.}, + + selected={true} } -@book{einstein1956investigations, - bibtex_show = {true}, - title = {Investigations on the Theory of the Brownian Movement}, - author = {Einstein, Albert}, - year = {1956}, - publisher = {Courier Corporation}, - preview = {brownian-motion.gif} +@misc{mohan2026hybrid, + title={Hybrid classical-quantum unsupervised multiclass classification}, + author={Mohan, Ankith and Upadhyay, Sarvagya}, + year={2026}, + month=mar # "~3", + publisher={Google Patents}, + note={US Patent 12,566,780}, + pdf={https://patents.google.com/patent/US12566780B2/en}, + + abstract={A method may include obtaining a multi-dimensional training dataset + that includes multiple datums. Each of the datums may correspond to a number + of quantum bits (qubits) and may represent a quantum state. The method may also + include generating, using a quantum computing device, a Gram matrix based on + the multiple datums. In addition, the method may include determining, using a + classical computing device, multiple operators according to a constraint defined + by the Gram matrix. Each of the operators may be configured as a proxy for a + corresponding datum. Further, the method may include assigning, using the + classical computing device, each of the operators to a label.}, + + selected={false} } -@article{einstein1950meaning, - abbr = {AJP}, - bibtex_show = {true}, - title = {The meaning of relativity}, - author = {Einstein, Albert and Taub, AH}, - journal = {American Journal of Physics}, - volume = {18}, - number = {6}, - pages = {403--404}, - year = {1950}, - publisher = {American Association of Physics Teachers} +@article{basak2026hierarchical, + title={Hierarchical quantum decoders}, + author={Basak, Nirupam and Mohan, Ankith and Tanggara, Andrew and Haug, Tobias and Paul, Goutam and Bharti, Kishor}, + arxiv={2601.21715}, + year={2026}, + journal={Preprint}, + + abstract={Decoders are a critical component of fault-tolerant quantum computing. + They must identify errors based on syndrome measurements to correct quantum + states. While finding the optimal correction is NP-hard and thus extremely + difficult, approximate decoders with faster runtime often rely on uncontrolled + heuristics. In this work, we propose a family of hierarchical quantum decoders + with a tunable trade-off between speed and accuracy while retaining guarantees + of optimality. We use the Lasserre Sum-of-Squares (SOS) hierarchy from optimization + theory to relax the decoding problem. This approach creates a sequence of + Semidefinite Programs (SDPs). Lower levels of the hierarchy are faster but + approximate, while higher levels are slower but more accurate. We demonstrate + that even low levels of this hierarchy significantly outperform standard Linear + Programming relaxations. Our results on rotated surface codes and honeycomb + color codes show that the SOS decoder approaches the performance of exact decoding. + We find that Levels $2$ and $3$ of our hierarchy perform nearly as well as the + exact solver. We analyze the convergence using rank-loop criteria and compare the + method against other relaxation schemes. This work bridges the gap between fast + heuristics and rigorous optimal decoding.}, + + selected={false} } -@article{PhysRev.47.777, - abbr = {PhysRev}, - title = {Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?}, - author = {Einstein*†, A. and Podolsky*, B. and Rosen*, N.}, - abstract = {In a complete theory there is an element corresponding to each element of reality. A sufficient condition for the reality of a physical quantity is the possibility of predicting it with certainty, without disturbing the system. In quantum mechanics in the case of two physical quantities described by non-commuting operators, the knowledge of one precludes the knowledge of the other. Then either (1) the description of reality given by the wave function in quantum mechanics is not complete or (2) these two quantities cannot have simultaneous reality. Consideration of the problem of making predictions concerning a system on the basis of measurements made on another system that had previously interacted with it leads to the result that if (1) is false then (2) is also false. One is thus led to conclude that the description of reality as given by a wave function is not complete.}, - journal = {Phys. Rev.}, - location = {New Jersey}, - volume = {47}, - issue = {10}, - pages = {777--780}, - numpages = {0}, - year = {1935}, - month = {May}, - publisher = aps, - doi = {10.1103/PhysRev.47.777}, - url = {https://link.aps.org/doi/10.1103/PhysRev.47.777}, - html = {https://journals.aps.org/pr/abstract/10.1103/PhysRev.47.777}, - pdf = {example_pdf.pdf}, - altmetric = {248277}, - dimensions = {true}, - google_scholar_id = {qyhmnyLat1gC}, - video = {https://www.youtube-nocookie.com/embed/aqz-KE-bpKQ}, - additional_info = {. *More Information* can be [found here](https://github.com/alshedivat/al-folio/)}, - annotation = {* Example use of superscripts
† Albert Einstein}, - selected = {true}, - inspirehep_id = {3255} +@inproceedings{mohan2025quantum, + title={Quantum heuristics for linear optimization over large separable operators}, + author={Mohan, Ankith and Haug, Tobias and Bharti, Kishor and Sikora, Jamie}, + booktitle={2025 IEEE 7th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA)}, + pages={580--589}, + year={2025}, + organization={IEEE}, + pdf={https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11410257}, + arxiv={2509.25585}, + + abstract={Optimizing over separable quantum objects is challenging for two key + reasons: determining separability is NP-hard, and the dimensionality of the + problem grows exponentially with the number of qubits. We address both challenges + by introducing a heuristic algorithm that leverages a quantum co-processor to + significantly reduce the problem's dimensionality. We then numerically demonstrate + that see-saw type optimization performs well in lower dimensional settings. A + notable feature of our approach is that it yields feasible solutions, not just + bounds on the optimal value, in contrast to many outer approximation based methods. + We apply our method to the problem of finding separable states with minimal + energy for a given Hamiltonian and use this to define an entanglement measure + for its ground space. Finally, we demonstrate how our approach can approximate + the separable ground energy of Hamiltonians up to 28 qubits.}, + + selected={false} } -@article{einstein1905molekularkinetischen, - title = {{\"U}ber die von der molekularkinetischen Theorie der W{\"a}rme geforderte Bewegung von in ruhenden Fl{\"u}ssigkeiten suspendierten Teilchen}, - author = {Einstein, A.}, - journal = {Annalen der physik}, - volume = {322}, - number = {8}, - pages = {549--560}, - year = {1905}, - publisher = {Wiley Online Library} +@article{basak2025approximate, + title={Approximate dynamical quantum error-correcting codes}, + author={Basak, Nirupam and Tanggara, Andrew and Mohan, Ankith and Paul, Goutam and Bharti, Kishor}, + arxiv={arXiv:2502.09177}, + year={2025}, + journal={Preprint}, + + abstract={Quantum error correction plays a critical role in enabling fault-tolerant + quantum computing by protecting fragile quantum information from noise. While + general-purpose quantum error correction codes are designed to address a wide + range of noise types, they often require substantial resources, making them + impractical for near-term quantum devices. Approximate quantum error correction + provides an alternative by tailoring codes to specific noise environments, + reducing resource demands while still maintaining noise-robustness. Dynamical + codes, including Floquet codes, introduce a dynamic approach to quantum error + correction, employing time-dependent operations to stabilize logical qubits. + In this work, we combine the flexibility of dynamical codes with the versatility + of approximate quantum error correction to offer a promising avenue for addressing + dominant noise in quantum systems. We construct several approximate dynamical + codes using the recently developed strategic code framework. As a special case, + we recover the approximate static codes widely studied in the existing literature. + By analyzing these approximate dynamical codes through semidefinite programming, + we establish the uniqueness and robustness of the optimal encoding, decoding, + and check measurements. We also develop a temporal Petz recovery map suited to + approximate dynamical codes.}, + + selected={true} } -@article{einstein1905movement, - abbr = {Ann. Phys.}, - title = {Un the movement of small particles suspended in statiunary liquids required by the molecular-kinetic theory 0f heat}, - author = {Einstein, A.}, - journal = {Ann. Phys.}, - volume = {17}, - pages = {549--560}, - year = {1905} +@inproceedings{beigi2024internalinspector, + title={InternalInspector I^2: Robust confidence estimation in LLMs through internal states}, + author={Beigi, Mohammad and Shen, Ying and Yang, Runing and Lin, Zihao and Wang, Qifan and Mohan, Ankith and He, Jianfeng and Jin, Ming and Lu, Chang-Tien and Huang, Lifu}, + booktitle={Findings of the association for computational linguistics: EMNLP 2024}, + pages={12847--12865}, + year={2024}, + publisher={Association for Computational Linguistics}, + pdf={https://aclanthology.org/2024.findings-emnlp.751.pdf}, + arxiv={2406.12053v1}, + + abstract={Despite their vast capabilities, Large Language Models (LLMs) often + struggle with generating reliable outputs, frequently producing high-confidence + inaccuracies known as hallucinations. Addressing this challenge, our research + introduces InternalInspector, a novel framework designed to enhance confidence + estimation in LLMs by leveraging contrastive learning on internal states + including attention states, feed-forward states, and activation states of all + layers. Unlike existing methods that primarily focus on the final activation + state, InternalInspector conducts a comprehensive analysis across all internal + states of every layer to accurately identify both correct and incorrect prediction + processes. By benchmarking InternalInspector against existing confidence estimation + methods across various natural language understanding and generation tasks, + including factual question answering, commonsense reasoning, and reading comprehension, + InternalInspector achieves significantly higher accuracy in aligning the + estimated confidence scores with the correctness of the LLM's predictions and + lower calibration error. Furthermore, InternalInspector excels at HaluEval, a + hallucination detection benchmark, outperforming other internal-based confidence + estimation methods in this task.}, + + selected={true} } -@article{einstein1905electrodynamics, - title = {On the electrodynamics of moving bodies}, - author = {Einstein, A.}, - year = {1905} +@article{mcirvin2024quantum, + title={Quantum state exclusion through offset measurement}, + author={McIrvin, Caleb and Mohan, Ankith and Sikora, Jamie}, + journal={Physical Review A}, + volume={110}, + number={4}, + pages={042211}, + year={2024}, + publisher={APS}, + pdf={https://journals.aps.org/pra/pdf/10.1103/PhysRevA.110.042211}, + arxiv={2403.17252}, + + abstract={The quantum state discrimination problem has Alice sending a quantum + state to Bob who wins if he correctly identifies the state. The pretty good + measurement, also known as the square root measurement, performs pretty well + at this task. We study the version of this problem where Bob tries to lose with + the greatest probability possible (which is harder than it sounds). We define + the pretty bad measurement, which performs pretty well at this task, or in + other words, pretty poorly for the original task. We show that both the pretty + good measurement and the pretty bad measurement are always no worse than blind + guessing at their respective tasks. As an application, we apply the pretty bad + measurement to the quantum state anomaly detection problem and show how to avoid + pretty bad qubits.}, + + selected={false} } -@article{einstein1905photoelectriceffect, - bibtex_show = {true}, - abbr = {Ann. Phys.}, - title = {{{\"U}ber einen die Erzeugung und Verwandlung des Lichtes betreffenden heuristischen Gesichtspunkt}}, - author = {Albert Einstein}, - abstract = {This is the abstract text.}, - journal = {Ann. Phys.}, - volume = {322}, - number = {6}, - pages = {132--148}, - year = {1905}, - doi = {10.1002/andp.19053220607}, - award = {Albert Einstein receveid the **Nobel Prize in Physics** 1921 *for his services to Theoretical Physics, and especially for his discovery of the law of the photoelectric effect*}, - award_name = {Nobel Prize} +@misc{liu2024identification, + title={Identification of influential nodes in graph datasets using combinatorial optimization formulations}, + author={Liu, Xiaoyuan and Mohan, Ankith and Upadhyay, Sarvagya}, + year={2024}, + month=jul # "~18", + publisher={Google Patents}, + note={US Patent App. 18/156,330}, + pdf={https://patents.google.com/patent/US20240241910A1/en}, + + abstract={A method may include obtaining a graph dataset that represents a social + network and includes a plurality of nodes. The method may include partitioning + the graph dataset into a first node cluster and a second node cluster in which + the first node cluster and the second node cluster each include one or more + nodes from the graph dataset. The method may include identifying one or more + first candidate influential nodes included in the first node cluster and one + or more second candidate influential nodes included in the second node cluster. + The method may include selecting one or more of the first candidate influential + nodes and the second candidate influential nodes as influencer nodes and + identifying a respective object included in the social network corresponding + to each of the influencer nodes.}, + + selected={false} } -@book{przibram1967letters, - bibtex_show = {true}, - title = {Letters on wave mechanics}, - author = {Einstein, Albert and Schrödinger, Erwin and Planck, Max and Lorentz, Hendrik Antoon and Przibram, Karl}, - year = {1967}, - publisher = {Vision}, - preview = {wave-mechanics.gif}, - abbr = {Vision} +@misc{mohan2026hybridquantumclassicalalgorithmbayesoptimal, + title={A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code}, + author={Ankith Mohan and Jamie Sikora and Sarvagya Upadhyay}, + arxiv={2312.04023}, + year={2026}, + journal={Preprint}, + + abstract={Quantum state discrimination is a fundamental primitive in quantum + information processing, underpinning tasks in quantum communication, sensing, + and learning. We consider the general Bayes framework, as introduced by Helstrom, + for state discrimination when, instead of a classical description of the candidate + states, one has access to their source code: the quantum circuit that prepares + them. We show that the semidefinite program (SDP) for the discrimination problem + can be reformulated in terms of the Gram matrix of these states, reducing the + SDP variable dimensions from $d L$ to $N L$, where $d$ is the Hilbert space + dimension, $N$ is the number of candidate states, and $L$ is the number of + possible guesses. Importantly, we further introduce a quantum pre-processing + procedure which efficiently constructs the reduced semidefinite program from + the source code, enabling our method to operate directly on quantum data. We + consider two applications. First, we characterize the optimal identifications + for quantum changepoint problems under several reward structures, including + multiple-changepoint settings that were previously computationally inaccessible. + Second, we consider a quantum error classification problem and show how our + reduction makes it tractable for systems of hundreds of qubits.}, + + selected={false} +} + +@article{mohan2021graph, + title={Graph signal recovery using restricted Boltzmann machines}, + author={Mohan, Ankith and Nakano, Aiichiro and Ferrara, Emilio}, + journal={Expert Systems with Applications}, + volume={185}, + pages={115635}, + year={2021}, + publisher={Elsevier}, + pdf={https://pdf.sciencedirectassets.com/271506/1-s2.0-S0957417421X00176/1-s2.0-S0957417421010290/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjECoaCXVzLWVhc3QtMSJHMEUCIHdzu7bM4eM39JGs3xZFKwcR1EJwGzdk6RkhqR6J%2FSo4AiEA7PjmA55%2FKE4roxijGTurrq5LsVVaSpQ%2BsCPXrBUmocwqvAUI8%2F%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FARAFGgwwNTkwMDM1NDY4NjUiDMFDHAnPDeF6x7DndSqQBd7hnn%2FUqyk9WvLoqCQakQD9DFamo5AvK%2Fq%2BaT%2BtmPR9KAaqEYvRF7rFg9SckUPFgdF6nOAMrdSi%2Fla8akwqsampmSAqmSF8%2B7QjjxXU2PPROmLj6EUqr7EXUIHxVpUmTpxWpsjB3wz9BE4Sgs0e7CH8JTt%2FOXKGM08aVzKb%2FAhCzjxBjfvG1Wk%2F2bRByFif75%2BIYvOmP7PoqPM7%2F6qhrYxzr5YqrT3K8HResNKHmFuajFxqt4L2CSTzod5xH2ZL5mYfSqP1uUS45Y2cxNL83oiQ5kcFAvYJo1tb%2F4xX3dDqkIeX1SqJoDnISguPAuYm08EzuaEZUYETiCrRNSCXuOU2m6TqNwM3I%2BU5hrhyPOu%2FcsNs74yBJUg%2F9bx7%2F56mlxRhqhiWgqp5jpd6hst5%2F0OavebFOVwHiJyWWxwpkXAdVR88mPzYisO7fe%2F8RH6m6B8KcdHqzjREssG7nDpT0XE2ZoziTV3llZUpbMv12YdQdxFQGmlMMFvDhTeEzVgRH7PkDZzEsP%2Bs4V2YtIdamrjDvzolkmRaVwwR6L8PkOtBDo1zr2u8JiRD%2BJehlA7s8VZ4uArl%2Bdx96wQQl%2Bznw4N%2F%2FxnycFStxaAAX9TdPECbmVPTg67355YbgomTx0%2B18IHKpndJspqd5bQKwdqQRHVwKNWK8cqKMHkoCwkizazXluI4DWyelfnEAChRc4nMHOojprZKTqRHoy5gFhCV0TNf1qEtwOyqygxqdTCy%2FnhcFwgoDL1vpHFWVgmlrfLtecRE8vaIAuMwXaDI%2FBBA5ELQ%2B7ZzFXizcAIYh43BbXJFCgrhr1jvV%2FG9QIFamSXbGZIOLRm8S7%2BtA7Vw8l0vB71B8sGjq0%2FSy25eYwuSiQRAMI3e2tUGOrEBF3z42KcieMXKi6MeHX4%2FFLuqeGtXar2sEuXcBcVyQyBSH8%2FgHVIgimEf45fpEOaF87TBE3lRWPKkv8GRGP1nW834eC%2FzZKkhB4M2H23l2w%2FQEByEPW%2B2L9AKWlmX5CytFr9lKxT2Y0u%2B2picZxbeZkIbcOfe8GcdEhdFj%2F6HPVaq%2Fc0ZXTYQeOSYo8hef4JsAwaSoT26bKSGxb6XkDToWW8Tvspp6e7DW%2BgUloT5FhCJ&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Date=20260925T191939Z&X-Amz-SignedHeaders=host&X-Amz-Expires=300&X-Amz-Credential=ASIAQ3PHCVTYQVHLUHN4%2F20260925%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Signature=1bc9792fb63b822cd81e2affa196084b19e968d0d371766d22f34c059480e6bf&hash=d95e53005a2dcf117723a4f943dbf95782e0e71ba1e6fee2eae996cbe931cf2b&host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&pii=S0957417421010290&tid=spdf-6be7f767-0d2d-4c49-804b-0567f63c011a&sid=0604e03079f5494fda792bb362ed13ce7d0fgxrqa&type=client&tsoh=d3d3LnNjaWVuY2VkaXJlY3QuY29t&rh=d3d3LnNjaWVuY2VkaXJlY3QuY29t&ua=0f1507545e025355025b53&rr=a40c61b80aa67ad5&cc=us}, + arxiv={2011.10549v1}, + + abstract={We propose a model-agnostic pipeline to recover graph signals from + an expert system by exploiting the content addressable memory property of + restricted Boltzmann machine and the representational ability of a neural + network. The proposed pipeline requires the deep neural network that is + trained on a downward machine learning task with clean data, data which is free + from any form of corruption or incompletion. We show that denoising the + representations learned by the deep neural networks is usually more effective + than denoising the data itself. Although this pipeline can deal with noise in + any dataset, it is particularly effective for graph-structured datasets.}, + + selected={false} +} + +@article{liu2020boltzmann, + title={Boltzmann machine modeling of layered MoS2 synthesis on a quantum annealer}, + author={Liu, Jeremy and Mohan, Ankith and Kalia, Rajiv K and Nakano, Aiichiro and Nomura, Ken-ichi and Vashishta, Priya and Yao, Ke-Thia}, + journal={Computational Materials Science}, + volume={173}, + pages={109429}, + year={2020}, + publisher={Elsevier}, + pdf={https://pdf.sciencedirectassets.com/271513/1-s2.0-S0927025619X00154/1-s2.0-S0927025619307281/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjECsaCXVzLWVhc3QtMSJIMEYCIQD3d4I9vYJ8T5VxDt9Lfhen2POzTXH2aSyFbK%2BGcHLE1wIhAPsMfHfV50gaLCw4Wxx5%2Bo8jsuxwdMxpzlq3ryNLuW3XKrwFCPT%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEQBRoMMDU5MDAzNTQ2ODY1IgxE%2Fi8Bbv7oA7tUkYMqkAW33yMsYdwEKr3VJj8tS4qL34EcLGzNCmj0nJVbqpGCADtVC23JUL81ngmgn2mWxePZajU1AMxjDfoCHdtJVWOqvGpc7wHInDadOtxFrCdfZ7EdQ7lfG0xhhP7N4LKpSskQBE0a0NKGZZra%2FmN2T5geJrb5vxpV%2F7BTQYm88PhsezLjFxeEhqlaSRZExftRTgQLzKY%2BV45Ks3mTUWRFFsxkomZjIcfMMuIhC5sJn9PSZZ9LV11cQrvsYvxdv0lZJo9Dq1nu9wMV3VaKGG9BvYZxIbj23u9MWd4bLxwsKlYt5K49x0MRGTKDmBtWlzpuDlNlz0wxnQKSb0Tdh25jBoleNDE2J8b5WigT1uLHIfHC9HgXFdXynjCHI9jCGrLYJcwy31UR3GboNtd2s0%2BhkqqNz%2BjSuNtHpFPtwIMHgXK7SjkBCgXsgZJ3Z5UCWtASsNoddhIC0Fhb4si%2BfJxH2TgxRnoSQPRX0FshsX45LoN15xSPvA%2FyADdCkgoydp9N8G9ZfiWyigsENXDA4mxTIIZmbVAZLoCDChoS9ZOYgf4jNDGcCgvOvx33wqNHo8KZlEVbk%2F%2BmNXuDxF6tRrAVa9KqB1HJLsTMTuRkS6bkcoJ8NZm1HDgDIsog1NQ5XL4Ac5Y7EP0N4Oko%2FOKaXOi%2Fgk%2B9kl4Hpyos18wlQhJOZaOsRU6K7GIZpVsdsj%2B%2Br%2B1pdXPcR1%2BjGiP9MYzT%2F1LfHr6%2BoqbZo2wyIDCOZGu5YsfgPUwiJPBwsr%2Bz8Wadb2nbMQ0CplhIMDWq9BjdkUK7b%2BX4Z79ZMdCzFW0Jj1s%2Fg4uKxF1mgvL0g4UNR%2BcDvWqkANrfC040sdY7VMgTX3L8GGUsbUtXOYICDaPass33shKxWjCJg9vVBjqwAdNtWQ0pfs85yIyiHBH7fSJ618EgYfZMC4XTXdki4wcOiQYd5FQS3%2FZ0pDNddcJ2T9KNIbfhTAjbRbm1EJexnn4qIypFyrDyhv5S9D7Tk84PcEK6t2ihxyC1dFGkc8HteEbpBKrfW1GQK9BqsvQRVhdHVkQyceKFpmGgwQN5mhyM4Dy%2FvDsavb0NciHMQOHvLApHSscEX2HHriWGsrjgWstv4A3OErmv65UVMkU%2BIVcg&X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Date=20260925T192420Z&X-Amz-SignedHeaders=host&X-Amz-Expires=300&X-Amz-Credential=ASIAQ3PHCVTY7OTDQX5O%2F20260925%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Signature=1c3f803d2a1376a02372d051a3ffe2fa80d538bba34bec93e9a8f5fa72eff2f3&hash=9c33d9684536387e5426d6d7fc7fbd64c63769861aa31323ae3428d827b14b31&host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&pii=S0927025619307281&tid=spdf-27f93775-89ce-420d-8aee-1190a0176171&sid=0604e03079f5494fda792bb362ed13ce7d0fgxrqa&type=client&tsoh=d3d3LnNjaWVuY2VkaXJlY3QuY29t&rh=d3d3LnNjaWVuY2VkaXJlY3QuY29t&ua=0f1507545e02535c595255&rr=a40c68916c287207&cc=us}, + + abstract={Two-dimensional layered materials are usually synthesized by chemical + vapor deposition (CVD). Here we use the Restricted Boltzmann Machine (RBM) and + its enhancement called Limited Boltzmann Machine (LBM) on a quantum computer + to model the chemical vapor deposition (CVD) growth data for a MoS2 monolayer. + The CVD data for Boltzmann machines are generated by reactive molecular dynamics + (RMD) simulations. The Boltzmann machines give insight into the semiconducting + (2H) and metallic (1T) phases and defects generated during the CVD growth of + MoS2. We compare the performances of the two types of Boltzmann machine models, + i.e., RBM versus augmented topologies with limited intra-layer coupling between + the hidden units (LBM). We show that limited topologies have a performance + advantage over restricted topologies. We examine connectivity within our + topological variants, explore hardware qubit mapping schemes, and discuss what + performance differences may imply about locality within the data without prior + knowledge.}, + + selected={false} +} + +@book{pm2018practical, + title={Practical social network analysis with python}, + author={PM, Krishna Raj and Mohan, Ankith and Srinivasa, KG}, + year={2018}, + publisher={Springer}, + html={https://link.springer.com/book/10.1007/978-3-319-96746-2}, + + abstract={This book focuses on social network analysis from a computational + perspective, introducing readers to the fundamental aspects of network theory + by discussing the various metrics used to measure the social network. It covers + different forms of graphs and their analysis using techniques like filtering, + clustering and rule mining, as well as important theories like small world + phenomenon. It also presents methods for identifying influential nodes in the + network and information dissemination models. Further, it uses examples to + explain the tools for visualising large-scale networks, and explores emerging + topics like big data and deep learning in the context of social network analysis. + + With the Internet becoming part of our everyday lives, social networking tools + are used as the primary means of communication. And as the volume and speed + of such data is increasing rapidly, there is a need to apply computational + techniques to interpret and understand it. Moreover, relationships in molecular + structures, co-authors in scientific journals, and developers in a software + community can also be understood better by visualising them as networks. + + This book brings together the theory and practice of social network analysis + and includes mathematical concepts, computational techniques and examples from + the real world to offer readers an overview of this domain.}, + + selected={false} } + +@article{krishnaraj2017performance, + title={Performance of procedures for identifying influentials in a social network: prediction of time and memory usage as a function of network properties}, + author={Krishnaraj, PM and Mohan, Ankith and Srinivasa, KG}, + journal={Social Network Analysis and Mining}, + volume={7}, + number={1}, + pages={34}, + year={2017}, + publisher={Springer}, + html={https://link.springer.com/article/10.1007/s13278-017-0454-1}, + + abstract={Identification of influential nodes in a social network is an + interesting problem since these nodes assist in faster information propagation + in the network. In the current work, the procedures based on Cole and Weiss + are used to identify influentials in networks of various sizes and their + performances are analyzed. Further it is established that preprocessing + techniques like clustering and sampling improve the performance of Cole + and Weiss procedures. Finally, the computational resources required for these + procedures are estimated based on network properties.}, + + selected={false} +} \ No newline at end of file diff --git a/_config.yml b/_config.yml index 890f654..3691eb9 100644 --- a/_config.yml +++ b/_config.yml @@ -6,7 +6,7 @@ title: blank # the website title (if blank, full name will be used instead) first_name: Ankith middle_name: last_name: Mohan -email: ankithmo@vt.edu +email: ankith.mohan@gmail.com description: > # the ">" symbol means to ignore newlines until "footer_text:" Ankith Mohan's Personal Website footer_text: > @@ -113,8 +113,7 @@ discord_id: # your discord id (18-digit unique numerical identifier) zotero_username: # your zotero username wechat_qr: # filename of your wechat qr-code saved as an image (e.g., wechat-qr.png if saved to assets/img/wechat-qr.png) -contact_note: > - You can even add a little note about which of these is the best way to reach you. +contact_note: # You can even add a little note about which of these is the best way to reach you. # ----------------------------------------------------------------------------- # Analytics and search engine verification diff --git a/_data/socials.yml b/_data/socials.yml index 5e01cef..52c5fc9 100644 --- a/_data/socials.yml +++ b/_data/socials.yml @@ -1,14 +1,8 @@ # this file contains the social media links and usernames of the author # the socials will be displayed in the order they are defined here -# for more information, please refer to the documentation of jekyll-socials plugin: https://github.com/george-gca/jekyll-socials -cv_pdf: /assets/pdf/example_pdf.pdf # path to your CV PDF file -email: you@example.com # your email address -inspirehep_id: 1010907 # Inspire HEP author ID -rss_icon: true # comment this line to hide the RSS icon -scholar_userid: qc6CJjYAAAAJ # your Google Scholar ID -# wechat_qr: # filename of your wechat qr-code saved as an image (e.g., wechat-qr.png if saved to assets/img/wechat-qr.png) -# whatsapp_number: # your WhatsApp number (full phone number in international format. Omit any zeroes, brackets, or dashes when adding the phone number in international format.) -custom_social: # can be any name here other than the ones already defined in the jekyll-socials plugin - logo: https://www.alberteinstein.com/wp-content/uploads/2024/03/cropped-favicon-192x192.png # can be png, svg, jpg - title: Custom Social - url: https://www.alberteinstein.com/ + +email: ankith.mohan@gmail.com +linkedin_username: ankithmohan +scholar_userid: h6EJ7CYAAAAJ +github_username: ankith-mohan +orcid_id: 0000-0003-3764-4267 diff --git a/_layouts/bib.liquid b/_layouts/bib.liquid index 08b1a45..b401af7 100644 --- a/_layouts/bib.liquid +++ b/_layouts/bib.liquid @@ -381,7 +381,7 @@ {% endif %} diff --git a/_news/2026-05-kafura-fellowship.md b/_news/2026-05-kafura-fellowship.md new file mode 100644 index 0000000..dcf9aae --- /dev/null +++ b/_news/2026-05-kafura-fellowship.md @@ -0,0 +1,8 @@ +--- +layout: post +date: 2026-05-26 00:00:00-0400 +inline: true +related_posts: false +--- + +I received the Kafura Doctoral Graduate Fellowship Award from Virginia Tech. diff --git a/_news/2026-07-phd-defense.md b/_news/2026-07-phd-defense.md new file mode 100644 index 0000000..01a84bd --- /dev/null +++ b/_news/2026-07-phd-defense.md @@ -0,0 +1,8 @@ +--- +layout: post +date: 2026-07-09 00:00:00-0400 +inline: true +related_posts: false +--- + +I successfully defended my Ph.D. dissertation in Computer Science at Virginia Tech. diff --git a/_news/2026-08-umass-postdoc.md b/_news/2026-08-umass-postdoc.md new file mode 100644 index 0000000..e96be52 --- /dev/null +++ b/_news/2026-08-umass-postdoc.md @@ -0,0 +1,8 @@ +--- +layout: post +date: 2026-08-01 00:00:00-0400 +inline: true +related_posts: false +--- + +I joined the Manning College of Information and Computer Sciences at the University of Massachusetts Amherst as a Postdoctoral Research Associate. diff --git a/_news/announcement_1.md b/_news/announcement_1.md deleted file mode 100644 index e5349ce..0000000 --- a/_news/announcement_1.md +++ /dev/null @@ -1,8 +0,0 @@ ---- -layout: post -date: 2015-10-22 15:59:00-0400 -inline: true -related_posts: false ---- - -A simple inline announcement. diff --git a/_news/announcement_2.md b/_news/announcement_2.md deleted file mode 100644 index 9269395..0000000 --- a/_news/announcement_2.md +++ /dev/null @@ -1,33 +0,0 @@ ---- -layout: post -title: A long announcement with details -date: 2015-11-07 16:11:00-0400 -inline: false -related_posts: false ---- - -Announcements and news can be much longer than just quick inline posts. In fact, they can have all the features available for the standard blog posts. See below. - ---- - -Jean shorts raw denim Vice normcore, art party High Life PBR skateboard stumptown vinyl kitsch. Four loko meh 8-bit, tousled banh mi tilde forage Schlitz dreamcatcher twee 3 wolf moon. Chambray asymmetrical paleo salvia, sartorial umami four loko master cleanse drinking vinegar brunch. Pinterest DIY authentic Schlitz, hoodie Intelligentsia butcher trust fund brunch shabby chic Kickstarter forage flexitarian. Direct trade cold-pressed meggings stumptown plaid, pop-up taxidermy. Hoodie XOXO fingerstache scenester Echo Park. Plaid ugh Wes Anderson, freegan pug selvage fanny pack leggings pickled food truck DIY irony Banksy. - -#### Hipster list - - - -Hoodie Thundercats retro, tote bag 8-bit Godard craft beer gastropub. Truffaut Tumblr taxidermy, raw denim Kickstarter sartorial dreamcatcher. Quinoa chambray slow-carb salvia readymade, bicycle rights 90's yr typewriter selfies letterpress cardigan vegan. - ---- - -Pug heirloom High Life vinyl swag, single-origin coffee four dollar toast taxidermy reprehenderit fap distillery master cleanse locavore. Est anim sapiente leggings Brooklyn ea. Thundercats locavore excepteur veniam eiusmod. Raw denim Truffaut Schlitz, migas sapiente Portland VHS twee Bushwick Marfa typewriter retro id keytar. - -> We do not grow absolutely, chronologically. We grow sometimes in one dimension, and not in another, unevenly. We grow partially. We are relative. We are mature in one realm, childish in another. -> —Anais Nin - -Fap aliqua qui, scenester pug Echo Park polaroid irony shabby chic ex cardigan church-key Odd Future accusamus. Blog stumptown sartorial squid, gastropub duis aesthetic Truffaut vero. Pinterest tilde twee, odio mumblecore jean shorts lumbersexual. diff --git a/_news/announcement_3.md b/_news/announcement_3.md deleted file mode 100644 index 4d54088..0000000 --- a/_news/announcement_3.md +++ /dev/null @@ -1,8 +0,0 @@ ---- -layout: post -date: 2016-01-15 07:59:00-0400 -inline: true -related_posts: false ---- - -A simple inline announcement with Markdown emoji! :sparkles: :smile: diff --git a/_pages/about.md b/_pages/about.md index cb631cc..478e356 100644 --- a/_pages/about.md +++ b/_pages/about.md @@ -2,6 +2,8 @@ layout: about title: about permalink: / +nav: false +nav_order: 1 subtitle: profile: @@ -10,12 +12,20 @@ profile: image_circular: false # crops the image to make it circular more_info: -news: false # includes a list of news items -latest_posts: false # includes a list of the newest posts -selected_papers: false # includes a list of papers marked as "selected={true}" -social: false # includes social icons at the bottom of the page +announcements: + enabled: true + scrollable: true + limit: 5 + +latest_posts: + enabled: false + scrollable: true + limit: 3 + +selected_papers: true +social: true --- -I am a PhD Candidate at [Virginia Tech](https://vt.edu) advised by [Jamie Sikora](https://website.cs.vt.edu/people/faculty/jamie-sikora.html). I received my M.S. from the [University of Southern California](https://usc.edu), where I was fortunate to be advised by [Emilio Ferrara](https://viterbi.usc.edu/directory/faculty/Ferrara/Emilio) and [Aiichiro Nakano](https://viterbi.usc.edu/directory/faculty/Nakano/Aiichiro). +I am a Postdoctoral Research Associate in the [Manning College of Information and Computer Sciences](https://www.cics.umass.edu) at the [University of Massachusetts Amherst](https://www.umass.edu), where I work with [Gayane Vardoyan](https://people.cs.umass.edu/~gvardoyan) and [Philip S. Thomas](https://people.cs.umass.edu/~pthomas/). I received my Ph.D. in Computer Science from [Virginia Tech](https://vt.edu), where I was advised by [Jamie Sikora](https://sites.google.com/site/jamiesikora), and my M.S. in Computer Science from the [University of Southern California](https://usc.edu), where I worked with [Emilio Ferrara](https://viterbi.usc.edu/directory/faculty/Ferrara/Emilio) and [Aiichiro Nakano](https://viterbi.usc.edu/directory/faculty/Nakano/Aiichiro). -My research lies at the intersection of **quantum computing**, **machine learning**, and **optimization**. +My current research focuses on **quantum information** and **quantum networks**. I am particularly interested in developing algorithms and protocols for quantum communication and distributed quantum systems, with an emphasis on quantum repeater networks, entanglement distribution, and the use of optimization theory and reinforcement learning for network control. diff --git a/_pages/about_einstein.md b/_pages/about_einstein.md index 0a1c4c0..e69de29 100644 --- a/_pages/about_einstein.md +++ b/_pages/about_einstein.md @@ -1,5 +0,0 @@ -Write your biography here. Tell the world about yourself. Link to your favorite [subreddit](https://www.reddit.com). You can put a picture in, too. The code is already in, just name your picture `prof_pic.jpg` and put it in the `img/` folder. - -Put your address / P.O. box / other info right below your picture. You can also disable any these elements by editing `profile` property of the YAML header of your `_pages/about.md`. Edit `_bibliography/papers.bib` and Jekyll will render your [publications page](/al-folio/publications/) automatically. - -Link to your social media connections, too. This theme is set up to use [Font Awesome icons](https://fontawesome.com/) and [Academicons](https://jpswalsh.github.io/academicons/), like the ones below. Add your Facebook, Twitter, LinkedIn, Google Scholar, or just disable all of them. diff --git a/_pages/blog.md b/_pages/blog.md index b8cdbd9..4af1fbb 100644 --- a/_pages/blog.md +++ b/_pages/blog.md @@ -2,7 +2,7 @@ layout: default permalink: /blog/ title: blog -nav: true +nav: false nav_order: 1 pagination: enabled: true diff --git a/_pages/cv.md b/_pages/cv.md index a197a36..cc5c827 100644 --- a/_pages/cv.md +++ b/_pages/cv.md @@ -1,12 +1,16 @@ --- -layout: cv +layout: page +title: cv permalink: /cv/ -title: CV nav: true -nav_order: 5 -cv_pdf: /assets/pdf/example_pdf.pdf # you can also use external links here -cv_format: rendercv # options: rendercv, jsonresume -description: This is a description of the page. You can modify it in '_pages/cv.md'. You can also change or remove the top pdf download button. -toc: - sidebar: left +nav_order: 3 --- + +
+ +
diff --git a/_pages/dropdown.md b/_pages/dropdown.md index dc4302e..d10c1b5 100644 --- a/_pages/dropdown.md +++ b/_pages/dropdown.md @@ -1,7 +1,7 @@ --- layout: page title: submenus -nav: true +nav: false nav_order: 8 dropdown: true children: diff --git a/_pages/profiles.md b/_pages/profiles.md index d7ca045..ad5b8bb 100644 --- a/_pages/profiles.md +++ b/_pages/profiles.md @@ -3,7 +3,7 @@ layout: profiles permalink: /people/ title: people description: members of the lab or group -nav: true +nav: false nav_order: 7 profiles: diff --git a/_pages/projects.md b/_pages/projects.md index e19d655..d29ad27 100644 --- a/_pages/projects.md +++ b/_pages/projects.md @@ -3,7 +3,7 @@ layout: page title: projects permalink: /projects/ description: A growing collection of your cool projects. -nav: true +nav: false nav_order: 3 display_categories: [work, fun] horizontal: false diff --git a/_pages/publications.md b/_pages/publications.md index 48027f8..3d3b626 100644 --- a/_pages/publications.md +++ b/_pages/publications.md @@ -2,7 +2,7 @@ layout: page permalink: /publications/ title: publications -description: publications by categories in reversed chronological order. generated by jekyll-scholar. +description: Publications in reverse chronological order. #generated by jekyll-scholar. nav: true nav_order: 2 --- diff --git a/_pages/repositories.md b/_pages/repositories.md index cba3870..8b263b0 100644 --- a/_pages/repositories.md +++ b/_pages/repositories.md @@ -3,7 +3,7 @@ layout: page permalink: /repositories/ title: repositories description: Edit the `_data/repositories.yml` and change the `github_users` and `github_repos` lists to include your own GitHub profile and repositories. -nav: true +nav: false nav_order: 4 --- diff --git a/_pages/teaching.md b/_pages/teaching.md index 94b7197..1505aa8 100644 --- a/_pages/teaching.md +++ b/_pages/teaching.md @@ -3,7 +3,7 @@ layout: page permalink: /teaching/ title: teaching description: Course materials, schedules, and resources for classes taught. -nav: true +nav: false nav_order: 6 calendar: true --- diff --git a/assets/json/resume.json b/assets/json/resume.json index 47544ed..346e9f9 100644 --- a/assets/json/resume.json +++ b/assets/json/resume.json @@ -78,10 +78,10 @@ { "language": "Hindi", "fluency": "Fluent" - } + }, { "language": "English", - "fluency": "Fluent", + "fluency": "Fluent" } ], "interests": [], diff --git a/assets/pdf/example_pdf.pdf b/assets/pdf/example_pdf.pdf deleted file mode 100644 index b1f80db..0000000 Binary files a/assets/pdf/example_pdf.pdf and /dev/null differ diff --git a/package-lock.json b/package-lock.json index 0036c3c..361a9c6 100644 --- a/package-lock.json +++ b/package-lock.json @@ -1,5 +1,5 @@ { - "name": "al-folio", + "name": "ankith-mohan.github.io", "lockfileVersion": 3, "requires": true, "packages": {