Matthew B. Hastings

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ryan O'Donnell

> Home > Persons > Matthew B. Hastings

Publications

2022
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/HastingsO22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/HastingsO22
Matthew B. Hastings, Ryan O'Donnell:
Optimizing strongly interacting fermionic Hamiltonians. STOC 2022: 776-789
2021
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/HastingsHO21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/HastingsHO21
Matthew B. Hastings, Jeongwan Haah, Ryan O'Donnell:
Fiber bundle codes: breaking the n^1/2 polylog(n) barrier for Quantum LDPC codes. STOC 2021: 1276-1288
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2110-10701
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2110-10701
Matthew B. Hastings, Ryan O'Donnell:
Optimizing Strongly Interacting Fermionic Hamiltonians. CoRR abs/2110.10701 (2021)
2020
[i5]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2009-03921
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2009-03921
Matthew B. Hastings, Jeongwan Haah, Ryan O'Donnell:
Fiber Bundle Codes: Breaking the N^1/2 polylog(N) Barrier for Quantum LDPC Codes. CoRR abs/2009.03921 (2020)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.