Searcharxiv⌕ Search

arXiv subjects

Norbert Schuch

Publications and source records attributed to Norbert Schuch.

At least 109 records · Page 6Linked to original sources

Gaussian Matrix Product States

We introduce Gaussian Matrix Product States (GMPS), a generalization of Matrix Product States (MPS) to lattices of harmonic oscillators. Our definition resembles the interpretation of MPS in terms of projected maximally entangled pairs, starting from which we derive several properties of GMPS, often in close analogy to the finite dimensional case: We show how to approximate arbitrary Gaussian states by MPS, we discuss how the entanglement in the bonds can be bounded, we demonstrate how the correlation functions can be computed from the GMPS representation, and that they decay exponentially in one dimension, and finally relate GMPS and ground states of local Hamiltonians.

quant-ph↗

Gapless Hamiltonians for the toric code using the PEPS formalism

We study Hamiltonians which have Kitaev's toric code as a ground state, and show how to construct a Hamiltonian which shares the ground space of the toric code, but which has gapless excitations with a continuous spectrum in the thermodynamic limit. Our construction is based on the framework of Projected Entangled Pair States (PEPS), and can be applied to a large class of two-dimensional systems to obtain gapless "uncle Hamiltonians".

quant-ph↗

Classifying quantum phases using Matrix Product States and PEPS

We give a classification of gapped quantum phases of one-dimensional systems in the framework of Matrix Product States (MPS) and their associated parent Hamiltonians, for systems with unique as well as degenerate ground states, and both in the absence and presence of symmetries. We find that without symmetries, all systems are in the same phase, up to accidental ground state degeneracies. If symmetries are imposed, phases without symmetry breaking (i.e., with unique ground states) are classified by the cohomology classes of the symmetry group, this is, the equivalence classes of its projective representations, a result first derived in [X. Chen, Z.-C. Gu, and X.-G. Wen, Phys. Rev. B 83, 035107 (2011); arXiv:1008.3745]. For phases with symmetry breaking (i.e., degenerate ground states), we find that the symmetry consists of two parts, one of which acts by permuting the ground states, while the other acts on individual ground states, and phases are labelled by both the permutation action of the former and the cohomology class of the latter. Using Projected Entangled Pair States (PEPS), we subsequently extend our framework to the classification of two-dimensional phases in the neighborhood of a number of important cases, in particular systems with unique ground states, degenerate ground states with a local order parameter, and topological order. We also show that in two dimensions, imposing symmetries does not constrain the phase diagram in the same way it does in one dimension. As a central tool, we introduce the isometric form, a normal form for MPS and PEPS which is a renormalization fixed point. Transforming a state to its isometric form does not change the phase, and thus, we can focus on to the classification of isometric forms.

cond-mat.str-el↗

Complexity of commuting Hamiltonians on a square lattice of qubits

We consider the computational complexity of Hamiltonians which are sums of commuting terms acting on plaquettes in a square lattice of qubits, and we show that deciding whether the ground state minimizes the energy of each local term individually is in the complexity class NP. That is, if the ground states has this property, this can be proven using a classical certificate which can be efficiently verified on a classical computer. Different to previous results on commuting Hamiltonians, our certificate proves the existence of such a state without giving instructions on how to prepare it.

quant-ph↗

Computational Difficulty of Computing the Density of States

We study the computational difficulty of computing the ground state degeneracy and the density of states for local Hamiltonians. We show that the difficulty of both problems is exactly captured by a class which we call #BQP, which is the counting version of the quantum complexity class QMA. We show that #BQP is not harder than its classical counting counterpart #P, which in turn implies that computing the ground state degeneracy or the density of states for classical Hamiltonians is just as hard as it is for quantum Hamiltonians.

quant-ph↗

Entanglement spectrum and boundary theories with projected entangled-pair states

In many physical scenarios, close relations between the bulk properties of quantum systems and theories associated to their boundaries have been observed. In this work, we provide an exact duality mapping between the bulk of a quantum spin system and its boundary using Projected Entangled Pair States (PEPS). This duality associates to every region a Hamiltonian on its boundary, in such a way that the entanglement spectrum of the bulk corresponds to the excitation spectrum of the boundary Hamiltonian. We study various specific models, like a deformed AKLT [1], an Ising-type [2], and Kitaev's toric code [3], both in finite ladders and infinite square lattices. In the latter case, some of those models display quantum phase transitions. We find that a gapped bulk phase with local order corresponds to a boundary Hamiltonian with local interactions, whereas critical behavior in the bulk is reflected on a diverging interaction length of the boundary Hamiltonian. Furthermore, topologically ordered states yield non-local Hamiltonians. As our duality also associates a boundary operator to any operator in the bulk, it in fact provides a full holographic framework for the study of quantum many-body systems via their boundary.

cond-mat.str-el↗

Information propagation for interacting particle systems

We show that excitations of interacting quantum particles in lattice models always propagate with a finite speed of sound. Our argument is simple yet general and shows that by focusing on the physically relevant observables one can generally expect a bounded speed of information propagation. The argument applies equally to quantum spins, bosons such as in the Bose-Hubbard model, fermions, anyons, and general mixtures thereof, on arbitrary lattices of any dimension. It also pertains to dissipative dynamics on the lattice, and generalizes to the continuum for quantum fields. Our result can be seen as a meaningful analogue of the Lieb-Robinson bound for strongly correlated models.

quant-ph↗

Highly Entangled States With Almost No Secrecy

In this paper we illuminate the relation between entanglement and secrecy by providing the first example of a quantum state that is highly entangled, but from which, nevertheless, almost no secrecy can be extracted. More precisely, we provide two bounds on the bipartite entanglement of the totally antisymmetric state in dimension d x d. First, we show that the amount of secrecy that can be extracted from the state is low, to be precise it is bounded by O(1/d). Second, we show that the state is highly entangled in the sense that we need a large amount of singlets to create the state: entanglement cost is larger than a constant, independent of d. In order to obtain our results we use representation theory, linear programming and the entanglement measure known as squashed entanglement. Our findings also clarify the relation between the squashed entanglement and the relative entropy of entanglement.

quant-ph↗

Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory

One of the central problems in quantum mechanics is to determine the ground state properties of a system of electrons interacting via the Coulomb potential. Since its introduction by Hohenberg, Kohn, and Sham, Density Functional Theory (DFT) has become the most widely used and successful method for simulating systems of interacting electrons, making their original work one of the most cited in physics. In this letter, we show that the field of computational complexity imposes fundamental limitations on DFT, as an efficient description of the associated universal functional would allow to solve any problem in the class QMA (the quantum version of NP) and thus particularly any problem in NP in polynomial time. This follows from the fact that finding the ground state energy of the Hubbard model in an external magnetic field is a hard problem even for a quantum computer, while given the universal functional it can be computed efficiently using DFT. This provides a clear illustration how the field of quantum computing is useful even if quantum computers would never be built.

quant-ph↗

PEPS as ground states: degeneracy and topology

We introduce a framework for characterizing Matrix Product States (MPS) and Projected Entangled Pair States (PEPS) in terms of symmetries. This allows us to understand how PEPS appear as ground states of local Hamiltonians with finitely degenerate ground states and to characterize the ground state subspace. Subsequently, we apply our framework to show how the topological properties of these ground states can be explained solely from the symmetry: We prove that ground states are locally indistinguishable and can be transformed into each other by acting on a restricted region, we explain the origin of the topological entropy, and we discuss how to renormalize these states based on their symmetries. Finally, we show how the anyonic character of excitations can be understood as a consequence of the underlying symmetries.

quant-ph↗

Matrix Product State and mean field solutions for one-dimensional systems can be found efficiently

We consider the problem of approximating ground states of one-dimensional quantum systems within the two most common variational ansatzes, namely the mean field ansatz and Matrix Product States. We show that both for mean field and for Matrix Product States of fixed bond dimension, the optimal solutions can be found in a way which is provably efficient (i.e., scales polynomially). This implies that the corresponding variational methods can be in principle recast in a way which scales provably polynomially. Moreover, our findings imply that ground states of one-dimensional commuting Hamiltonians can be found efficiently.

quant-ph↗

Simulating two- and three-dimensional frustrated quantum systems with string-bond states

Simulating frustrated quantum magnets is among the most challenging tasks in computational physics. We apply String-Bond States, a recently introduced ansatz which combines Tensor Networks with Monte Carlo based methods, to the simulation of frustrated quantum systems in both two and three dimensions. We compare our results with existing results for unfrustrated and two-dimensional systems with open boundary conditions, and demonstrate that the method applies equally well to the simulation of frustrated systems with periodic boundaries in both two and three dimensions.

cond-mat.str-el↗

Fermionic Projected Entangled Pair States

We introduce a family of states, the fPEPS, which describes fermionic systems on lattices in arbitrary spatial dimensions. It constitutes the natural extension of another family of states, the PEPS, which efficiently approximate ground and thermal states of spin systems with short-range interactions. We give an explicit mapping between those families, which allows us to extend previous simulation methods to fermionic systems. We also show that fPEPS naturally arise as exact ground states of certain fermionic Hamiltonians. We give an example of such a Hamiltonian, exhibiting criticality while obeying an area law.

quant-ph↗

Limitations of Passive Protection of Quantum Information

The ability to protect quantum information from the effect of noise is one of the major goals of quantum information processing. In this article, we study limitations on the asymptotic stability of quantum information stored in passive N-qubit systems. We consider the effect of small imperfections in the implementation of the protecting Hamiltonian in the form of perturbations or weak coupling to a ground state environment. We prove that, regardless of the protecting Hamiltonian, there exists a perturbed evolution that necessitates a final error correcting step when the state of the memory is read. Such an error correction step is shown to require a finite error threshold, the lack thereof being exemplified by the 3D compass model. We go on to present explicit weak Hamiltonian perturbations which destroy the logical information stored in the 2D toric code in a time O(log(N)).

quant-ph↗

How long can a quantum memory withstand depolarizing noise?

We investigate the possibilities and limitations of passive Hamiltonian protection of a quantum memory against depolarizing noise. Without protection, the lifetime of a single qubit is independent of N, the number of qubits composing the memory. In the presence of a protecting Hamiltonian, the lifetime increases at most logarithmically with N. We construct an explicit time-independent Hamiltonian which saturates this bound, exploiting the noise itself to achieve the protection.

quant-ph↗

Ground-State Properties of Quantum Many-Body Systems: Entangled-Plaquette States and Variational Monte Carlo

We propose a new ansatz for the ground-state wave function of quantum many-body systems on a lattice. The key idea is to cover the lattice with plaquettes and obtain a state whose configurational weights can be optimized by means of a Variational Monte Carlo algorithm. Such a scheme applies to any dimension, without any "sign" instability. We show results for various two dimensional spin models (including frustrated ones). A detailed comparison with available exact results, as well as with variational methods based on different ansatzs is offered. In particular, our numerical estimates are in quite good agreement with exact ones for unfrustrated systems, and compare favorably to other methods for frustrated ones.

cond-mat.str-el↗

The computational difficulty of finding MPS ground states

We determine the computational difficulty of finding ground states of one-dimensional (1D) Hamiltonians which are known to be Matrix Product States (MPS). To this end, we construct a class of 1D frustration free Hamiltonians with unique MPS ground states and a polynomial gap above, for which finding the ground state is at least as hard as factoring. By lifting the requirement of a unique ground state, we obtain a class for which finding the ground state solves an NP-complete problem. Therefore, for these Hamiltonians it is not even possible to certify that the ground state has been found. Our results thus imply that in order to prove convergence of variational methods over MPS, as the Density Matrix Renormalization Group, one has to put more requirements than just MPS ground states and a polynomial spectral gap.

quant-ph↗

On entropy growth and the hardness of simulating time evolution

The simulation of quantum systems is a task for which quantum computers are believed to give an exponential speedup as compared to classical ones. While ground states of one-dimensional systems can be efficiently approximated using Matrix Product States (MPS), their time evolution can encode quantum computations, so that simulating the latter should be hard classically. However, one might believe that for systems with high enough symmetry, and thus insufficient parameters to encode a quantum computation, efficient classical simulation is possible. We discuss supporting evidence to the contrary: We provide a rigorous proof of the observation that a time independent local Hamiltonian can yield a linear increase of the entropy when acting on a product state in a translational invariant framework. This criterion has to be met by any classical simulation method, which in particular implies that every global approximation of the evolution requires exponential resources for any MPS based method.

quant-ph↗