In three dimensions, there is a nontrivial quantum cellular automaton (QCA) which disentangles the three-fermion Walker--Wang model, a model whose action depends on Stiefel--Whitney classes of the spacetime manifold. Here we present a conjectured generalization to higher dimensions. For an arbitrary symmetry protected topological phase of time reversal whose action depends on Stiefel--Whitney classes, we construct a corresponding QCA that we conjecture disentangles that phase. Some of our QCA are Clifford, and we relate these to a classification theorem of Clifford QCA. We identify Clifford QCA in $4m+1$ dimensions, for which we find a low-depth circuit description using non-Clifford gates but not with Clifford gates.
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 degree-$4$ Majorana operators but does not impose any other relations on them, does not give the correct order of magnitude bound on the ground state energy. Second (a "separation"), we show that the graph invariant $\Psi(G)$ defined in Ref. 1 may be strictly larger than the independence number $\alpha(G)$. The invariant $\Psi(G)$ is a bound on the norm of a Hamiltonian whose terms obey commutation relations determined by the graph $G$, and it was shown that $\alpha(G)\leq \Psi(G) \leq \vartheta(G)$, where $\vartheta(\cdot)$ is the Lovasz theta function. We briefly discuss the case of $q\neq 4$ in the SYK model. Separately, we define a problem that we call the quantum knapsack problem.
Using bosonization, which maps fermions coupled to a ${\mathbb{Z}}_2$ gauge field to a qubit system, we give a simple form for the non-trivial 3-fermion quantum cellular automaton (QCA) as a unitary operator realizing a phase depending on the framing of flux loops, building off work by Shirley et al. We relate this framing dependent phase to a pump of $8$ copies of a $p+ip$ state through the system. We give a resolution of an apparent paradox, namely that the pump is a shallow depth circuit (albeit with tails), while the QCA is nontrivial. We discuss also the pump of fewer copies of a $p+ip$ state, and describe its action on topologically degenerate ground states. One consequence of our results is that a pump of $n$ $p+ip$ states generated by a free Fermi evolution is a free fermion unitary characterized by a non-trivial winding number $n$ as a map from the third homotopy group of the Brilliouin Zone $3$-torus to that of $SU(N_ b)$, where $N_b$ is the number of bands. Using our simplified form of the QCA, we give higher dimensional generalizations that we conjecture are also nontrivial QCAs, and we discuss the relation to Chern-Simons theory.
The surface code is one of the most popular quantum error correction codes. It comes with efficient decoders, such as the Minimum Weight Perfect Matching (MWPM) decoder and the Union-Find (UF) decoder, allowing for fast quantum error correction. For a general linear code or stabilizer code, the decoding problem is NP-hard. What makes it tractable for the surface code is the special structure of faults and checks: Each X and Z fault triggers at most two checks. As a result, faults can be interpreted as edges in a graph whose vertices are the checks, and the decoding problem can be solved using standard graph algorithms such as Edmonds' minimum-weight perfect matching algorithm. For general codes, this decoding graph is replaced by a hypergraph making the decoding problem more challenging. In this work, we propose two heuristic algorithms for splitting the hyperedges of a decoding hypergraph into edges. After splitting, hypergraph faults can be decoded using any surface code decoder. Due to the complexity of the decoding problem, we do not expect this strategy to achieve a good error correction performance for a general code. However, we empirically show that this strategy leads to a good performance for some classes of LDPC codes because they are defined by low weight checks. We apply this splitting decoder to Floquet codes for which some faults trigger up to four checks and verify numerically that this decoder achieves the maximum code distance for two instances of Floquet codes.
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". Here, we are considering codes that in some sense generalize the honeycomb code[1] to more general, non-planar graphs. We then consider a class of these codes that is related to (generalized) toric codes on $2$-complexes. For (generalized) toric codes on $2$-complexes, the following question arises: can the distance of these codes grow faster than square-root? We answer the question negatively, and remark on recent systolic inequalities[2]. We then turn to the case that of planar codes with vacancies, or ``dead qubits", and consider the statistical mechanics of decoding in this setting. Although we do not prove a threshold, our results should be asymptotically correct for low error probability and high degree decoding graphs (high degree taken before low error probability). In an appendix, we discuss a toy model of vacancies in planar quantum codes, giving a phenomenological discussion of how errors occur when ``super-stabilizers" are not measured, and in a separate appendix we discuss a relation between Floquet codes and chain maps.
We develop protocols for Hastings-Haah Floquet codes in the presence of dead qubits.
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.
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 time, and auxiliary field Monte Carlo. This paper should be seen as a sequel to Refs. 1,2. Additionally in this paper, we consider the difficulty of approximating the ground state energy of the Sachdev-Ye-Kitaev (SYK) model using other methods. We provide limitations on the power of the Lanczos method, starting with a Gausian wavefunction, and on the power of a sum of Gaussian wavefunctions (in this case under an assumption).
The sum-of-squares (SoS) hierarchy is a powerful technique based on semi-definite programming that can be used for both classical and quantum optimization problems. This hierarchy goes under several names; in particular, in quantum chemistry it is called the reduced density matrix (RDM) method. We consider the ability of this hierarchy to reproduce weak coupling perturbation theory for three different kinds of systems: spin (or qubit) systems, bosonic systems (the anharmonic oscillator), and fermionic systems with quartic interactions. For such fermionic systems, we show that degree-$4$ SoS (called $2$-RDM in quantum chemsitry) does not reproduce second order perturbation theory but degree-$6$ SoS ($3$-RDM) does (and we conjecture that it reproduces third order perturbation theory). Indeed, we identify a fragment of degree-$6$ SoS which can do this, which may be useful for practical quantum chemical calculations as it may be possible to implement this fragment with less cost than the full degree-$6$ SoS. Remarkably, this fragment is very similar to one studied by Hastings and O'Donnell for the Sachdev-Ye-Kitaev (SYK) model.
The recent "honeycomb code" is a fault-tolerant quantum memory defined by a sequence of checks which implements a nontrivial automorphism of the toric code. We argue that a general framework to understand this code is to consider continuous adiabatic paths of gapped Hamiltonians and we give a conjectured description of the fundamental group and second and third homotopy groups of this space in two spatial dimensions. A single cycle of such a path can implement some automorphism of the topological order of that Hamiltonian. We construct such paths for arbitrary automorphisms of two-dimensional doubled topological order. Then, realizing this in the case of the toric code, we turn this path back into a sequence of checks, constructing an automorphism code closely related to the honeycomb code.
Quantum error correction is crucial for any quantum computing platform to achieve truly scalable quantum computation. The surface code and its variants have been considered the most promising quantum error correction scheme due to their high threshold, low overhead, and relatively simple structure that can naturally be implemented in many existing qubit architectures, such as superconducting qubits. The recent development of Floquet codes offers another promising approach. By going beyond the usual paradigm of stabilizer codes, Floquet codes achieve similar performance while being constructed entirely from two-qubit measurements. This makes them particularly suitable for platforms where two-qubit measurements can be implemented directly, such as measurement-only topological qubits based on Majorana zero modes (MZMs). Here, we explain how two variants of Floquet codes can be implemented on MZM-based architectures without any auxiliary qubits for syndrome measurement and with shallow syndrome extraction sequences. We then numerically demonstrate their favorable performance. In particular, we show that they improve the threshold for scalable quantum computation in MZM-based systems by an order of magnitude, and significantly reduce space and time overheads below threshold.
We consider the possibility of developing a Lieb-Robinson bound for the double bracket flow. This is a differential equation $$\partial_B H(B)=[[V,H(B)],H(B)]$$ which may be used to diagonalize Hamiltonians. Here, $V$ is fixed and $H(0)=H$. We argue (but do not prove) that $H(B)$ need not converge to a limit for nonzero real $B$ in the infinite volume limit, even assuming several conditions on $H(0)$. However, we prove Lieb-Robinson bounds for all $B$ for the double-bracket flow for free fermion systems, but the range increases \emphexponentially with the control parameter $B$.
We give a simple classical algorithm which provably achieves the performance in the title. The algorithm is a simple modification of the Gaussian wave process.
We consider many-body quantum systems on a finite lattice, where the Hilbert space is the tensor product of finite-dimensional Hilbert spaces associated with each site, and where the Hamiltonian of the system is a sum of local terms. We are interested in proving uniform bounds on various properties as the size of the lattice tends to infinity. An important case is when there is a spectral gap between the lowest state(s) and the rest of the spectrum which persists in this limit, corresponding to what physicists call a ``phase of matter". Here, the combination of elementary Fourier analysis with the technique of Lieb-Robinson bounds (bounds on the velocity of propagation) is surprisingly powerful. We use this to prove exponential decay of connected correlation functions, a higher-dimensional Lieb-Schultz-Mattis theorem, and a Hall conductance quantization theorem for interacting electrons with disorder.
Quasiparticle excitations in $3+1$ dimensions can be either bosons or fermions. In this work, we introduce the notion of fermionic loop excitations in $3+1$ dimensional topological phases. Specifically, we construct a new many-body lattice invariant of gapped Hamiltonians, the loop self-statistics, that distinguishes two bosonic topological orders that both superficially resemble $3+1$ d ${\mathbb{Z}}_2$ gauge theory coupled to fermionic charged matter. The first has fermionic charges and bosonic ${\mathbb{Z}}_2$ gauge flux loops (FcBl) and is just the ordinary fermionic toric code. The second has fermionic charges and fermionic loops (FcFl), and, as we argue, can only exist at the boundary of a non-trivial 4+1d invertible bosonic phase, stable without any symmetries, i.e. it possesses a gravitational anomaly. We substantiate these claims by constructing an explicit exactly solvable $4+1$ d Walker-Wang model and computing the loop self-statistics in the fermionic ${\mathbb{Z}}_2$ gauge theory hosted at its boundary. We also show that the FcFl phase has the same gravitational anomaly as all-fermion quantum electrodynamics. Our results are in agreement with the recent classification of nondegenerate braided fusion 2-categories by Johnson-Freyd, and with the cobordism prediction of a non-trivial ${\mathbb{Z}}_2$ classified $4+1$ d invertible phase with action $S=\frac{1}{2} \int w_2 w_3$.
The fundamental problem in much of physics and quantum chemistry is to optimize a low-degree polynomial in certain anticommuting variables. Being a quantum mechanical problem, in many cases we do not know an efficient classical witness to the optimum, or even to an approximation of the optimum. One prominent exception is when the optimum is described by a so-called "Gaussian state", also called a free fermion state. In this work we are interested in the complexity of this optimization problem when no good Gaussian state exists. Our primary testbed is the Sachdev--Ye--Kitaev (SYK) model of random degree-$q$ polynomials, a model of great current interest in condensed matter physics and string theory, and one which has remarkable properties from a computational complexity standpoint. Among other results, we give an efficient classical certification algorithm for upper-bounding the largest eigenvalue in the $q=4$ SYK model, and an efficient quantum certification algorithm for lower-bounding this largest eigenvalue; both algorithms achieve constant-factor approximations with high probability.
We introduce a simple construction of boundary conditions for the honeycomb code that uses only pairwise checks and allows parallelogram geometries at the cost of modifying the bulk measurement sequence. We discuss small instances of the code.
We present a quantum error correcting code with dynamically generated logical qubits. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, our measurement patterns generate logical qubits, allowing the code to act as a fault-tolerant quantum memory. Our particular code gives a model very similar to the two-dimensional toric code, but each measurement is a two-qubit Pauli measurement.
We consider a model of quantum computation using qubits where it is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state. The physical motivation is that we can do these measurements in a way that is protected against revealing other information so long as all terms in the Hamiltonian are $SU(2)$-invariant. We conjecture that this model is equivalent to BQP. Towards this goal, we show: (1) this model is capable of universal quantum computation with polylogarithmic overhead if it is supplemented by single qubit $X$ and $Z$ gates. (2) Without any additional gates, it is at least as powerful as the weak model of "permutational quantum computation" of Jordan [14, 18]. (3) With postselection, the model is equivalent to PostBQP.
We give a general procedure for weight reducing quantum codes. This corrects a previous work\citeowr, and introduces a new technique that we call "coning" to effectively induce high weight stabilizers in an LDPC code. As one application, any LDPC code (with arbitrary $O(1)$ stabilizer weights) may be turned into a code where all stabilizers have weight at most $5$ at the cost of at most a constant factor increase in number of physical qubits and constant factor reduction in distance. Also, by applying this technique to a quantum code whose $X$-stabilizers are derived from a classical log-weight random code and whose $Z$-stabilizers have linear weight, we construct an LDPC quantum code with distance $\tilde \Omega(N^{2/3})$ and $\tilde\Omega(N^{2/3})$ logical qubits.
We give a procedure for "reverse engineering" a closed, simply connected, Riemannian manifold with bounded local geometry from a sparse chain complex over $\mathbb{Z}$. Applying this procedure to chain complexes obtained by "lifting" recently developed quantum codes, which correspond to chain complexes over $\mathbb{Z}_2$, we construct the first examples of power law $\mathbb{Z}_2$ systolic freedom. As a result that may be of independent interest in graph theory, we give an efficient randomized algorithm to construct a weakly fundamental cycle basis for a graph, such that each edge appears only polylogarithmically times in the basis. We use this result to trivialize the fundamental group of the manifold we construct.
Homological product codes are a class of codes that can have improved distance while retaining relatively low stabilizer weight. We show how to build union-find decoders for these codes, using a union-find decoder for one of the codes in the product and a brute force decoder for the other code. We apply this construction to the specific case of the product of a surface code with a small code such as a $[[4,2,2]]$ code, which we call an augmented surface code. The distance of the augmented surface code is the product of the distance of the surface code with that of the small code, and the union-find decoder, with slight modifications, can decode errors up to half the distance. We present numerical simulations, showing that while the threshold of these augmented codes is lower than that of the surface code, the low noise performance is improved.
We present a quantum LDPC code family that has distance $\Omega(N^{3/5}/\operatorname{polylog}(N))$ and $\tilde\Theta(N^{3/5})$ logical qubits. This is the first quantum LDPC code construction which achieves distance greater than $N^{1/2} \operatorname{polylog}(N)$. The construction is based on generalizing the homological product of codes to a fiber bundle.
This is a personal history of the Hastings-Michalakis proof of quantum Hall conductance quantization.
Motivated by recent work showing that a quantum error correcting code can be generated by hybrid dynamics of unitaries and measurements, we study the long time behavior of such systems. We demonstrate that even in the "mixed" phase, a maximally mixed initial density matrix is purified on a time scale equal to the Hilbert space dimension (i.e., exponential in system size), albeit with noisy dynamics at intermediate times which we connect to Dyson Brownian motion. In contrast, we show that free fermion systems -- i.e., ones where the unitaries are generated by quadratic Hamiltonians and the measurements are of fermion bilinears -- purify in a time quadratic in the system size. In particular, a volume law phase for the entanglement entropy cannot be sustained in a free fermion system.
Magic state distillation uses special codes to suppress errors in input states, which are often tailored to a Clifford-twirled error model. We present detailed measurement sequences for magic state distillation protocols which can suppress arbitrary errors on any part of a protocol, assuming the independence of errors across qubits. Provided with input magic states, our protocol operates on a two-dimensional square grid by measurements of $ZZ$ on horizontal pairs of qubits, $XX$ on vertical pairs, and $Z,X$ on single qubits.
We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
We construct an exactly solvable commuting projector model for a $4+1$ dimensional ${\mathbb Z}_2$ symmetry-protected topological phase (SPT) which is outside the cohomology classification of SPTs. The model is described by a decorated domain wall construction, with "three-fermion" Walker-Wang phases on the domain walls. We describe the anomalous nature of the phase in several ways. One interesting feature is that, in contrast to in-cohomology phases, the effective ${\mathbb Z}_2$ symmetry on a $3+1$ dimensional boundary cannot be described by a quantum circuit and instead is a nontrivial quantum cellular automaton (QCA). A related property is that a codimension-two defect (for example, the termination of a ${\mathbb Z}_2$ domain wall at a trivial boundary) will carry nontrivial chiral central charge $4$ mod $8$. We also construct a gapped symmetric topologically-ordered boundary state for our model, which constitutes an anomalous symmetry enriched topological phase outside of the classification of arXiv:1602.00187, and define a corresponding anomaly indicator.
We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a general method of ancilla removal. Further, we show how to define a group of QCA that is well-defined without needing to use families, by showing how to construct a coherent family containing an arbitrary finite QCA; the coherent family consists of QCA on progressively finer systems of qudits where any two members are related by a shallow quantum circuit. This construction applied to translation invariant QCA shows that all translation invariant QCA in three dimensions and all translation invariant Clifford QCA in any dimension are coherent.
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 algorithm, and a super-polynomial speedup over classical algorithms that use only polynomial space. The classical algorithms that we present are related to, but slightly different from those presented recently in Ref. 1. In particular, we have an improved threshold for recovery and the algorithms we present work for both even and odd order tensors. These results suggest that large-scale inference problems are a promising future application for quantum computers.
We analyze the class of Generalized Double Semion (GDS) models in arbitrary dimensions from the point of view of lattice Hamiltonians. We show that on a $d$-dimensional spatial manifold $M$ the dual of the GDS is equivalent, up to constant depth local quantum circuits, to a group cohomology theory tensored with lower dimensional cohomology models that depend on the manifold $M$. We comment on the space-time topological quantum field theory (TQFT) interpretation of this result. We also investigate the GDS in the presence of time reversal symmetry, showing that it forms a non-trivial symmetry enriched toric code phase in odd spatial dimensions.
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 performance as the single step QAOA on MAX-3-LIN-2. Second, we show that this class of classical algorithms generalizes a class previously considered in the literature, and also that a single step of the classical algorithm will outperform the single-step QAOA on all triangle-free MAX-CUT instances. In fact, for all but $4$ choices of degree, existing single-step classical algorithms already outperform the QAOA on these graphs, while for the remaining $4$ choices we show that the generalization here outperforms it. Finally, we consider the QAOA and provide strong evidence that, for any fixed number of steps, its performance on MAX-3-LIN-2 on bounded degree graphs cannot achieve the same scaling as can be done by a class of "global" classical algorithms. These results suggest that such local classical algorithms are likely to be at least as promising as the QAOA for approximate optimization.
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 give guarantees that the algorithm will find such a nontrivial improvement: if few solutions exist which are much worse than random, then a nontrivial improvement is guaranteed. The quantum algorithm is based on a sudden of a Hamiltonian; while the algorithm is general, we analyze it in the specific context of MAX-$K$-LIN$2$, for both even and odd $K$. The classical algorithm is a "dequantization of this algorithm", obtaining the same guarantee (indeed, some results which are only conjectured in the quantum case can be proven here); however, the quantum point of view helps in analyzing the performance of the classical algorithm and might in some cases perform better.
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via dimensional reduction, finding a classification by the first homology group of the manifold modulo torsion. Second, in two dimensions, we show that an extension of this index theory (including torsion) fully classifies quantum cellular automata, at least in the absence of fermionic degrees of freedom. This complete classification in one and two dimensions by index theory is not expected to extend to higher dimensions due to recent evidence of a nontrivial automaton in three dimensions. Finally, we discuss some group theoretical aspects of the classification of quantum cellular automata and consider these automata on higher dimensional real projective spaces.
We numerically investigate the performance of the short path optimization algorithm on a toy problem, with the potential chosen to depend only on the total Hamming weight to allow simulation of larger systems. We consider classes of potentials with multiple minima which cause the adiabatic algorithm to experience difficulties with small gaps. The numerical investigation allows us to consider a broader range of parameters than was studied in previous rigorous work on the short path algorithm, and to show that the algorithm can continue to lead to speedups for more general objective functions than those considered before. We find in many cases a polynomial speedup over Grover search. We present a heuristic analytic treatment of choices of these parameters and of scaling of phase transitions in this model.
Motivated by the growing interest in self-correcting quantum memories, we study the feasibility of self-correction in classical lattice systems composed of bounded degrees of freedom with local interactions. We argue that self-correction, including a requirement of stability against external perturbation, cannot be realized in system with broken global symmetries such as the 2d Ising model, but that systems with local, i.e. gauge, symmetries have the required properties. Previous work gave a three-dimensional quantum system which realized a self-correcting classical memory. Here we show that a purely classical three dimensional system, Wegner's 3D Ising lattice gauge model, can also realize this self-correction despite having an extensive ground state degeneracy. We give a detailed numerical study to support the existence of a self-correcting phase in this system, even when the gauge symmetry is explicitly broken. More generally, our results obtained by studying the memory lifetime of the system are in quantitative agreement with the phase diagram obtained from conventional analysis of the system's specific heat, except that self-correction extends beyond the topological phase, past the lower critical temperature.
We construct a three-dimensional quantum cellular automaton (QCA), an automorphism of the local operator algebra on a lattice of qubits, which disentangles the ground state of the Walker-Wang three fermion model. We show that if this QCA can be realized by a quantum circuit of constant depth, then there exists a two-dimensional commuting projector Hamiltonian which realizes the three fermion topological order which is widely believed not to be possible. We conjecture in accordance with this belief that this QCA is not a quantum circuit of constant depth, and we provide two further pieces of evidence to support the conjecture. We show that this QCA maps every local Pauli operator to a local Pauli operator, but is not a Clifford circuit of constant depth. Further, we show that if the three-dimensional QCA can be realized by a quantum circuit of constant depth, then there exists a two-dimensional QCA acting on fermionic degrees of freedom which cannot be realized by a quantum circuit of constant depth; i.e., we prove the existence of a nontrivial QCA in either three or two dimensions. The square of our three-dimensional QCA can be realized by a quantum circuit of constant depth, and this suggests the existence of a $\mathbb{Z}_2$ invariant of a QCA in higher dimensions, totally distinct from the classification by positive rationals (i.e., by one integer index for each prime) in one dimension. In an appendix, unrelated to the main body of this paper, we give a fermionic generalization of a result of Bravyi and Vyalyi on ground states of 2-local commuting Hamiltonians.
The short path algorithm gives a super-Grover speedup for various optimization problems under the assumption of a unique ground state and under an assumption on the density of low-energy states. Here, we remove the assumption of a unique ground state; this uses the same algorithm but a slightly different analysis and holds for arbitrary MAX-$D$-LIN-$2$ problems. Then, specializing to the case $D=2$, we show that for certain values of the objective function we can always achieve a super-Grover speedup (albeit a very slight one) without any assumptions on the density of states. Finally, for random instances, we give a heuristic treatment suggesting a more significant improvement.
We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the same degree $D$; this problem is called weighted MAX-E$D$-LIN2. We require that the optimal solution be unique for odd $D$ and doubly degenerate for even $D$; however, we expect that the algorithm still works without this condition and we show how to reduce to the case without this assumption at the cost of an additional overhead. While the time required is still exponential, the algorithm provably outperforms Grover's algorithm assuming a mild condition on the number of low energy states of the target Hamiltonian. The detailed analysis of the runtime dependence on a tradeoff between the number of such states and algorithm speed: fewer such states allows a greater speedup. This leads to a natural hybrid algorithm that finds either an exact or approximate solution.
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in its vicinity). This class of Hamiltonians is very general and is believed to capture fundamental interactions of physics. Our algorithm simulates the time evolution of such a Hamiltonian on $n$ qubits for time $T$ up to error $\epsilon$ using $\mathcal O( nT \mathrm{polylog} (nT/\epsilon))$ gates with depth $\mathcal O(T \mathrm{polylog} (nT/\epsilon))$. Our algorithm is the first simulation algorithm that achieves gate cost quasilinear in $nT$ and polylogarithmic in $1/\epsilon$. Our algorithm also readily generalizes to time-dependent Hamiltonians and yields an algorithm with similar gate count for any piecewise slowly varying time-dependent bounded local Hamiltonian. We also prove a matching lower bound on the gate count of such a simulation, showing that any quantum algorithm that can simulate a piecewise constant bounded local Hamiltonian in one dimension to constant error requires $\tilde \Omega(nT)$ gates in the worst case. The lower bound holds even if we only require the output state to be correct on local measurements. To our best knowledge, this is the first nontrivial lower bound on the gate complexity of the simulation problem. Our algorithm is based on a decomposition of the time-evolution unitary into a product of small unitaries using Lieb-Robinson bounds. In the appendix, we prove a Lieb-Robinson bound tailored to Hamiltonians with small commutators between local terms, giving zero Lieb-Robinson velocity in the limit of commuting Hamiltonians. This improves the performance of our algorithm when the Hamiltonian is close to commuting.
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground state of some Hamiltonian, it is not necessary to implement the time-evolution operator: any unitary operator which is a function of the Hamiltonian will do. We propose one such unitary operator which can be implemented exactly, circumventing any Taylor or Trotter approximation errors. The second technique is tailored to lattice models, and is targeted at reducing the use of generic single-qubit rotations, which are very expensive to produce by standard fault tolerant techniques. In particular, the number of generic single-qubit rotations used by our method scales with the number of parameters in the Hamiltonian, which contrasts with a growth proportional to the lattice size required by other techniques.
It has been conjectured [1] that for any distillation protocol for magic states for the $T$ gate, the number of noisy input magic states required per output magic state at output error rate $\epsilon$ is $\Omega(\log(1/\epsilon))$. We show that this conjecture is false. We find a family of quantum error correcting codes of parameters $[[\sum_{i=w+1}^m \binom{m}{i}, \sum_{i=0}^{w} \binom{m}{i}, \sum_{i=w+1}^{r+1} \binom{r+1}{i}]]$ for any integers $ m > 2r$, $r > w \ge 0$, by puncturing quantum Reed-Muller codes. When $m > \nu r$, our code admits a transversal logical gate at the $\nu$-th level of Clifford hierarchy. In a distillation protocol for magic states at the level $\nu = 3$ ($T$-gate), the ratio of input to output magic states is $O(\log^\gamma (1/\epsilon))$ where $\gamma = \log(n/k)/\log(d)< 0.678$ for some $m,r,w$. The smallest code in our family for which $\gamma < 1$ is on $\approx 2^{58}$ qubits.
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 $\gamma\rightarrow 1$. We also present a Reed-Muller based construction of these codes which obtains a worse $\gamma$ 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.
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.
Recent results have shown the stability of frustration-free Hamiltonians to weak local perturbations, assuming several conditions. In this paper, we prove the stability of free fermion Hamiltonians which are gapped and local. These free fermion Hamiltonians are not necessarily frustration-free, but we are able to adapt previous work to prove stability. The key idea is to add an additional copy of the system to cancel topological obstructions. We comment on applications to quantization of Hall conductance in such systems.
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 $\delta$ (up to $\log \log 1/\delta$). 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.
We consider Majorana fermion stabilizer codes with small number of modes and distance. We give an upper bound on the number of logical qubits for distance $4$ codes, and we construct Majorana fermion codes similar to the classical Hamming code that saturate this bound. We perform numerical studies and find other distance $4$ and $6$ codes that we conjecture have the largest possible number of logical qubits for the given number of physical Majorana modes. Some of these codes have more logical qubits than any Majorana fermion code derived from a qubit stabilizer code.
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on these logical qubits are only approximation of the desired gate. This can arise, for example, in synthesizing a single qubit unitary from a set of Clifford and $T$ gates; for a generic such unitary, any finite sequence of gates only approximates the desired target. In this case, errors in the gate can add coherently so that, roughly, the error $\epsilon$ in the unitary of each gate must scale as $\epsilon \lesssim 1/N$, where $N$ is the number of gates. If, however, one has the option of synthesizing one of several unitaries near the desired target, and if an average of these options is closer to the target, we give some elementary bounds showing cases in which the errors can be made to add incoherently by averaging over random choices, so that, roughly, one needs $\epsilon \lesssim 1/\sqrt{N}$. We remark on one particular application to distilling magic states where this effect happens automatically in the usual circuits.
We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the stabilizer generators all have weights $O(1)$ and such that $O(1)$ generators act on any given qubit. The number of logical qubits is unchanged by the procedure, while we give bounds on the increase in number of physical qubits and in the effect on distance and other code parameters, such as soundness (as a locally testable code) and "cosoundness" (defined later). Applications are discussed, including to codes from high-dimensional manifolds which have logarithmic weight stabilizers. Assuming a conjecture in geometry\citehdm, this allows the construction of CSS stabilizer codes with generator weight $O(1)$ and almost linear distance. Another application of the construction is to increasing the distance to $X$ or $Z$ errors, whichever is smaller, so that the two distances are equal.
Torsten Karzig, Christina Knapp, Roman M. Lutchyn, Parsa Bonderson, Matthew B. Hastings, Chetan Nayak, Jason Alicea, Karsten Flensberg, Stephan Plugge, Yuval Oreg, Charles M. Marcus, Michael H. Freedman 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.
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.
We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of quantum CSS stabilizer codes on $N$ qubits with logarithmic weight stabilizers and distance $N^{1-\epsilon}$ for any $\epsilon>0$. The conjecture is that there is a constant $C>0$ such that for any $n$-dimensional torus ${\mathbb T}^n={\mathbb R}^n/\Lambda$, where $\Lambda$ is a lattice, the least volume unoriented $n/2$-dimensional surface (using the Euclidean metric) representing nontrivial homology has volume at least $C^n$ times the volume of the least volume $n/2$-dimensional hyperplane representing nontrivial homology; in fact, it would suffice to have this result for $\Lambda$ an integral lattice with the surface restricted to faces of a cubulation by unit hypercubes. The main technical result is an estimate of Rankin invariants\citerankin for certain random lattices, showing that in a certain sense they are optimal. Additionally, we construct codes with square-root distance, logarithmic weight stabilizers, and inverse polylogarithmic soundness factor (considered as quantum locally testable codes\citeqltc). We also provide an short, alternative proof that the shortest vector in the exterior power of a lattice may be non-split\citecoulangeon.
We study a variant of the quantum approximate optimization algorithm [ E. Farhi, J. Goldstone, and S. Gutmann, arXiv:1411.4028] with slightly different parametrization and different objective: rather than looking for a state which approximately solves an optimization problem, our goal is to find a quantum algorithm that, given an instance of MAX-2-SAT, will produce a state with high overlap with the optimal state. Using a machine learning approach, we chose a "training set" of instances and optimized the parameters to produce large overlap for the training set. We then tested these optimized parameters on a larger instance set. As a training set, we used a subset of the hard instances studied by E. Crosson, E. Farhi, C. Yen-Yu Lin, H.-H. Lin, and P. Shor (CFLLS) [arXiv:1401.7320]. When tested on the full set, the parameters that we find produce significantly larger overlap than the optimized annealing times of CFLLS. Testing on other random instances from $20$ to $28$ bits continues to show improvement over annealing, with the improvement being most notable on the hardest instances. Further tests on instances of MAX-3-SAT also showed improvement on the hardest instances. This algorithm may be a possible application for near-term quantum computers with limited coherence times.
The quantum max-flow min-cut conjecture relates the rank of a tensor network to the minimum cut in the case that all tensors in the network are identical\citemfmc1. This conjecture was shown to be false in Ref. \onlinecitemfmc2 by an explicit counter-example. Here, we show that the conjecture is almost true, in that the ratio of the quantum max-flow to the quantum min-cut converges to $1$ as the dimension $N$ of the degrees of freedom on the edges of the network tends to infinity. The proof is based on estimating moments of the singular values of the network. We introduce a generalization of "rainbow diagrams"\citerainbow to tensor networks to estimate the dominant diagrams. A direct comparison of second and fourth moments lower bounds the ratio of the quantum max-flow to the quantum min-cut by a constant. To show the tighter bound that the ratio tends to $1$, we consider higher moments. In addition, we show that the limiting moments as $N \rightarrow \infty$ agree with that in a different ensemble where tensors in the network are chosen independently, this is used to show that the distributions of singular values in the two different ensembles weakly converge to the same limiting distribution. We present also a numerical study of one particular tensor network, which shows a surprising dependence of the rank deficit on $N \mod 4$ and suggests further conjecture on the limiting behavior of the rank.
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.
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.
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimize the energy of the constructed quantum state for a given problem Hamiltonian. For this purpose we propose a simple-to-implement class of quantum states motivated by adiabatic state preparation. We test its accuracy and determine the required circuit depth for a Hubbard model on ladders with up to 12 sites (24 spin-orbitals), and for small molecules. We find that this ansatz converges faster than previously proposed schemes based on unitary coupled clusters. While the required number of measurements is astronomically large for quantum chemistry applications to molecules, applying the variational approach to the Hubbard model (and related models) is found to be far less demanding and potentially practical on small quantum computers. We also discuss another application of quantum state preparation using short quantum circuits, to prepare trial ground states of models faster than using adiabatic state preparation.
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.
We consider wavefunctions which are non-negative in some tensor product basis. We study what possible teleportation can occur in such wavefunctions, giving a complete answer in some cases (when one system is a qubit) and partial answers elsewhere. We use this to show that a one-dimensional wavefunction which is non-negative and has zero correlation length can be written in a "coherent Gibbs state" form, as explained later. We conjecture that such holds in higher dimensions. Additionally, some results are provided on possible teleportation in general wavefunctions, explaining how Schmidt coefficients before measurement limit the possible Schmidt coefficients after measurement, and on the absence of a "generalized area law"\citegenarealaw even for Hamiltonians with no sign problem. One of the motivations for this work is an attempt to prove a conjecture about ground state wavefunctions which have an "intrinsic" sign problem that cannot be removed by any quantum circuit. We show a weaker version of this, showing that the sign problem is intrinsic for commuting Hamiltonians in the same phase as the double semion model under the technical assumption that TQO-2 holds\citetqo2.
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.
We construct a random MERA state with a bond dimension that varies with the level of the MERA. This causes the state to exhibit a very different entanglement structure from that usually seen in MERA, with neighboring intervals of length $l$ exhibiting a mutual information proportional to $\epsilon l$ for some constant $\epsilon$, up to a length scale exponentially large in $\epsilon$. We express the entropy of a random MERA in terms of sums over cuts through the MERA network, with the entropy in this case controlled by the cut minimizing bond dimensions cut through. One motivation for this construction is to investigate the tightness of the Brandao-Horodecki\citebh entropy bound relating entanglement to correlation decay. Using the random MERA, we show that at least part of the proof is tight: there do exist states with the required property of having linear mutual information between neighboring intervals at all length scales. We conjecture that this state has exponential correlation decay and that it demonstrates that the Brandao-Horodecki bound is tight (at least up to constant factors), and we provide some numerical evidence for this as well as a sketch of how a proof of correlation decay might proceed.
The "folding algorithm"\citefold1 is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the temporal entanglement. We show that this temporal entanglement is, in many cases, equal to the spatial entanglement of a modified Hamiltonian. This inspires a modification to the folding algorithm, that we call the "hybrid algorithm". We find that this leads to improved accuracy for the same numerical effort. We then use these algorithms to study relaxation in a transverse plus parallel field Ising model, finding persistent quasi-periodic oscillations for certain choices of initial conditions.
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.
We study complexity of several problems related to the Transverse field Ising Model (TIM). First, we consider the problem of estimating the ground state energy known as the Local Hamiltonian Problem (LHP). It is shown that the LHP for TIM on degree-3 graphs is equivalent modulo polynomial reductions to the LHP for general k-local `stoquastic' Hamiltonians with any constant $k\ge 2$. This result implies that estimating the ground state energy of TIM on degree-3 graphs is a complete problem for the complexity class StoqMA - an extension of the classical class MA. As a corollary, we complete the complexity classification of 2-local Hamiltonians with a fixed set of interactions proposed recently by Cubitt and Montanaro. Secondly, we study quantum annealing algorithms for finding ground states of classical spin Hamiltonians associated with hard optimization problems. We prove that the quantum annealing with TIM Hamiltonians is equivalent modulo polynomial reductions to the quantum annealing with a certain subclass of k-local stoquastic Hamiltonians. This subclass includes all Hamiltonians representable as a sum of a k-local diagonal Hamiltonian and a 2-local stoquastic Hamiltonian.
We propose two distinct methods of improving quantum computing protocols based on surface codes. First, we analyze the use of dislocations instead of holes to produce logical qubits, potentially reducing spacetime volume required. Dislocations induce defects which, in many respects, behave like Majorana quasi-particles. We construct circuits to implement these codes and present fault-tolerant measurement methods for these and other defects which may reduce spatial overhead. One advantage of these codes is that Hadamard gates take exactly $0$ time to implement. We numerically study the performance of these codes using a minimum weight and a greedy decoder using finite-size scaling. Second, we consider state injection of arbitrary ancillas to produce arbitrary rotations. This avoids the logarithmic (in precision) overhead in online cost required if $T$ gates are used to synthesize arbitrary rotations. While this has been considered before, we consider also the parallel performance of this protocol. Arbitrary ancilla injection leads to a probabilistic protocol in which there is a constant chance of success on each round; we use an amortized analysis to show that even in a parallel setting this leads to only a constant factor slowdown as opposed to the logarithmic slowdown that might be expected naively.
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.
The simulation of molecules is a widely anticipated application of quantum computers. However, recent studies \citeWBCH13a,HWBT14a have cast a shadow on this hope by revealing that the complexity in gate count of such simulations increases with the number of spin orbitals $N$ as $N^8$, which becomes prohibitive even for molecules of modest size $N\sim 100$. This study was partly based on a scaling analysis of the Trotter step required for an ensemble of random artificial molecules. Here, we revisit this analysis and find instead that the scaling is closer to $N^6$ in worst case for real model molecules we have studied, indicating that the random ensemble fails to accurately capture the statistical properties of real-world molecules. Actual scaling may be significantly better than this due to averaging effects. We then present an alternative simulation scheme and show that it can sometimes outperform existing schemes, but that this possibility depends crucially on the details of the simulated molecule. We obtain further improvements using a version of the coalescing scheme of \citeWBCH13a; this scheme is based on using different Trotter steps for different terms. The method we use to bound the complexity of simulating a given molecule is efficient, in contrast to the approach of \citeWBCH13a,HWBT14a which relied on exponentially costly classical exact simulation.
This is a set of notes on some unrelated topics in mathematical physics, at varying levels of detail. First, I consider certain questions relating to the decay of correlation functions in matrix product states, in particular those generated by quantum expanders. This is discussed in relation to recent results of Brandao and Horodecki on area laws on systems with exponentially decaying correlation function\citeareaexp. Second, I consider some difficulties in trying to construct a tensor product state (or PEPS) describing a two-dimensional fermionic system with non-vanishing Hall conductance. Third, I present some relations between the theory of almost commuting matrices and that of vector bundles, making the connection between the classifications more explicit. Fourth, I present an open question about quantum channels, and some partial results.
We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant. Our modification does not require additional ancilla qubits. Then, we demonstrate how many operations can be parallelized, leading to a further linear decrease in the parallel depth of the circuit, at the cost of a small constant factor increase in number of qubits required. Thirdly, we modify the term order in the Trotter-Suzuki decomposition, significantly reducing the error at given Trotter-Suzuki timestep. A final improvement modifies the Hamiltonian to reduce errors introduced by the non-zero Trotter-Suzuki timestep. All of these techniques are validated using numerical simulation and detailed gate counts are given for realistic molecules.
We analyze the four dimensional toric code in a hyperbolic space and show that it has a classical error correction procedure which runs in almost linear time and can be parallelized to almost constant time, giving an example of a quantum LDPC code with linear rate and efficient error correction.