default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew B. Hastings
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j25]Jeongwan Haah
, Matthew B. Hastings, Robin Kothari, Guang Hao Low:
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. SIAM J. Comput. 52(6): S18-250 (2023)- 2022
- [j24]Jeongwan Haah, Matthew B. Hastings:
Boundaries for the Honeycomb Code. Quantum 6: 693 (2022) - 2021
- [j23]Lukasz Fidkowski, Jeongwan Haah, Matthew B. Hastings:
How Dynamical Quantum Memories Forget. Quantum 5: 382 (2021) - [j22]Jeongwan Haah, Matthew B. Hastings:
Measurement sequences for magic state distillation. Quantum 5: 383 (2021) - [j21]Nicolas Delfosse, Matthew B. Hastings:
Union-Find Decoders For Homological Product Codes. Quantum 5: 406 (2021) - [j20]Michael H. Freedman, Matthew B. Hastings, Modjtaba Shokrian Zini:
Symmetry Protected Quantum Computation. Quantum 5: 554 (2021) - [j19]Matthew B. Hastings, Jeongwan Haah:
Dynamically Generated Logical Qubits. Quantum 5: 564 (2021) - [j18]Matthew B. Hastings:
The Power of Adiabatic Quantum Computation with No Sign Problem. Quantum 5: 597 (2021) - 2020
- [j17]Matthew B. Hastings:
Classical and Quantum Algorithms for Tensor Principal Component Analysis. Quantum 4: 237 (2020) - 2019
- [j16]Matthew B. Hastings:
Classical and quantum bounded depth approximation algorithms. Quantum Inf. Comput. 19(13&14): 1116-1140 (2019) - 2018
- [j15]Matthew B. Hastings:
Local Maxima and Improved Exact Algorithm for MAX-2-SAT. Chic. J. Theor. Comput. Sci. 2018 (2018) - [j14]Jeongwan Haah, Matthew B. Hastings, David Poulin, Dave Wecker:
Magic state distillation at intermediate size. Quantum Inf. Comput. 18(1&2): 114-140 (2018) - 2017
- [j13]Matthew B. Hastings:
Turning gate synthesis errors into incoherent errors. Quantum Inf. Comput. 17(5&6): 488-494 (2017) - [j12]Matthew B. Hastings:
Small Majorana fermion codes. Quantum Inf. Comput. 17(13&14): 1191-1205 (2017) - [j11]Matthew B. Hastings:
Weight reduction for quantum codes. Quantum Inf. Comput. 17(15&16): 1307-1334 (2017) - 2016
- [j10]Matthew B. Hastings:
Random MERA states and the tightness of the Brandao-Horodecki entropy bound. Quantum Inf. Comput. 16(13&14): 1228-1252 (2016) - 2015
- [j9]Matthew B. Hastings, Dave Wecker, Bela Bauer, Matthias Troyer:
Improving quantum algorithms for quantum chemistry. Quantum Inf. Comput. 15(1-2): 1-21 (2015) - [j8]David Poulin, Matthew B. Hastings, Dave Wecker, Nathan Wiebe, Andrew C. Doberty, Matthias Troyer:
The Trotter step size required for accurate quantum simulation of quantum chemistry. Quantum Inf. Comput. 15(5&6): 361-384 (2015) - [j7]Matthew B. Hastings, Alan Geller:
Reduced space-time and time costs Ising dislocation codes and arbitrary ancillas. Quantum Inf. Comput. 15(11&12): 962-986 (2015) - 2014
- [j6]Michael H. Freedman, Matthew B. Hastings:
Quantum systems on non-k-hyperfinite complexes: a generalization of classical statistical mechanics on expander graphs. Quantum Inf. Comput. 14(1-2): 144-180 (2014) - [j5]Krysta M. Svore, Matthew B. Hastings, Michael H. Freedman:
Faster phase estimation. Quantum Inf. Comput. 14(3-4): 306-328 (2014) - [j4]Matthew B. Hastings:
Decoding in hyperbolic spaces: quantum LDPC codes with linear rate and efficient error correction. Quantum Inf. Comput. 14(13-14): 1187-1202 (2014) - 2013
- [j3]Matthew B. Hastings:
Trivial low energy states for commuting Hamiltonians, and the quantum PCP conjecture. Quantum Inf. Comput. 13(5-6): 393-429 (2013) - [j2]Matthew B. Hastings:
Obstructions to classically simulating the quantum adiabatic algorithm. Quantum Inf. Comput. 13(11-12): 1038-1076 (2013) - 2009
- [j1]Matthew B. Hastings, Aram W. Harrow:
Classical and quantum tensor product expanders. Quantum Inf. Comput. 9(3&4): 336-360 (2009)
Conference and Workshop Papers
- 2022
- [c6]Matthew B. Hastings, Ryan O'Donnell:
Optimizing strongly interacting fermionic Hamiltonians. STOC 2022: 776-789 - 2021
- [c5]Matthew B. Hastings, Jeongwan Haah, Ryan O'Donnell:
Fiber bundle codes: breaking the n1/2 polylog(n) barrier for Quantum LDPC codes. STOC 2021: 1276-1288 - [c4]András Gilyén, Matthew B. Hastings, Umesh V. Vazirani:
(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem. STOC 2021: 1357-1369 - 2018
- [c3]Jeongwan Haah, Matthew B. Hastings, Robin Kothari, Guang Hao Low:
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians. FOCS 2018: 350-360 - 2017
- [c2]Matthew B. Hastings:
Quantum Codes from High-Dimensional Manifolds. ITCS 2017: 25:1-25:26 - 2014
- [c1]Sergey Bravyi, Matthew B. Hastings:
Homological product codes. STOC 2014: 273-282
Informal and Other Publications
- 2021
- [i8]Michael H. Freedman, Matthew B. Hastings, Modjtaba Shokrian Zini:
Symmetry Protected Quantum Computation. CoRR abs/2105.04649 (2021) - [i7]Matthew B. Hastings, Ryan O'Donnell:
Optimizing Strongly Interacting Fermionic Hamiltonians. CoRR abs/2110.10701 (2021) - [i6]Matthew B. Hastings:
A Classical Algorithm Which Also Beats 1/2 + 2/π 1/√D For High Girth MAX-CUT. CoRR abs/2111.12641 (2021) - 2020
- [i5]Matthew B. Hastings, Jeongwan Haah, Ryan O'Donnell:
Fiber Bundle Codes: Breaking the N1/2 polylog(N) Barrier for Quantum LDPC Codes. CoRR abs/2009.03921 (2020) - 2019
- [i4]Matthew B. Hastings:
Classical and Quantum Algorithms for Tensor Principal Component Analysis. CoRR abs/1907.12724 (2019) - 2016
- [i3]Matthew B. Hastings:
Local Maxima and Improved Exact Algorithm for MAX-2-SAT. CoRR abs/1610.07100 (2016) - [i2]Matthew B. Hastings:
Local Maxima and Improved Exact Algorithm for MAX-2-SAT. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i1]Ilia N. Zintchenko, Matthew B. Hastings, Nathan Wiebe, Ethan Brown, Matthias Troyer:
Partial Reinitialisation for Optimisers. CoRR abs/1512.03025 (2015)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
