The propagation of information in non-relativistic quantum systems obeys a speed limit known as a Lieb-Robinson bound. We derive a new Lieb-Robinson bound for systems with interactions that decay with distance r as a power law, 1/rα. The bound implies an effective light cone tighter than all previous bounds. Our approach is based on a technique for approximating the time evolution of a system, which was first introduced as part of a quantum simulation algorithm by Haah et al. [arXiv:1801.03922]. To bound the error of the approximation, we use a known Lieb-Robinson bound that is weaker than the bound we establish. This result brings the analysis full circle, suggesting a deep connection between Lieb-Robinson bounds and digital quantum simulation. In addition to the new Lieb-Robinson bound, our analysis also gives an error bound for the Haah et al. quantum simulation algorithm when used to simulate power-law decaying interactions. In particular, we show that the gate count of the algorithm scales with the system size better than existing algorithms when α>3D (where D is the number of dimensions).

1 aTran, Minh, Cong1 aGuo, Andrew, Y.1 aSu, Yuan1 aGarrison, James, R.1 aEldredge, Zachary1 aFoss-Feig, Michael1 aChilds, Andrew, M.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1808.0522501298nas a2200157 4500008004100000245005600041210005600097260001500153520081900168100002100987700002801008700002101036700002601057700002001083856003701103 2018 eng d00aBell monogamy relations in arbitrary qubit networks0 aBell monogamy relations in arbitrary qubit networks c2018/01/093 aCharacterizing trade-offs between simultaneous violations of multiple Bell inequalities in a large network of qubits is computationally demanding. We propose a graph-theoretic approach to efficiently produce Bell monogamy relations in arbitrary arrangements of qubits. All the relations obtained for bipartite Bell inequalities are tight and leverage only a single Bell monogamy relation. This feature is unique to bipartite Bell inequalities, as we show that there is no finite set of such elementary monogamy relations for multipartite inequalities. Nevertheless, many tight monogamy relations for multipartite inequalities can be obtained with our method as shown in explicit examples.

1 aTran, Minh, Cong1 aRamanathan, Ravishankar1 aMcKague, Matthew1 aKaszlikowski, Dagomir1 aPaterek, Tomasz uhttps://arxiv.org/abs/1801.0307101520nas a2200121 4500008004100000245006500041210006500106260001500171520113200186100002101318700002201339856003701361 2018 eng d00aBlind quantum computation using the central spin Hamiltonian0 aBlind quantum computation using the central spin Hamiltonian c2018/01/113 aBlindness is a desirable feature in delegated computation. In the classical setting, blind computations protect the data or even the program run by a server. In the quantum regime, blind computing may also enable testing computational or other quantum properties of the server system. Here we propose a scheme for universal blind quantum computation using a quantum simulator capable of emulating Heisenberg-like Hamiltonians. Our scheme is inspired by the central spin Hamiltonian in which a single spin controls dynamics of a number of bath spins. We show how, by manipulating this spin, a client that only accesses the central spin can effectively perform blind computation on the bath spins. Remarkably, two-way quantum communication mediated by the central spin is sufficient to ensure security in the scheme. Finally, we provide explicit examples of how our universal blind quantum computation enables verification of the power of the server from classical to stabilizer to full BQP computation.

1 aTran, Minh, Cong1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/1801.0400611925nas a2200205 45000080041000002450079000412100069001202600015001893000011002044900007002155201127900222100002111501700002511522700002011547700001711567700002311584700002011607700002311627856006911650 2017 eng d00aGenuine N -partite entanglement without N -partite correlation functions0 aGenuine N partite entanglement without N partite correlation fun c2017/06/26 a0623310 v953 aA genuinely N-partite entangled state may display vanishing N-partite correlations measured for arbitrary local observables. In such states the genuine entanglement is noticeable solely in correlations between subsets of particles. A straightforward way to obtain such states for odd N is to design an “antistate” in which all correlations between an odd number of observers are exactly opposite. Evenly mixing a state with its antistate then produces a mixed state with no N-partite correlations, with many of them genuinely multiparty entangled. Intriguingly, all known examples of “entanglement without correlations” involve an *odd* number of particles. Here we further develop the idea of antistates, thereby shedding light on the different properties of even and odd particle systems. We conjecture that there is no antistate to any pure even-N-party entangled state making the simple construction scheme unfeasible. However, as we prove by construction, higher-rank examples of entanglement without correlations for arbitrary even N indeed exist. These classes of states exhibit genuine entanglement and even violate an N-partite Bell inequality, clearly demonstrating the nonclassical features of these states as well as showing their applicability for quantum information processing.

Lieb and Robinson provided bounds on how fast bipartite connected correlations can arise in systems with only short-range interactions. We generalize Lieb-Robinson bounds on bipartite connected correlators to multipartite connected correlators. The bounds imply that an n-partite connected correlator can reach unit value in constant time. Remarkably, the bounds also allow for an n-partite connected correlator to reach a value that is exponentially large with system size in constant time, a feature which stands in contrast to bipartite connected correlations. We provide explicit examples of such systems.

1 aTran, Minh, Cong1 aGarrison, James, R.1 aGong, Zhe-Xuan1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1705.0435504239nas a2200157 4500008004100000245006100041210005900102260001500161490000700176520377200183100002103955700002403976700001904000700002504019856003704044 2017 eng d00aLieb-Robinson bounds on n-partite connected correlations0 aLiebRobinson bounds on npartite connected correlations c2017/11/270 v963 aLieb and Robinson provided bounds on how fast bipartite connected correlations can arise in systems with only short-range interactions. We generalize Lieb-Robinson bounds on bipartite connected correlators to multipartite connected correlators. The bounds imply that an

Large quantum simulators, with sufficiently many qubits to be impossible to simulate classically, become hard to experimentally validate. We propose two tests of a quantum simulator with Heisenberg interaction in a linear chain of spins. In the first, we propagate half of a singlet state through a chain of spin with a ferromagnetic interaction and subsequently recover the state with an antiferromagnetic interaction. The antiferromagnetic interaction is intrinsic to the system while the ferromagnetic one can be simulated by a sequence of time-dependent controls of the antiferromagnetic interaction and Suzuki-Trotter approximations. In the second test, we use the same technique to transfer a spin singlet state from one end of a spin chain to the other. We show that the tests are robust against parametric errors in operation of the simulator and may be applicable even without error correction.

1 aWang, Yiping1 aTran, Minh, Cong1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/1712.05282