Esha Swaroop
@eshaspark.bsky.social
PhD student working in quantum error-correction at IQC & Perimeter Institute, Waterloo.
LDPC Logic gates started looking a lot more concrete -- explicit constructions with realistic overheads for near but interesting codes we know (BB, lifted product codes,..) coming soon.
November 5, 2025 at 4:47 AM
LDPC Logic gates started looking a lot more concrete -- explicit constructions with realistic overheads for near but interesting codes we know (BB, lifted product codes,..) coming soon.
Reposted by Esha Swaroop
Fault-tolerant logical measurement just got a lot faster!
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
October 17, 2025 at 5:36 AM
Fault-tolerant logical measurement just got a lot faster!
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
In new work, we show that code surgeries based on hypergraphs, rather than graphs, allow fast and parallel fault-tolerant logical measurements with low qubit overhead (without requiring the code to be single-shot).
arxiv.org/abs/2510.14895
Here are slides from our @qip2025.bsky.social talk on Logical gates on quantum LDPC codes by surgery / Universal Adapters. doi.org/10.5281/zenodo.14997472
March 10, 2025 at 4:56 AM
Here are slides from our @qip2025.bsky.social talk on Logical gates on quantum LDPC codes by surgery / Universal Adapters. doi.org/10.5281/zenodo.14997472
Reposted by Esha Swaroop
Thiago put together a nice plot summarizing how this result fits into other results about bounds of time/space overhead vs locality. In terms of this plot, the paper's goal was to put a circle in the O(1) column, but not in the "all" row.
February 25, 2025 at 9:24 AM
Thiago put together a nice plot summarizing how this result fits into other results about bounds of time/space overhead vs locality. In terms of this plot, the paper's goal was to put a circle in the O(1) column, but not in the "all" row.
Reposted by Esha Swaroop
Next week is QIP, which is the main conference in theoretical question information science. I am delighted that three of my group members have accepted talks: Paula Belzig, Esha Swaroop, and Peixue Wu.
With an acceptance rate of 20%, this is a big accomplishment for each of them!
With an acceptance rate of 20%, this is a big accomplishment for each of them!
February 20, 2025 at 2:15 PM
Next week is QIP, which is the main conference in theoretical question information science. I am delighted that three of my group members have accepted talks: Paula Belzig, Esha Swaroop, and Peixue Wu.
With an acceptance rate of 20%, this is a big accomplishment for each of them!
With an acceptance rate of 20%, this is a big accomplishment for each of them!
Reposted by Esha Swaroop
Interesting paper implementing magic state distillation with neutral atoms: arxiv.org/abs/2412.15165
They're in a weird regime: below the distillation threshold but over the color code threshold. They see improvements!... But hit a ceiling imposed by their d=3 memory error (because d=5 does worse).
They're in a weird regime: below the distillation threshold but over the color code threshold. They see improvements!... But hit a ceiling imposed by their d=3 memory error (because d=5 does worse).
Experimental Demonstration of Logical Magic State Distillation
Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error correcting codes, physi...
arxiv.org
December 20, 2024 at 8:47 AM
Interesting paper implementing magic state distillation with neutral atoms: arxiv.org/abs/2412.15165
They're in a weird regime: below the distillation threshold but over the color code threshold. They see improvements!... But hit a ceiling imposed by their d=3 memory error (because d=5 does worse).
They're in a weird regime: below the distillation threshold but over the color code threshold. They see improvements!... But hit a ceiling imposed by their d=3 memory error (because d=5 does worse).
Reposted by Esha Swaroop
We've been getting a lot of questions about alternate QEC codes, and are we looking into any? Yes! Here's experiments for two on Willow.
The color code: arxiv.org/abs/2412.14256
Dynamic surface codes: arxiv.org/abs/2412.14360
The color code: arxiv.org/abs/2412.14256
Dynamic surface codes: arxiv.org/abs/2412.14360
Scaling and logic in the color code on a superconducting quantum processor
Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correctio...
arxiv.org
December 20, 2024 at 4:05 AM
We've been getting a lot of questions about alternate QEC codes, and are we looking into any? Yes! Here's experiments for two on Willow.
The color code: arxiv.org/abs/2412.14256
Dynamic surface codes: arxiv.org/abs/2412.14360
The color code: arxiv.org/abs/2412.14256
Dynamic surface codes: arxiv.org/abs/2412.14360
Reposted by Esha Swaroop
👋 Anyone need some codes? We've got 566 classical & quantum codes.
October 10, 2023 at 7:49 AM
👋 Anyone need some codes? We've got 566 classical & quantum codes.
@quantumearl.bsky.social A question: maybe i'm missing something obvious, but confinement and soundness like the same thing here? 🙈 As I understand it, they both involve a proportionality between the weight of the syndrome (perhaps addnl wrapped as input to a function) and the weight of the error.
November 24, 2024 at 3:47 PM
@quantumearl.bsky.social A question: maybe i'm missing something obvious, but confinement and soundness like the same thing here? 🙈 As I understand it, they both involve a proportionality between the weight of the syndrome (perhaps addnl wrapped as input to a function) and the weight of the error.
Sharing our work "Universal adapters for quantum LDPC codes" posted today to arxiv arxiv.org/abs/2410.03628
We provide a flexible tool to enable joint measurements between logical operators in arbitrary LDPC codes, and also a variant to implement targeted CNOT gates using Dehn twists.
We provide a flexible tool to enable joint measurements between logical operators in arbitrary LDPC codes, and also a variant to implement targeted CNOT gates using Dehn twists.
Universal adapters between quantum LDPC codes
We propose the repetition code adapter as a way to perform joint logical Pauli measurements within a quantum low-density parity check (LDPC) codeblock or between separate such codeblocks. This adapter...
arxiv.org
October 7, 2024 at 9:33 AM
Sharing our work "Universal adapters for quantum LDPC codes" posted today to arxiv arxiv.org/abs/2410.03628
We provide a flexible tool to enable joint measurements between logical operators in arbitrary LDPC codes, and also a variant to implement targeted CNOT gates using Dehn twists.
We provide a flexible tool to enable joint measurements between logical operators in arbitrary LDPC codes, and also a variant to implement targeted CNOT gates using Dehn twists.
Reposted by Esha Swaroop
Wonderful article by @benbenbrubaker.bsky.social on the recent breakthrough result of Pravesh Kothari and Peter Manohar on locally correctable codes (LCCs). Even beyond this result, one of the best expositions of error-correcting codes I've read!
www.quantamagazine.org/magical-erro...
www.quantamagazine.org/magical-erro...
‘Magical’ Error Correction Scheme Proved Inherently Inefficient | Quanta Magazine
Locally correctable codes need barely any information to fix errors, but they’re extremely long. Now we know that the simplest versions can’t get any shorter.
www.quantamagazine.org
January 9, 2024 at 9:31 PM
Wonderful article by @benbenbrubaker.bsky.social on the recent breakthrough result of Pravesh Kothari and Peter Manohar on locally correctable codes (LCCs). Even beyond this result, one of the best expositions of error-correcting codes I've read!
www.quantamagazine.org/magical-erro...
www.quantamagazine.org/magical-erro...
Reposted by Esha Swaroop
Apply for a faculty position in quantum computing at the University of Waterloo’s School of Computer Science & Institute for Quantum Computing. Deadline December 22.
uwaterloo.ca/institute-fo...
uwaterloo.ca/institute-fo...
Assistant Professor – Quantum Information / Computer Science | Institute for Quantum Computing
The David R. Cheriton School of Computer Science and the Institute for Quantum Computing (IQC) at the University of Waterloo
uwaterloo.ca
December 5, 2023 at 10:05 PM
Apply for a faculty position in quantum computing at the University of Waterloo’s School of Computer Science & Institute for Quantum Computing. Deadline December 22.
uwaterloo.ca/institute-fo...
uwaterloo.ca/institute-fo...
Reposted by Esha Swaroop
There are at least three mathematical ways of quantifying how “quantum” a computation may be, but there doesn't appear to be one quantum metric to rule them all. www.quantamagazine.org/the-quest-to...
The Quest to Quantify Quantumness | Quanta Magazine
What makes a quantum computer more powerful than a classical computer? It’s a surprisingly subtle question that physicists are still grappling with, decades into the quantum age.
www.quantamagazine.org
October 19, 2023 at 2:48 PM
There are at least three mathematical ways of quantifying how “quantum” a computation may be, but there doesn't appear to be one quantum metric to rule them all. www.quantamagazine.org/the-quest-to...
Reposted by Esha Swaroop
Do you want to correct a quantum code? Do you like tensor networks? Do you live in 3D? Well I have the paper for you! scirate.com/arxiv/2310.1...
Tensor Network Decoding Beyond 2D
Decoding algorithms based on approximate tensor network contraction have proven tremendously successful in decoding 2D local quantum codes such as surface/toric codes and color codes, effectively achi
scirate.com
October 18, 2023 at 3:16 AM
Do you want to correct a quantum code? Do you like tensor networks? Do you live in 3D? Well I have the paper for you! scirate.com/arxiv/2310.1...