In this Letter we make progress on a longstanding open problem of Aaronson and Ambainis [Theory of Computing 1, 47 (2005)]: we show that if A is the adjacency matrix of a sufficiently sparse low-dimensional graph then the unitary operator e^{itA} can be approximated by a unitary operator U(t) whose sparsity pattern is exactly that of a low-dimensional graph which gets more dense as |t| increases. Secondly, we show that if U is a sparse unitary operator with a gap Δin its spectrum, then there exists an approximate logarithm H of U which is also sparse. The sparsity pattern of H gets more dense as 1/Δincreases. These two results can be interpreted as a way to convert between local continuous-time and local discrete-time processes. As an example we show that the discrete-time coined quantum walk can be realised as an approximately local continuous-time quantum walk. Finally, we use our construction to provide a definition for a fractional quantum fourier transform.
Numerous quantum many-body systems are characterized by either fundamental or emergent constraints---such as gauge symmetries or parity superselection for fermions---which effectively limit the accessible observables and realizable operations. Moreover, these constraints combine non-trivially with the potential requirement that operations be performed locally. The combination of symmetry and locality constraints influence our ability to perform quantum error correction in two counterposing ways. On the one hand, they constrain the effect of noise, limiting its possible action over the quantum …
Due to the short decohorence time of qubits available in the NISQ-era, it is essential to pack (minimize the size and or the depth of) a logical quantum circuit as efficiently as possible given a sparsely coupled physical architecture. In this work we introduce a locality-aware qubit routing algorithm based on a graph theoretic framework. Our algorithm is designed for the grid and certain "grid-like" architectures. We experimentally show the competitiveness of algorithm by comparing it against the approximate token swapping algorithm, which is used as a primitive in many state-of-the-art quant…
We discuss quantum non-locality and contextuality using the notion of transition sets. This approach provides a way to obtain a direct logical contradiction with locality/non-contextuality in the EPRB gedanken experiment as well as a clear graphical illustration of what violations of Bell inequalities quantify. In particular, we show graphically how these violations are related to measures of non-local transition sets. We also introduce a new form of contextuality, {\em measurement ordering contextuality}, i.e. there exists commuting operators $\hat{\mathcal{A}}$ and $\hat{\mathcal{B}}$ such t…
We quantify the amount of non-locality contained in n noisy versions of so-called Popescu-Rohrlich boxes (PRBs), i.e., bipartite systems violating the CHSH Bell inequality maximally. Following the approach by Elitzur, Popescu, and Rohrlich, we measure the amount of non-locality of a system by representing it as a convex combination of a local behaviour, with maximal possible weight, and a non-signalling system. We show that the local part of n systems, each of which approximates a PRB with probability $1-ε$, is of order $Θ(ε^{\lceil n/2\rceil})$ in the isotropic, and equal to $(3ε)^n$ in the m…
Adapting a definition of Aaronson and Ambainis [Theory Comput. 1 (2005), 47--79], we call a quantum dynamics on a digraph "saturated Z-local" if the nonzero transition amplitudes specifying the unitary evolution are in exact correspondence with the directed edges (including loops) of the digraph. This idea appears recurrently in a variety of contexts including angular momentum, quantum chaos, and combinatorial matrix theory. Complete characterization of the digraph properties that allow such a process to exist is a long-standing open question that can also be formulated in terms of minimum ran…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly connected and the physics is invariant under the full symmetric group acting on the vertices. We present evidence that the model also has a low-energy phase in which the graph describing the system breaks permutation symmetry and appears to be ordered, low-dimensional and local. Consideration of the free energy associated with the dominant terms in the dynamics show…
We introduce a quantum algorithm that produces approximate solutions for combinatorial optimization problems. The algorithm depends on a positive integer p and the quality of the approximation improves as p is increased. The quantum circuit that implements the algorithm consists of unitary gates whose locality is at most the locality of the objective function whose optimum is sought. The depth of the circuit grows linearly with p times (at worst) the number of constraints. If p is fixed, that is, independent of the input size, the algorithm makes use of efficient classical preprocessing. If p …
We propose a family of non-locality unique games for 2 parties based on a square lattice on an arbitrary surface. We show that, due to structural similarities with error correction codes of Kitaev for fault tolerant quantum computation, the games have classical values computable in polynomial time for $d=2$ measurement outcomes. By representing games in their graph form, for arbitrary $d$ and underlying surface we provide their classification into equivalence classes with respect to relabeling of measurement outcomes, for a selected set of permutations which define the winning conditions. A ca…
One of the authors has recently propounded an SR (semantic realism) model which shows, circumventing known no-go theorems, that an objective (noncontextual, hence local) interpretation of quantum mechanics (QM) is possible. We consider here compound physical systems and show why the proofs of nonlocality of QM do not hold within the SR model. We also discuss quantum measurement theory within this model, note that the objectification problem disappears since the measurement of any property simply reveals its unknown value, and show that the projection postulate can be considered as an approxima…
Non-contextuality (NC) and Bell inequalities can be expressed as bounds $Ω$ for positive linear combinations $S$ of probabilities of events, $S \leq Ω$. Exclusive events in $S$ can be represented as adjacent vertices of a graph called the exclusivity graph of $S$. In the case that events correspond to the outcomes of quantum projective measurements, quantum probabilities are intimately related to the Grötschel-Lovász-Schrijver theta body of the exclusivity graph. Then, one can easily compute an upper bound to the maximum quantum violation of any NC or Bell inequality by optimizing $S$ over the…
Contextuality is often referred to as a generalization of non-locality. In this work, using the hypergraph approach for contextuality we show how to associate a contextual scenario to a general k-partite non local game, and consider the reverse direction: how and when is it possible to represent a general contextuality scenario as a non local game. Using the notion of conditional contextuality, we show that it is possible to embed any contextual scenario in a two players non local game. We also discuss different equivalences of contextuality scenarios and show that the construction used in the…
The Lieb-Robinson theorem states that locality is approximately preserved in the dynamics of quantum lattice systems. Whenever one has finite-dimensional constituents, observables evolving in time under a local Hamiltonian will essentially grow linearly in their support, up to exponentially suppressed corrections. In this work, we formulate Lieb-Robinson bounds for general harmonic systems on general lattices, for which the constituents are infinite-dimensional, as systems representing discrete versions of free fields or the harmonic approximation to the Bose-Hubbard model. We consider both lo…
In a Bell test, the set of observed probability distributions complying with the principle of local realism is fully characterized by Bell inequalities. Quantum theory allows for a violation of these inequalities, which is famously regarded as Bell nonlocality. However, finding the maximal degree of this violation is, in general, an undecidable problem. Consequently, no algorithm can be used to derive quantum analogs of Bell inequalities, which would characterize the set of probability distributions allowed by quantum theory. Here we present a family of inequalities, which approximate the set …
I argue that conventional estimates of the criterion for classical behavior of a macroscopic body are incorrect, because they do not take into account the locality of interactions, which characterizes the behavior of all systems described approximately by local quantum field theory. Black holes are the only localized objects which do not have such a description. The deviations from classical behavior of a macroscopic body, except for those which can be described as classical uncertainties in the initial values of macroscopic variables,are {\it exponentially} small as a function of the volume o…
We consider open many-body systems governed by a time-dependent quantum master equation with short-range interactions. With a generalized Lieb-Robinson bound, we show that the evolution in this very generic framework is quasi-local, i.e., the evolution of observables can be approximated by implementing the dynamics only in a vicinity of the observables' support. The precision increases exponentially with the diameter of the considered subsystem. Hence, the time-evolution can be simulated on classical computers with a cost that is independent of the system size. Providing error bounds for Trott…
We review some recent results that express or rely on the locality properties of the dynamics of quantum spin systems. In particular, we present a slightly sharper version of the recently obtained Lieb-Robinson bound on the group velocity for such systems on a large class of metric graphs. Using this bound we provide expressions of the quasi-locality of the dynamics in various forms, present a proof of the Exponential Clustering Theorem, and discuss a multi-dimensional Lieb-Schultz-Mattis Theorem.
The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with bounded degree, with p small enough, measurements of distant qubits in the state output by the QAOA give uncorrelated results. We focus on finding big independent sets in random graphs with dn/2 edges keeping d fixed and n large. Using the Overlap Gap Property of almost optimal independent sets in random graphs, and the locality of the QAOA, we are able to show th…
I argue that conventional estimates of the criterion for classical behavior of a macroscopic body are incorrect in most circumstances,because they do not take into account the locality of interactions, which characterizes the behavior of all systems described approximately by local quantum field theory. The deviations from classical behavior of a macroscopic body, except for those that can be described as classical uncertainties in the initial values of macroscopic variables,are {\it exponentially} small as a function of the volume of the macro-system in microscopic units. Conventional estimat…
This work is concerned with thermal quantum states of Hamiltonians on spin and fermionic lattice systems with short range interactions. We provide results leading to a local definition of temperature, thereby extending the notion of "intensivity of temperature" to interacting quantum models. More precisely, we derive a perturbation formula for thermal states. The influence of the perturbation is exactly given in terms of a generalized covariance. For this covariance, we prove exponential clustering of correlations above a universal critical temperature that upper bounds physical critical tempe…
