We generalize past work on quantum sensor networks to show that, for d input parameters, entanglement can yield a factor O(d) improvement in mean squared error when estimating an analytic function of these parameters. We show that the protocol is optimal for qubit sensors, and conjecture an optimal protocol for photons passing through interferometers. Our protocol is also applicable to continuous variable measurements, such as one quadrature of a field operator. We outline a few potential applications, including calibration of laser operations in trapped ion quantum computing.

1 aQian, Kevin1 aEldredge, Zachary1 aGe, Wenchao1 aPagano, Guido1 aMonroe, Christopher1 aPorto, James, V.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1901.0904201743nas a2200205 4500008004100000245007000041210006900111260001500180490000600195520112800201100002101329700002001350700001301370700002401383700002201407700002301429700002301452700002501475856003701500 2019 eng d00aLocality and digital quantum simulation of power-law interactions0 aLocality and digital quantum simulation of powerlaw interactions c07/10/20190 v93 aThe 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.0522501611nas a2200205 4500008004100000245008100041210006900122260001500191490000800206520098000214100001701194700001601211700002401227700002201251700002501273700002401298700002101322700002501343856003701368 2019 eng d00aScale-Invariant Continuous Entanglement Renormalization of a Chern Insulator0 aScaleInvariant Continuous Entanglement Renormalization of a Cher c03/27/20190 v1223 aThe multi-scale entanglement renormalization ansatz (MERA) postulates the existence of quantum circuits that renormalize entanglement in real space at different length scales. Chern insulators, however, cannot have scale-invariant discrete MERA circuits with finite bond dimension. In this Letter, we show that the continuous MERA (cMERA), a modified version of MERA adapted for field theories, possesses a fixed point wavefunction with nonzero Chern number. Additionally, it is well known that reversed MERA circuits can be used to prepare quantum states efficiently in time that scales logarithmically with the size of the system. However, state preparation via MERA typically requires the advent of a full-fledged universal quantum computer. In this Letter, we demonstrate that our cMERA circuit can potentially be realized in existing analog quantum computers, i.e., an ultracold atomic Fermi gas in an optical lattice with light-induced spin-orbit coupling.

1 aChu, Su-Kuan1 aZhu, Guanyu1 aGarrison, James, R.1 aEldredge, Zachary1 aCuriel, Ana, Valdés1 aBienias, Przemyslaw1 aSpielman, I., B.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1807.1148601538nas a2200157 4500008004100000245007800041210006900119260001500188520103700203100001601240700001701256700002201273700002501295700002301320856003701343 2018 eng d00aDistributed Quantum Metrology and the Entangling Power of Linear Networks0 aDistributed Quantum Metrology and the Entangling Power of Linear c2018/07/253 aWe derive a bound on the ability of a linear optical network to estimate a linear combination of independent phase shifts by using an arbitrary non-classical but unentangled input state, thereby elucidating the quantum resources required to obtain the Heisenberg limit with a multi-port interferometer. Our bound reveals that while linear networks can generate highly entangled states, they cannot effectively combine quantum resources that are well distributed across multiple modes for the purposes of metrology: in this sense linear networks endowed with well-distributed quantum resources behave classically. Conversely, our bound shows that linear networks can achieve the Heisenberg limit for distributed metrology when the input photons are hoarded in a small number of input modes, and we present an explicit scheme for doing so. Our results also have implications for measures of non-classicality.

1 aGe, Wenchao1 aJacobs, Kurt1 aEldredge, Zachary1 aGorshkov, Alexey, V.1 aFoss-Feig, Michael uhttps://arxiv.org/abs/1707.0665501425nas a2200157 4500008004100000245007800041210006900119260001500188520092400203100001601127700001701143700002201160700002501182700002301207856003701230 2018 eng d00aDistributed Quantum Metrology and the Entangling Power of Linear Networks0 aDistributed Quantum Metrology and the Entangling Power of Linear c2018/07/253 aWe derive a bound on the ability of a linear optical network to estimate a linear combination of independent phase shifts by using an arbitrary non-classical but unentangled input state, thereby elucidating the quantum resources required to obtain the Heisenberg limit with a multi-port interferometer. Our bound reveals that while linear networks can generate highly entangled states, they cannot effectively combine quantum resources that are well distributed across multiple modes for the purposes of metrology: in this sense linear networks endowed with well-distributed quantum resources behave classically. Conversely, our bound shows that linear networks can achieve the Heisenberg limit for distributed metrology when the input photons are hoarded in a small number of input modes, and we present an explicit scheme for doing so. Our results also have implications for measures of non-classicality.

1 aGe, Wenchao1 aJacobs, Kurt1 aEldredge, Zachary1 aGorshkov, Alexey, V.1 aFoss-Feig, Michael uhttps://arxiv.org/abs/1707.0665501192nas a2200145 4500008004100000245007300041210006900114260001500183520071800198100002200916700002300938700002400961700002500985856003601010 2018 eng d00aOptimal and Secure Measurement Protocols for Quantum Sensor Networks0 aOptimal and Secure Measurement Protocols for Quantum Sensor Netw c2018/03/233 aStudies of quantum metrology have shown that the use of many-body entangled states can lead to an enhancement in sensitivity when compared to product states. In this paper, we quantify the metrological advantage of entanglement in a setting where the quantity to be measured is a linear function of parameters coupled to each qubit individually. We first generalize the Heisenberg limit to the measurement of non-local observables in a quantum network, deriving a bound based on the multi-parameter quantum Fisher information. We then propose a protocol that can make use of GHZ states or spin-squeezed states, and show that in the case of GHZ states the procedure is optimal, i.e., it saturates our bound.

1 aEldredge, Zachary1 aFoss-Feig, Michael1 aRolston, Steven, L.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1607.0464601556nas a2200157 4500008004100000245006300041210006300104520105500167100002101222700002201243700002401265700002301289700002401312700002501336856003701361 2018 eng d00aUnitary Entanglement Construction in Hierarchical Networks0 aUnitary Entanglement Construction in Hierarchical Networks3 aThe construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the preparation of entangled states. We begin by explaining a formal framework, the hierarchical product, in which modular graphs can be easily constructed. This framework naturally leads us to suggest a class of graphs, which we dub hierarchies. We argue that such graphs have favorable properties for quantum information processing, such as a small diameter and small total edge weight, and use the concept of Pareto efficiency to identify promising quantum graph architectures. We present numerical and analytical results on the speed at which large entangled states can be created on nearest-neighbor grids and hierarchy graphs. We also present a scheme for performing circuit placement--the translation from circuit diagrams to machine qubits--on quantum systems whose connectivity is described by hierarchies.

1 aBapat, Aniruddha1 aEldredge, Zachary1 aGarrison, James, R.1 aDesphande, Abhinav1 aChong, Frederic, T.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1808.0787627528nas a2200181 45000080041000002450087000412100069001282600015001973000011002124900008002235202696300231100002227194700001927216700002627235700002327261700002527284856003727309 2017 eng d00aFast State Transfer and Entanglement Renormalization Using Long-Range Interactions0 aFast State Transfer and Entanglement Renormalization Using LongR c2017/10/25 a1705030 v1193 aIn short-range interacting systems, the speed at which entanglement can be established between two separated points is limited by a constant Lieb-Robinson velocity. Long-range interacting systems are capable of faster entanglement generation, but the degree of the speed-up possible is an open question. In this paper, we present a protocol capable of transferring a quantum state across a distance

Tightly confined modes of light, as in optical nanofibers or photonic crystal waveguides, can lead to large optical coupling in atomic systems, which mediates long-range interactions between atoms. These one-dimensional systems can naturally possess couplings that are asymmetric between modes propagating in different directions. Strong long-range interaction among atoms via these modes can drive them to a self-organized periodic distribution. In this paper, we examine the self-organizing behavior of atoms in one dimension coupled to a chiral reservoir. We determine the solution to the equations of motion in different parameter regimes, relative to both the detuning of the pump laser that initializes the atomic dipole-dipole interactions and the degree of reservoir chirality. In addition, we calculate possible experimental signatures such as reflectivity from self-organized atoms and motional sidebands.

1 aEldredge, Zachary1 aSolano, Pablo1 aChang, Darrick1 aGorshkov, Alexey, V. uhttp://journals.aps.org/pra/abstract/10.1103/PhysRevA.94.053855