Built with Drupal, hosted on Cloudflare. Domain registered in 2024.
ronakr.com is built with Drupal, hosted on Cloudflare. It measures traffic with Cloudflare Web Analytics.
| Technology | Version | First seen |
|---|---|---|
| CMS & Site Builders1 | ||
| – | 9 Nov 2026 | |
| Web Servers, Languages & Backend Frameworks1 | ||
| – | 9 Nov 2026 | |
| CDN & Hosting1 | ||
| – | 9 Nov 2026 | |
| Analytics & Tag Management1 | ||
| – | 9 Nov 2026 | |
| Fonts & Icon Fonts1 | ||
| – | 9 Nov 2026 | |
| Security, WAF & Bot Protection3 | ||
| – | 9 Nov 2026 | |
Registration from the registry's RDAP record, the certificate the site serves, and its rank in public traffic lists.
The crew hasn’t read this site’s colors yet. We read a palette when we capture a site’s screenshot, busiest sites first. Meanwhile, browse palettes from other sites.
Counted from every stack change we've recorded: of the sites we watched running one of this site's tools, how many went on to add another. A pattern across sites, not a forecast for this one.
aisha.ns.cloudflare.combeau.ns.cloudflare.com# As a condition of accessing this website, you agree to abide by the following # content signals: # (a) If a Content-Signal = yes, you may collect content for the corresponding # use. # (b) If a Content-Signal = no, you may not collect content for the # corresponding use. # (c) If the website operator does not include a Content-Signal for a # corresponding use, the website operator neither grants nor restricts # permission via Content-Signal with respect to the corresponding use. # The content signals and their meanings are: # search: building a search index and providing search results (e.g., returning # hyperlinks and short excerpts from your website's contents). Search does not # include providing AI-generated search summaries. # ai-input: inputting content into one or more AI models (e.g., retrieval # augmented generation, grounding, or other real-time taking of content for # generative AI search answers). # ai-train: training or fine-tuning AI models. # use: how AI systems may consume the content (immediate, reference, or full). # ANY RESTRICTIONS EXPRESSED VIA CONTENT SIGNALS ARE EXPRESS RESERVATIONS OF # RIGHTS UNDER ARTICLE 4 OF THE EUROPEAN UNION DIRECTIVE 2019/790 ON COPYRIGHT # AND RELATED RIGHTS IN THE DIGITAL SINGLE MARKET. # BEGIN Cloudflare Managed content User-agent: * Content-Signal: search=yes,ai-train=no,use=reference Allow: / # Training crawlers User-agent: Amazonbot Disallow: / User-agent: Applebot-Extended Disallow: / User-agent: Bytespider Disallow: / User-agent: CCBot Disallow: / User-agent: ClaudeBot Disallow: / User-agent: Diffbot Disallow: / User-agent: Google-Extended Disallow: / User-agent: GPTBot Disallow: / User-agent: omgili Disallow: / User-agent: anthropic-ai Disallow: / User-agent: Claude-Web Disallow: / User-agent: cohere-ai Disallow: / User-agent: MistralAI-Training Disallow: / User-agent: meta-externalagent Disallow: / User-agent: GoogleOther Disallow: / User-agent: Baiduspider Disallow: / User-agent: PetalBot Disallow: / User-agent: AwarioSmartBot User-agent: AwarioRssBot Disallow: / User-agent: Google-CloudVertexBot Disallow: / User-agent: QualifiedBot Disallow: / User-agent: Cotoyogi Disallow: / User-agent: ICC-Crawler Disallow: / User-agent: atlassian-bot Disallow: / User-agent: FishBot Disallow: / User-agent: BorderxBot Disallow: / User-agent: NavuBot Disallow: / User-agent: SemrushBot-SWA Disallow: / User-agent: WARDBot Disallow: / User-agent: magpie-crawler Disallow: / User-agent: KimiBot Disallow: / User-agent: CitibotSiteCrawler Disallow: / # END Cloudflare Managed Content <!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>Ronak Ramachandran</title> <link rel="stylesheet" href="style.css?v=1.1"> <link rel="apple-touch-icon" sizes="180x180" href="apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="favicon-16x16.png"> <link rel="manifest" href="site.webmanifest"> <base target="_blank"> <script src="index.js?v=1.1"></script> <script src="redirect.js"></script> </head> <body> <div class="spacer"></div> <div class="container"> <div class="flexheader"> <div><img src="orangejulius.png" alt="Ronak Ramachandran" class="headshot"></div> <div> <h1>Ronak Ramachandran</h1> <p class="infoline"> <a href="mailto:ronakr@utexas.edu">ronakr@utexas.edu</a> | <a href="https://scholar.google.com/citations?user=9bdK4doAAAAJ&hl=en">Google Scholar</a> | <a href="https://drive.google.com/file/d/1xt6Xu7PYazGeRS6QlCNOHtnw9ipMfDDn/view?usp=sharing">CV</a> <!-- | GDC 4.408C --> </p> <p class="blurb"> I'm a fourth-year computer science PhD student at the University of Texas at Austin, advised by <a href="https://scottaaronson.com/">Scott Aaronson</a>. My research interests include quantum complexity theory, cryptography, and algorithms. I am affiliated with UT's <a href="https://www.cs.utexas.edu/act">Theory Group</a> and <a href="https://www.cs.utexas.edu/~qic/">Quantum Information Center</a>, and I am supported by an <a href="https://nsfgrfp.org/">NSF Graduate Research Fellowship</a>. </p> </div> </div> <h2>Prior Education</h2> <b>University of Texas at Austin</b> (2019-23) <div class="indented"> • B.S. in Computer Science Honors (Turing Scholars Honors Program) <br> • B.S. in Mathematics <br> • Certificates: Quantum Information Science, Core Texts and Ideas (Jefferson Scholars Program) </div> <h2>Research</h2> <p>Click on <button class="toggle-all-btn" onclick="toggleAll()">▶</button> to see a <span class="tagline">one-line synopsis for experts</span> followed by an explanation in layman's terms.</p> <div class="pub" onclick="togglePub(this)"> <div class="pub-header"> <button class="toggle-btn"></button> <div> <div class="pub-title"><a href="https://arxiv.org/pdf/2610.01025"><b>Device-Independent Conference Keys from Parity-Extended Games</b></a></div> <div class="pub-authors"> <a href="https://sites.google.com/view/suvradip/">Suvradip Chakraborty</a>, <b>Ronak Ramachandran</b>, <a href="https://aniruddhasen.github.io/">Aniruddha Sen</a>. <a class="resource" href="https://arxiv.org/abs/2610.01025">arXiv</a> </div> </div> </div> <div class="pub-description"> <div class="tagline"> We devise a method to extend certain two-player non-local games to many players and use it to design a high key rate device-independent multi-party Quantum Key Distribution (QKD) protocol based on the Mermin-Peres magic square game. </div> <div class="vspace"></div> One way to share secret messages with many friends is to place messages in a lockbox that only you and your friends have the keys to. Over the internet, we use virtual lockboxes and keys, made of 0's and 1's. If you and your friends can't physically meet up, <i>how can you privately share keys over the internet?</i> <div class="vspace"></div> Quantum computers provide one solution: <b>entanglement</b>. If many quantum devices are entangled, then the data stored in all of them will be identical and can be used as a shared key. Still, how can we be sure no nosy eavesdropper learns the key, not even the company that sold you and your friends the entangled quantum devices? <div class="vspace"></div> The trick is <b>non-local games</b>. Similar to how cops force criminals to be honest by separating them, a non-local game forces its separated players to use entanglement to coordinate their stories. If you and your friends cleverly make your quantum devices play a non-local game many times, then the devices are forced to use entanglement in a way that gives you and your friends private keys along the way. <div class="vspace"></div> Two-player games are easy to study, but many-player games are hard. We give a general method to turn certain two-player games into many-player games that are useful for sharing keys. If low-error quantum devices exist, our key-sharing protocol based on our new many-player version of the <a href="https://en.wikipedia.org/wiki/Quantum_pseudo-telepathy">magic square game</a> requires playing fewer rounds than the <a href="https://arxiv.org/abs/1708.00798">previous best protocol</a>. </div> </div> <div class="pub" onclick="togglePub(this)"> <div class="pub-header"> <button class="toggle-btn"></button> <div> <div class="pub-title"><a href="https://arxiv.org/pdf/2509.01945"><b>Quantum Statistical Witness Indistinguishability</b></a></div> <div class="pub-authors"> <a href="https://sites.google.com/view/shafiknassar/bio">Shafik Nassar</a>, <b>Ronak Ramachandran</b>. <a class="resource" href="files/QIP 2026 QSWI Poster.pdf">poster, QIP '26</a> <a class="resource" href="https://arxiv.org/abs/2509.01945">arXiv</a> </div> </div> </div> <div class="pub-description"> <div class="tagline"> We define and initiate the study of Quantum Statistical Witness Indistinguishability (QSWI), the class of NP problems with quantum interactive proofs where the prover doesn't reveal which witness they know to the verifier. </div> <div class="vspace"></div> This is a paper in <b>quantum cryptography</b>, the study of communicating without revealing secrets in a world with quantum computers. Consider the following scenario: <div class="vspace"></div> <b>Ms. Prover</b> is a class-action lawyer representing thousands of customers who have supposedly witnessed the company <b>InstanceCorp</b> doing evil. <b>Mr. Verifier</b> is a righteous, logical, but skeptical juror whose vote will decide the case. Through a conversation* with Mr. Verifier, Ms. Prover needs to convince Mr. Verifier that InstanceCorp is guilty without revealing the identity of her main witness, the <b>Lead Plaintiff</b>, who brought the case to her on condition of anonymity. <div class="vspace"></div> When can Ms. Prover convince Mr. Verifier that InstanceCorp is guilty without revealing which witness is the Lead Plaintiff? This is essentially the question behind the study of <a href="https://eprint.iacr.org/2023/754.pdf">Statistical Witness Indistinguishability (SWI)</a>. In this paper, we introduce and initiate the study of <b><i>Quantum</i> Statistical Witness Indistinguishability (QSWI)</b>, the case when Ms. Prover and Mr. Verifier each have their own quantum computers and can exchange quantum information. <div class="vspace"></div> We show that if Ms. Prover could convince Mr. Verifier with a long conversation, then she could convince him with a three-message conversation. No one knows how to accomplish this when Ms. Prover and Mr. Verifier don't have quantum computers. We also show that if Ms. Prover could convince Mr. Verifier that she has many credible witnesses without revealing all their identities, then she could convince Mr. Verifier that InstanceCorp is guilty without revealing which witness is her Lead Plaintiff. <div class="vspace"></div> <div class="footnote"> * In the US, it's <a href="https://www.lawshelf.com/coursewarecontentview/communication-with-jurors">illegal</a> for a lawyer to directly interact with a juror, but the courtroom setting here is just relatable <a href="https://en.wikipedia.org/wiki/Flavor_text">flavor text</a> for the abstract scenario we consider. </div> </div> </div> <div class="pub" onclick="togglePub(this)"> <div class="pub-header"> <button class="toggle-btn"></button> <div> <div class="pub-title"><a href="https://arxiv.org/pdf/2504.03620"><b>Quantum Search with In-Place Queries</b></a></div> <div class="pub-authors"> <a href="https://blake-holman.github.io/">Blake Holman</a>, <b>Ronak Ramachandran</b>, <a href="https://www.justinyirka.com/">Justin Yirka</a>. <a class="resource" href="https://doi.org/10.4230/LIPIcs.TQC.2025.1">TQC '25</a> <a class="resource" href="https://www.youtube.com/watch?v=sKCdy3ZWLQA">video</a> <a class="resource" href="files/rpe.html">slides</a> <a class="resource" href="https://arxiv.org/abs/2504.03620">arXiv</a> </div> </div> </div> <div class="pub-description"> <div class="tagline"> We design a quantum algorithm to invert a permutation over N items using <span class="nowrap">√<span class="sqrt">N</span></span> in-place queries, and we identify some tasks requiring more in-place queries than standard XOR queries. </div> <div class="vspace"></div> Like a game of <a href="https://en.wikipedia.org/wiki/Twenty_questions">20 Questions</a>, the <b>query complexity</b> of a problem is the number of questions (queries) about the problem's input that must be answered to find a solution. Changing how we ask questions and receive answers, known as the <b>query model</b>, can sometimes change how many questions are needed. <div class="vspace"></div> Consider the following problem in query complexity, called <b>Permutation Inversion</b>: a magician shuffles a deck of N cards numbered <b>1</b> to <b>N</b>. Your goal is to find the position of <b>1</b> using as few queries as possible, but you can only query by handing the magician a chalkboard with a number x which she returns after writing the value of the card at position x. <div class="vspace"></div> Without a quantum computer, you might need N queries to solve this problem, since <b>1</b> could be the last card you check. However, with a quantum computer, <!-- the ability to query in superposition means --> it might matter how the magician responds. When she writes down her answer next to your query, that's called a <b>standard XOR query</b>. When she erases your query to write her answer, that's called an <b>in-place query</b>. <div class="vspace"></div> Some problems are known to require far fewer in-place queries than standard queries, and before our work, no task was known to require more in-place queries than standard queries, seeming to suggest in-place queries are more powerful than standard queries. Despite this, researchers believed that standard queries might outperform in-place queries for some problems, and researchers conjectured that Permutation Inversion was an example. <div class="vspace"></div> We refuted this conjecture by designing an algorithm for Permutation Inversion using <span class="nowrap">√<span class="sqrt">N</span></span> in-place queries. However, we also came up with tasks that require far <i>more</i> in-place queries than standard queries, showing that the two query models are better suited for different tasks. <div class="vspace"></div> For the <a href="files/InPlaceSearch.html">slides</a> that I presented at <a href="https://tqc-conference.org/">TQC 2025</a>, I used <a href="https://www.manim.community/">manim</a> and <a href="https://www.manim.community/plugin/manim-slides/">manim-slides</a>. Check out my code <a href="https://github.com/ironak/quantum-search-in-place-slides">here</a>! </div> </div> <div class="pub" onclick="togglePub(this)"> <div class="pub-header"> <button class="toggle-btn"></button> <div> <div class="pub-title"><a href="https://arxiv.org/pdf/2403.02543"><b>PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements</b></a></div> <div class="pub-authors"> <a href="https://www.scottaaronson.com/">Scott Aaronson</a>, <a href="https://sabeegrewal.com/">Sabee Grewal</a>, <a href="https://vishnuiyer.org/">Vishnu Iyer</a>, <a href="https://www.universiteitleiden.nl/en/staffmembers/simon-marshall">Simon C. Marshall</a>, <b>Ronak Ramachandran</b>. <a class="resource" href="https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.3">FSTTCS '25</a> <a class="resource" href="https://arxiv.org/abs/2403.02543">arXiv</a> </div> </div> </div> <div class="pub-description"> <div class="tagline"> We show that problems with solutions that can be verified by classical computers in exponential time (NEXP) can also be verified in polynomial time by quantum computers augmented with the ability to make non-collapsing measurements (PDQMA) or the ability to inspect the history of a hidden variable (DQMA). </div> <div class="vspace"></div> Imagine you're given a huge crossword. Because each clue could have many valid answers, solving the crossword might seem difficult, but if you were given a solved copy, you probably could check it pretty quickly. A <a href="https://en.wikipedia.org/wiki/P_versus_NP_problem">central goal</a> of theoretical computer science is to prove differences between the resources required to <i>solve</i> problems and the resources required to <i>check</i> their solutions. Proving a difference between what quantum computers can solve and what they can check has been an open problem for <a href="https://arxiv.org/abs/quant-ph/0210077">over 25 years</a>. Unable to resolve this problem, some researchers began considering how a couple slight modifications to physics might affect the answer: <ol> <li> In quantum mechanics, observation is a destructive action: when we measure a quantum state, it changes. What if quantum computers could measure non-destructively? </li> <li> <a href="https://einsteinpapers.press.princeton.edu/vol15-trans/437">Some early quantum physicists</a> were unsettled by the idea that quantum measurement outcomes are probabilistic. To avoid this randomness, many argued for alternative laws of physics, called <a href="https://en.wikipedia.org/wiki/Hidden-variable_theory">hidden variable theories</a>, where perceived randomness was explained away by an underlying truth we could never access. What if quantum computers had access to the entire history of such an underlying truth? </li> </ol> <a href="https://arxiv.org/abs/1412.6507">Prior work</a> establishes that the above modifications each only slightly improve how quickly quantum computers <i>solve</i> problems. In this work, we show that with these modifications, quantum computers quickly <i>check</i> problems that classical computers can't check quickly. </div> </div> <div class="pub" onclick="togglePub(this)"> <div class="pub-header"> <button class="toggle-btn"></button> <div> <div class="pub-title"><a href="https://apps.cs.utexas.edu/apps/sites/default/files/tech_reports/tbd_0.pdf"><b>Topological Bulk Discretization</b></a></div> <div class="pub-authors"> <a href="https://ecs.syracuse.edu/faculty-staff/jason-pollack">Jason Pollack</a>, <b>Ronak Ramachandran</b>. <a class="resource" href="https://apps.cs.utexas.edu/apps/tech-reports/199506">UT Tech Reports '23</a> <a class="resource" href="files/QIP 2024 DBRP Poster.pdf">poster, QIP '24</a> </div> </div> </div> <div class="pub-description"> <div class="tagline"> This is my undergraduate Turing Scholar's Honors thesis. With guidance from Scott Aaronson and Jason Pollack, I extended <a href="https://arxiv.org/abs/2210.15601">their work</a> in quantum gravity on the <b>Discrete Bulk Reconstruction Problem</b>. </div> <div class="vspace"></div> Quantum gravity is the study of possible ways to resolve inconsistencies between quantum mechanics and Einstein's theory of relativity. One <a href="https://en.wikipedia.org/wiki/Holographic_principle">well-studied approach</a> shows how a D-dimensional spacetime with a certain kind of gravity, called <b><i>the bulk</i></b>, can be equated with a (D-1)-dimensional spacetime with a certain kind of quantum mechanics, called the <b><i>the boundary</i></b>. The <b>Bulk Reconstruction Problem</b> is the task of describing the bulk given information about the boundary. Aaronson and Pollack designed algorithms solving this problem in the special case when we think of the bulk and boundary as split up into <b>discrete</b> cells instead of being continuous spacetimes. <div class="vspac
| – |
| 9 Nov 2026 |
| – | 9 Nov 2026 |