What Would It Take to Feel Safe?

What would it take to make people feel safe? What message will those who would wage peace offer to this beleaguered planet? There is indeed a threat. I will call that threat terrorist fascism because that is what it is. It thwarts human beings in pursuit of the most basic need identified by psychologists: The need to feel their bodies are safe. This threat is horrible indeed, and the road to ending it is long and hard. I do not know all we need to do to end terrorist fascism, but what I know of history tells me that militarism is less the answer to, than the fellow traveler of, fascists. Nothing will make us safe other than what democracy commands: Ask hard questions, consider all voices as we face this current threat. I often wonder, Could we do a better job in fighting terrorism if we had Arabic-speaking Muslim citizens in the FBI? If we knew more about Arab Americans, could we come up with more effective tactics than racial profiling and mass detentions to get the information we need to make us safe

Positive Wigner functions render classical simulation of quantum computation efficient

We show that quantum circuits where the initial state and all the following quantum operations can be represented by positive Wigner functions can be classically efficiently simulated. This is true both for continuous-variable as well as discrete variable systems in odd prime dimensions, two cases which will be treated on entirely the same footing. Noting the fact that Clifford and Gaussian operations preserve the positivity of the Wigner function, our result generalizes the Gottesman-Knill theorem. Our algorithm provides a way of sampling from the output distribution of a computation or a simulation, including the efficient sampling from an approximate output distribution in case of sampling imperfections for initial states, gates, or measurements. In this sense, this work highlights the role of the positive Wigner function as separating classically efficiently simulatable systems from those that are potentially universal for quantum computing and simulation, and it emphasizes the role of negativity of the Wigner function as a computational resource.Comment: 7 pages, minor change

Variational Matrix Product Operators for the Steady State of Dissipative Quantum Systems

We present a new variational method, based on the matrix product operator (MPO) ansatz, for finding the steady state of dissipative quantum chains governed by master equations of the Lindblad form. Instead of requiring an accurate representation of the system evolution until the stationary state is attained, the algorithm directly targets the final state, thus allowing for a faster convergence when the steady state is a MPO with small bond dimension. Our numerical simulations for several dissipative spin models over a wide range of parameters illustrate the performance of the method and show that indeed the stationary state is often well described by a MPO of very moderate dimensions.Comment: Accepted versio

Algorithms for finite Projected Entangled Pair States

Projected Entangled Pair States (PEPS) are a promising ansatz for the study of strongly correlated quantum many-body systems in two dimensions. But due to their high computational cost, developing and improving PEPS algorithms is necessary to make the ansatz widely usable in practice. Here we analyze several algorithmic aspects of the method. On the one hand, we quantify the connection between the correlation length of the PEPS and the accuracy of its approximate contraction, and discuss how purifications can be used in the latter. On the other, we present algorithmic improvements for the update of the tensor that introduce drastic gains in the numerical conditioning and the efficiency of the algorithms. Finally, the state-of-the-art general PEPS code is benchmarked with the Heisenberg and quantum Ising models on lattices of up to $21 \times 21$ sites.Comment: 18 pages, 20 figures, accepted versio

Quantum simulation of the Schwinger model: A study of feasibility

We analyze some crucial questions regarding the practical feasibility of quantum simulation for lattice gauge models. Our analysis focuses on two models suitable for the quantum simulation of the Schwinger Hamiltonian, or QED in 1+1 dimensions, which we investigate numerically using tensor networks. In particular, we explore the effect of representing the gauge degrees of freedom with finite-dimensional systems and show that the results converge rapidly; thus even with small dimensions it is possible to obtain a reasonable accuracy. We also discuss the time scales required for the adiabatic preparation of the interacting vacuum state and observe that for a suitable ramping of the interaction the required time is almost insensitive to the system size and the dimension of the physical systems. Finally, we address the possible presence of noninvariant terms in the Hamiltonian that is realized in the experiment and show that for low levels of noise it is still possible to achieve a good precision for some ground-state observables, even if the gauge symmetry is not exact in the implemented model.Comment: 10 pages, 10 figures, published versio

Unifying Projected Entangled Pair States contractions

The approximate contraction of a Projected Entangled Pair States (PEPS) tensor network is a fundamental ingredient of any PEPS algorithm, required for the optimization of the tensors in ground state search or time evolution, as well as for the evaluation of expectation values. An exact contraction is in general impossible, and the choice of the approximating procedure determines the efficiency and accuracy of the algorithm. We analyze different previous proposals for this approximation, and show that they can be understood via the form of their environment, i.e. the operator that results from contracting part of the network. This provides physical insight into the limitation of various approaches, and allows us to introduce a new strategy, based on the idea of clusters, that unifies previous methods. The resulting contraction algorithm interpolates naturally between the cheapest and most imprecise and the most costly and most precise method. We benchmark the different algorithms with finite PEPS, and show how the cluster strategy can be used for both the tensor optimization and the calculation of expectation values. Additionally, we discuss its applicability to the parallelization of PEPS and to infinite systems (iPEPS).Comment: 28 pages, 15 figures, accepted versio

Non-Abelian string breaking phenomena with Matrix Product States

Using matrix product states, we explore numerically the phenomenology of string breaking in a non-Abelian lattice gauge theory, namely 1+1 dimensional SU(2). The technique allows us to study the static potential between external heavy charges, as traditionally explored by Monte Carlo simulations, but also to simulate the real-time dynamics of both static and dynamical fermions, as the latter are fully included in the formalism. We propose a number of observables that are sensitive to the presence or breaking of the flux string, and use them to detect and characterize the phenomenon in each of these setups.Comment: 20+5 pages, 14 figures, version 2 contains more numerical results, version 3: published versio