Media Summary: Nouédyn Baspin (The University of Sydney) Louis Golowich (UC Berkeley) Quantum Complexity: ... Louis Golowich (UC Berkeley) Advances in Quantum ...

Bounds On Qldpc Code Parameters - Detailed Analysis & Overview

Nouédyn Baspin (The University of Sydney) Louis Golowich (UC Berkeley) Quantum Complexity: ... Louis Golowich (UC Berkeley) Advances in Quantum ... Asymptotically Good Quantum and Locally Testable Classical LDPC Speaker: Vahid Nourozi (New Mexico State University) This is part of the Quantum Days 2024 , November 7- 8, 2024 ... Zhiyang (Sunny) He (MIT) Quantum Algorithms, Complexity, ...

This paper introduces the concept of 'intrinsic locality dimension' for quantum error-correcting Time: Oct 22, 2021 Speaker: Ting-Chun Lin (UCSD, HonHai QC) Title: Good Shai Evra; Tali Kaufman; Gilles Zemor Affiliations: IAS; Bar Ilan University; Bordeaux University. Hessam Mahdavifar (Northeastern University) ...

Photo Gallery

Bounds on qLDPC Code Parameters
NLTS Hamiltonians (and Strongly-Explicit SoS Lower Bounds) from Low-Rate Quantum LDPC Codes
Introduction to qLDPC Codes
STOC 2022 - Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
Quantum LDPC codes
Day 2:  Overcoming the Distance Barrier: QLDPC Codes with Linear Distance and Dimension
Extractors: Building a Quantum Computer with QLDPC Codes
Intrinsic Locality Dimension of Quantum Codes: Geometry-Free Bounds & Fault Tolerance
Barbell Codes: Practical qLDPC Codes for Superconducting Quantum Hardware
2021 1022 Good QLDPC code from lossless expanders
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expander
24 - Bounding Volume Hierarchies with a blazing fast implementation using Morton codes
View Detailed Profile
Bounds on qLDPC Code Parameters

Bounds on qLDPC Code Parameters

Nouédyn Baspin (The University of Sydney) https://simons.berkeley.edu/talks/nouedyn-baspin-university-sydney-2024-02-13 ...

NLTS Hamiltonians (and Strongly-Explicit SoS Lower Bounds) from Low-Rate Quantum LDPC Codes

NLTS Hamiltonians (and Strongly-Explicit SoS Lower Bounds) from Low-Rate Quantum LDPC Codes

Louis Golowich (UC Berkeley) https://simons.berkeley.edu/talks/louis-golowich-uc-berkeley-2024-03-20 Quantum Complexity: ...

Introduction to qLDPC Codes

Introduction to qLDPC Codes

Louis Golowich (UC Berkeley) https://simons.berkeley.edu/talks/louis-golowich-uc-berkeley-2024-02-12 Advances in Quantum ...

STOC 2022 - Asymptotically Good Quantum and Locally Testable Classical LDPC Codes

STOC 2022 - Asymptotically Good Quantum and Locally Testable Classical LDPC Codes

Asymptotically Good Quantum and Locally Testable Classical LDPC

Quantum LDPC codes

Quantum LDPC codes

Quantum LDPC

Day 2:  Overcoming the Distance Barrier: QLDPC Codes with Linear Distance and Dimension

Day 2: Overcoming the Distance Barrier: QLDPC Codes with Linear Distance and Dimension

Speaker: Vahid Nourozi (New Mexico State University) This is part of the Quantum Days 2024 , November 7- 8, 2024 ...

Extractors: Building a Quantum Computer with QLDPC Codes

Extractors: Building a Quantum Computer with QLDPC Codes

Zhiyang (Sunny) He (MIT) https://simons.berkeley.edu/talks/zhiyang-sunny-he-mit-2025-05-28 Quantum Algorithms, Complexity, ...

Intrinsic Locality Dimension of Quantum Codes: Geometry-Free Bounds & Fault Tolerance

Intrinsic Locality Dimension of Quantum Codes: Geometry-Free Bounds & Fault Tolerance

This paper introduces the concept of 'intrinsic locality dimension' for quantum error-correcting

Barbell Codes: Practical qLDPC Codes for Superconducting Quantum Hardware

Barbell Codes: Practical qLDPC Codes for Superconducting Quantum Hardware

Original Paper: Barbell

2021 1022 Good QLDPC code from lossless expanders

2021 1022 Good QLDPC code from lossless expanders

Time: Oct 22, 2021 Speaker: Ting-Chun Lin (UCSD, HonHai QC) Title: Good

Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expander

Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expander

Shai Evra; Tali Kaufman; Gilles Zemor Affiliations: IAS; Bar Ilan University; Bordeaux University.

24 - Bounding Volume Hierarchies with a blazing fast implementation using Morton codes

24 - Bounding Volume Hierarchies with a blazing fast implementation using Morton codes

In this tutorial I explain how

High-Rate Fair-Density Parity-Check Codes

High-Rate Fair-Density Parity-Check Codes

Hessam Mahdavifar (Northeastern University) ...