arXiv subjects

Matthew B. Hastings

Publications and source records attributed to Matthew B. Hastings.

At least 55 records · Page 3Linked to original sources

arXiv2018

Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates

We present several different codes and protocols to distill $T$, controlled-$S$, and Toffoli (or $CCZ$) gates. One construction is based on codes that generalize the triorthogonal codes, allowing any of these gates to be induced at the logical level by transversal $T$. We present a randomized construction of generalized triorthogonal codes obtaining an asymptotic distillation efficiency $γ\rightarrow 1$. We also present a Reed-Muller based construction of these codes which obtains a worse $γ$ but performs well at small sizes. Additionally, we present protocols based on checking the stabilizers of $CCZ$ magic states at the logical level by transversal gates applied to codes; these protocols generalize the protocols of 1703.07847. Several examples, including a Reed-Muller code for $T$-to-Toffoli distillation, punctured Reed-Muller codes for $T$-gate distillation, and some of the check based protocols, require a lower ratio of input gates to output gates than other known protocols at the given order of error correction for the given code size. In particular, we find a $512$ T-gate to $10$ Toffoli gate code with distance $8$ as well as triorthogonal codes with parameters $[[887,137,5]],[[912,112,6]],[[937,87,7]]$ with very low prefactors in front of the leading order error terms in those codes.

quant-ph↗

arXiv2017

Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count

We present an infinite family of protocols to distill magic states for $T$-gates that has a low space overhead and uses an asymptotic number of input magic states to achieve a given target error that is conjectured to be optimal. The space overhead, defined as the ratio between the physical qubits to the number of output magic states, is asymptotically constant, while both the number of input magic states used per output state and the $T$-gate depth of the circuit scale linearly in the logarithm of the target error $δ$ (up to $\log \log 1/δ$). Unlike other distillation protocols, this protocol achieves this performance without concatenation and the input magic states are injected at various steps in the circuit rather than all at the start of the circuit. The protocol can be modified to distill magic states for other gates at the third level of the Clifford hierarchy, with the same asymptotic performance. The protocol relies on the construction of weakly self-dual CSS codes with many logical qubits and large distance, allowing us to implement control-SWAPs on multiple qubits. We call this code the "inner code". The control-SWAPs are then used to measure properties of the magic state and detect errors, using another code that we call the "outer code". Alternatively, we use weakly-self dual CSS codes which implement controlled Hadamards for the inner code, reducing circuit depth. We present several specific small examples of this protocol.

quant-ph↗

arXiv2017

Magic State Distillation at Intermediate Size

Recently we proposed a family of magic state distillation protocols that obtains asymptotic performance that is conjectured to be optimal. This family depends upon several codes, called "inner codes" and "outer codes." We presented some small examples of these codes as well as an analysis of codes in the asymptotic limit. Here, we analyze such protocols in an intermediate size regime, using hundreds to thousands of qubits. We use BCH inner codes, combined with various outer codes. We extend our protocols by adding error correction in some cases. We present a variety of protocols in various input error regimes; in many cases these protocols require significantly fewer input magic states to obtain a given output error than previous protocols.

quant-ph↗

arXiv2017

Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes

We present designs for scalable quantum computers composed of qubits encoded in aggregates of four or more Majorana zero modes, realized at the ends of topological superconducting wire segments that are assembled into superconducting islands with significant charging energy. Quantum information can be manipulated according to a measurement-only protocol, which is facilitated by tunable couplings between Majorana zero modes and nearby semiconductor quantum dots. Our proposed architecture designs have the following principal virtues: (1) the magnetic field can be aligned in the direction of all of the topological superconducting wires since they are all parallel; (2) topological $T$-junctions are not used, obviating possible difficulties in their fabrication and utilization; (3) quasiparticle poisoning is abated by the charging energy; (4) Clifford operations are executed by a relatively standard measurement: detection of corrections to quantum dot energy, charge, or differential capacitance induced by quantum fluctuations; (5) it is compatible with strategies for producing good approximate magic states.

cond-mat.mes-hall↗

arXiv2016

Double semions in arbitrary dimension

We present a generalization of the double semion topological quantum field theory to higher dimensions, as a theory of $d-1$ dimensional surfaces in a $d$ dimensional ambient space. We construct a local Hamiltonian which is a sum of commuting projectors and analyze the excitations and the ground state degeneracy. Defining a consistent set of local rules requires the sign structure of the ground state wavefunction to depend not just on the number of disconnected surfaces, but also upon their higher Betti numbers through the semicharacteristic. For odd $d$ the theory is related to the toric code by a local unitary transformation, but for even $d$ the dimension of the space of zero energy ground states is in general different from the toric code and for even $d>2$ it is also in general different from that of the twisted $Z_2$ Dijkgraaf-Witten model.

quant-ph↗

arXiv2016

Optimal Circuit-Level Decoding for Surface Codes

Surface codes exploit topological protection to increase error resilience in quantum computing devices and can in principle be implemented in existing hardware. They are one of the most promising candidates for active error correction, not least due to a polynomial-time decoding algorithm which admits one of the highest predicted error thresholds. We consider the dependence of this threshold on underlying assumptions including different noise models, and analyze the performance of a minimum weight perfect matching (MWPM) decoding compared to a mathematically optimal maximum likelihood (ML) decoding. Our ML algorithm tracks the success probabilities for all possible corrections over time and accounts for individual gate failure probabilities and error propagation due to the syndrome measurement circuit. We present the very first evidence for the true error threshold of an optimal circuit level decoder, allowing us to draw conclusions about what kind of improvements are possible over standard MWPM.

quant-ph↗

arXiv2016

Hybrid quantum-classical approach to correlated materials

Recent improvements in control of quantum systems make it seem feasible to finally build a quantum computer within a decade. While it has been shown that such a quantum computer can in principle solve certain small electronic structure problems and idealized model Hamiltonians, the highly relevant problem of directly solving a complex correlated material appears to require a prohibitive amount of resources. Here, we show that by using a hybrid quantum-classical algorithm that incorporates the power of a small quantum computer into a framework of classical embedding algorithms, the electronic structure of complex correlated materials can be efficiently tackled using a quantum computer. In our approach, the quantum computer solves a small effective quantum impurity problem that is self-consistently determined via a feedback loop between the quantum and classical computation. Use of a quantum computer enables much larger and more accurate simulations than with any known classical algorithm, and will allow many open questions in quantum materials to be resolved once a small quantum computer with around one hundred logical qubits becomes available.

quant-ph↗

arXiv2015

Nonzero temperature Entanglement Negativity of quantum spin models: Area law, Linked Cluster Expansions and Sudden Death

We show that the bipartite logarithmic entanglement negativity (EN) of quantum spin models obeys an area law at all nonzero temperatures. We develop numerical linked cluster (NLC) expansions for the `area-law' logarithmic entanglement negativity as a function of temperature and other parameters. For one-dimensional models the results of NLC are compared with exact diagonalization on finite systems and are found to agree very well. The NLC results are also obtained for two dimensional XXZ and transverse-field Ising models. In all cases, we find a sudden onset (or sudden death) of negativity at a finite temperature above which the negativity is zero. We use perturbation theory to develop a physical picture for this sudden onset (or sudden death). The onset of EN or its magnitude are insensitive to classical finite-temperature phase transitions, supporting the argument for absence of any role of quantum mechanics at such transitions. On approach to a quantum critical point at $T=0$, negativity shows critical scaling in size and temperature.

cond-mat.stat-mech↗

arXiv2015

Solving strongly correlated electron models on a quantum computer

One of the main applications of future quantum computers will be the simulation of quantum models. While the evolution of a quantum state under a Hamiltonian is straightforward (if sometimes expensive), using quantum computers to determine the ground state phase diagram of a quantum model and the properties of its phases is more involved. Using the Hubbard model as a prototypical example, we here show all the steps necessary to determine its phase diagram and ground state properties on a quantum computer. In particular, we discuss strategies for efficiently determining and preparing the ground state of the Hubbard model starting from various mean-field states with broken symmetry. We present an efficient procedure to prepare arbitrary Slater determinants as initial states and present the complete set of quantum circuits needed to evolve from these to the ground state of the Hubbard model. We show that, using efficient nesting of the various terms each time step in the evolution can be performed with just $\mathcal{O}(N)$ gates and $\mathcal{O}(\log N)$ circuit depth. We give explicit circuits to measure arbitrary local observables and static and dynamic correlation functions, both in the time and frequency domain. We further present efficient non-destructive approaches to measurement that avoid the need to re-prepare the ground state after each measurement and that quadratically reduce the measurement error.

quant-ph↗

arXiv2015

Slowest local operators in quantum spin chains

We numerically construct slowly relaxing local operators in a nonintegrable spin-1/2 chain. Restricting the support of the operator to $M$ consecutive spins along the chain, we exhaustively search for the operator that minimizes the Frobenius norm of the commutator with the Hamiltonian. We first show that the Frobenius norm bounds the time scale of relaxation of the operator at high temperatures. We find operators with significantly slower relaxation than the slowest simple "hydrodynamic" mode due to energy diffusion. Then, we examine some properties of the nontrivial slow operators. Using both exhaustive search and tensor network techniques, we find similar slowly relaxing operators for a Floquet spin chain; this system is hydrodynamically "trivial", with no conservation laws restricting their dynamics. We argue that such slow relaxation may be a generic feature following from locality and unitarity.

cond-mat.stat-mech↗

arXiv2015

From local to global ground states in Ising spin glasses

We consider whether it is possible to find ground states of frustrated spin systems by solving them locally. Using spin glass physics and Imry-Ma arguments in addition to numerical benchmarks we quantify the power of such local solution methods and show that for the average low-dimensional spin glass problem outside the spin- glass phase the exact ground state can be found in polynomial time. In the second part we present a heuristic, general-purpose hierarchical approach which for spin glasses on chimera graphs and lattices in two and three dimensions outperforms, to our knowledge, any other solver currently around, with significantly better scaling performance than simulated annealing.

cond-mat.dis-nn↗

arXiv2014

Quantization of Hall Conductance For Interacting Electrons on a Torus

We consider interacting, charged spins on a torus described by a gapped Hamiltonian with a unique groundstate and conserved local charge. Using quasi-adiabatic evolution of the groundstate around a flux-torus, we prove, without any averaging assumption, that the Hall conductance of the groundstate is quantized in integer multiples of e^2/h, up to exponentially small corrections in the linear size of the system. In addition, we discuss extensions to the fractional quantization case under an additional topological order assumption on the degenerate groundstate subspace.

quant-ph↗

arXiv2014

Gate count estimates for performing quantum chemistry on small quantum computers

As quantum computing technology improves and quantum computers with a small but non-trivial number of N > 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman's original proposal of simulating quantum systems, and in particular the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to perform quantum chemistry on a quantum computer. We focus on the quantum resources required to find the ground state of a molecule twice as large as what current classical computers can solve exactly. We find that while such a problem requires about a ten-fold increase in the number of qubits over current technology, the required increase in the number of gates that can be coherently executed is many orders of magnitude larger. This suggests that for quantum computation to become useful for quantum chemistry problems, drastic algorithmic improvements will be needed.

quant-ph↗

arXiv2014

On Metaplectic Modular Categories and their applications

For non-abelian simple objects in a unitary modular category, the density of their braid group representations, the #P-hard evaluation of their associated link invariants, and the BQP-completeness of their anyonic quantum computing models are closely related. We systematically study such properties of the non-abelian simple objects in metaplectic modular categories, which are unitary modular categories with fusion rules of SO(m)_2 for an odd integer m \geq 3. The simple objects with quantum dimensions \sqrt{m} have finite image braid group representations, and their link invariants are classically efficient to evaluate. We also provide classically efficient simulation of their braid group representations. These simulations of the braid group representations can be regarded as qudit generalizations of the Knill-Gottesmann theorem for the qubit case. The simple objects of dimension 2 give us a surprising result: while their braid group representations have finite images and are efficiently simulable classically after a generalized localization, their link invariants are #P-hard to evaluate exactly. We sharpen the #P-hardness by showing that any sufficiently accurate approximation of their associated link invariants is already #P-hard.

math.QA↗

arXiv2013

Homological Product Codes

Quantum codes with low-weight stabilizers known as LDPC codes have been actively studied recently due to their simple syndrome readout circuits and potential applications in fault-tolerant quantum computing. However, all families of quantum LDPC codes known to this date suffer from a poor distance scaling limited by the square-root of the code length. This is in a sharp contrast with the classical case where good families of LDPC codes are known that combine constant encoding rate and linear distance. Here we propose the first family of good quantum codes with low-weight stabilizers. The new codes have a constant encoding rate, linear distance, and stabilizers acting on at most $\sqrt{n}$ qubits, where $n$ is the code length. For comparison, all previously known families of good quantum codes have stabilizers of linear weight. Our proof combines two techniques: randomized constructions of good quantum codes and the homological product operation from algebraic topology. We conjecture that similar methods can produce good stabilizer codes with stabilizer weight $n^a$ for any $a>0$. Finally, we apply the homological product to construct new small codes with low-weight stabilizers.

quant-ph↗

arXiv2013

Self-Correcting Quantum Memories Beyond the Percolation Threshold

We analyze several high dimensional generalizations of the toric code at nonzero temperature. We find that in large enough dimension, there can be a distinct separation between the critical temperature $T_c$, given by thermodynamic singularities, and the percolation temperature $T_p$, given by the percolation of defects. We argue that the regime $T_p<T<T_c$ is a range of temperatures where a self-correcting quantum memory can operate despite having percolating defects. We present analytic arguments and numerical evidence in support of this scenario, including a mean-field treatment and Monte Carlo simulations. Near $T_c$, simulations observe a large hysteretic behavior, which may have applications by allowing the self-correcting phase to survive in a "superheated" regime.

cond-mat.str-el↗

arXiv2013

Anomalies in the Entanglement Properties of the Square Lattice Heisenberg Model

We compute the bipartite entanglement properties of the spin-half square-lattice Heisenberg model by a variety of numerical techniques that include valence bond quantum Monte Carlo (QMC), stochastic series expansion QMC, high temperature series expansions and zero temperature coupling constant expansions around the Ising limit. We find that the area law is always satisfied, but in addition to the entanglement entropy per unit boundary length, there are other terms that depend logarithmically on the subregion size, arising from broken symmetry in the bulk and from the existence of corners at the boundary. We find that the numerical results are anomalous in several ways. First, the bulk term arising from broken symmetry deviates from an exact calculation that can be done for a mean-field Neel state. Second, the corner logs do not agree with the known results for non-interacting Boson modes. And, third, even the finite temperature mutual information shows an anomalous behavior as T goes to zero, suggesting that T->0 and L->infinity limits do not commute. These calculations show that entanglement entropy demonstrates a very rich behavior in d>1, which deserves further attention.

cond-mat.str-el↗

arXiv2013

Faster Phase Estimation

We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine its scaling in circuit depth and width. We show that the use of purely random measurements requires a number of measurements that is optimal up to constant factors, albeit at the cost of exponential classical post-processing; the method can also be used to improve classical signal processing. We then develop a quantum algorithm for phase estimation that yields an asymptotic improvement in runtime, coming within a factor of log* of the minimum number of measurements required while still requiring only minimal classical post-processing. The corresponding quantum circuit requires asymptotically lower depth and width (number of qubits) than quantum phase estimation.

quant-ph↗