Zobrazeno 1 - 10
of 227
pro vyhledávání: '"Hastings, M. B."'
Autor:
Hastings, M. B.
We answer two questions regarding the sum-of-squares for the SYK model left open in Ref. 1, both of which are related to graphs. First (a "limitation"), we show that a fragment of the sum-of-squares, in which one considers commutation relations of de
Externí odkaz:
http://arxiv.org/abs/2402.14752
Autor:
Hastings, M. B.
We consider some questions related to codes constructed using various graphs, in particular focusing on graphs which are not lattices in two or three dimensions. We begin by considering Floquet codes which can be constructed using ``emergent fermions
Externí odkaz:
http://arxiv.org/abs/2308.10264
Autor:
Freedman, M. H., Hastings, M. B.
Quantum information is about the entanglement of states. To this starting point we add parameters whereby a single state becomes a non-vanishing section of a bundle. We consider through examples the possible entanglement patterns of sections.
Co
Co
Externí odkaz:
http://arxiv.org/abs/2304.01072
Autor:
Hastings, M. B.
This is a collection of various result and notes, addressing the sum-of-squares hierarchy for spin and fermion systems using some ideas from quantum field theory, including higher order perturbation theory, critical phenomena, nonlocal coupling in ti
Externí odkaz:
http://arxiv.org/abs/2302.14006
Autor:
Hastings, M. B.
We give a general procedure for weight reducing quantum codes. This corrects a previous work\cite{owr}, and introduces a new technique that we call "coning" to effectively induce high weight stabilizers in an LDPC code. As one application, any LDPC c
Externí odkaz:
http://arxiv.org/abs/2102.10030
Autor:
Hastings, M. B.
This is a personal history of the Hastings-Michalakis proof of quantum Hall conductance quantization.
Comment: 3 pages
Comment: 3 pages
Externí odkaz:
http://arxiv.org/abs/2009.01645
Autor:
Hastings, M. B.
Publikováno v:
Quantum 5, 597 (2021)
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
Comment: 22 pages, 2 figures; v2 final version in Quantum
Comment: 22 pages, 2 figures; v2 final version in Quantum
Externí odkaz:
http://arxiv.org/abs/2005.03791
Autor:
Hastings, M. B.
Publikováno v:
Quantum 4, 237 (2020)
We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical spectral a
Externí odkaz:
http://arxiv.org/abs/1907.12724
Autor:
Hastings, M. B.
We consider some classical and quantum approximate optimization algorithms with bounded depth. First, we define a class of "local" classical optimization algorithms and show that a single step version of these algorithms can achieve the same performa
Externí odkaz:
http://arxiv.org/abs/1905.07047
Autor:
Hastings, M. B.
Publikováno v:
Quantum 3, 201 (2019)
We consider classical and quantum algorithms which have a duality property: roughly, either the algorithm provides some nontrivial improvement over random or there exist many solutions which are significantly worse than random. This enables one to gi
Externí odkaz:
http://arxiv.org/abs/1904.13339