01807nas a2200181 4500008004100000022001400041245003600055210003500091260001400126490000600140520134200146100001501488700002301503700001701526700002401543700002101567856003701588 2024 eng d a2691-339900aClifford-Deformed Surface Codes0 aCliffordDeformed Surface Codes c3/19/20240 v53 a

Various realizations of Kitaev's surface code perform surprisingly well for biased Pauli noise. Attracted by these potential gains, we study the performance of Clifford-deformed surface codes (CDSCs) obtained from the surface code by applying single-qubit Clifford operators. We first analyze CDSCs on the 3×3 square lattice and find that, depending on the noise bias, their logical error rates can differ by orders of magnitude. To explain the observed behavior, we introduce the effective distance d′, which reduces to the standard distance for unbiased noise. To study CDSC performance in the thermodynamic limit, we focus on random CDSCs. Using the statistical mechanical mapping for quantum codes, we uncover a phase diagram that describes random CDSC families with 50% threshold at infinite bias. In the high-threshold region, we further demonstrate that typical code realizations outperform the thresholds and subthreshold logical error rates, at finite bias, of the best-known translationally invariant codes. We demonstrate the practical relevance of these random CDSC families by constructing a translation-invariant CDSC belonging to a high-performance random CDSC family. We also show that our translation-invariant CDSC outperforms well-known translation-invariant CDSCs such as the XZZX and XY codes.

1 aDua, Arpit1 aKubica, Aleksander1 aJiang, Liang1 aFlammia, Steven, T.1 aGullans, Michael uhttps://arxiv.org/abs/2201.0780202447nas a2200169 4500008004100000245005000041210004900091260001300140520194800153100002002101700003302121700002102154700002802175700001702203700002002220856003702240 2024 eng d00aComplexity-constrained quantum thermodynamics0 aComplexityconstrained quantum thermodynamics c3/7/20243 a

Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the process's complexity is restricted. We focus on the prototypical task of information erasure, or Landauer erasure, wherein an n-qubit memory is reset to the all-zero state. We show that the minimum thermodynamic work required to reset an arbitrary state, via a complexity-constrained process, is quantified by the state's complexity entropy. The complexity entropy therefore quantifies a trade-off between the work cost and complexity cost of resetting a state. If the qubits have a nontrivial (but product) Hamiltonian, the optimal work cost is determined by the complexity relative entropy. The complexity entropy quantifies the amount of randomness a system appears to have to a computationally limited observer. Similarly, the complexity relative entropy quantifies such an observer's ability to distinguish two states. We prove elementary properties of the complexity (relative) entropy and determine the complexity entropy's behavior under random circuits. Also, we identify information-theoretic applications of the complexity entropy. The complexity entropy quantifies the resources required for data compression if the compression algorithm must use a restricted number of gates. We further introduce a complexity conditional entropy, which arises naturally in a complexity-constrained variant of information-theoretic decoupling. Assuming that this entropy obeys a conjectured chain rule, we show that the entropy bounds the number of qubits that one can decouple from a reference system, as judged by a computationally bounded referee. Overall, our framework extends the resource-theoretic approach to thermodynamics to integrate a notion of time, as quantified by complexity.

1 aMunson, Anthony1 aKothakonda, Naga, Bhavya Tej1 aHaferkamp, Jonas1 aHalpern, Nicole, Yunger1 aEisert, Jens1 aFaist, Philippe uhttps://arxiv.org/abs/2403.0482802447nas a2200169 4500008004100000245005000041210004900091260001300140520194800153100002002101700003302121700002102154700002802175700001702203700002002220856003702240 2024 eng d00aComplexity-constrained quantum thermodynamics0 aComplexityconstrained quantum thermodynamics c3/7/20243 a

Quantum complexity measures the difficulty of realizing a quantum process, such as preparing a state or implementing a unitary. We present an approach to quantifying the thermodynamic resources required to implement a process if the process's complexity is restricted. We focus on the prototypical task of information erasure, or Landauer erasure, wherein an n-qubit memory is reset to the all-zero state. We show that the minimum thermodynamic work required to reset an arbitrary state, via a complexity-constrained process, is quantified by the state's complexity entropy. The complexity entropy therefore quantifies a trade-off between the work cost and complexity cost of resetting a state. If the qubits have a nontrivial (but product) Hamiltonian, the optimal work cost is determined by the complexity relative entropy. The complexity entropy quantifies the amount of randomness a system appears to have to a computationally limited observer. Similarly, the complexity relative entropy quantifies such an observer's ability to distinguish two states. We prove elementary properties of the complexity (relative) entropy and determine the complexity entropy's behavior under random circuits. Also, we identify information-theoretic applications of the complexity entropy. The complexity entropy quantifies the resources required for data compression if the compression algorithm must use a restricted number of gates. We further introduce a complexity conditional entropy, which arises naturally in a complexity-constrained variant of information-theoretic decoupling. Assuming that this entropy obeys a conjectured chain rule, we show that the entropy bounds the number of qubits that one can decouple from a reference system, as judged by a computationally bounded referee. Overall, our framework extends the resource-theoretic approach to thermodynamics to integrate a notion of time, as quantified by complexity.

1 aMunson, Anthony1 aKothakonda, Naga, Bhavya Tej1 aHaferkamp, Jonas1 aHalpern, Nicole, Yunger1 aEisert, Jens1 aFaist, Philippe uhttps://arxiv.org/abs/2403.0482801739nas a2200121 4500008004100000245004000041210004000081260001300121520140700134100001701541700002201558856003701580 2024 eng d00aError Correction in Dynamical Codes0 aError Correction in Dynamical Codes c3/7/20243 a

We ask what is the general framework for a quantum error correcting code that is defined by a sequence of measurements. Recently, there has been much interest in Floquet codes and space-time codes. In this work, we define and study the distance of a dynamical code. This is a subtle concept and difficult to determine: At any given time, the system will be in a subspace which forms a quantum error-correcting code with a given distance, but the full error correction capability of that code may not be available due to the schedule of measurements associated with the code. We address this challenge by developing an algorithm that tracks information we have learned about the error syndromes through the protocol and put that together to determine the distance of a dynamical code, in a non-fault-tolerant context. We use the tools developed for the algorithm to analyze the initialization and masking properties of a generic Floquet code. Further, we look at properties of dynamical codes under the constraint of geometric locality with a view to understand whether the fundamental limitations on logical gates and code parameters imposed by geometric locality for traditional codes can be surpassed in the dynamical paradigm. We find that codes with a limited number of long range connectivity will not allow non-Clifford gates to be implemented with finite depth circuits in the 2D setting.

1 aFu, Xiaozhen1 aGottesman, Daniel uhttps://arxiv.org/abs/2403.0416301993nas a2200205 4500008004100000022001400041245010700055210006900162260001400231490000800245520134600253100001901599700001901618700002001637700001901657700002901676700002001705700002501725856003701750 2024 eng d a1079-711400aHigh-Energy Collision of Quarks and Mesons in the Schwinger Model: From Tensor Networks to Circuit QED0 aHighEnergy Collision of Quarks and Mesons in the Schwinger Model c2/28/20240 v1323 a

With the aim of studying nonperturbative out-of-equilibrium dynamics of high-energy particle collisions on quantum simulators, we investigate the scattering dynamics of lattice quantum electrodynamics in 1+1 dimensions. Working in the bosonized formulation of the model and in the thermodynamic limit, we use uniform-matrix-product-state tensor networks to construct multi-particle wave-packet states, evolve them in time, and detect outgoing particles post collision. This facilitates the numerical simulation of scattering experiments in both confined and deconfined regimes of the model at different energies, giving rise to rich phenomenology, including inelastic production of quark and meson states, meson disintegration, and dynamical string formation and breaking. We obtain elastic and inelastic scattering cross sections, together with time-resolved momentum and position distributions of the outgoing particles. Furthermore, we propose an analog circuit-QED implementation of the scattering process that is native to the platform, requires minimal ingredients and approximations, and enables practical schemes for particle wave-packet preparation and evolution. This study highlights the role of classical and quantum simulation in enhancing our understanding of scattering processes in quantum field theories in real time.

1 aBelyansky, Ron1 aWhitsitt, Seth1 aMueller, Niklas1 aFahimniya, Ali1 aBennewitz, Elizabeth, R.1 aDavoudi, Zohreh1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2307.0252201965nas a2200205 4500008004100000245009400041210006900135260001400204520132100218100002001539700002101559700001701580700002301597700001701620700001801637700001801655700002501673700002401698856003701722 2024 eng d00aLong-Distance Nuclear Matrix Elements for Neutrinoless Double-Beta Decay from Lattice QCD0 aLongDistance Nuclear Matrix Elements for Neutrinoless DoubleBeta c2/14/20243 a

Neutrinoless double-beta (0νββ) decay is a heretofore unobserved process which, if observed, would imply that neutrinos are Majorana particles. Interpretations of the stringent experimental constraints on 0νββ-decay half-lives require calculations of nuclear matrix elements. This work presents the first lattice quantum-chromodynamics (LQCD) calculation of the matrix element for 0νββ decay in a multi-nucleon system, specifically the nn→ppee transition, mediated by a light left-handed Majorana neutrino propagating over nuclear-scale distances. This calculation is performed with quark masses corresponding to a pion mass of mπ=806 MeV at a single lattice spacing and volume. The statistically cleaner Σ−→Σ+ee transition is also computed in order to investigate various systematic uncertainties. The prospects for matching the results of LQCD calculations onto a nuclear effective field theory to determine a leading-order low-energy constant relevant for 0νββ decay with a light Majorana neutrino are investigated. This work, therefore, sets the stage for future calculations at physical values of the quark masses that, combined with effective field theory and nuclear many-body studies, will provide controlled theoretical inputs to experimental searches of 0νββ decay.

1 aDavoudi, Zohreh1 aDetmold, William1 aFu, Zhenghao1 aGrebe, Anthony, V.1 aJay, William1 aMurphy, David1 aOare, Patrick1 aShanahan, Phiala, E.1 aWagman, Michael, L. uhttps://arxiv.org/abs/2402.0936202465nas a2200517 4500008004100000245011600041210006900157260001400226520098200240100001701222700001701239700002501256700002001281700002401301700002201325700001601347700001901363700001901382700001801401700001901419700002001438700001901458700002101477700003101498700001801529700001901547700001601566700001601582700001601598700002001614700001901634700002101653700001901674700002201693700001801715700002401733700002301757700001801780700002001798700001801818700002301836700001901859700002001878700001201898856003701910 2023 eng d00aAccelerating Progress Towards Practical Quantum Advantage: The Quantum Technology Demonstration Project Roadmap0 aAccelerating Progress Towards Practical Quantum Advantage The Qu c3/20/20233 a

Quantum information science and technology (QIST) is a critical and emerging technology with the potential for enormous world impact and is currently invested in by over 40 nations. To bring these large-scale investments to fruition and bridge the lower technology readiness levels (TRLs) of fundamental research at universities to the high TRLs necessary to realize the promise of practical quantum advantage accessible to industry and the public, we present a roadmap for Quantum Technology Demonstration Projects (QTDPs). Such QTDPs, focused on intermediate TRLs, are large-scale public-private partnerships with a high probability of translation from laboratory to practice. They create technology demonstrating a clear 'quantum advantage' for science breakthroughs that are user-motivated and will provide access to a broad and diverse community of scientific users. Successful implementation of a program of QTDPs will have large positive economic impacts.

1 aAlsing, Paul1 aBattle, Phil1 aBienfang, Joshua, C.1 aBorders, Tammie1 aBrower-Thomas, Tina1 aCarr, Lincoln, D.1 aChong, Fred1 aDadras, Siamak1 aDeMarco, Brian1 aDeutsch, Ivan1 aFigueroa, Eden1 aFreedman, Danna1 aEveritt, Henry1 aGauthier, Daniel1 aJohnston-Halperin, Ezekiel1 aKim, Jungsang1 aKira, Mackillo1 aKumar, Prem1 aKwiat, Paul1 aLekki, John1 aLoiacono, Anjul1 aLončar, Marko1 aLowell, John, R.1 aLukin, Mikhail1 aMerzbacher, Celia1 aMiller, Aaron1 aMonroe, Christopher1 aPollanen, Johannes1 aPappas, David1 aRaymer, Michael1 aReano, Ronald1 aRodenburg, Brandon1 aSavage, Martin1 aSearles, Thomas1 aYe, Jun uhttps://arxiv.org/abs/2210.1475701506nas a2200157 4500008004100000245005800041210005700099260001400156520104400170100002001214700001801234700002101252700002001273700001801293856003701311 2023 eng d00aEffect of non-unital noise on random circuit sampling0 aEffect of nonunital noise on random circuit sampling c6/28/20233 a

In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical non-unital noise sources with constant noise rates. We show that even in the presence of unital sources like the depolarizing channel, the distribution, under the combined noise channel, never resembles a maximally entropic distribution at any depth. To show this, we prove that the output distribution of such circuits never anticoncentrates — meaning it is never too "flat" — regardless of the depth of the circuit. This is in stark contrast to the behavior of noiseless random quantum circuits or those with only unital noise, both of which anticoncentrate at sufficiently large depths. As consequences, our results have interesting algorithmic implications on both the hardness and easiness of noisy random circuit sampling, since anticoncentration is a critical property exploited by both state-of-the-art classical hardness and easiness results.

1 aFefferman, Bill1 aGhosh, Soumik1 aGullans, Michael1 aKuroiwa, Kohdai1 aSharma, Kunal uhttps://arxiv.org/abs/2306.1665902358nas a2200145 4500008004100000245007400041210006900115260001400184520188700198100002002085700002002105700002802125700002202153856003702175 2023 eng d00aEfficient learning of ground & thermal states within phases of matter0 aEfficient learning of ground thermal states within phases of mat c1/30/20233 a

We consider two related tasks: (a) estimating a parameterisation of a given Gibbs state and expectation values of Lipschitz observables on this state; and (b) learning the expectation values of local observables within a thermal or quantum phase of matter. In both cases, we wish to minimise the number of samples we use to learn these properties to a given precision.
For the first task, we develop new techniques to learn parameterisations of classes of systems, including quantum Gibbs states of non-commuting Hamiltonians with exponential decay of correlations and the approximate Markov property. We show it is possible to infer the expectation values of all extensive properties of the state from a number of copies that not only scales polylogarithmically with the system size, but polynomially in the observable's locality -- an exponential improvement. This set of properties includes expected values of quasi-local observables and entropies.  For the second task, we develop efficient algorithms for learning observables in a phase of matter of a quantum system. By exploiting the locality of the Hamiltonian, we show that M local observables can be learned with probability 1−δ to precision ϵ with using only N=O(log(Mδ)epolylog(ϵ−1)) samples -- an exponential improvement on the precision over previous bounds. Our results apply to both families of ground states of Hamiltonians displaying local topological quantum order, and thermal phases of matter with exponential decay of correlations. In addition, our sample complexity applies to the worse case setting whereas previous results only applied on average.
Furthermore, we develop tools of independent interest, such as robust shadow tomography algorithms, Gibbs approximations to ground states, and generalisations of transportation cost inequalities for Gibbs states.

1 aOnorati, Emilio1 aRouzé, Cambyse1 aFrança, Daniel, Stilck1 aWatson, James, D. uhttps://arxiv.org/abs/2301.1294602121nas a2200181 4500008004100000245006900041210006800110260001400178520156100192100001901753700002201772700001901794700001901813700002401832700002501856700002101881856003701902 2023 eng d00aFault-tolerant hyperbolic Floquet quantum error correcting codes0 aFaulttolerant hyperbolic Floquet quantum error correcting codes c9/18/20233 a

A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes." These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate (1/8+2/n) and have a depth-3 syndrome extraction circuit. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n. The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [[400,52,8]] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.

1 aFahimniya, Ali1 aDehghani, Hossein1 aBharti, Kishor1 aMathew, Sheryl1 aKollár, Alicia, J.1 aGorshkov, Alexey, V.1 aGullans, Michael uhttps://arxiv.org/abs/2309.1003301860nas a2200145 4500008004100000245007100041210006900112260001500181520139900196100001601595700002101611700002401632700002101656856003701677 2023 eng d00aFault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes0 aFaultTolerant Quantum Memory using LowDepth Random Circuit Codes c11/29/20233 a

Low-depth random circuit codes possess many desirable properties for quantum error correction but have so far only been analyzed in the code capacity setting where it is assumed that encoding gates and syndrome measurements are noiseless. In this work, we design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes even when all gates and measurements are subject to noise. This is sufficient for fault-tolerant quantum memory since these encoded states can then be used as ancillas for Steane error correction. We show through numerical simulations that our protocol can correct erasure errors up to an error rate of 2%. In addition, we also extend results in the code capacity setting by developing a maximum likelihood decoder for depolarizing noise similar to work by Darmawan et al. As in their work, we formulate the decoding problem as a tensor network contraction and show how to contract the network efficiently by exploiting the low-depth structure. Replacing the tensor network with a so-called ''tropical'' tensor network, we also show how to perform minimum weight decoding. With these decoders, we are able to numerically estimate the depolarizing error threshold of finite-rate random circuit codes and show that this threshold closely matches the hashing bound even when the decoding is sub-optimal.

1 aNelson, Jon1 aBentsen, Gregory1 aFlammia, Steven, T.1 aGullans, Michael uhttps://arxiv.org/abs/2311.1798501923nas a2200253 4500008004100000020002200041245008700063210006900150260004800219520105800267100002001325700001901345700002301364700001501387700001601402700002401418700002001442700002201462700001201484700001501496700002201511700002201533856011401555 2023 eng d a978-3-031-38554-400aFixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium0 aFixing and Mechanizing the Security Proof of FiatShamir with Abo aChambSpringer Nature Switzerlandc8/9/20233 a

We extend and consolidate the security justification for the Dilithium signature scheme. In particular, we identify a subtle but crucial gap that appears in several ROM and QROM security proofs for signature schemes that are based on the Fiat-Shamir with aborts paradigm, including Dilithium. The gap lies in the CMA-to-NMA reduction and was uncovered when trying to formalize a variant of the QROM security proof by Kiltz, Lyubashevsky, and Schaffner (Eurocrypt 2018). The gap was confirmed by the authors, and there seems to be no simple patch for it. We provide new, fixed proofs for the affected CMA-to-NMA reduction, both for the ROM and the QROM, and we perform a concrete security analysis for the case of Dilithium to show that the claimed security level is still valid after addressing the gap. Furthermore, we offer a fully mechanized ROM proof for the CMA-security of Dilithium in the EasyCrypt proof assistant. Our formalization includes several new tools and techniques of independent interest for future formal verification results.

1 aBarbosa, Manuel1 aBarthe, Gilles1 aDoczkal, Christian1 aDon, Jelle1 aFehr, Serge1 aGrégoire, Benjamin1 aHuang, Yu-Hsuan1 aHülsing, Andreas1 aLee, Yi1 aWu, Xiaodi1 aHandschuh, Helena1 aLysyanskaya, Anna uhttps://www.quics.umd.edu/publications/fixing-and-mechanizing-security-proof-fiat-shamir-aborts-and-dilithium01926nas a2200181 4500008004100000245010800041210006900149260001300218520132500231100001901556700001901575700002001594700001901614700002901633700002001662700002501682856003701707 2023 eng d00aHigh-Energy Collision of Quarks and Hadrons in the Schwinger Model: From Tensor Networks to Circuit QED0 aHighEnergy Collision of Quarks and Hadrons in the Schwinger Mode c7/5/20233 a

With the aim of studying nonperturbative out-of-equilibrium dynamics of high-energy particle collisions on quantum simulators, we investigate the scattering dynamics of lattice quantum electrodynamics in 1+1 dimensions. Working in the bosonized formulation of the model, we propose an analog circuit-QED implementation that is native to the platform, requires minimal ingredients and approximations, and enables practical schemes for particle wave-packet preparation and evolution. Furthermore, working in the thermodynamic limit, we use uniform-matrix-product-state tensor networks to construct multi-particle wave-packet states, evolve them in time, and detect outgoing particles post collision. This facilitates the numerical simulation of scattering experiments in both confined and deconfined regimes of the model at different energies, giving rise to rich phenomenology, including inelastic production of quark and meson states, meson disintegration, and dynamical string formation and breaking. We obtain elastic and inelastic scattering cross sections, together with time-resolved momentum and position distributions of the outgoing particles. This study highlights the role of classical and quantum simulation in enhancing our understanding of scattering processes in quantum field theories in real time.

1 aBelyansky, Ron1 aWhitsitt, Seth1 aMueller, Niklas1 aFahimniya, Ali1 aBennewitz, Elizabeth, R.1 aDavoudi, Zohreh1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2307.0252202618nas a2200229 4500008004100000245007500041210006900116260001500185520193200200100001902132700002002151700002602171700001702197700001802214700001802232700002302250700002202273700001502295700001802310700002302328856003702351 2023 eng d00aMicrowave signal processing using an analog quantum reservoir computer0 aMicrowave signal processing using an analog quantum reservoir co c12/26/20233 a

Quantum reservoir computing (QRC) has been proposed as a paradigm for performing machine learning with quantum processors where the training is efficient in the number of required runs of the quantum processor and takes place in the classical domain, avoiding the issue of barren plateaus in parameterized-circuit quantum neural networks. It is natural to consider using a quantum processor based on superconducting circuits to classify microwave signals that are analog -- continuous in time. However, while theoretical proposals of analog QRC exist, to date QRC has been implemented using circuit-model quantum systems -- imposing a discretization of the incoming signal in time, with each time point input by executing a gate operation. In this paper we show how a quantum superconducting circuit comprising an oscillator coupled to a qubit can be used as an analog quantum reservoir for a variety of classification tasks, achieving high accuracy on all of them. Our quantum system was operated without artificially discretizing the input data, directly taking in microwave signals. Our work does not attempt to address the question of whether QRCs could provide a quantum computational advantage in classifying pre-recorded classical signals. However, beyond illustrating that sophisticated tasks can be performed with a modest-size quantum system and inexpensive training, our work opens up the possibility of achieving a different kind of advantage than a purely computational advantage: superconducting circuits can act as extremely sensitive detectors of microwave photons; our work demonstrates processing of ultra-low-power microwave signals in our superconducting circuit, and by combining sensitive detection with QRC processing within the same system, one could achieve a quantum sensing-computational advantage, i.e., an advantage in the overall analysis of microwave signals comprising just a few photons.

1 aSenanian, Alen1 aPrabhu, Sridhar1 aKremenetski, Vladimir1 aRoy, Saswata1 aCao, Yingkang1 aKline, Jeremy1 aOnodera, Tatsuhiro1 aWright, Logan, G.1 aWu, Xiaodi1 aFatemi, Valla1 aMcMahon, Peter, L. uhttps://arxiv.org/abs/2312.1616601472nas a2200133 4500008004100000245008700041210006900128260001500197520101000212100002601222700003001248700002301278856003701301 2023 eng d00aNon-invertible symmetry-protected topological order in a group-based cluster state0 aNoninvertible symmetryprotected topological order in a groupbase c12/14/20233 a

Despite growing interest in beyond-group symmetries in quantum condensed matter systems, there are relatively few microscopic lattice models explicitly realizing these symmetries, and many phenomena have yet to be studied at the microscopic level. We introduce a one-dimensional stabilizer Hamiltonian composed of group-based Pauli operators whose ground state is a G×Rep(G)-symmetric state: the G cluster state introduced in Brell, New Journal of Physics 17, 023029 (2015) [at this http URL]. We show that this state lies in a symmetry-protected topological (SPT) phase protected by G×Rep(G) symmetry, distinct from the symmetric product state by a duality argument. We identify several signatures of SPT order, namely protected edge modes, string order parameters, and topological response. We discuss how G cluster states may be used as a universal resource for measurement-based quantum computation, explicitly working out the case where G is a semidirect product of abelian groups.

1 aFechisin, Christopher1 aTantivasadakarn, Nathanan1 aAlbert, Victor, V. uhttps://arxiv.org/abs/2312.0927202080nas a2200193 4500008004100000245009100041210006900132260001500201520147600216100002501692700001301717700001401730700001901744700001601763700002101779700002501800700002401825856003701849 2023 eng d00aObservation of a finite-energy phase transition in a one-dimensional quantum simulator0 aObservation of a finiteenergy phase transition in a onedimension c10/30/20233 a

One of the most striking many-body phenomena in nature is the sudden change of macroscopic properties as the temperature or energy reaches a critical value. Such equilibrium transitions have been predicted and observed in two and three spatial dimensions, but have long been thought not to exist in one-dimensional (1D) systems. Fifty years ago, Dyson and Thouless pointed out that a phase transition in 1D can occur in the presence of long-range interactions, but an experimental realization has so far not been achieved due to the requirement to both prepare equilibrium states and realize sufficiently long-range interactions. Here we report on the first experimental demonstration of a finite-energy phase transition in 1D. We use the simple observation that finite-energy states can be prepared by time-evolving product initial states and letting them thermalize under the dynamics of a many-body Hamiltonian. By preparing initial states with different energies in a 1D trapped-ion quantum simulator, we study the finite-energy phase diagram of a long-range interacting quantum system. We observe a ferromagnetic equilibrium phase transition as well as a crossover from a low-energy polarized paramagnet to a high-energy unpolarized paramagnet in a system of up to 23 spins, in excellent agreement with numerical simulations. Our work demonstrates the ability of quantum simulators to realize and study previously inaccessible phases at finite energy density.

1 aSchuckert, Alexander1 aKatz, Or1 aFeng, Lei1 aCrane, Eleanor1 aDe, Arinjoy1 aHafezi, Mohammad1 aGorshkov, Alexey, V.1 aMonroe, Christopher uhttps://arxiv.org/abs/2310.1986901762nas a2200133 4500008004100000245007100041210006900112260001400181520134900195100001601544700001801560700001301578856003701591 2023 eng d00aParallel self-testing of EPR pairs under computational assumptions0 aParallel selftesting of EPR pairs under computational assumption c3/29/20233 a

Self-testing is a fundamental feature of quantum mechanics that allows a classical verifier to force untrusted quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two spatially separated devices. Recently, Metger and Vidick [Quantum, 2021] showed that a single EPR pair of a single quantum device can be self-tested under computational assumptions. In this work, we generalize their results to give the first parallel self-test of N EPR pairs and measurements on them in the single-device setting under the same computational assumptions. We show that our protocol can be passed with probability negligibly close to 1 by an honest quantum device using poly(N) resources. Moreover, we show that any quantum device that fails our protocol with probability at most ϵ must be poly(N,ϵ)-close to being honest in the appropriate sense. In particular, our protocol can test any distribution over tensor products of computational or Hadamard basis measurements, making it suitable for applications such as device-independent quantum key distribution under computational assumptions. Moreover, a simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a single cloud quantum computer using only classical communication.

1 aFu, Honghao1 aWang, Daochen1 aZhao, Qi uhttps://arxiv.org/abs/2201.1343001762nas a2200133 4500008004100000245007100041210006900112260001400181520134900195100001601544700001801560700001301578856003701591 2023 eng d00aParallel self-testing of EPR pairs under computational assumptions0 aParallel selftesting of EPR pairs under computational assumption c3/29/20233 a

Self-testing is a fundamental feature of quantum mechanics that allows a classical verifier to force untrusted quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two spatially separated devices. Recently, Metger and Vidick [Quantum, 2021] showed that a single EPR pair of a single quantum device can be self-tested under computational assumptions. In this work, we generalize their results to give the first parallel self-test of N EPR pairs and measurements on them in the single-device setting under the same computational assumptions. We show that our protocol can be passed with probability negligibly close to 1 by an honest quantum device using poly(N) resources. Moreover, we show that any quantum device that fails our protocol with probability at most ϵ must be poly(N,ϵ)-close to being honest in the appropriate sense. In particular, our protocol can test any distribution over tensor products of computational or Hadamard basis measurements, making it suitable for applications such as device-independent quantum key distribution under computational assumptions. Moreover, a simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a single cloud quantum computer using only classical communication.

1 aFu, Honghao1 aWang, Daochen1 aZhao, Qi uhttps://arxiv.org/abs/2201.1343002360nas a2200145 4500008004100000245007900041210006900120260001500189520188900204100002002093700002002113700002802133700002202161856003102183 2023 eng d00aProvably Efficient Learning of Phases of Matter via Dissipative Evolutions0 aProvably Efficient Learning of Phases of Matter via Dissipative  c11/13/20233 a

The combination of quantum many-body and machine learning techniques has recently proved to be a fertile ground for new developments in quantum computing. Several works have shown that it is possible to classically efficiently predict the expectation values of local observables on all states within a phase of matter using a machine learning algorithm after learning from data obtained from other states in the same phase. However, existing results are restricted to phases of matter such as ground states of gapped Hamiltonians and Gibbs states that exhibit exponential decay of correlations. In this work, we drop this requirement and show how it is possible to learn local expectation values for all states in a phase, where we adopt the Lindbladian phase definition by Coser \& Pérez-García [Coser \& Pérez-García, Quantum 3, 174 (2019)], which defines states to be in the same phase if we can drive one to other rapidly with a local Lindbladian. This definition encompasses the better-known Hamiltonian definition of phase of matter for gapped ground state phases, and further applies to any family of states connected by short unitary circuits, as well as non-equilibrium phases of matter, and those stable under external dissipative interactions. Under this definition, we show that N=O(log(n/δ)2polylog(1/ϵ)) samples suffice to learn local expectation values within a phase for a system with n qubits, to error ϵ with failure probability δ. This sample complexity is comparable to previous results on learning gapped and thermal phases, and it encompasses previous results of this nature in a unified way. Furthermore, we also show that we can learn families of states which go beyond the Lindbladian definition of phase, and we derive bounds on the sample complexity which are dependent on the mixing time between states under a Lindbladian evolution.

1 aOnorati, Emilio1 aRouzé, Cambyse1 aFrança, Daniel, Stilck1 aWatson, James, D. uarXiv:2311.07506 Search...05435nas a2201621 4500008004100000245010800041210006900149260001500218520094500233100001801178700002301196700001601219700002801235700002001263700002001283700001601303700002001319700002101339700002401360700001901384700001901403700002601422700001801448700002301466700002101489700001601510700001701526700002101543700002301564700002101587700001601608700001701624700003101641700003401672700001801706700001801724700002101742700001801763700002401781700001801805700002001823700003501843700002201878700001601900700002001916700001901936700001701955700001901972700002301991700001802014700002402032700002302056700002302079700001802102700001702120700001902137700002602156700002002182700001902202700001902221700002302240700001802263700002202281700001802303700001902321700002802340700002402368700001902392700002002411700002002431700002702451700001202478700001702490700001502507700002102522700001802543700001902561700003202580700002402612700002202636700003102658700001702689700002302706700002402729700002002753700001902773700001902792700001602811700001702827700001802844700001802862700002002880700001902900700002302919700001902942700001702961700002602978700001603004700002003020700001603040700001803056700002803074700002103102700001803123700002403141700001403165700002303179700002003202700002103222700002003243700001803263700001803281700002103299700002103320700002303341700001803364700001803382700001403400700001903414700001603433700001503449700002003464700002103484700002103505700001703526700002803543700002203571700002303593700002603616700001503642700001703657700002303674700002403697700001803721700001703739700002003756856003703776 2023 eng d00aQuantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions0 aQuantumcentric Supercomputing for Materials Science A Perspectiv c12/14/20233 a

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

1 aAlexeev, Yuri1 aAmsler, Maximilian1 aBaity, Paul1 aBarroca, Marco, Antonio1 aBassini, Sanzio1 aBattelle, Torey1 aCamps, Daan1 aCasanova, David1 aChoi, Young, jai1 aChong, Frederic, T.1 aChung, Charles1 aCodella, Chris1 aCorcoles, Antonio, D.1 aCruise, James1 aDi Meglio, Alberto1 aDubois, Jonathan1 aDuran, Ivan1 aEckl, Thomas1 aEconomou, Sophia1 aEidenbenz, Stephan1 aElmegreen, Bruce1 aFare, Clyde1 aFaro, Ismael1 aFernández, Cristina, Sanz1 aFerreira, Rodrigo, Neumann Ba1 aFuji, Keisuke1 aFuller, Bryce1 aGagliardi, Laura1 aGalli, Giulia1 aGlick, Jennifer, R.1 aGobbi, Isacco1 aGokhale, Pranav1 aGonzalez, Salvador, de la Puen1 aGreiner, Johannes1 aGropp, Bill1 aGrossi, Michele1 aGull, Emmanuel1 aHealy, Burns1 aHuang, Benchen1 aHumble, Travis, S.1 aIto, Nobuyasu1 aIzmaylov, Artur, F.1 aJavadi-Abhari, Ali1 aJennewein, Douglas1 aJha, Shantenu1 aJiang, Liang1 aJones, Barbara1 ade Jong, Wibe, Albert1 aJurcevic, Petar1 aKirby, William1 aKister, Stefan1 aKitagawa, Masahiro1 aKlassen, Joel1 aKlymko, Katherine1 aKoh, Kwangwon1 aKondo, Masaaki1 aKurkcuoglu, Doga, Murat1 aKurowski, Krzysztof1 aLaino, Teodoro1 aLandfield, Ryan1 aLeininger, Matt1 aLeyton-Ortega, Vicente1 aLi, Ang1 aLin, Meifeng1 aLiu, Junyu1 aLorente, Nicolas1 aLuckow, Andre1 aMartiel, Simon1 aMartin-Fernandez, Francisco1 aMartonosi, Margaret1 aMarvinney, Claire1 aMedina, Arcesio, Castaneda1 aMerten, Dirk1 aMezzacapo, Antonio1 aMichielsen, Kristel1 aMitra, Abhishek1 aMittal, Tushar1 aMoon, Kyungsun1 aMoore, Joel1 aMotta, Mario1 aNa, Young-Hye1 aNam, Yunseong1 aNarang, Prineha1 aOhnishi, Yu-ya1 aOttaviani, Daniele1 aOtten, Matthew1 aPakin, Scott1 aPascuzzi, Vincent, R.1 aPenault, Ed1 aPiontek, Tomasz1 aPitera, Jed1 aRall, Patrick1 aRavi, Gokul, Subramania1 aRobertson, Niall1 aRossi, Matteo1 aRydlichowski, Piotr1 aRyu, Hoon1 aSamsonidze, Georgy1 aSato, Mitsuhisa1 aSaurabh, Nishant1 aSharma, Vidushi1 aSharma, Kunal1 aShin, Soyoung1 aSlessman, George1 aSteiner, Mathias1 aSitdikov, Iskandar1 aSuh, In-Saeng1 aSwitzer, Eric1 aTang, Wei1 aThompson, Joel1 aTodo, Synge1 aTran, Minh1 aTrenev, Dimitar1 aTrott, Christian1 aTseng, Huan-Hsin1 aTureci, Esin1 aValinas, David, García1 aVallecorsa, Sofia1 aWever, Christopher1 aWojciechowski, Konrad1 aWu, Xiaodi1 aYoo, Shinjae1 aYoshioka, Nobuyuki1 aYu, Victor, Wen-zhe1 aYunoki, Seiji1 aZhuk, Sergiy1 aZubarev, Dmitry uhttps://arxiv.org/abs/2312.0973301429nas a2200157 4500008004100000245005600041210005600097260001300153520097200166100001801138700002301156700001801179700002101197700001601218856003701234 2023 eng d00aRandom Pulse Sequences for Qubit Noise Spectroscopy0 aRandom Pulse Sequences for Qubit Noise Spectroscopy c3/2/20233 a

Qubit noise spectroscopy is an important tool for the experimental investigation of open quantum systems. However, conventional techniques for implementing noise spectroscopy are time-consuming, because they require multiple measurements of the noise spectral density at different frequencies. Here we describe an alternative method for quickly characterizing the spectral density. Our method utilizes random pulse sequences, with carefully-controlled correlations among the pulses, to measure arbitrary linear functionals of the noise spectrum. Such measurements allow us to estimate k'th-order moments of the noise spectrum, as well as to reconstruct sparse noise spectra via compressed sensing. Our simulations of the performance of the random pulse sequences on a realistic physical system, self-assembled quantum dots, reveal a speedup of an order of magnitude in extracting the noise spectrum compared to conventional dynamical decoupling approaches.

1 aHuang, Kaixin1 aFarfurnik, Demitry1 aSeif, Alireza1 aHafezi, Mohammad1 aLiu, Yi-Kai uhttps://arxiv.org/abs/2303.0090901741nas a2200181 4500008004100000245006600041210006300107260001300170520118700183100001801370700002301388700002401411700002101435700002001456700002501476700002101501856003701522 2023 eng d00aA sharp phase transition in linear cross-entropy benchmarking0 asharp phase transition in linear crossentropy benchmarking c5/8/20233 a

Demonstrations of quantum computational advantage and benchmarks of quantum processors via quantum random circuit sampling are based on evaluating the linear cross-entropy benchmark (XEB). A key question in the theory of XEB is whether it approximates the fidelity of the quantum state preparation. Previous works have shown that the XEB generically approximates the fidelity in a regime where the noise rate per qudit ε satisfies εN≪1 for a system of N qudits and that this approximation breaks down at large noise rates. Here, we show that the breakdown of XEB as a fidelity proxy occurs as a sharp phase transition at a critical value of εN that depends on the circuit architecture and properties of the two-qubit gates, including in particular their entangling power. We study the phase transition using a mapping of average two-copy quantities to statistical mechanics models in random quantum circuit architectures with full or one-dimensional connectivity. We explain the phase transition behavior in terms of spectral properties of the transfer matrix of the statistical mechanics model and identify two-qubit gate sets that exhibit the largest noise robustness.

1 aWare, Brayden1 aDeshpande, Abhinav1 aHangleiter, Dominik1 aNiroula, Pradeep1 aFefferman, Bill1 aGorshkov, Alexey, V.1 aGullans, Michael uhttps://arxiv.org/abs/2305.0495401491nas a2200181 4500008004100000245008400041210006900125260001400194520089300208100003001101700002701131700003001158700002101188700001801209700002401227700002101251856003701272 2023 eng d00aSpin-selective strong light-matter coupling in a 2D hole gas-microcavity system0 aSpinselective strong lightmatter coupling in a 2D hole gasmicroc c2/12/20233 a

The interplay between time-reversal symmetry breaking and strong light-matter coupling in 2D gases brings intriguing aspects to polariton physics. This combination can lead to polarization/spin selective light-matter interaction in the strong coupling regime. In this work, we report such a selective strong light-matter interaction by harnessing a 2D gas in the quantum Hall regime coupled to a microcavity. Specifically, we demonstrate circular-polarization dependence of the vacuum Rabi splitting, as a function of magnetic field and hole density. We provide a quantitative understanding of the phenomenon by modeling the coupling of optical transitions between Landau levels to the microcavity. This method introduces a control tool over the spin degree of freedom in polaritonic semiconductor systems, paving the way for new experimental possibilities in light-matter hybrids.

1 aSuarez-Forero, Daniel, G.1 aSession, Deric, Weston1 aMehrabad, Mahmoud, Jalali1 aKnuppel, Patrick1 aFaelt, Stefan1 aWegscheider, Werner1 aHafezi, Mohammad uhttps://arxiv.org/abs/2302.0602301289nas a2200169 4500008004100000245004100041210004100082260001400123520084200137100002300979700001601002700001801018700001201036700001701048700001701065856003701082 2023 eng d00aStreaming quantum state purification0 aStreaming quantum state purification c9/28/20233 a

Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.

1 aChilds, Andrew, M.1 aFu, Honghao1 aLeung, Debbie1 aLi, Zhi1 aOzols, Maris1 aVyas, Vedang uhttps://arxiv.org/abs/2309.1638702547nas a2200205 4500008004100000245006500041210006400106260001400170490000900184520193000193653002702123653003102150100002002181700002202201700002302223700002202246700001702268700001902285856003702304 2023 eng d00aTime-energy uncertainty relation for noisy quantum metrology0 aTimeenergy uncertainty relation for noisy quantum metrology c12/5/20230 v4(4)3 a

Detection of weak forces and precise measurement of time are two of the many applications of quantum metrology to science and technology. We consider a quantum system initialized in a pure state and whose evolution is goverened by a Hamiltonian H; a measurement can later estimate the time t for which the system has evolved. In this work, we introduce and study a fundamental trade-off which relates the amount by which noise reduces the accuracy of a quantum clock to the amount of information about the energy of the clock that leaks to the environment. Specifically, we consider an idealized scenario in which Alice prepares an initial pure state of the clock, allows the clock to evolve for a time t that is not precisely known, and then transmits the clock through a noisy channel to Bob. The environment (Eve) receives any information that is lost. We prove that Bob's loss of quantum Fisher information (QFI) about t is equal to Eve's gain of QFI about a complementary energy parameter. We also prove a more general trade-off that applies when Bob and Eve wish to estimate the values of parameters associated with two non-commuting observables. We derive the necessary and sufficient conditions for the accuracy of the clock to be unaffected by the noise. These are a subset of the Knill-Laflamme error-correction conditions; states satisfying these conditions are said to form a metrological code. We provide a scheme to construct metrological codes in the stabilizer formalism. We show that there are metrological codes that cannot be written as a quantum error-correcting code with similar distance in which the Hamiltonian acts as a logical operator, potentially offering new schemes for constructing states that do not lose any sensitivity upon application of a noisy channel. We discuss applications of our results to sensing using a many-body state subject to erasure or amplitude-damping noise.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aFaist, Philippe1 aWoods, Mischa, P.1 aAlbert, Victor, V.1 aRenes, Joseph, M.1 aEisert, Jens1 aPreskill, John uhttps://arxiv.org/abs/2207.1370702171nas a2200289 4500008004100000245007500041210006900116260001400185520131000199100002201509700002001531700002001551700002401571700002401595700002001619700001901639700002001658700002901678700001801707700002001725700001801745700002301763700001701786700001701803700002401820856003701844 2023 eng d00aVerifiable measurement-based quantum random sampling with trapped ions0 aVerifiable measurementbased quantum random sampling with trapped c7/26/20233 a

Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing tools for verifying that a quantum device indeed performed the classically intractable sampling task are either impractical or not scalable to the quantum advantage regime. The verification problem thus remains an outstanding challenge. Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation on a trapped-ion quantum processor. We create random cluster states, which are at the heart of measurement-based computing, up to a size of 4 x 4 qubits. Moreover, by exploiting the structure of these states, we are able to recycle qubits during the computation to sample from entangled cluster states that are larger than the qubit register. We then efficiently estimate the fidelity to verify the prepared states--in single instances and on average--and compare our results to cross-entropy benchmarking. Finally, we study the effect of experimental noise on the certificates. Our results and techniques provide a feasible path toward a verified demonstration of a quantum advantage.

1 aRingbauer, Martin1 aHinsche, Marcel1 aFeldker, Thomas1 aFaehrmann, Paul, K.1 aBermejo-Vega, Juani1 aEdmunds, Claire1 aPostler, Lukas1 aStricker, Roman1 aMarciniak, Christian, D.1 aMeth, Michael1 aPogorelov, Ivan1 aBlatt, Rainer1 aSchindler, Philipp1 aEisert, Jens1 aMonz, Thomas1 aHangleiter, Dominik uhttps://arxiv.org/abs/2307.1442401635nas a2200181 4500008004100000245010500041210006900146260001500215300001200230490000600242520106000248100001801308700002001326700002501346700002101371700002401392856003701416 2022 eng d00aCombining machine learning with physics: A framework for tracking and sorting multiple dark solitons0 aCombining machine learning with physics A framework for tracking c06/01/2022 a023163 0 v43 a

In ultracold-atom experiments, data often comes in the form of images which suffer information loss inherent in the techniques used to prepare and measure the system. This is particularly problematic when the processes of interest are complicated, such as interactions among excitations in Bose-Einstein condensates (BECs). In this paper, we describe a framework combining machine learning (ML) models with physics-based traditional analyses to identify and track multiple solitonic excitations in images of BECs. We use an ML-based object detector to locate the solitonic excitations and develop a physics-informed classifier to sort solitonic excitations into physically motivated subcategories. Lastly, we introduce a quality metric quantifying the likelihood that a specific feature is a longitudinal soliton. Our trained implementation of this framework, SolDet, is publicly available as an open-source python package. SolDet is broadly applicable to feature identification in cold-atom images when trained on a suitable user-provided dataset.

1 aGuo, Shangjie1 aKoh, Sophia, M.1 aFritsch, Amilson, R.1 aSpielman, I., B.1 aZwolak, Justyna, P. uhttps://arxiv.org/abs/2111.0488101667nas a2200157 4500008004100000245007000041210006800111260001400179520117400193653002701367653003101394100001601425700001801441700001301459856003701472 2022 eng d00aComputational self-testing of multi-qubit states and measurements0 aComputational selftesting of multiqubit states and measurements c1/31/20223 a

Self-testing is a fundamental technique within quantum information theory that allows a classical verifier to force (untrusted) quantum devices to prepare certain states and perform certain measurements on them. The standard approach assumes at least two spatially separated devices. Recently, Metger and Vidick [Quantum, 2021] showed that a single EPR pair of a single quantum device can be self-tested under standard computational assumptions. In this work, we generalize their techniques to give the first protocol that self-tests N EPR pairs and measurements in the single-device setting under the same computational assumptions. We show that our protocol can be passed with probability negligibly close to 1 by an honest quantum device using poly(N) resources. Moreover, we show that any quantum device that fails our protocol with probability at most ϵ must be poly(N,ϵ)-close to being honest in the appropriate sense. In particular, a simplified version of our protocol is the first that can efficiently certify an arbitrary number of qubits of a cloud quantum computer, on which we cannot enforce spatial separation, using only classical communication.

10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aFu, Honghao1 aWang, Daochen1 aZhao, Qi uhttps://arxiv.org/abs/2201.1343001123nas a2200133 4500008004100000245012100041210006900162260001500231300000800246490000600254520067600260100001600936856003700952 2022 eng d00aConstant-sized correlations are sufficient to robustly self-test maximally entangled states with unbounded dimension0 aConstantsized correlations are sufficient to robustly selftest m c01/03/2022 a6140 v63 a

We show that for any prime odd integer d, there exists a correlation of size Θ(r) that can robustly self-test a maximally entangled state of dimension 4d−4, where r is the smallest multiplicative generator of Z∗d. The construction of the correlation uses the embedding procedure proposed by Slofstra (Forum of Mathematics, Pi. Vol. 7, (2019)). Since there are infinitely many prime numbers whose smallest multiplicative generator is at most 5 (M. Murty The Mathematical Intelligencer 10.4 (1988)), our result implies that constant-sized correlations are sufficient for robust self-testing of maximally entangled states with unbounded local dimension.

1 aFu, Honghao uhttps://arxiv.org/abs/1911.0149401840nas a2200253 4500008004100000245006100041210006000102260001400162520102500176653002701201653003901228653003101267653004701298653005201345100001401397700001301411700001701424700002301441700002501464700001801489700001801507700002401525856003701549 2022 eng d00aContinuous Symmetry Breaking in a Trapped-Ion Spin Chain0 aContinuous Symmetry Breaking in a TrappedIon Spin Chain c11/2/20223 a

One-dimensional systems exhibiting a continuous symmetry can host quantum phases of matter with true long-range order only in the presence of sufficiently long-range interactions. In most physical systems, however, the interactions are short-ranged, hindering the emergence of such phases in one dimension. Here we use a one-dimensional trapped-ion quantum simulator to prepare states with long-range spin order that extends over the system size of up to 23 spins and is characteristic of the continuous symmetry-breaking phase of matter. Our preparation relies on simultaneous control over an array of tightly focused individual-addressing laser beams, generating long-range spin-spin interactions. We also observe a disordered phase with frustrated correlations. We further study the phases at different ranges of interaction and the out-of-equilibrium response to symmetry-breaking perturbations. This work opens an avenue to study new quantum phases and out-of-equilibrium dynamics in low-dimensional systems.

10aFOS: Physical sciences10aQuantum Gases (cond-mat.quant-gas)10aQuantum Physics (quant-ph)10aStatistical Mechanics (cond-mat.stat-mech)10aStrongly Correlated Electrons (cond-mat.str-el)1 aFeng, Lei1 aKatz, Or1 aHaack, Casey1 aMaghrebi, Mohammad1 aGorshkov, Alexey, V.1 aGong, Zhexuan1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2211.0127501358nas a2200157 4500008004100000245008900041210006900130260001500199520084100214100002501055700001801080700002001098700002101118700002401139856003701163 2022 eng d00aDark Solitons in Bose-Einstein Condensates: A Dataset for Many-body Physics Research0 aDark Solitons in BoseEinstein Condensates A Dataset for Manybody c05/17/20223 a

We establish a dataset of over 1.6×104 experimental images of Bose-Einstein condensates containing solitonic excitations to enable machine learning (ML) for many-body physics research. About 33 % of this dataset has manually assigned and carefully curated labels. The remainder is automatically labeled using SolDet -- an implementation of a physics-informed ML data analysis framework -- consisting of a convolutional-neural-network-based classifier and object detector as well as a statistically motivated physics-informed classifier and a quality metric. This technical note constitutes the definitive reference of the dataset, providing an opportunity for the data science community to develop more sophisticated analysis tools, to further understand nonlinear many-body physics, and even advance cold atom experiments.

1 aFritsch, Amilson, R.1 aGuo, Shangjie1 aKoh, Sophia, M.1 aSpielman, I., B.1 aZwolak, Justyna, P. uhttps://arxiv.org/abs/2205.0911401214nas a2200193 4500008004100000245008100041210006900122260001400191520059300205653003700798653002700835653003100862100001300893700001400906700002100920700002400941700001800965856003700983 2022 eng d00aDemonstration of three- and four-body interactions between trapped-ion spins0 aDemonstration of three and fourbody interactions between trapped c9/12/20223 a

Quantum processors use the native interactions between effective spins to simulate Hamiltonians or execute quantum gates. In most processors, the native interactions are pairwise, limiting the efficiency of controlling entanglement between many qubits. Here we experimentally demonstrate a new class of native interactions between trapped-ion qubits, extending conventional pairwise interactions to higher order. We realize three- and four-body spin interactions as examples, showing that high-order spin polynomials may serve as a new toolbox for quantum information applications.

10aAtomic Physics (physics.atom-ph)10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aKatz, Or1 aFeng, Lei1 aRisinger, Andrew1 aMonroe, Christopher1 aCetina, Marko uhttps://arxiv.org/abs/2209.0569101903nas a2200193 4500008004100000245006000041210006000101260001400161520128300175653004301458653002701501653002901528653003401557653003101591100001501622700002001637700001501657856003701672 2022 eng d00aDifferentiable Quantum Programming with Unbounded Loops0 aDifferentiable Quantum Programming with Unbounded Loops c11/8/20223 a

The emergence of variational quantum applications has led to the development of automatic differentiation techniques in quantum computing. Recently, Zhu et al. (PLDI 2020) have formulated differentiable quantum programming with bounded loops, providing a framework for scalable gradient calculation by quantum means for training quantum variational applications. However, promising parameterized quantum applications, e.g., quantum walk and unitary implementation, cannot be trained in the existing framework due to the natural involvement of unbounded loops. To fill in the gap, we provide the first differentiable quantum programming framework with unbounded loops, including a newly designed differentiation rule, code transformation, and their correctness proof. Technically, we introduce a randomized estimator for derivatives to deal with the infinite sum in the differentiation of unbounded loops, whose applicability in classical and probabilistic programming is also discussed. We implement our framework with Python and Q#, and demonstrate a reasonable sample efficiency. Through extensive case studies, we showcase an exciting application of our framework in automatically identifying close-to-optimal parameters for several parameterized quantum applications.

10aFOS: Computer and information sciences10aFOS: Physical sciences10aMachine Learning (cs.LG)10aProgramming Languages (cs.PL)10aQuantum Physics (quant-ph)1 aFang, Wang1 aYing, Mingsheng1 aWu, Xiaodi uhttps://arxiv.org/abs/2211.0450701837nas a2200169 4500008004100000245009700041210006900138260001300207520131000220100001301530700001301543700002001556700001801576700002001594700001601614856003701630 2022 eng d00aEfficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation0 aEfficient quantum algorithm for nonlinear reactiondiffusion equa c5/2/20223 a

Nonlinear differential equations exhibit rich phenomena in many fields but are notoriously challenging to solve. Recently, Liu et al. [1] demonstrated the first efficient quantum algorithm for dissipative quadratic differential equations under the condition R<1, where R measures the ratio of nonlinearity to dissipation using the ℓ2 norm. Here we develop an efficient quantum algorithm based on [1] for reaction-diffusion equations, a class of nonlinear partial differential equations (PDEs). To achieve this, we improve upon the Carleman linearization approach introduced in [1] to obtain a faster convergence rate under the condition RD<1, where RD measures the ratio of nonlinearity to dissipation using the ℓ∞ norm. Since RD is independent of the number of spatial grid points n while R increases with n, the criterion RD<1 is significantly milder than R<1 for high-dimensional systems and can stay convergent under grid refinement for approximating PDEs. As applications of our quantum algorithm we consider the Fisher-KPP and Allen-Cahn equations, which have interpretations in classical physics. In particular, we show how to estimate the mean square kinetic energy in the solution by postprocessing the quantum state that encodes it to extract derivative information.

1 aAn, Dong1 aFang, Di1 aJordan, Stephen1 aLiu, Jin-Peng1 aLow, Guang, Hao1 aWang, Jiasu uhttps://arxiv.org/abs/2205.0114101498nas a2200301 4500008004100000245006800041210006800109260001400177520060600191653002700797653004400824653003100868100001700899700001600916700002500932700001800957700001300975700001800988700001901006700002101025700001401046700002201060700001601082700001901098700001801117700002401135856003701159 2022 eng d00aExperimental Implementation of an Efficient Test of Quantumness0 aExperimental Implementation of an Efficient Test of Quantumness c9/28/20223 a

A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification, or non-interactive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient non-interactive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.

10aFOS: Physical sciences10aOther Condensed Matter (cond-mat.other)10aQuantum Physics (quant-ph)1 aLewis, Laura1 aZhu, Daiwei1 aGheorghiu, Alexandru1 aNoel, Crystal1 aKatz, Or1 aHarraz, Bahaa1 aWang, Qingfeng1 aRisinger, Andrew1 aFeng, Lei1 aBiswas, Debopriyo1 aEgan, Laird1 aVidick, Thomas1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2209.1431602357nas a2200145 4500008004100000245007100041210006900112260001400181490000600195520190500201100002302106700002502129700002002154856003702174 2022 eng d00aImportance of the Spectral gap in Estimating Ground-State Energies0 aImportance of the Spectral gap in Estimating GroundState Energie c12/9/20220 v33 a

The field of quantum Hamiltonian complexity lies at the intersection of quantum many-body physics and computational complexity theory, with deep implications to both fields. The main object of study is the LocalHamiltonian problem, which is concerned with estimating the ground-state energy of a local Hamiltonian and is complete for the class QMA, a quantum generalization of the class NP. A major challenge in the field is to understand the complexity of the LocalHamiltonian problem in more physically natural parameter regimes. One crucial parameter in understanding the ground space of any Hamiltonian in many-body physics is the spectral gap, which is the difference between the smallest two eigenvalues. Despite its importance in quantum many-body physics, the role played by the spectral gap in the complexity of the LocalHamiltonian is less well-understood. In this work, we make progress on this question by considering the precise regime, in which one estimates the ground-state energy to within inverse exponential precision. Computing ground-state energies precisely is a task that is important for quantum chemistry and quantum many-body physics.
In the setting of inverse-exponential precision, there is a surprising result that the complexity of LocalHamiltonian is magnified from QMA to PSPACE, the class of problems solvable in polynomial space. We clarify the reason behind this boost in complexity. Specifically, we show that the full complexity of the high precision case only comes about when the spectral gap is exponentially small. As a consequence of the proof techniques developed to show our results, we uncover important implications for the representability and circuit complexity of ground states of local Hamiltonians, the theory of uniqueness of quantum witnesses, and techniques for the amplification of quantum witnesses in the presence of postselection.

1 aDeshpande, Abhinav1 aGorshkov, Alexey, V.1 aFefferman, Bill uhttps://arxiv.org/abs/2007.1158201220nas a2200157 4500008004100000245008300041210006900124260001400193300001100207490000800218520072400226100001800950700002200968700001500990856005701005 2022 eng d00aIsolation and manipulation of a single-donor detector in a silicon quantum dot0 aIsolation and manipulation of a singledonor detector in a silico c9/27/2022 a1254230 v1063 a

We demonstrate the isolation and electrostatic control of a single phosphorus donor in a silicon quantum dot by making use of source-drain bias during cooldown and biases applied to capacitively coupled gates. Characterization of the device at low temperatures and in magnetic fields shows single donors can be electrostatically isolated near one of the quantum dot's tunnel barriers with either single or double occupancy. This model is well supported by capacitance-based simulations. The ability to use the D 0 state of such isolated donors as a charge detector is demonstrated by observing the charge stability diagram of a nearby and capacitively coupled semiconnected double quantum dot.

1 aLasek, A., A.1 aBarnes, C., H. W.1 aFerrus, T. uhttps://link.aps.org/doi/10.1103/PhysRevB.106.12542301537nas a2200157 4500008004100000245004800041210004800089260001400137520103000151100002101181700002001202700002801222700001701250700002801267856008401295 2022 eng d00aLinear growth of quantum circuit complexity0 aLinear growth of quantum circuit complexity c3/28/20223 a

The complexity of quantum states has become a key quantity of interest across various subfields of physics, from quantum computing to the theory of black holes. The evolution of generic quantum systems can be modelled by considering a collection of qubits subjected to sequences of random unitary gates. Here we investigate how the complexity of these random quantum circuits increases by considering how to construct a unitary operation from Haar-random two-qubit quantum gates. Implementing the unitary operation exactly requires a minimal number of gates—this is the operation’s exact circuit complexity. We prove a conjecture that this complexity grows linearly, before saturating when the number of applied gates reaches a threshold that grows exponentially with the number of qubits. Our proof overcomes difficulties in establishing lower bounds for the exact circuit complexity by combining differential topology and elementary algebraic geometry with an inductive construction of Clifford circuits.

1 aHaferkamp, Jonas1 aFaist, Philippe1 aKothakonda, Naga, B. T.1 aEisert, Jens1 aHalpern, Nicole, Yunger uhttps://www.quics.umd.edu/publications/linear-growth-quantum-circuit-complexity02013nas a2200277 4500008004100000245008100041210006900122260001300191300001300204490000600217520120300223100002301426700001801449700002001467700002101487700002001508700002001528700001701548700002101565700001401586700001701600700002401617700002001641700001501661856005901676 2022 eng d00aQuantum computational advantage via high-dimensional Gaussian boson sampling0 aQuantum computational advantage via highdimensional Gaussian bos c1/5/2022 aeabi78940 v83 a

A programmable quantum computer based on fiber optics outperforms classical computers with a high level of confidence. Photonics is a promising platform for demonstrating a quantum computational advantage (QCA) by outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing proposals and demonstrations face challenges. Experimentally, current implementations of Gaussian boson sampling (GBS) lack programmability or have prohibitive loss rates. Theoretically, there is a comparative lack of rigorous evidence for the classical hardness of GBS. In this work, we make progress in improving both the theoretical evidence and experimental prospects. We provide evidence for the hardness of GBS, comparable to the strongest theoretical proposals for QCA. We also propose a QCA architecture we call high-dimensional GBS, which is programmable and can be implemented with low loss using few optical components. We show that particular algorithms for simulating GBS are outperformed by high-dimensional GBS experiments at modest system sizes. This work thus opens the path to demonstrating QCA with programmable photonic processors.

1 aDeshpande, Abhinav1 aMehta, Arthur1 aVincent, Trevor1 aQuesada, Nicolas1 aHinsche, Marcel1 aIoannou, Marios1 aMadsen, Lars1 aLavoie, Jonathan1 aQi, Haoyu1 aEisert, Jens1 aHangleiter, Dominik1 aFefferman, Bill1 aDhand, Ish uhttps://www.science.org/doi/abs/10.1126/sciadv.abi789401714nas a2200181 4500008004100000245004400041210004400085260001500129490000800144520120900152100002801361700002801389700002101417700002001438700001701458700002001475856003701495 2022 eng d00aResource theory of quantum uncomplexity0 aResource theory of quantum uncomplexity c12/19/20220 v1063 a

Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies the number of computational gates required to prepare the state from a simple tensor product. The greater a state's distance from maximal complexity, or "uncomplexity," the more useful the state is as input to a quantum computation. Separately, resource theories -- simple models for agents subject to constraints -- are burgeoning in quantum information theory. We unite the two domains, confirming Brown and Susskind's conjecture that a resource theory of uncomplexity can be defined. The allowed operations, fuzzy operations, are slightly random implementations of two-qubit gates chosen by an agent. We formalize two operational tasks, uncomplexity extraction and expenditure. Their optimal efficiencies depend on an entropy that we engineer to reflect complexity. We also present two monotones, uncomplexity measures that decline monotonically under fuzzy operations, in certain regimes. This work unleashes on many-body complexity the resource-theory toolkit from quantum information theory.

1 aHalpern, Nicole, Yunger1 aKothakonda, Naga, B. T.1 aHaferkamp, Jonas1 aMunson, Anthony1 aEisert, Jens1 aFaist, Philippe uhttps://arxiv.org/abs/2110.1137101867nas a2200205 4500008004100000245006500041210006500106260001500171520119000186653003701376653004301413653002701456653003101483100001801514700002301532700002401555700002501579700002001604856003701624 2022 eng d00aSharp complexity phase transitions generated by entanglement0 aSharp complexity phase transitions generated by entanglement c12/20/20223 a

Entanglement is one of the physical properties of quantum systems responsible for the computational hardness of simulating quantum systems. But while the runtime of specific algorithms, notably tensor network algorithms, explicitly depends on the amount of entanglement in the system, it is unknown whether this connection runs deeper and entanglement can also cause inherent, algorithm-independent complexity. In this work, we quantitatively connect the entanglement present in certain quantum systems to the computational complexity of simulating those systems. Moreover, we completely characterize the entanglement and complexity as a function of a system parameter. Specifically, we consider the task of simulating single-qubit measurements of k--regular graph states on n qubits. We show that, as the regularity parameter is increased from 1 to n−1, there is a sharp transition from an easy regime with low entanglement to a hard regime with high entanglement at k=3, and a transition back to easy and low entanglement at k=n−3. As a key technical result, we prove a duality for the simulation complexity of regular graph states between low and high regularity.

10aComputational Complexity (cs.CC)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aGhosh, Soumik1 aDeshpande, Abhinav1 aHangleiter, Dominik1 aGorshkov, Alexey, V.1 aFefferman, Bill uhttps://arxiv.org/abs/2212.1058202149nas a2200457 4500008004100000245005300041210005200094260001400146520077300160653005700933653002700990653004601017653004901063100003401112700002201146700002101168700001901189700001901208700002201227700001901249700002201268700002501290700001901315700001701334700001901351700002101370700002101391700001801412700001401430700002701444700002201471700002201493700001601515700002001531700001701551700002501568700002201593700001401615700002501629856003701654 2022 eng d00aSnowmass 2021 White Paper: The Windchime Project0 aSnowmass 2021 White Paper The Windchime Project c3/14/20223 a

The absence of clear signals from particle dark matter in direct detection experiments motivates new approaches in disparate regions of viable parameter space. In this Snowmass white paper, we outline the Windchime project, a program to build a large array of quantum-enhanced mechanical sensors. The ultimate aim is to build a detector capable of searching for Planck mass-scale dark matter purely through its gravitational coupling to ordinary matter. In the shorter term, we aim to search for a number of other physics targets, especially some ultralight dark matter candidates. Here, we discuss the basic design, open R&D challenges and opportunities, current experimental efforts, and both short- and long-term physics targets of the Windchime project.

10aCosmology and Nongalactic Astrophysics (astro-ph.CO)10aFOS: Physical sciences10aHigh Energy Physics - Experiment (hep-ex)10aHigh Energy Physics - Phenomenology (hep-ph)1 aCollaboration, The, Windchime1 aAttanasio, Alaina1 aBhave, Sunil, A.1 aBlanco, Carlos1 aCarney, Daniel1 aDemarteau, Marcel1 aElshimy, Bahaa1 aFebbraro, Michael1 aFeldman, Matthew, A.1 aGhosh, Sohitri1 aHickin, Abby1 aHong, Seongjin1 aLang, Rafael, F.1 aLawrie, Benjamin1 aLi, Shengchao1 aLiu, Zhen1 aMaldonado, Juan, P. A.1 aMarvinney, Claire1 aOo, Hein, Zay Yar1 aPai, Yun-Yi1 aPooser, Raphael1 aQin, Juehang1 aSparmann, Tobias, J.1 aTaylor, Jacob, M.1 aTian, Hao1 aTunnell, Christopher uhttps://arxiv.org/abs/2203.0724201292nas a2200157 4500008004100000245012000041210006900161260000800230300000800238490000600246520080400252100001301056700001301069700001301082856003901095 2022 eng d00aTime-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation0 aTimedependent Hamiltonian Simulation of Highly Oscillatory Dynam capr a6900 v63 a

We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling. Our method can be used for efficient Hamiltonian simulation in the interaction picture. In particular, we demonstrate that for the simulation of the Schrödinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate, of which the proof rests on a careful application of pseudo-differential calculus. Numerical results verify the effectiveness and the superconvergence property of our method.

1 aAn, Dong1 aFang, Di1 aLin, Lin uhttps://arxiv.org/abs/2111.03103v201353nas a2200145 4500008004100000245003500041210003500076260001400111520095600125100002801081700002201109700001801131700002101149856003701170 2022 eng d00aTopological Edge Mode Tapering0 aTopological Edge Mode Tapering c6/14/20223 a

Mode tapering, or the gradual manipulation of the size of some mode, is a requirement for any system that aims to efficiently interface two or more subsystems of different mode sizes. While high efficiency tapers have been demonstrated, they often come at the cost of a large device footprint or challenging fabrication. Topological photonics, offering robustness to certain types of disorder as well as chirality, has proved to be a well-suited design principle for numerous applications in recent years. Here we present a new kind of mode taper realized through topological bandgap engineering. We numerically demonstrate a sixfold change in mode width over an extremely compact 8μm distance with near unity efficiency in the optical domain. With suppressed backscattering and no excitation of higher-order modes, such a taper could enable new progress in the development of scalable, multi-component systems in classical and quantum optics.

1 aFlower, Christopher, J.1 aBarik, Sabyasachi1 aMittal, Sunil1 aHafezi, Mohammad uhttps://arxiv.org/abs/2206.0705602078nas a2200277 4500008004100000245006700041210006600108260001500174520125200189100002201441700001801463700002501481700002101506700002401527700002501551700002101576700002001597700002501617700002601642700001601668700001901684700002301703700001801726700001901744856003701763 2021 eng d00aDevice-independent Randomness Expansion with Entangled Photons0 aDeviceindependent Randomness Expansion with Entangled Photons c01/28/20213 a

With the growing availability of experimental loophole-free Bell tests, it has become possible to implement a new class of device-independent random number generators whose output can be certified to be uniformly random without requiring a detailed model of the quantum devices used. However, all of these experiments require many input bits in order to certify a small number of output bits, and it is an outstanding challenge to develop a system that generates more randomness than is used. Here, we devise a device-independent spot-checking protocol which uses only uniform bits as input. Implemented with a photonic loophole-free Bell test, we can produce 24% more certified output bits (1,181,264,237) than consumed input bits (953,301,640), which is 5 orders of magnitude more efficient than our previous work [arXiv:1812.07786]. The experiment ran for 91.0 hours, creating randomness at an average rate of 3606 bits/s with a soundness error bounded by 5.7×10−7 in the presence of classical side information. Our system will allow for greater trust in public sources of randomness, such as randomness beacons, and the protocols may one day enable high-quality sources of private randomness as the device footprint shrinks.

1 aShalm, Lynden, K.1 aZhang, Yanbao1 aBienfang, Joshua, C.1 aSchlager, Collin1 aStevens, Martin, J.1 aMazurek, Michael, D.1 aAbellán, Carlos1 aAmaya, Waldimar1 aMitchell, Morgan, W.1 aAlhejji, Mohammad, A.1 aFu, Honghao1 aOrnstein, Joel1 aMirin, Richard, P.1 aNam, Sae, Woo1 aKnill, Emanuel uhttps://arxiv.org/abs/1912.1115801385nas a2200205 4500008004100000245004900041210004700090260001400137520077400151100002000925700001900945700001500964700002400979700001901003700001901022700002301041700001501064700001301079856008701092 2021 eng d00aEasyPQC: Verifying Post-Quantum Cryptography0 aEasyPQC Verifying PostQuantum Cryptography c9/20/20213 a

EasyCrypt is a formal verification tool used extensively for formalizing concrete security proofs of cryptographic constructions. However, the EasyCrypt formal logics consider only classical attackers, which means that post-quantum security proofs cannot be formalized and machine-checked with this tool. In this paper we prove that a natural extension of the EasyCrypt core logics permits capturing a wide class of post-quantum cryptography proofs, settling a question raised by (Unruh, POPL 2019). Leveraging our positive result, we implement EasyPQC, an extension of EasyCrypt for post-quantum security proofs, and use EasyPQC to verify post-quantum security of three classic constructions: PRF-based MAC, Full Domain Hash and GPV08 identity-based encryption.

1 aBarbosa, Manuel1 aBarthe, Gilles1 aFan, Xiong1 aGrégoire, Benjamin1 aHung, Shih-Han1 aKatz, Jonathan1 aStrub, Pierre-Yves1 aWu, Xiaodi1 aZhou, Li uhttps://www.quics.umd.edu/publications/easypqc-verifying-post-quantum-cryptography02349nas a2200313 4500008004100000245007100041210006900112260001400181520145100195100001601646700003401662700001701696700001801713700001301731700001801744700001901762700002101781700001401802700002201816700001601838700002501854700001801879700001901897700002001916700002001936700001801956700002401974856003701998 2021 eng d00aInteractive Protocols for Classically-Verifiable Quantum Advantage0 aInteractive Protocols for ClassicallyVerifiable Quantum Advantag c12/9/20213 a

Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output is itself classically intractable. On the other hand, certain quantum algorithms (e.g. prime factorization via Shor's algorithm) are efficiently verifiable, but require more resources than what is available on near-term devices. One way to bridge the gap between verifiability and implementation is to use "interactions" between a prover and a verifier. By leveraging cryptographic functions, such protocols enable the classical verifier to enforce consistency in a quantum prover's responses across multiple rounds of interaction. In this work, we demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer. We execute two complementary protocols -- one based upon the learning with errors problem and another where the cryptographic construction implements a computational Bell test. To perform multiple rounds of interaction, we implement mid-circuit measurements on a subset of trapped ion qubits, with subsequent coherent evolution. For both protocols, the performance exceeds the asymptotic bound for classical behavior; maintaining this fidelity at scale would conclusively demonstrate verifiable quantum advantage.

1 aZhu, Daiwei1 aKahanamoku-Meyer, Gregory, D.1 aLewis, Laura1 aNoel, Crystal1 aKatz, Or1 aHarraz, Bahaa1 aWang, Qingfeng1 aRisinger, Andrew1 aFeng, Lei1 aBiswas, Debopriyo1 aEgan, Laird1 aGheorghiu, Alexandru1 aNam, Yunseong1 aVidick, Thomas1 aVazirani, Umesh1 aYao, Norman, Y.1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2112.0515601631nas a2200169 4500008004100000245009500041210006900136260001400205520107500219100001901294700002401313700002101337700002201358700001901380700002501399856003701424 2021 eng d00aLinear and continuous variable spin-wave processing using a cavity-coupled atomic ensemble0 aLinear and continuous variable spinwave processing using a cavit c9/30/20213 a

Spin-wave excitations in ensembles of atoms are gaining attention as a quantum information resource. However, current techniques with atomic spin waves do not achieve universal quantum information processing. We conduct a theoretical analysis of methods to create a high-capacity universal quantum processor and network node using an ensemble of laser-cooled atoms, trapped in a one-dimensional periodic potential and coupled to a ring cavity. We describe how to establish linear quantum processing using a lambda-scheme in a rubidium-atom system, calculate the expected experimental operational fidelities. Second, we derive an efficient method to achieve linear controllability with a single ensemble of atoms, rather than two-ensembles as proposed in [K. C. Cox et al. Spin-Wave Quantum Computing with Atoms in a Single-Mode Cavity, preprint 2021]. Finally, we propose to use the spin-wave processor for continuous-variable quantum information processing and present a scheme to generate large dual-rail cluster states useful for deterministic computing. 

1 aCox, Kevin, C.1 aBienias, Przemyslaw1 aMeyer, David, H.1 aFahey, Donald, P.1 aKunz, Paul, D.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2109.1524601499nas a2200181 4500008004100000245008200041210006900123260001400192300001100206490000600217520094800223100001801171700002501189700002101214700002101235700002401256856003701280 2021 eng d00aMachine-learning enhanced dark soliton detection in Bose-Einstein condensates0 aMachinelearning enhanced dark soliton detection in BoseEinstein  c6/17/2021 a0350200 v23 a

Most data in cold-atom experiments comes from images, the analysis of which is limited by our preconceptions of the patterns that could be present in the data. We focus on the well-defined case of detecting dark solitons -- appearing as local density depletions in a BEC -- using a methodology that is extensible to the general task of pattern recognition in images of cold atoms. Studying soliton dynamics over a wide range of parameters requires the analysis of large datasets, making the existing human-inspection-based methodology a significant bottleneck. Here we describe an automated classification and positioning system for identifying localized excitations in atomic Bose-Einstein condensates (BECs) utilizing deep convolutional neural networks to eliminate the need for human image examination. Furthermore, we openly publish our labeled dataset of dark solitons, the first of its kind, for further machine learning research.

1 aGuo, Shangjie1 aFritsch, Amilson, R.1 aGreenberg, Craig1 aSpielman, I., B.1 aZwolak, Justyna, P. uhttps://arxiv.org/abs/2101.0540401577nas a2200133 4500008004100000245008200041210006900123260001400192520114500206100001601351700001701367700002201384856003701406 2021 eng d00aThe membership problem for constant-sized quantum correlations is undecidable0 amembership problem for constantsized quantum correlations is und c1/26/20213 a

When two spatially separated parties make measurements on an unknown entangled quantum state, what correlations can they achieve? How difficult is it to determine whether a given correlation is a quantum correlation? These questions are central to problems in quantum communication and computation. Previous work has shown that the general membership problem for quantum correlations is computationally undecidable. In the current work we show something stronger: there is a family of constant-sized correlations -- that is, correlations for which the number of measurements and number of measurement outcomes are fixed -- such that solving the quantum membership problem for this family is computationally impossible. Thus, the undecidability that arises in understanding Bell experiments is not dependent on varying the number of measurements in the experiment. This places strong constraints on the types of descriptions that can be given for quantum correlation sets. Our proof is based on a combination of techniques from quantum self-testing and from undecidability results of the third author for linear system nonlocal games.

1 aFu, Honghao1 aMiller, Carl1 aSlofstra, William uhttps://arxiv.org/abs/2101.1108701661nas a2200205 4500008004100000245006800041210006700109260001500176300000900191490000700200520101600207100001701223700002001240700001501260700001801275700001601293700001901309700002301328856010401351 2021 eng d00aNoise-induced barren plateaus in variational quantum algorithms0 aNoiseinduced barren plateaus in variational quantum algorithms c11/29/2021 a69610 v123 a

Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether noise on NISQ devices places fundamental limitations on VQA performance. We rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for a generic ansatz that includes as special cases the Quantum Alternating Operator Ansatz and the Unitary Coupled Cluster Ansatz, among others. For the former, our numerical heuristics demonstrate the NIBP phenomenon for a realistic hardware noise model.

1 aWang, Samson1 aFontana, Enrico1 aCerezo, M.1 aSharma, Kunal1 aSone, Akira1 aCincio, Lukasz1 aColes, Patrick, J. uhttps://www.quics.umd.edu/publications/noise-induced-barren-plateaus-variational-quantum-algorithms01981nas a2200241 4500008004100000245005400041210005400095260001300149520129500162100002501457700002301482700002001505700002001525700002201545700002201567700001401589700001901603700001801622700001801640700002001658700002401678856003701702 2021 eng d00aObservation of a prethermal discrete time crystal0 aObservation of a prethermal discrete time crystal c2/2/20213 a

The conventional framework for defining and understanding phases of matter requires thermodynamic equilibrium. Extensions to non-equilibrium systems have led to surprising insights into the nature of many-body thermalization and the discovery of novel phases of matter, often catalyzed by driving the system periodically. The inherent heating from such Floquet drives can be tempered by including strong disorder in the system, but this can also mask the generality of non-equilibrium phases. In this work, we utilize a trapped-ion quantum simulator to observe signatures of a non-equilibrium driven phase without disorder: the prethermal discrete time crystal (PDTC). Here, many-body heating is suppressed not by disorder-induced many-body localization, but instead via high-frequency driving, leading to an expansive time window where non-equilibrium phases can emerge. We observe a number of key features that distinguish the PDTC from its many-body-localized disordered counterpart, such as the drive-frequency control of its lifetime and the dependence of time-crystalline order on the energy density of the initial state. Floquet prethermalization is thus presented as a general strategy for creating, stabilizing and studying intrinsically out-of-equilibrium phases of matter.

1 aKyprianidis, Antonis1 aMachado, Francisco1 aMorong, William1 aBecker, Patrick1 aCollins, Kate, S.1 aElse, Dominic, V.1 aFeng, Lei1 aHess, Paul, W.1 aNayak, Chetan1 aPagano, Guido1 aYao, Norman, Y.1 aMonroe, Christopher uhttps://arxiv.org/abs/2102.0169502060nas a2200217 4500008004100000245006500041210006400106260001400170520145900184100001501643700001201658700001501670700002001685700001301705700002001718700001501738700001201753700002501765700001501790856003701805 2021 eng d00aObservation of Stark many-body localization without disorder0 aObservation of Stark manybody localization without disorder c2/14/20213 a

Thermalization is a ubiquitous process of statistical physics, in which details of few-body observables are washed out in favor of a featureless steady state. Even in isolated quantum many-body systems, limited to reversible dynamics, thermalization typically prevails. However, in these systems, there is another possibility: many-body localization (MBL) can result in preservation of a non-thermal state. While disorder has long been considered an essential ingredient for this phenomenon, recent theoretical work has suggested that a quantum many-body system with a uniformly increasing field -- but no disorder -- can also exhibit MBL, resulting in `Stark MBL.' Here we realize Stark MBL in a trapped-ion quantum simulator and demonstrate its key properties: halting of thermalization and slow propagation of correlations. Tailoring the interactions between ionic spins in an effective field gradient, we directly observe their microscopic equilibration for a variety of initial states, and we apply single-site control to measure correlations between separate regions of the spin chain. Further, by engineering a varying gradient, we create a disorder-free system with coexisting long-lived thermalized and nonthermal regions. The results demonstrate the unexpected generality of MBL, with implications about the fundamental requirements for thermalization and with potential uses in engineering long-lived non-equilibrium quantum matter.

1 aMorong, W.1 aLiu, F.1 aBecker, P.1 aCollins, K., S.1 aFeng, L.1 aKyprianidis, A.1 aPagano, G.1 aYou, T.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/2102.0725002003nas a2200253 4500008004100000245008100041210006900122260001400191520125700205100002301462700001801485700002001503700002101523700002001544700002001564700001701584700002101601700001401622700001701636700002401653700002001677700001501697856003701712 2021 eng d00aQuantum Computational Supremacy via High-Dimensional Gaussian Boson Sampling0 aQuantum Computational Supremacy via HighDimensional Gaussian Bos c2/24/20213 a

Photonics is a promising platform for demonstrating quantum computational supremacy (QCS) by convincingly outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing photonics proposals and demonstrations face significant hurdles. Experimentally, current implementations of Gaussian boson sampling lack programmability or have prohibitive loss rates. Theoretically, there is a comparative lack of rigorous evidence for the classical hardness of GBS. In this work, we make significant progress in improving both the theoretical evidence and experimental prospects. On the theory side, we provide strong evidence for the hardness of Gaussian boson sampling, placing it on par with the strongest theoretical proposals for QCS. On the experimental side, we propose a new QCS architecture, high-dimensional Gaussian boson sampling, which is programmable and can be implemented with low loss rates using few optical components. We show that particular classical algorithms for simulating GBS are vastly outperformed by high-dimensional Gaussian boson sampling experiments at modest system sizes. This work thus opens the path to demonstrating QCS with programmable photonic processors.

1 aDeshpande, Abhinav1 aMehta, Arthur1 aVincent, Trevor1 aQuesada, Nicolas1 aHinsche, Marcel1 aIoannou, Marios1 aMadsen, Lars1 aLavoie, Jonathan1 aQi, Haoyu1 aEisert, Jens1 aHangleiter, Dominik1 aFefferman, Bill1 aDhand, Ish uhttps://arxiv.org/abs/2102.1247401694nas a2200169 4500008004100000245004400041210004400085260001500129520120900144100002801353700002801381700002101409700002001430700001701450700002001467856003701487 2021 eng d00aResource theory of quantum uncomplexity0 aResource theory of quantum uncomplexity c10/21/20213 a

Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies the number of computational gates required to prepare the state from a simple tensor product. The greater a state's distance from maximal complexity, or ``uncomplexity,'' the more useful the state is as input to a quantum computation. Separately, resource theories -- simple models for agents subject to constraints -- are burgeoning in quantum information theory. We unite the two domains, confirming Brown and Susskind's conjecture that a resource theory of uncomplexity can be defined. The allowed operations, fuzzy operations, are slightly random implementations of two-qubit gates chosen by an agent. We formalize two operational tasks, uncomplexity extraction and expenditure. Their optimal efficiencies depend on an entropy that we engineer to reflect complexity. We also present two monotones, uncomplexity measures that decline monotonically under fuzzy operations, in certain regimes. This work unleashes on many-body complexity the resource-theory toolkit from quantum information theory.

1 aHalpern, Nicole, Yunger1 aKothakonda, Naga, B. T.1 aHaferkamp, Jonas1 aMunson, Anthony1 aEisert, Jens1 aFaist, Philippe uhttps://arxiv.org/abs/2110.1137101130nas a2200169 4500008004100000245006700041210006500108260001400173520060600187100001900793700002400812700002100836700001900857700002200876700002500898856003700923 2021 eng d00aSpin-Wave Quantum Computing with Atoms in a Single-Mode Cavity0 aSpinWave Quantum Computing with Atoms in a SingleMode Cavity c9/30/20213 a

We present a method for network-capable quantum computing that relies on holographic spin-wave excitations stored collectively in ensembles of qubits. We construct an orthogonal basis of spin waves in a one-dimensional array and show that high-fidelity universal linear controllability can be achieved using only phase shifts, applied in both momentum and position space. Neither single-site addressability nor high single-qubit cooperativity is required, and the spin waves can be read out with high efficiency into a single cavity mode for quantum computing and networking applications. 

1 aCox, Kevin, C.1 aBienias, Przemyslaw1 aMeyer, David, H.1 aKunz, Paul, D.1 aFahey, Donald, P.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2109.1525201465nas a2200169 4500008004100000245007200041210006900113260001400182520093400196100002301130700002001153700002501173700002101198700002101219700001801240856003701258 2021 eng d00aTight bounds on the convergence of noisy random circuits to uniform0 aTight bounds on the convergence of noisy random circuits to unif c12/1/20213 a

We study the properties of output distributions of noisy, random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the uniform distribution. These bounds are tight with respect to the dependence on circuit depth. Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits. We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation. Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques. We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what was thought prior to this work. 

1 aDeshpande, Abhinav1 aFefferman, Bill1 aGorshkov, Alexey, V.1 aGullans, Michael1 aNiroula, Pradeep1 aShtanko, Oles uhttps://arxiv.org/abs/2112.0071601128nas a2200145 4500008004100000245008100041210006900122260001400191520066400205100002100869700002100890700001900911700001500930856003700945 2020 eng d00aApproximate recovery and relative entropy I. general von Neumann subalgebras0 aApproximate recovery and relative entropy I general von Neumann  c6/14/20203 a

We prove the existence of a universal recovery channel that approximately recovers states on a v. Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I v. Neumann algebras by Junge at al. [arXiv:1509.07127]. We broadly follow their proof strategy but consider here arbitrary v. Neumann algebras, where qualitatively new issues arise. Our results hinge on the construction of certain analytic vectors and computations/estimations of their Araki-Masuda Lp norms. We comment on applications to the quantum null energy condition.

1 aFaulkner, Thomas1 aHollands, Stefan1 aSwingle, Brian1 aWang, Yixu uhttps://arxiv.org/abs/2006.0800201128nas a2200145 4500008004100000245008100041210006900122260001400191520066400205100002100869700002100890700001900911700001500930856003700945 2020 eng d00aApproximate recovery and relative entropy I. general von Neumann subalgebras0 aApproximate recovery and relative entropy I general von Neumann  c6/14/20203 a

We prove the existence of a universal recovery channel that approximately recovers states on a v. Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I v. Neumann algebras by Junge at al. [arXiv:1509.07127]. We broadly follow their proof strategy but consider here arbitrary v. Neumann algebras, where qualitatively new issues arise. Our results hinge on the construction of certain analytic vectors and computations/estimations of their Araki-Masuda Lp norms. We comment on applications to the quantum null energy condition.

1 aFaulkner, Thomas1 aHollands, Stefan1 aSwingle, Brian1 aWang, Yixu uhttps://arxiv.org/abs/2006.0800201669nas a2200181 4500008004100000245010700041210006900148260001300217490000800230520098500238100002701223700002201250700002201272700002401294700001901318700001901337856013101356 2020 eng d00aCollisions of room-temperature helium with ultracold lithium and the van der Waals bound state of HeLi0 aCollisions of roomtemperature helium with ultracold lithium and  c1/6/20200 v1013 a

We have computed the thermally averaged total, elastic rate coefficient for the collision of a room-temperature helium atom with an ultracold lithium atom. This rate coefficient has been computed as part of the characterization of a cold-atom vacuum sensor based on laser-cooled Li 6 or Li 7 atoms that will operate in the ultrahigh-vacuum (p< 10− 6 Pa) and extreme-high-vacuum (p< 10− 10 Pa) regimes. The analysis involves computing the X 2 Σ+ HeLi Born-Oppenheimer potential followed by the numerical solution of the relevant radial Schrödinger equation. The potential is computed using a single-reference-coupled-cluster electronic-structure method with basis sets of different completeness in order to characterize our uncertainty budget. We predict that the rate coefficient for a 300 K helium gas and a 1 μ K Li gas is 1.467 (13)× 10− 9 cm 3/s for He 4+ Li 6 and 1.471 (13)× 10− 9 cm 3/s for He 4+ Li 7, where the …

1 aMakrides, Constantinos1 aBarker, Daniel, S1 aFedchak, James, A1 aScherschligt, Julia1 aEckel, Stephen1 aTiesinga, Eite uhttps://www.quics.umd.edu/publications/collisions-room-temperature-helium-ultracold-lithium-and-van-der-waals-bound-state-heli02409nas a2200193 4500008004100000245006700041210006700108260001500175490000700190520183800197100002002035700001902055700002302074700001802097700002402115700002002139700001902159856003702178 2020 eng d00aContinuous symmetries and approximate quantum error correction0 aContinuous symmetries and approximate quantum error correction c10/26/20200 v103 a

Quantum error correction and symmetry arise in many areas of physics, including many-body systems, metrology in the presence of noise, fault-tolerant computation, and holographic quantum gravity. Here we study the compatibility of these two important principles. If a logical quantum system is encoded into n physical subsystems, we say that the code is covariant with respect to a symmetry group G if a G transformation on the logical system can be realized by performing transformations on the individual subsystems. For a G-covariant code with G a continuous group, we derive a lower bound on the error correction infidelity following erasure of a subsystem. This bound approaches zero when the number of subsystems n or the dimension d of each subsystem is large. We exhibit codes achieving approximately the same scaling of infidelity with n or d as the lower bound. Leveraging tools from representation theory, we prove an approximate version of the Eastin-Knill theorem: If a code admits a universal set of transversal gates and corrects erasure with fixed accuracy, then, for each logical qubit, we need a number of physical qubits per subsystem that is inversely proportional to the error parameter. We construct codes covariant with respect to the full logical unitary group, achieving good accuracy for large d (using random codes) or n (using codes based on W-states). We systematically construct codes covariant with respect to general groups, obtaining natural generalizations of qubit codes to, for instance, oscillators and rotors. In the context of the AdS/CFT correspondence, our approach provides insight into how time evolution in the bulk corresponds to time evolution on the boundary without violating the Eastin-Knill theorem, and our five-rotor code can be stacked to form a covariant holographic code.

1 aFaist, Philippe1 aNezami, Sepehr1 aAlbert, Victor, V.1 aSalton, Grant1 aPastawski, Fernando1 aHayden, Patrick1 aPreskill, John uhttps://arxiv.org/abs/1902.0771401932nas a2200181 4500008004100000245005700041210005700098260001300155520138000168100002501548700002001573700002201593700002701615700002301642700002501665700002301690856003701713 2020 eng d00aCritical Theory for the Breakdown of Photon Blockade0 aCritical Theory for the Breakdown of Photon Blockade c6/9/20203 a

Photon blockade is the result of the interplay between the quantized nature of light and strong optical nonlinearities, whereby strong photon-photon repulsion prevents a quantum optical system from absorbing multiple photons. We theoretically study a single atom coupled to the light field, described by the resonantly driven Jaynes--Cummings model, in which case the photon blockade breaks down in a second order phase transition at a critical drive strength. We show that this transition is associated to the spontaneous breaking of an anti-unitary PT-symmetry. Within a semiclassical approximation we calculate the expectation values of observables in the steady state. We then move beyond the semiclassical approximation and approach the critical point from the disordered (blockaded) phase by reducing the Lindblad quantum master equation to a classical rate equation that we solve. The width of the steady-state distribution in Fock space is found to diverge as we approach the critical point with a simple power-law, allowing us to calculate the critical scaling of steady state observables without invoking mean-field theory. We propose a simple physical toy model for biased diffusion in the space of occupation numbers, which captures the universal properties of the steady state. We list several experimental platforms where this phenomenon may be observed.

1 aCurtis, Jonathan, B.1 aBoettcher, Igor1 aYoung, Jeremy, T.1 aMaghrebi, Mohammad, F.1 aCarmichael, Howard1 aGorshkov, Alexey, V.1 aFoss-Feig, Michael uhttps://arxiv.org/abs/2006.0559301942nas a2200145 4500008004100000245007300041210006900114260001300183490000600196520143200202100001801634700001601652700001901668856010901687 2020 eng d00aEfficient randomness certification by quantum probability estimation0 aEfficient randomness certification by quantum probability estima c1/7/20200 v23 a

For practical applications of quantum randomness generation, it is important to certify and further produce a fixed block of fresh random bits with as few trials as possible. Consequently, protocols with high finite-data efficiency are preferred. To yield such protocols with respect to quantum side information, we develop quantum probability estimation. Our approach is applicable to device-independent as well as device-dependent scenarios, and it generalizes techniques from previous works [Miller and Shi, SIAM J. Comput. 46, 1304 (2017); Arnon-Friedman et al., Nat. Commun. 9, 459 (2018)]. Quantum probability estimation can adapt to changing experimental conditions, allows stopping the experiment as soon as the prespecified randomness goal is achieved, and can tolerate imperfect knowledge of the input distribution. Moreover, the randomness rate achieved at constant error is asymptotically optimal. For the device-independent scenario, our approach certifies the amount of randomness available in experimental results without first searching for relations between randomness and violations of fixed Bell inequalities. We implement quantum probability estimation for device-independent randomness generation in the CHSH Bell-test configuration, and we show significant improvements in finite-data efficiency, particularly at small Bell violations which are typical in current photonic loophole-free Bell tests.

1 aZhang, Yanbao1 aFu, Honghao1 aKnill, Emanuel uhttps://www.quics.umd.edu/publications/efficient-randomness-certification-quantum-probability-estimation01465nas a2200265 4500008004100000245006700041210006500108260001500173490000800188520070100196100001800897700002200915700002500937700002400962700002500986700001801011700002101029700002001050700002501070700001601095700001701111700001501128700001901143856003701162 2020 eng d00aExperimental Low-Latency Device-Independent Quantum Randomness0 aExperimental LowLatency DeviceIndependent Quantum Randomness c12/24/20190 v1243 a

Applications of randomness such as private key generation and public randomness beacons require small blocks of certified random bits on demand. Device-independent quantum random number generators can produce such random bits, but existing quantum-proof protocols and loophole-free implementations suffer from high latency, requiring many hours to produce any random bits. We demonstrate device-independent quantum randomness generation from a loophole-free Bell test with a more efficient quantum-proof protocol, obtaining multiple blocks of 512 bits with an average experiment time of less than 5 min per block and with certified error bounded by 2−64≈5.42×10−20.

1 aZhang, Yanbao1 aShalm, Lynden, K.1 aBienfang, Joshua, C.1 aStevens, Martin, J.1 aMazurek, Michael, D.1 aNam, Sae, Woo1 aAbellán, Carlos1 aAmaya, Waldimar1 aMitchell, Morgan, W.1 aFu, Honghao1 aMiller, Carl1 aMink, Alan1 aKnill, Emanuel uhttps://arxiv.org/abs/1812.0778601494nas a2200181 4500008004100000245005100041210005100092260001500143300001100158490000700169520100800176100001401184700001701198700002501215700001901240700001601259856003701275 2020 eng d00aMore of the Bulk from Extremal Area Variations0 aMore of the Bulk from Extremal Area Variations c12/24/2020 a0470010 v383 a

It was shown recently, building on work of Alexakis, Balehowksy, and Nachman that the geometry of (some portion of) a manifold with boundary is uniquely fixed by the areas of a foliation of two-dimensional disk-shaped surfaces anchored to the boundary. In the context of AdS/CFT, this implies that (a portion of) a four-dimensional bulk geometry can be fixed uniquely from the entanglement entropies of disk-shaped boundary regions, subject to several constraints. In this Note, we loosen some of these constraints, in particular allowing for the bulk foliation of extremal surfaces to be local and removing the constraint of disk topology; these generalizations ensure uniqueness of more of the deep bulk geometry by allowing for e.g. surfaces anchored on disconnected asymptotic boundaries, or HRT surfaces past a phase transition. We also explore in more depth the generality of the local foliation requirement, showing that even in a highly dynamical geometry like AdS-Vaidya it is satisfied.

1 aBao, Ning1 aCao, ChunJun1 aFischetti, Sebastian1 aPollack, Jason1 aZhong, Yibo uhttps://arxiv.org/abs/2009.0785002329nas a2200157 4500008004100000245005700041210005600098260001400154490000700168520186200175100002202037700002502059700002302084700002702107856003702134 2020 eng d00aNon-equilibrium fixed points of coupled Ising models0 aNonequilibrium fixed points of coupled Ising models c2/26/20200 v103 a

Driven-dissipative systems can exhibit non-equilibrium phenomena that are absent in their equilibrium counterparts. However, phase transitions present in these systems generically exhibit an effectively classical equilibrium behavior in spite of their quantum non-equilibrium origin. In this paper, we show that multicritical points in driven-dissipative systems can give rise to genuinely non-equilibrium behavior. We investigate a non-equilibrium driven-dissipative model of interacting bosons that exhibits two distinct phase transitions: one from a high- to a low-density phase---reminiscent of a liquid-gas transition---and another to an antiferromagnetic phase. Each phase transition is described by the Ising universality class characterized by an (emergent or microscopic) Z2 symmetry. They, however, coalesce at a multicritical point giving rise to a non-equilibrium model of coupled Ising-like order parameters described by a Z2×Z2 symmetry. Using a dynamical renormalization-group approach, we show that a pair of non-equilibrium fixed points (NEFPs) emerge that govern the long-distance critical behavior of the system. We elucidate various exotic features of these NEFPs. In particular, we show that a generic continuous scale invariance at criticality is reduced to a discrete scale invariance. This further results in complex-valued critical exponents, spiraling phase boundaries, and a complex Liouvillian gap even close to the phase transition. As direct evidence of the non-equilibrium nature of the NEFPs, we show that the fluctuation-dissipation relation is violated at all scales, leading to an effective temperature that becomes "hotter" and "hotter" at longer and longer wavelengths. Finally, we argue that this non-equilibrium behavior can be observed in cavity arrays with cross-Kerr nonlinearities.

1 aYoung, Jeremy, T.1 aGorshkov, Alexey, V.1 aFoss-Feig, Michael1 aMaghrebi, Mohammad, F. uhttps://arxiv.org/abs/1903.0256901795nas a2200157 4500008004100000245008800041210006900129260001400198520128700212100002501499700001701524700002201541700001901563700001801582856003701600 2020 eng d00aA note on blind contact tracing at scale with applications to the COVID-19 pandemic0 anote on blind contact tracing at scale with applications to the  c4/10/20203 a

The current COVID-19 pandemic highlights the utility of contact tracing, when combined with case isolation and social distancing, as an important tool for mitigating the spread of a disease [1]. Contact tracing provides a mechanism of identifying individuals with a high likelihood of previous exposure to a contagious disease, allowing additional precautions to be put in place to prevent continued transmission. Here we consider a cryptographic approach to contact tracing based on secure two-party computation (2PC). We begin by considering the problem of comparing a set of location histories held by two parties to determine whether they have come within some threshold distance while at the same time maintaining the privacy of the location histories. We propose a solution to this problem using pre-shared keys, adapted from an equality testing protocol due to Ishai et al [2]. We discuss how this protocol can be used to maintain privacy within practical contact tracing scenarios, including both app-based approaches and approaches which leverage location history held by telecoms and internet service providers. We examine the efficiency of this approach and show that existing infrastructure is sufficient to support anonymised contact tracing at a national level.

1 aFitzsimons, Jack, K.1 aMantri, Atul1 aPisarczyk, Robert1 aRainforth, Tom1 aZhao, Zhikuan uhttps://arxiv.org/abs/2004.0511601259nas a2200157 4500008004100000245007100041210006900112260001400181520077600195100001300971700001700984700001601001700002501017700002201042856003701064 2020 eng d00aOptical quantum memory with optically inaccessible noble-gas spins0 aOptical quantum memory with optically inaccessible noblegas spin c7/17/20203 a

Optical quantum memories, which store and preserve the quantum state of photons, rely on a coherent mapping of the photonic state onto matter states that are optically accessible. Here we outline a new physical mechanism to map the state of photons onto the long-lived but optically inaccessible collective state of noble-gas spins. The mapping employs the coherent spin-exchange interaction arising from random collisions with alkali vapor. We analyze optimal strategies for high-efficiency storage and retrieval of non-classical light at various parameter regimes. Based on these strategies, we identify feasible experimental conditions for realizing efficient quantum memories with noble-gas spins having hours-long coherence times at room temperature and above

1 aKatz, Or1 aReches, Eran1 aShaham, Roy1 aGorshkov, Alexey, V.1 aFirstenberg, Ofer uhttps://arxiv.org/abs/2007.0877001854nas a2200193 4500008004100000245008800041210006900129260001400198520128100212100001501493700001701508700001501525700001601540700001701556700001401573700001901587700001701606856003701623 2020 eng d00aProbing XY phase transitions in a Josephson junction array with tunable frustration0 aProbing XY phase transitions in a Josephson junction array with  c1/22/20203 a

The seminal theoretical works of Berezinskii, Kosterlitz, and Thouless presented a new paradigm for phase transitions in condensed matter that are driven by topological excitations. These transitions have been extensively studied in the context of two-dimensional XY models -- coupled compasses -- and have generated interest in the context of quantum simulation. Here, we use a circuit quantum-electrodynamics architecture to study the critical behavior of engineered XY models through their dynamical response. In particular, we examine not only the unfrustrated case but also the fully-frustrated case which leads to enhanced degeneracy associated with the spin rotational [U(1)] and discrete chiral (Z2) symmetries. The nature of the transition in the frustrated case has posed a challenge for theoretical studies while direct experimental probes remain elusive. Here we identify the transition temperatures for both the unfrustrated and fully-frustrated XY models by probing a Josephson junction array close to equilibrium using weak microwave excitations and measuring the temperature dependence of the effective damping obtained from the complex reflection coefficient. We argue that our probing technique is primarily sensitive to the dynamics of the U(1) part.

1 aCosmic, R.1 aKawabata, K.1 aAshida, Y.1 aIkegami, H.1 aFurukawa, S.1 aPatil, P.1 aTaylor, J., M.1 aNakamura, Y. uhttps://arxiv.org/abs/2001.0787702376nas a2200157 4500008004100000245005000041210004900091260001500140520192200155100002102077700002202098700002002120700001702140700002402157856003702181 2020 eng d00aQuantum coding with low-depth random circuits0 aQuantum coding with lowdepth random circuits c10/19/20203 a

Random quantum circuits have played a central role in establishing the computational advantages of near-term quantum computers over their conventional counterparts. Here, we use ensembles of low-depth random circuits with local connectivity in D≥1 spatial dimensions to generate quantum error-correcting codes. For random stabilizer codes and the erasure channel, we find strong evidence that a depth O(logN) random circuit is necessary and sufficient to converge (with high probability) to zero failure probability for any finite amount below the channel capacity for any D. Previous results on random circuits have only shown that O(N1/D) depth suffices or that O(log3N) depth suffices for all-to-all connectivity (D→∞). We then study the critical behavior of the erasure threshold in the so-called moderate deviation limit, where both the failure probability and the distance to the channel capacity converge to zero with N. We find that the requisite depth scales like O(logN) only for dimensions D≥2, and that random circuits require O(N−−√) depth for D=1. Finally, we introduce an "expurgation" algorithm that uses quantum measurements to remove logical operators that cause the code to fail by turning them into either additional stabilizers or into gauge operators in a subsystem code. With such targeted measurements, we can achieve sub-logarithmic depth in D≥2 spatial dimensions below capacity without increasing the maximum weight of the check operators. We find that for any rate beneath the capacity, high-performing codes with thousands of logical qubits are achievable with depth 4-8 expurgated random circuits in D=2 dimensions. These results indicate that finite-rate quantum codes are practically relevant for near-term devices and may significantly reduce the resource requirements to achieve fault tolerance for near-term applications. 

1 aGullans, Michael1 aKrastanov, Stefan1 aHuse, David, A.1 aJiang, Liang1 aFlammia, Steven, T. uhttps://arxiv.org/abs/2010.0977501697nas a2200169 4500008004100000245008100041210006900122260001500191520115700206100002001363700002301383700001901406700002001425700002001445700002501465856003701490 2019 eng d00aComplexity phase diagram for interacting and long-range bosonic Hamiltonians0 aComplexity phase diagram for interacting and longrange bosonic H c06/10/20193 a

Recent years have witnessed a growing interest in topics at the intersection of many-body physics and complexity theory. Many-body physics aims to understand and classify emergent behavior of systems with a large number of particles, while complexity theory aims to classify computational problems based on how the time required to solve the problem scales as the problem size becomes large. In this work, we use insights from complexity theory to classify phases in interacting many-body systems. Specifically, we demonstrate a "complexity phase diagram" for the Bose-Hubbard model with long-range hopping. This shows how the complexity of simulating time evolution varies according to various parameters appearing in the problem, such as the evolution time, the particle density, and the degree of locality. We find that classification of complexity phases is closely related to upper bounds on the spread of quantum correlations, and protocols to transfer quantum information in a controlled manner. Our work motivates future studies of complexity in many-body systems and its interplay with the associated physical phenomena. 

1 aMaskara, Nishad1 aDeshpande, Abhinav1 aTran, Minh, C.1 aEhrenberg, Adam1 aFefferman, Bill1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1906.0417802955nas a2200397 4500008004100000245008600041210006900127260001500196520181200211100002102023700002302044700002002067700001702087700002202104700001702126700002502143700001802168700001902186700001702205700001702222700002702239700001502266700001702281700001802298700001702316700001602333700002002349700001902369700002302388700002502411700002402436700001802460700002002478700002202498856003702520 2019 eng d00aDevelopment of Quantum InterConnects for Next-Generation Information Technologies0 aDevelopment of Quantum InterConnects for NextGeneration Informat c12/13/20193 a

Just as classical information technology rests on a foundation built of interconnected information-processing systems, quantum information technology (QIT) must do the same. A critical component of such systems is the interconnect, a device or process that allows transfer of information between disparate physical media, for example, semiconductor electronics, individual atoms, light pulses in optical fiber, or microwave fields. While interconnects have been well engineered for decades in the realm of classical information technology, quantum interconnects (QuICs) present special challenges, as they must allow the transfer of fragile quantum states between different physical parts or degrees of freedom of the system. The diversity of QIT platforms (superconducting, atomic, solid-state color center, optical, etc.) that will form a quantum internet poses additional challenges. As quantum systems scale to larger size, the quantum interconnect bottleneck is imminent, and is emerging as a grand challenge for QIT. For these reasons, it is the position of the community represented by participants of the NSF workshop on Quantum Interconnects that accelerating QuIC research is crucial for sustained development of a national quantum science and technology program. Given the diversity of QIT platforms, materials used, applications, and infrastructure required, a convergent research program including partnership between academia, industry and national laboratories is required. This document is a summary from a U.S. National Science Foundation supported workshop held on 31 October - 1 November 2019 in Alexandria, VA. Attendees were charged to identify the scientific and community needs, opportunities, and significant challenges for quantum interconnects over the next 2-5 years. 

1 aAwschalom, David1 aBerggren, Karl, K.1 aBernien, Hannes1 aBhave, Sunil1 aCarr, Lincoln, D.1 aDavids, Paul1 aEconomou, Sophia, E.1 aEnglund, Dirk1 aFaraon, Andrei1 aFejer, Marty1 aGuha, Saikat1 aGustafsson, Martin, V.1 aHu, Evelyn1 aJiang, Liang1 aKim, Jungsang1 aKorzh, Boris1 aKumar, Prem1 aKwiat, Paul, G.1 aLončar, Marko1 aLukin, Mikhail, D.1 aMiller, David, A. B.1 aMonroe, Christopher1 aNam, Sae, Woo1 aNarang, Prineha1 aOrcutt, Jason, S. uhttps://arxiv.org/abs/1912.0664201741nas a2200205 4500008004100000245007000041210006900111260001500180490000600195520112800201100001901329700002001348700001301368700002401381700002201405700002301427700002301450700002501473856003701498 2019 eng d00aLocality and digital quantum simulation of power-law interactions0 aLocality and digital quantum simulation of powerlaw interactions c07/10/20190 v93 a

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, C.1 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.0522501470nas a2200145 4500008004100000245009500041210006900136260001400205520099100219100001801210700001601228700002001244700002301264856003701287 2019 eng d00aMomentum-space entanglement after a quench in one-dimensional disordered fermionic systems0 aMomentumspace entanglement after a quench in onedimensional diso c9/11/20193 a

We numerically investigate the momentum-space entanglement entropy and entanglement spectrum of the random-dimer model and its generalizations, which circumvent Anderson localization, after a quench in the Hamiltonian parameters. The type of dynamics that occurs depends on whether or not the Fermi level of the initial state is near the energy of the delocalized states present in these models. If the Fermi level of the initial state is near the energy of the delocalized states, we observe an interesting slow logarithmic-like growth of the momentum-space entanglement entropy followed by an eventual saturation. Otherwise, the momentum-space entanglement entropy is found to rapidly saturate. We also find that the momentum-space entanglement spectrum reveals the presence of delocalized states in these models for long times after the quench and the many-body entanglement gap decays logarithmically in time when the Fermi level is near the energy of the delocalized states.

1 aLundgren, Rex1 aLiu, Fangli1 aLaurell, Pontus1 aFiete, Gregory, A. uhttps://arxiv.org/abs/1909.0514001912nas a2200265 4500008004100000245007900041210006900120260001500189520117500204100001601379700001501395700001201410700001501422700002001437700001101457700001301468700001901481700002001500700001701520700001501537700001701552700002501569700001501594856003701609 2019 eng d00aObservation of Domain Wall Confinement and Dynamics in a Quantum Simulator0 aObservation of Domain Wall Confinement and Dynamics in a Quantum c12/23/20193 a

Confinement is a ubiquitous mechanism in nature, whereby particles feel an attractive force that increases without bound as they separate. A prominent example is color confinement in particle physics, in which baryons and mesons are produced by quark confinement. Analogously, confinement can also occur in low-energy quantum many-body systems when elementary excitations are confined into bound quasiparticles. Here, we report the first observation of magnetic domain wall confinement in interacting spin chains with a trapped-ion quantum simulator. By measuring how correlations spread, we show that confinement can dramatically suppress information propagation and thermalization in such many-body systems. We are able to quantitatively determine the excitation energy of domain wall bound states from non-equilibrium quench dynamics. Furthermore, we study the number of domain wall excitations created for different quench parameters, in a regime that is difficult to model with classical computers. This work demonstrates the capability of quantum simulators for investigating exotic high-energy physics phenomena, such as quark collision and string breaking

1 aTan, W., L.1 aBecker, P.1 aLiu, F.1 aPagano, G.1 aCollins, K., S.1 aDe, A.1 aFeng, L.1 aKaplan, H., B.1 aKyprianidis, A.1 aLundgren, R.1 aMorong, W.1 aWhitsitt, S.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/1912.1111702010nas a2200409 4500008004100000245006800041210006600109260001500175520084400190100001901034700002601053700002001079700002001099700002001119700001701139700002501156700002201181700001901203700001701222700002201239700002101261700002501282700001901307700002301326700001801349700001901367700002101386700002101407700001501428700002001443700002401463700001801487700002301505700001901528700001601547856003701563 2019 eng d00aOpportunities for Nuclear Physics & Quantum Information Science0 aOpportunities for Nuclear Physics Quantum Information Science c03/13/20193 a

his whitepaper is an outcome of the workshop Intersections between Nuclear Physics and Quantum Information held at Argonne National Laboratory on 28-30 March 2018 [www.phy.anl.gov/npqi2018/]. The workshop brought together 116 national and international experts in nuclear physics and quantum information science to explore opportunities for the two fields to collaborate on topics of interest to the U.S. Department of Energy (DOE) Office of Science, Office of Nuclear Physics, and more broadly to U.S. society and industry. The workshop consisted of 22 invited and 10 contributed talks, as well as three panel discussion sessions. Topics discussed included quantum computation, quantum simulation, quantum sensing, nuclear physics detectors, nuclear many-body problem, entanglement at collider energies, and lattice gauge theories.

1 aCloët, I., C.1 aDietrich, Matthew, R.1 aArrington, John1 aBazavov, Alexei1 aBishof, Michael1 aFreese, Adam1 aGorshkov, Alexey, V.1 aGrassellino, Anna1 aHafidi, Kawtar1 aJacob, Zubin1 aMcGuigan, Michael1 aMeurice, Yannick1 aMeziani, Zein-Eddine1 aMueller, Peter1 aMuschik, Christine1 aOsborn, James1 aOtten, Matthew1 aPetreczky, Peter1 aPolakovic, Tomas1 aPoon, Alan1 aPooser, Raphael1 aRoggero, Alessandro1 aSaffman, Mark1 aVanDevender, Brent1 aZhang, Jiehang1 aZohar, Erez uhttps://arxiv.org/abs/1903.0545301947nas a2200397 4500008004100000245005400041210005400095260001500149520085000164100001801014700001601032700002301048700002301071700002201094700002401116700001901140700001801159700001801177700002001195700002501215700001801240700001801258700001901276700001901295700001601314700002301330700001901353700001701372700002401389700001901413700002201432700001901454700001901473700002001492856003701512 2019 eng d00aQuantum Computer Systems for Scientific Discovery0 aQuantum Computer Systems for Scientific Discovery c12/16/20193 a

The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considered together, by co-designing full stack quantum computer systems along with their applications in order to hasten their development and potential for scientific discovery. In this context, we identify scientific and community needs, opportunities, and significant challenges for the development of quantum computers for science over the next 2-10 years. This document is written by a community of university, national laboratory, and industrial researchers in the field of Quantum Information Science and Technology, and is based on a summary from a U.S. National Science Foundation workshop on Quantum Computing held on October 21-22, 2019 in Alexandria, VA.

1 aAlexeev, Yuri1 aBacon, Dave1 aBrown, Kenneth, R.1 aCalderbank, Robert1 aCarr, Lincoln, D.1 aChong, Frederic, T.1 aDeMarco, Brian1 aEnglund, Dirk1 aFarhi, Edward1 aFefferman, Bill1 aGorshkov, Alexey, V.1 aHouck, Andrew1 aKim, Jungsang1 aKimmel, Shelby1 aLange, Michael1 aLloyd, Seth1 aLukin, Mikhail, D.1 aMaslov, Dmitri1 aMaunz, Peter1 aMonroe, Christopher1 aPreskill, John1 aRoetteler, Martin1 aSavage, Martin1 aThompson, Jeff1 aVazirani, Umesh uhttps://arxiv.org/abs/1912.0757702892nas a2200397 4500008004100000245005600041210005500097260001500152520177700167100001701944700002301961700002101984700002202005700001902027700001602046700001902062700002502081700002302106700002002129700002002149700002602169700002302195700002402218700002202242700002302264700001602287700001302303700002002316700002402336700001702360700001902377700001802396700002302414700002002437856003702457 2019 eng d00aQuantum Simulators: Architectures and Opportunities0 aQuantum Simulators Architectures and Opportunities c12/14/20193 a

Quantum simulators are a promising technology on the spectrum of quantum devices from specialized quantum experiments to universal quantum computers. These quantum devices utilize entanglement and many-particle behaviors to explore and solve hard scientific, engineering, and computational problems. Rapid development over the last two decades has produced more than 300 quantum simulators in operation worldwide using a wide variety of experimental platforms. Recent advances in several physical architectures promise a golden age of quantum simulators ranging from highly optimized special purpose simulators to flexible programmable devices. These developments have enabled a convergence of ideas drawn from fundamental physics, computer science, and device engineering. They have strong potential to address problems of societal importance, ranging from understanding vital chemical processes, to enabling the design of new materials with enhanced performance, to solving complex computational problems. It is the position of the community, as represented by participants of the NSF workshop on "Programmable Quantum Simulators," that investment in a national quantum simulator program is a high priority in order to accelerate the progress in this field and to result in the first practical applications of quantum machines. Such a program should address two areas of emphasis: (1) support for creating quantum simulator prototypes usable by the broader scientific community, complementary to the present universal quantum computer effort in industry; and (2) support for fundamental research carried out by a blend of multi-investigator, multi-disciplinary collaborations with resources for quantum simulator software, hardware, and education. 

1 aAltman, Ehud1 aBrown, Kenneth, R.1 aCarleo, Giuseppe1 aCarr, Lincoln, D.1 aDemler, Eugene1 aChin, Cheng1 aDeMarco, Brian1 aEconomou, Sophia, E.1 aEriksson, Mark, A.1 aFu, Kai-Mei, C.1 aGreiner, Markus1 aHazzard, Kaden, R. A.1 aHulet, Randall, G.1 aKollár, Alicia, J.1 aLev, Benjamin, L.1 aLukin, Mikhail, D.1 aMa, Ruichao1 aMi, Xiao1 aMisra, Shashank1 aMonroe, Christopher1 aMurch, Kater1 aNazario, Zaira1 aNi, Kang-Kuen1 aPotter, Andrew, C.1 aRoushan, Pedram uhttps://arxiv.org/abs/1912.0693801810nas a2200169 4500008004100000245005600041210005600097260001500153490000700168520133300175100002701508700001801535700001701553700001801570700001501588856003701603 2019 eng d00aQuantum Wasserstein Generative Adversarial Networks0 aQuantum Wasserstein Generative Adversarial Networks c2019/10/310 v323 a

The study of quantum generative models is well-motivated, not only because of its importance in quantum machine learning and quantum chemistry but also because of the perspective of its implementation on near-term quantum machines. Inspired by previous studies on the adversarial training of classical and quantum generative models, we propose the first design of quantum Wasserstein Generative Adversarial Networks (WGANs), which has been shown to improve the robustness and the scalability of the adversarial training of quantum generative models even on noisy quantum hardware. Specifically, we propose a definition of the Wasserstein semimetric between quantum data, which inherits a few key theoretical merits of its classical counterpart. We also demonstrate how to turn the quantum Wasserstein semimetric into a concrete design of quantum WGANs that can be efficiently implemented on quantum machines. Our numerical study, via classical simulation of quantum systems, shows the more robust and scalable numerical performance of our quantum WGANs over other quantum GAN proposals. As a surprising application, our quantum WGAN has been used to generate a 3-qubit quantum circuit of ~50 gates that well approximates a 3-qubit 1-d Hamiltonian simulation circuit that requires over 10k gates using standard techniques.

1 aChakrabarti, Shouvanik1 aHuang, Yiming1 aLi, Tongyang1 aFeizi, Soheil1 aWu, Xiaodi uhttps://arxiv.org/abs/1911.0011101465nas a2200145 4500008004100000245006900041210006900110260001300179520101400192100001401206700001701220700002501237700002001262856003701282 2019 eng d00aTowards Bulk Metric Reconstruction from Extremal Area Variations0 aTowards Bulk Metric Reconstruction from Extremal Area Variations c04/09/193 a

The Ryu-Takayanagi and Hubeny-Rangamani-Takayanagi formulae suggest that bulk geometry emerges from the entanglement structure of the boundary theory. Using these formulae, we build on a result of Alexakis, Balehowsky, and Nachman to show that in four bulk dimensions, the entanglement entropies of boundary regions of disk topology uniquely fix the bulk metric in any region foliated by the corresponding HRT surfaces. More generally, for a bulk of any dimension , knowledge of the (variations of the) areas of two-dimensional boundary-anchored extremal surfaces of disk topology uniquely fixes the bulk metric wherever these surfaces reach. This result is covariant and not reliant on any symmetry assumptions; its applicability thus includes regions of strong dynamical gravity such as the early-time interior of black holes formed from collapse. While we only show uniqueness of the metric, the approach we present provides a clear path towards an\textit {explicit} spacetime metric reconstruction.

1 aBao, Ning1 aCao, ChunJun1 aFischetti, Sebastian1 aKeeler, Cynthia uhttps://arxiv.org/abs/1904.0483401552nas a2200169 4500008004100000245007500041210006900116520100400185100001901189700002301208700002201231700002401253700002401277700002001301700002401321856003701345 2018 eng d00aDemonstration of Bayesian quantum game on an ion trap quantum computer0 aDemonstration of Bayesian quantum game on an ion trap quantum co3 a

We demonstrate a Bayesian quantum game on an ion trap quantum computer with five qubits. The players share an entangled pair of qubits and perform rotations on their qubit as the strategy choice. Two five-qubit circuits are sufficient to run all 16 possible strategy choice sets in a game with four possible strategies. The data are then parsed into player types randomly in order to combine them classically into a Bayesian framework. We exhaustively compute the possible strategies of the game so that the experimental data can be used to solve for the Nash equilibria of the game directly. Then we compare the payoff at the Nash equilibria and location of phase-change-like transitions obtained from the experimental data to the theory, and study how it changes as a function of the amount of entanglement.

1 aSolmeyer, Neal1 aLinke, Norbert, M.1 aFiggatt, Caroline1 aLandsman, Kevin, A.1 aBalu, Radhakrishnan1 aSiopsis, George1 aMonroe, Christopher uhttps://arxiv.org/abs/1802.0811601425nas 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 a

We 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.0665501538nas 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 a

We 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.0665512409nas a2200169 45000080041000002450055000412100055000963000047001514900008001985201188600206100002312092700002012115700001912135700002312154700002512177856003712202 2018 eng d00aDynamical phase transitions in sampling complexity0 aDynamical phase transitions in sampling complexity a12 pages, 4 figures. v3: published version0 v1213 a

We make the case for studying the complexity of approximately simulating (sampling) quantum systems for reasons beyond that of quantum computational supremacy, such as diagnosing phase transitions. We consider the sampling complexity as a function of time t due to evolution generated by spatially local quadratic bosonic Hamiltonians. We obtain an upper bound on the scaling of t with the number of bosons n for which approximate sampling is classically efficient. We also obtain a lower bound on the scaling of t with n for which any instance of the boson sampling problem reduces to this problem and hence implies that the problem is hard, assuming the conjectures of Aaronson and Arkhipov [Proc. 43rd Annu. ACM Symp. Theory Comput. STOC '11]. This establishes a dynamical phase transition in sampling complexity. Further, we show that systems in the Anderson-localized phase are always easy to sample from at arbitrarily long times. We view these results in the light of classifying phases of physical systems based on parameters in the Hamiltonian. In doing so, we combine ideas from mathematical physics and computational complexity to gain insight into the behavior of condensed matter, atomic, molecular and optical systems.

1 aDeshpande, Abhinav1 aFefferman, Bill1 aTran, Minh, C.1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1703.0533201139nas a2200133 4500008004100000245004700041210004600088260001200134300001100146520077800157100001600935700001700951856003700968 2018 eng d00aLocal randomness: Examples and application0 aLocal randomness Examples and application c03/2018 a0323243 a

When two players achieve a superclassical score at a nonlocal game, their outputs must contain intrinsic randomness. This fact has many useful implications for quantum cryptography. Recently it has been observed [C. Miller and Y. Shi, Quantum Inf. Computat. 17, 0595 (2017)] that such scores also imply the existence of local randomness—that is, randomness known to one player but not to the other. This has potential implications for cryptographic tasks between two cooperating but mistrustful players. In the current paper we bring this notion toward practical realization, by offering near-optimal bounds on local randomness for the CHSH game, and also proving the security of a cryptographic application of local randomness (single-bit certified deletion).

1 aFu, Honghao1 aMiller, Carl uhttps://arxiv.org/abs/1708.0433801356nas a2200181 4500008004100000245006000041210005900101260001500160490000700175520083200182100001801014700002401032700002301056700002201079700001501101700002101116856003701137 2018 eng d00aMachine learning assisted readout of trapped-ion qubits0 aMachine learning assisted readout of trappedion qubits c2018/05/010 v513 a

We reduce measurement errors in a quantum computer using machine learning techniques. We exploit a simple yet versatile neural network to classify multi-qubit quantum states, which is trained using experimental data. This flexible approach allows the incorporation of any number of features of the data with minimal modifications to the underlying network architecture. We experimentally illustrate this approach in the readout of trapped-ion qubits using additional spatial and temporal features in the data. Using this neural network classifier, we efficiently treat qubit readout crosstalk, resulting in a 30\% improvement in detection error over the conventional threshold method. Our approach does not depend on the specific details of the system and can be readily generalized to other quantum computing platforms.

1 aSeif, Alireza1 aLandsman, Kevin, A.1 aLinke, Norbert, M.1 aFiggatt, Caroline1 aMonroe, C.1 aHafezi, Mohammad uhttps://arxiv.org/abs/1804.0771801192nas 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 a

Studies 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.0464601943nas a2200169 4500008004100000245007600041210006900117520143500186100001601621700001801637700001801655700002101673700001201694700001501706700001501721856003701736 2018 eng d00aParallel Entangling Operations on a Universal Ion Trap Quantum Computer0 aParallel Entangling Operations on a Universal Ion Trap Quantum C3 a

The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear efficiency gains in numerous quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a quantum computer using a depth-4 quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up quantum circuits and achieving fault tolerance with trapped ion quantum computers.

1 aFiggatt, C.1 aOstrander, A.1 aLinke, N., M.1 aLandsman, K., A.1 aZhu, D.1 aMaslov, D.1 aMonroe, C. uhttps://arxiv.org/abs/1810.1194801663nas a2200133 4500008004100000245007200041210006900113520124300182100001401425700001401439700002201453700001701475856003701492 2018 eng d00aQuantum Channel Simulation and the Channel's Smooth Max-Information0 aQuantum Channel Simulation and the Channels Smooth MaxInformatio3 a

We study the general framework of quantum channel simulation, that is, the ability of a quantum channel to simulate another one using different classes of codes. First, we show that the minimum error of simulation and the one-shot quantum simulation cost under no-signalling assisted codes are given by semidefinite programs. Second, we introduce the channel's smooth max-information, which can be seen as a one-shot generalization of the mutual information of a quantum channel. We provide an exact operational interpretation of the channel's smooth max-information as the one-shot quantum simulation cost under no-signalling assisted codes. Third, we derive the asymptotic equipartition property of the channel's smooth max-information, i.e., it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. This implies the quantum reverse Shannon theorem in the presence of no-signalling correlations. Finally, we explore the simulation cost of various quantum channels.

1 aFang, Kun1 aWang, Xin1 aTomamichel, Marco1 aBerta, Mario uhttps://arxiv.org/abs/1807.0535401599nas a2200133 4500008004100000245006800041210006800109520117300177100001801350700002001368700002001388700002001408856003701428 2018 eng d00aQuantum Supremacy and the Complexity of Random Circuit Sampling0 aQuantum Supremacy and the Complexity of Random Circuit Sampling3 a

A critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study both the hardness and verification of RCS. While RCS was defined with experimental realization in mind, we show complexity theoretic evidence of hardness that is on par with the strongest theoretical proposals for supremacy. Specifically, we show that RCS satisfies an average-case hardness condition - computing output probabilities of typical quantum circuits is as hard as computing them in the worst-case, and therefore #P-hard. Our reduction exploits the polynomial structure in the output amplitudes of random quantum circuits, enabled by the Feynman path integral. In addition, it follows from known results that RCS satisfies an anti-concentration property, making it the first supremacy proposal with both average-case hardness and anti-concentration. 

1 aBouland, Adam1 aFefferman, Bill1 aNirkhe, Chinmay1 aVazirani, Umesh uhttps://arxiv.org/abs/1803.0440201532nas a2200193 4500008004100000245009300041210006900134260001500203300001100218490000800229520089100237100002101128700002401149700002201173700002301195700002401218700002301242856007301265 2018 eng d00aRobust two-qubit gates in a linear ion crystal using a frequency-modulated driving force0 aRobust twoqubit gates in a linear ion crystal using a frequencym c2018/01/09 a0205010 v1203 a

In an ion trap quantum computer, collective motional modes are used to entangle two or more qubits in order to execute multi-qubit logical gates. Any residual entanglement between the internal and motional states of the ions will result in decoherence errors, especially when there are many spectator ions in the crystal. We propose using a frequency-modulated (FM) driving force to minimize such errors and implement it experimentally. In simulation, we obtained an optimized FM gate that can suppress decoherence to less than 10−4 and is robust against a frequency drift of more than ±1 kHz. The two-qubit gate was tested in a five-qubit trapped ion crystal, with 98.3(4)% fidelity for a Mølmer-Sørensen entangling gate and 98.6(7)% for a controlled-not (CNOT) gate. We also show an optimized FM two-qubit gate for 17 ions, proving the scalability of our method.

1 aLeung, Pak, Hong1 aLandsman, Kevin, A.1 aFiggatt, Caroline1 aLinke, Norbert, M.1 aMonroe, Christopher1 aBrown, Kenneth, R. uhttps://journals.aps.org/prl/abstract/10.1103/PhysRevLett.120.02050102029nas a2200205 4500008004100000245009100041210006900132490000900201520141200210100001901622700002001641700001801661700001701679700002001696700002001716700001601736700001701752700001701769856003701786 2018 eng d00aA spinor Bose-Einstein condensate phase-sensitive amplifier for SU(1,1) interferometry0 aspinor BoseEinstein condensate phasesensitive amplifier for SU110 vA 983 a

The SU(1,1) interferometer was originally conceived as a Mach-Zehnder interferometer with the beam-splitters replaced by parametric amplifiers. The parametric amplifiers produce states with correlations that result in enhanced phase sensitivity. F=1 spinor Bose-Einstein condensates (BECs) can serve as the parametric amplifiers for an atomic version of such an interferometer by collisionally producing entangled pairs of ⟨F=1,m=±1| atoms. We simulate the effect of single and double-sided seeding of the inputs to the amplifier using the truncated-Wigner approximation. We find that single-sided seeding degrades the performance of the interferometer exactly at the phase the unseeded interferometer should operate the best. Double-sided seeding results in a phase-sensitive amplifier, where the maximal sensitivity is a function of the phase relationship between the input states of the amplifier. In both single and double-sided seeding we find there exists an optimal phase shift that achieves sensitivity beyond the standard quantum limit. Experimentally, we demonstrate a spinor phase-sensitive amplifier using a BEC of 23Na in an optical dipole trap. This configuration could be used as an input to such an interferometer. We are able to control the initial phase of the double-seeded amplifier, and demonstrate sensitivity to initial population fractions as small as 0.1\%. 

1 aWrubel, J., P.1 aSchwettmann, A.1 aFahey, D., P.1 aGlassman, Z.1 aPechkis, H., K.1 aGriffin, P., F.1 aBarnett, R.1 aTiesinga, E.1 aLett, P., D. uhttps://arxiv.org/abs/1807.0667601858nas a2200169 4500008004100000245004400041210004400085520137000129100002401499700002201523700002101545700002301566700001801589700002001607700002401627856003701651 2018 eng d00aVerified Quantum Information Scrambling0 aVerified Quantum Information Scrambling3 a

Quantum scrambling is the dispersal of local information into many-body quantum entanglements and correlations distributed throughout the entire system. This concept underlies the dynamics of thermalization in closed quantum systems, and more recently has emerged as a powerful tool for characterizing chaos in black holes. However, the direct experimental measurement of quantum scrambling is difficult, owing to the exponential complexity of ergodic many-body entangled states. One way to characterize quantum scrambling is to measure an out-of-time-ordered correlation function (OTOC); however, since scrambling leads to their decay, OTOCs do not generally discriminate between quantum scrambling and ordinary decoherence. Here, we implement a quantum circuit that provides a positive test for the scrambling features of a given unitary process. This approach conditionally teleports a quantum state through the circuit, providing an unambiguous litmus test for scrambling while projecting potential circuit errors into an ancillary observable. We engineer quantum scrambling processes through a tunable 3-qubit unitary operation as part of a 7-qubit circuit on an ion trap quantum computer. Measured teleportation fidelities are typically ∼80%, and enable us to experimentally bound the scrambling-induced decay of the corresponding OTOC measurement.

1 aLandsman, Kevin, A.1 aFiggatt, Caroline1 aSchuster, Thomas1 aLinke, Norbert, M.1 aYoshida, Beni1 aYao, Norman, Y.1 aMonroe, Christopher uhttps://arxiv.org/abs/1806.0280702065nas a2200169 4500008004100000245007000041210006900111260001500180520154900195100001601744700001901760700002101779700001801800700001601818700002401834856003701858 2017 eng d00aComplete 3-Qubit Grover Search on a Programmable Quantum Computer0 aComplete 3Qubit Grover Search on a Programmable Quantum Computer c2017/03/303 a

Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries over classical computers. It is an optimal search algorithm for a quantum computer, and has further applications as a subroutine for other quantum algorithms. Searches with two qubits have been demonstrated on a variety of platforms and proposed for others, but larger search spaces have only been demonstrated on a non-scalable NMR system. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state-marking scheme required to perform a classical search. All quantum solutions are shown to outperform their classical counterparts. We also report the first implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.

1 aFiggatt, C.1 aMaslov, Dmitri1 aLandsman, K., A.1 aLinke, N., M.1 aDebnath, S.1 aMonroe, Christopher uhttps://arxiv.org/abs/1703.1053505805nas a2200145 4500008004100000245004900041210004900090260001500139520537700154100002305531700002005554700002305574700002505597856003705622 2017 eng d00aComplexity of sampling as an order parameter0 aComplexity of sampling as an order parameter c2017/03/153 a

We consider the classical complexity of approximately simulating time evolution under spatially local quadratic bosonic Hamiltonians for time t. We obtain upper and lower bounds on the scaling of twith the number of bosons, n, for which simulation, cast as a sampling problem, is classically efficient and provably hard, respectively. We view these results in the light of classifying phases of physical systems based on parameters in the Hamiltonian and conjecture a link to dynamical phase transitions. In doing so, we combine ideas from mathematical physics and computational complexity to gain insight into the behavior of condensed matter systems.

1 aDeshpande, Abhinav1 aFefferman, Bill1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1703.0533201586nas a2200193 4500008004100000245007900041210006900120260001400189490000700203520099200210100002401202700002201226700002201248700001901270700002001289700002701309700001901336856003701355 2017 eng d00aDevelopment of a new UHV/XHV pressure standard (cold atom vacuum standard)0 aDevelopment of a new UHVXHV pressure standard cold atom vacuum s c2017/11/30 v543 a

The National Institute of Standards and Technology has recently begun a program to develop a primary pressure standard that is based on ultra-cold atoms, covering a pressure range of 1 x 10-6 to 1 x 10-10 Pa and possibly lower. These pressures correspond to the entire ultra-high vacuum range and extend into the extreme-high vacuum. This cold-atom vacuum standard (CAVS) is both a primary standard and absolute sensor of vacuum. The CAVS is based on the loss of cold, sensor atoms (such as the alkali-metal lithium) from a magnetic trap due to collisions with the background gas (primarily H2) in the vacuum. The pressure is determined from a thermally-averaged collision cross section, which is a fundamental atomic property, and the measured loss rate. The CAVS is primary because it will use collision cross sections determined from ab initio calculations for the Li + H2 system. Primary traceability is transferred to other systems of interest using sensitivity coefficients.

1 aScherschligt, Julia1 aFedchak, James, A1 aBarker, Daniel, S1 aEckel, Stephen1 aKlimov, Nikolai1 aMakrides, Constantinos1 aTiesinga, Eite uhttps://arxiv.org/abs/1801.1012001217nas a2200169 4500008004100000245006400041210006200105260001500167300001100182490000800193520070900201100001900910700002300929700003300952700002500985856003701010 2017 eng d00a{E}ntanglement area laws for long-range interacting systems0 aE ntanglement area laws for longrange interacting systems c2017/07/31 a0505010 v1193 a

We prove that the entanglement entropy of any state evolved under an arbitrary 1/rα long-range-interacting D-dimensional lattice spin Hamiltonian cannot change faster than a rate proportional to the boundary area for any α > D + 1. We also prove that for any α > 2D + 2, the ground state of such a Hamiltonian satisfies the entanglement area law if it can be transformed along a gapped adiabatic path into a ground state known to satisfy the area law. These results significantly generalize their existing counterparts for short-range interacting systems, and are useful for identifying dynamical phase transitions and quantum phase transitions in the presence of long-range interactions.

1 aGong, Zhe-Xuan1 aFoss-Feig, Michael1 aBrandão, Fernando, G. S. L.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1702.0536802145nas a2200205 4500008004100000245005800041210005700099260001500156300001100171490000700182520152100189100002301710700002101733700002201754700002101776700002501797700002101822700002701843856006901870 2017 eng d00aEmergent equilibrium in many-body optical bistability0 aEmergent equilibrium in manybody optical bistability c2017/04/17 a0438260 v953 a

Many-body systems constructed of quantum-optical building blocks can now be realized in experimental platforms ranging from exciton-polariton fluids to ultracold gases of Rydberg atoms, establishing a fascinating interface between traditional many-body physics and the driven-dissipative, non-equilibrium setting of cavity-QED. At this interface, the standard techniques and intuitions of both fields are called into question, obscuring issues as fundamental as the role of fluctuations, dimensionality, and symmetry on the nature of collective behavior and phase transitions. Here, we study the driven-dissipative Bose-Hubbard model, a minimal description of numerous atomic, optical, and solid-state systems in which particle loss is countered by coherent driving. Despite being a lattice version of optical bistability---a foundational and patently non-equilibrium model of cavity-QED---the steady state possesses an emergent equilibrium description in terms of a classical Ising model. We establish this picture by identifying a limit in which the quantum dynamics is asymptotically equivalent to non-equilibrium Langevin equations, which support a phase transition described by model A of the Hohenberg-Halperin classification. Numerical simulations of the Langevin equations corroborate this picture, producing results consistent with the behavior of a finite-temperature Ising model.

1 aFoss-Feig, Michael1 aNiroula, Pradeep1 aYoung, Jeremy, T.1 aHafezi, Mohammad1 aGorshkov, Alexey, V.1 aWilson, Ryan, M.1 aMaghrebi, Mohammad, F. uhttps://journals.aps.org/pra/abstract/10.1103/PhysRevA.95.04382602985nas a2200157 4500008004100000245004900041210004900090260001500139300001100154490000700165520255000172100002002722700002302742700002502765856003702790 2017 eng d00aExact sampling hardness of Ising spin models0 aExact sampling hardness of Ising spin models c2017/09/14 a0323240 v963 a

We study the complexity of classically sampling from the output distribution of an Ising spin model, which can be implemented naturally in a variety of atomic, molecular, and optical systems. In particular, we construct a specific example of an Ising Hamiltonian that, after time evolution starting from a trivial initial state, produces a particular output configuration with probability very nearly proportional to the square of the permanent of a matrix with arbitrary integer entries. In a similar spirit to boson sampling, the ability to sample classically from the probability distribution induced by time evolution under this Hamiltonian would imply unlikely complexity theoretic consequences, suggesting that the dynamics of such a spin model cannot be efficiently simulated with a classical computer. Physical Ising spin systems capable of achieving problem-size instances (i.e., qubit numbers) large enough so that classical sampling of the output distribution is classically difficult in practice may be achievable in the near future. Unlike boson sampling, our current results only imply hardness of exact classical sampling, leaving open the important question of whether a much stronger approximate-sampling hardness result holds in this context. The latter is most likely necessary to enable a convincing experimental demonstration of quantum supremacy. As referenced in a recent paper [A. Bouland, L. Mancinska, and X. Zhang, in Proceedings of the 31st Conference on Computational Complexity (CCC 2016), Leibniz International Proceedings in Informatics (Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, 2016)], our result completes the sampling hardness classification of two-qubit commuting Hamiltonians.

1 aFefferman, Bill1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1701.0316701709nas a2200229 4500008004100000245006700041210006700108250000700175260001500182300001400197490000800211520106700219100001601286700001901302700002201321700001601343700001601359700002101375700001501396700002401411856004401435 2017 eng d00aExperimental Comparison of Two Quantum Computing Architectures0 aExperimental Comparison of Two Quantum Computing Architectures a13 c2017/03/21 a3305-33100 v1143 a

We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device [1] with limited connectivity, and the other is a fully connected trapped-ion system [2]. Even though the two systems have different native quantum interactions, both can be programmed in a way that is blind to the underlying hardware, thus allowing the first comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that employ more connectivity clearly benefit from a better connected system of qubits. While the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that co-designing particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

1 aLinke, N.M.1 aMaslov, Dmitri1 aRoetteler, Martin1 aDebnath, S.1 aFiggatt, C.1 aLandsman, K., A.1 aWright, K.1 aMonroe, Christopher uhttp://www.pnas.org/content/114/13/330527528nas 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 a

In 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 L in d dimensions using long-range interactions with strength bounded by 1/rα. If α<d, the state transfer time is asymptotically independent of L; if α=d, the time is logarithmic in distance L; if d<α<d+1, transfer occurs in time proportional to Lαd; and if αd+1, it occurs in time proportional to L. We then use this protocol to upper bound the time required to create a state specified by a MERA (multiscale entanglement renormalization ansatz) tensor network, and show that, if the linear size of the MERA state is L, then it can be created in time that scales with L identically to state transfer up to multiplicative logarithmic corrections.

1 aEldredge, Zachary1 aGong, Zhe-Xuan1 aMoosavian, Ali, Hamed1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1612.0244201351nas a2200157 4500008004100000245007200041210006900113260001500182300001100197490000700208520084900215100002401064700002301088700002701111856005501138 2017 eng d00aPartial breakdown of quantum thermalization in a Hubbard-like model0 aPartial breakdown of quantum thermalization in a Hubbardlike mod c2017/02/17 a0542040 v953 a

We study the possible breakdown of quantum thermalization in a model of itinerant electrons on a one-dimensional chain without disorder, with both spin and charge degrees of freedom. The eigenstates of this model exhibit peculiar properties in the entanglement entropy, the apparent scaling of which is modified from a “volume law” to an “area law” after performing a partial, site-wise measurement on the system. These properties and others suggest that this model realizes a new, nonthermal phase of matter, known as a quantum disentangled liquid (QDL). The putative existence of this phase has striking implications for the foundations of quantum statistical mechanics.

1 aGarrison, James, R.1 aMishmash, Ryan, V.1 aFisher, Matthew, P. A. uhttp://link.aps.org/doi/10.1103/PhysRevB.95.05420402646nas a2200241 4500008004100000245008200041210006900123260001500192520190700207100002902114700002302143700001802166700002302184700001502207700002002222700002702242700002402269700001902293700002002312700001702332700001802349856003702367 2017 eng d00aOn the readiness of quantum optimization machines for industrial applications0 areadiness of quantum optimization machines for industrial applic c2017/08/313 a

There have been multiple attempts to demonstrate that quantum annealing and, in particular, quantum annealing on quantum annealing machines, has the potential to outperform current classical optimization algorithms implemented on CMOS technologies. The benchmarking of these devices has been controversial. Initially, random spin-glass problems were used, however, these were quickly shown to be not well suited to detect any quantum speedup. Subsequently, benchmarking shifted to carefully crafted synthetic problems designed to highlight the quantum nature of the hardware while (often) ensuring that classical optimization techniques do not perform well on them. Even worse, to date a true sign of improved scaling with the number problem variables remains elusive when compared to classical optimization techniques. Here, we analyze the readiness of quantum annealing machines for real-world application problems. These are typically not random and have an underlying structure that is hard to capture in synthetic benchmarks, thus posing unexpected challenges for optimization techniques, both classical and quantum alike. We present a comprehensive computational scaling analysis of fault diagnosis in digital circuits, considering architectures beyond D-wave quantum annealers. We find that the instances generated from real data in multiplier circuits are harder than other representative random spin-glass benchmarks with a comparable number of variables. Although our results show that transverse-field quantum annealing is outperformed by state-of-the-art classical optimization algorithms, these benchmark instances are hard and small in the size of the input, therefore representing the first industrial application ideally suited for near-term quantum annealers.

1 aPerdomo-Ortiz, Alejandro1 aFeldman, Alexander1 aOzaeta, Asier1 aIsakov, Sergei, V.1 aZhu, Zheng1 aO'Gorman, Bryan1 aKatzgraber, Helmut, G.1 aDiedrich, Alexander1 aNeven, Hartmut1 ade Kleer, Johan1 aLackey, Brad1 aBiswas, Rupak uhttps://arxiv.org/abs/1708.0978001534nas a2200169 4500008004100000245006200041210005800103260001500161490000800176520102300184100002301207700002201230700002301252700002501275700002701300856003701327 2017 eng d00aA solvable family of driven-dissipative many-body systems0 asolvable family of drivendissipative manybody systems c2017/11/100 v1193 a

Exactly solvable models have played an important role in establishing the sophisticated modern understanding of equilibrium many-body physics. And conversely, the relative scarcity of solutions for non-equilibrium models greatly limits our understanding of systems away from thermal equilibrium. We study a family of nonequilibrium models, some of which can be viewed as dissipative analogues of the transverse-field Ising model, in that an effectively classical Hamiltonian is frustrated by dissipative processes that drive the system toward states that do not commute with the Hamiltonian. Surprisingly, a broad and experimentally relevant subset of these models can be solved efficiently in any number of spatial dimensions. We leverage these solutions to prove a no-go theorem on steady-state phase transitions in a many-body model that can be realized naturally with Rydberg atoms or trapped ions, and to compute the effects of decoherence on a canonical trapped-ion-based quantum computation architecture.

1 aFoss-Feig, Michael1 aYoung, Jeremy, T.1 aAlbert, Victor, V.1 aGorshkov, Alexey, V.1 aMaghrebi, Mohammad, F. uhttps://arxiv.org/abs/1703.0462600514nas a2200157 4500008004100000245006700041210006600108260001500174300001100189490000700200100002700207700001900234700002300253700002500276856005500301 2016 eng d00aCausality and quantum criticality in long-range lattice models0 aCausality and quantum criticality in longrange lattice models c2016/03/17 a1251280 v931 aMaghrebi, Mohammad, F.1 aGong, Zhe-Xuan1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttp://link.aps.org/doi/10.1103/PhysRevB.93.12512801582nas a2200169 4500008004100000245006700041210006600108260001500174300001100189490000700200520107500207100002701282700001901309700002301328700002501351856003601376 2016 eng d00aCausality and quantum criticality with long-range interactions0 aCausality and quantum criticality with longrange interactions c2016/03/17 a1251280 v923 a Quantum lattice systems with long-range interactions often exhibit drastically different behavior than their short-range counterparts. In particular, because they do not satisfy the conditions for the Lieb-Robinson theorem, they need not have an emergent relativistic structure in the form of a light cone. Adopting a field-theoretic approach, we study the one-dimensional transverse-field Ising model and a fermionic model with long-range interactions, explore their critical and near-critical behavior, and characterize their response to local perturbations. We deduce the dynamic critical exponent, up to the two-loop order within the renormalization group theory, which we then use to characterize the emergent causal behavior. We show that beyond a critical value of the power-law exponent of long-range interactions, the dynamics effectively becomes relativistic. Various other critical exponents describing correlations in the ground state, as well as deviations from a linear causal cone, are deduced for a wide range of the power-law exponent. 1 aMaghrebi, Mohammad, F.1 aGong, Zhe-Xuan1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1508.0090601682nas a2200193 4500008004100000245006100041210006100102260001500163300001100178490000700189520113200196100002101328700002101349700001301370700002501383700002101408700002301429856003601452 2016 eng d00aCollective phases of strongly interacting cavity photons0 aCollective phases of strongly interacting cavity photons c2016/09/01 a0338010 v943 a

We study a coupled array of coherently driven photonic cavities, which maps onto a driven-dissipative XY spin-12 model with ferromagnetic couplings in the limit of strong optical nonlinearities. Using a site-decoupled mean-field approximation, we identify steady state phases with canted antiferromagnetic order, in addition to limit cycle phases, where oscillatory dynamics persist indefinitely. We also identify collective bistable phases, where the system supports two steady states among spatially uniform, antiferromagnetic, and limit cycle phases. We compare these mean-field results to exact quantum trajectories simulations for finite one-dimensional arrays. The exact results exhibit short-range antiferromagnetic order for parameters that have significant overlap with the mean-field phase diagram. In the mean-field bistable regime, the exact quantum dynamics exhibits real-time collective switching between macroscopically distinguishable states. We present a clear physical picture for this dynamics, and establish a simple relationship between the switching times and properties of the quantum Liouvillian.

1 aWilson, Ryan, M.1 aMahmud, Khan, W.1 aHu, Anzi1 aGorshkov, Alexey, V.1 aHafezi, Mohammad1 aFoss-Feig, Michael uhttp://arxiv.org/abs/1601.0685701705nas a2200121 4500008004100000245005700041210005500098260001500153520133500168100002001503700002401523856003601547 2016 eng d00aA Complete Characterization of Unitary Quantum Space0 aComplete Characterization of Unitary Quantum Space c2016/04/053 aWe give two complete characterizations of unitary quantum space-bounded classes. The first is based on the Matrix Inversion problem for well-conditioned matrices. We show that given the size-n efficient encoding of a 2O(k(n))×2O(k(n)) well-conditioned matrix H, approximating a particular entry of H−1 is complete for the class of problems solvable by a quantum algorithm that uses O(k(n)) space and performs all quantum measurements at the end of the computation. In particular, the problem of computing entries of H−1 for an explicit well-conditioned n×n matrix H is complete for unitary quantum logspace. We then show that the problem of approximating to high precision the least eigenvalue of a positive semidefinite matrix H, encoded as a circuit, gives a second characterization of unitary quantum space complexity. In the process we also establish an equivalence between unitary quantum space-bounded classes and certain QMA proof systems. As consequences, we establish that QMA with exponentially small completeness-soundness gap is equal to PSPACE, that determining whether a local Hamiltonian is frustration-free is PSPACE-complete, and give a provable setting in which the ability to prepare PEPS states gives less computational power than the ability to prepare the ground state of a generic local Hamiltonian.1 aFefferman, Bill1 aLin, Cedric, Yen-Yu uhttp://arxiv.org/abs/1604.0138401599nas a2200169 4500008004100000245004900041210004900090260001500139520107400154100001901228700002001247700002001267700002501287700002501312700002401337856006801361 2016 eng d00aComputational Security of Quantum Encryption0 aComputational Security of Quantum Encryption c2016/11/103 a

Quantum-mechanical devices have the potential to transform cryptography. Most research in this area has focused either on the information-theoretic advantages of quantum protocols or on the security of classical cryptographic schemes against quantum attacks. In this work, we initiate the study of another relevant topic: the encryption of quantum data in the computational setting. In this direction, we establish quantum versions of several fundamental classical results. First, we develop natural definitions for private-key and public-key encryption schemes for quantum data. We then define notions of semantic security and indistinguishability, and, in analogy with the classical work of Goldwasser and Micali, show that these notions are equivalent. Finally, we construct secure quantum encryption schemes from basic primitives. In particular, we show that quantum-secure one-way functions imply IND-CCA1-secure symmetric-key quantum encryption, and that quantum-secure trapdoor one-way permutations imply semantically-secure public-key quantum encryption.

1 aAlagic, Gorjan1 aBroadbent, Anne1 aFefferman, Bill1 aGagliardoni, Tommaso1 aSchaffner, Christian1 aJules, Michael, St. uhttps://link.springer.com/chapter/10.1007%2F978-3-319-49175-2_302040nas a2200193 4500008004100000245007800041210006900119260001500188300001000203490000800213520145000221100001601671700001801687700001601705700002101721700001501742700001501757856007401772 2016 eng d00aDemonstration of a small programmable quantum computer with atomic qubits0 aDemonstration of a small programmable quantum computer with atom c2016/08/04 a63-660 v5363 a

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here, we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully-connected set of gate operations that are native to the hardware and have a mean fidelity of 98 %. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa (DJ) and Bernstein-Vazirani (BV) algorithms with average success rates of 95 % and 90 %, respectively. We also perform a coherent quantum Fourier transform (QFT) on five trappedion qubits for phase estimation and period finding with average fidelities of 62 % and 84 %, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.

1 aDebnath, S.1 aLinke, N., M.1 aFiggatt, C.1 aLandsman, K., A.1 aWright, K.1 aMonroe, C. uhttp://www.nature.com/nature/journal/v536/n7614/full/nature18648.html01507nas a2200145 4500008004100000245007200041210006900113260001500182520103700197100002301234700001901257700002501276700002301301856003701324 2016 eng d00aEntanglement and spin-squeezing without infinite-range interactions0 aEntanglement and spinsqueezing without infiniterange interaction c2016/12/223 a

Infinite-range interactions are known to facilitate the production of highly entangled states with applications in quantum information and metrology. However, many experimental systems have interactions that decay with distance, and the achievable benefits in this context are much less clear. Combining recent exact solutions with a controlled expansion in the system size, we analyze quench dynamics in Ising models with power-law (1/r α ) interactions in D dimensions, thereby expanding the understanding of spin squeezing into a broad and experimentally relevant context. In spatially homogeneous systems, we show that for small α the scaling of squeezing with system size is identical to the infinite-range (α = 0) case. This indifference to the interaction range persists up to a critical value α = 2D/3, above which squeezing degrades continuously. Boundaryinduced inhomogeneities present in most experimental systems modify this picture, but it nevertheless remains qualitatively correct for finite-sized systems.

1 aFoss-Feig, Michael1 aGong, Zhe-Xuan1 aGorshkov, Alexey, V.1 aClark, Charles, W. uhttps://arxiv.org/abs/1612.0780501724nas a2200181 4500008004100000245005800041210005800099260001500157520121100172100001801383700001801401700002101419700001601440700001601456700001801472700001501490856003701505 2016 eng d00aExperimental demonstration of quantum fault tolerance0 aExperimental demonstration of quantum fault tolerance c2016/11/213 a

Quantum computers will eventually reach a size at which quantum error correction (QEC) becomes imperative. In order to make quantum information robust to errors introduced by qubit imperfections and flawed control operations, QEC protocols encode a logical qubit in multiple physical qubits. This redundancy allows the extraction of error syndromes and the subsequent correction or detection of errors without destroying the logical state itself through direct measurement. While several experiments have shown a reduction of high intrinsic or artificially introduced errors in logical qubits, fault-tolerant encoding of a logical qubit has never been demonstrated. Here we show the encoding and syndrome measurement of a fault-tolerant logical qubit via an error detection protocol on four physical qubits, represented by trapped atomic ions. This demonstrates for the first time the robustness of a fault-tolerant qubit to imperfections in the very operations used to encode it. This advantage persists in the face of large added error rates and experimental calibration errors.

1 aLinke, N., M.1 aGutierrez, M.1 aLandsman, K., A.1 aFiggatt, C.1 aDebnath, S.1 aBrown, K., R.1 aMonroe, C. uhttps://arxiv.org/abs/1611.0694601814nas a2200205 4500008004100000245007600041210006900117260001500186300001100201490000700212520120100219100001901420700002701439700001301466700002301479700002101502700002401523700002501547856003601572 2016 eng d00aKaleidoscope of quantum phases in a long-range interacting spin-1 chain0 aKaleidoscope of quantum phases in a longrange interacting spin1  c2016/05/11 a2051150 v933 aMotivated by recent trapped-ion quantum simulation experiments, we carry out a comprehensive study of the phase diagram of a spin-1 chain with XXZ-type interactions that decay as 1/rα, using a combination of finite and infinite-size DMRG calculations, spin-wave analysis, and field theory. In the absence of long-range interactions, varying the spin-coupling anisotropy leads to four distinct phases: a ferromagnetic Ising phase, a disordered XY phase, a topological Haldane phase, and an antiferromagnetic Ising phase. If long-range interactions are antiferromagnetic and thus frustrated, we find primarily a quantitative change of the phase boundaries. On the other hand, ferromagnetic (non-frustrated) long-range interactions qualitatively impact the entire phase diagram. Importantly, for α≲3, long-range interactions destroy the Haldane phase, break the conformal symmetry of the XY phase, give rise to a new phase that spontaneously breaks a U(1) continuous symmetry, and introduce an exotic tricritical point with no direct parallel in short-range interacting spin chains. We show that the main signatures of all five phases found could be observed experimentally in the near future. 1 aGong, Zhe-Xuan1 aMaghrebi, Mohammad, F.1 aHu, Anzi1 aFoss-Feig, Michael1 aRicherme, Philip1 aMonroe, Christopher1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1510.0210801933nas a2200277 4500008004100000245007200041210006900113260001500182300001100197490000700208520116900215100001301384700001901397700001401416700001801430700001401448700002501462700002301487700001701510700001701527700002101544700001801565700001401583700002201597856003601619 2016 eng d00aPure-state tomography with the expectation value of Pauli operators0 aPurestate tomography with the expectation value of Pauli operato c2016/03/31 a0321400 v933 a

We examine the problem of finding the minimum number of Pauli measurements needed to uniquely determine an arbitrary n-qubit pure state among all quantum states. We show that only 11 Pauli measurements are needed to determine an arbitrary two-qubit pure state compared to the full quantum state tomography with 16 measurements, and only 31 Pauli measurements are needed to determine an arbitrary three-qubit pure state compared to the full quantum state tomography with 64 measurements. We demonstrate that our protocol is robust under depolarizing error with simulated random pure states. We experimentally test the protocol on two- and three-qubit systems with nuclear magnetic resonance techniques. We show that the pure state tomography protocol saves us a number of measurements without considerable loss of fidelity. We compare our protocol with same-size sets of randomly selected Pauli operators and find that our selected set of Pauli measurements significantly outperforms those random sampling sets. As a direct application, our scheme can also be used to reduce the number of settings needed for pure-state tomography in quantum optical systems.

1 aMa, Xian1 aJackson, Tyler1 aZhou, Hui1 aChen, Jianxin1 aLu, Dawei1 aMazurek, Michael, D.1 aFisher, Kent, A.G.1 aPeng, Xinhua1 aKribs, David1 aResch, Kevin, J.1 aJi, Zhengfeng1 aZeng, Bei1 aLaflamme, Raymond uhttp://arxiv.org/abs/1601.0537900861nas a2200121 4500008004100000245005500041210005500096260001500151520049300166100002000659700002400679856003600703 2016 eng d00aQuantum Merlin Arthur with Exponentially Small Gap0 aQuantum Merlin Arthur with Exponentially Small Gap c2016/01/083 aWe study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we show that a "precise" version of the Local Hamiltonian problem is PSPACE-complete, and give a provable setting in which the ability to prepare PEPS states is not as powerful as the ability to prepare the ground state of general Local Hamiltonians.1 aFefferman, Bill1 aLin, Cedric, Yen-Yu uhttp://arxiv.org/abs/1601.0197502209nas a2200121 4500008004100000245002700041210002400068260001500092520190500107100001902012700002002031856003602051 2016 eng d00aOn Quantum Obfuscation0 aQuantum Obfuscation c2016/02/043 aEncryption of data is fundamental to secure communication in the modern world. Beyond encryption of data lies obfuscation, i.e., encryption of functionality. It is well-known that the most powerful means of obfuscating classical programs, so-called ``black-box obfuscation',' is provably impossible [Barak et al '12]. However, several recent results have yielded candidate schemes that satisfy a definition weaker than black-box, and yet still have numerous applications. In this work, we initialize the rigorous study of obfuscating programs via quantum-mechanical means. We define notions of quantum obfuscation which encompass several natural variants. The input to the obfuscator can describe classical or quantum functionality, and the output can be a circuit description or a quantum state. The obfuscator can also satisfy one of a number of obfuscation conditions: black-box, information-theoretic black-box, indistinguishability, and best possible; the last two conditions come in three variants: perfect, statistical, and computational. We discuss many applications, including CPA-secure quantum encryption, quantum fully-homomorphic encryption, and public-key quantum money. We then prove several impossibility results, extending a number of foundational papers on classical obfuscation to the quantum setting. We prove that quantum black-box obfuscation is impossible in a setting where adversaries can possess more than one output of the obfuscator. In particular, generic transformation of quantum circuits into black-box-obfuscated quantum circuits is impossible. We also show that statistical indistinguishability obfuscation is impossible, up to an unlikely complexity-theoretic collapse. Our proofs involve a new tool: chosen-ciphertext-secure encryption of quantum data, which was recently shown to be possible assuming quantum-secure one-way functions exist [Alagic et al '16].1 aAlagic, Gorjan1 aFefferman, Bill uhttp://arxiv.org/abs/1602.0177101010nas a2200145 4500008004100000245007200041210006800113260001500181490000700196520056900203100001800772700001900790700001900809856003600828 2016 eng d00aA Quantum Version of Schöning's Algorithm Applied to Quantum 2-SAT0 aQuantum Version of Schönings Algorithm Applied to Quantum 2SAT c2016/03/220 v163 a

We study a quantum algorithm that consists of a simple quantum Markov process, and we analyze its behavior on restricted versions of Quantum 2-SAT. We prove that the algorithm solves this decision problem with high probability for n qubits, L clauses, and promise gap c in time O(n^2 L^2 c^{-2}). If the Hamiltonian is additionally polynomially gapped, our algorithm efficiently produces a state that has high overlap with the satisfying subspace. The Markov process we study is a quantum analogue of Sch\"oning's probabilistic algorithm for k-SAT.

1 aFarhi, Edward1 aKimmel, Shelby1 aTemme, Kristan uhttp://arxiv.org/abs/1603.0698521161nas a2200205 45000080041000000200022000410220014000632450069000772100068001462600015002143000016002294900007002455202053400252100002020786700002420806700002420830700002220854700002520876856005420901 2016 eng d a978-3-95977-013-2 a1868-896900aSpace-Efficient Error Reduction for Unitary Quantum Computations0 aSpaceEfficient Error Reduction for Unitary Quantum Computations c2016/04/27 a14:1--14:140 v553 a

This paper develops general space-efficient methods for error reduction for unitary quantum computation. Consider a polynomial-time quantum computation with completeness c and soundnesss, either with or without a witness (corresponding to QMA and BQP, respectively). To convert this computation into a new computation with error at most 2p, the most space-efficient method known requires extra workspace of O(plog1cs) qubits. This space requirement is too large for scenarios like logarithmic-space quantum computations. This paper presents error-reduction methods for unitary quantum computations (i.e., computations without intermediate measurements) that require extra workspace of just O(logpcs) qubits. This in particular gives the first methods of strong amplification for logarithmic-space unitary quantum computations with two-sided bounded error. This also leads to a number of consequences in complexity theory, such as the uselessness of quantum witnesses in bounded-error logarithmic-space unitary quantum computations, the PSPACE upper bound for QMA with exponentially-small completeness-soundness gap, and strong amplification for matchgate computations.

1 aFefferman, Bill1 aKobayashi, Hirotada1 aLin, Cedric, Yen-Yu1 aMorimae, Tomoyuki1 aNishimura, Harumichi uhttp://drops.dagstuhl.de/opus/volltexte/2016/629709346nas a2200181 4500008004100000245005500041210005400096260001500150520881500165100001908980700001608999700002309015700002409038700002009062700002009082700002509102856003709127 2016 eng d00aSteady-state superradiance with Rydberg polaritons0 aSteadystate superradiance with Rydberg polaritons c2016/11/023 a

A steady-state superradiant laser can be used to generate ultranarrow-linewidth light, and thus has important applications in the fields of quantum information and precision metrology. However, the light produced by such a laser is still essentially classical. Here, we show that the introduction of a Rydberg medium into a cavity containing atoms with a narrow optical transition can lead to the steady-state superradiant emission of ultranarrow-linewidth nonclassical light. The cavity nonlinearity induced by the Rydberg medium strongly modifies the superradiance threshold, and leads to a Mollow triplet in the cavity output spectrumthis behavior can be understood as an unusual analogue of resonance fluorescence. The cavity output spectrum has an extremely sharp central peak, with a linewidth that can be far narrower than that of a classical superradiant laser. This unprecedented spectral sharpness, together with the nonclassical nature of the light, could lead to new applications in which spectrally pure quantum light is desired.

1 aGong, Zhe-Xuan1 aXu, Minghui1 aFoss-Feig, Michael1 aThompson, James, K.1 aRey, Ana, Maria1 aHolland, Murray1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1611.0079701535nas a2200193 4500008004100000245005200041210005100093260001500144300001100159490000700170520099900177100001901176700002701195700001301222700002201235700002301257700002501280856003601305 2016 eng d00aTopological phases with long-range interactions0 aTopological phases with longrange interactions c2016/01/08 a0411020 v933 a Topological phases of matter are primarily studied in quantum many-body systems with short-range interactions. Whether various topological phases can survive in the presence of long-range interactions, however, is largely unknown. Here we show that a paradigmatic example of a symmetry-protected topological phase, the Haldane phase of an antiferromagnetic spin-1 chain, surprisingly remains intact in the presence of arbitrarily slowly decaying power-law interactions. The influence of long-range interactions on the topological order is largely quantitative, and we expect similar results for more general systems. Our conclusions are based on large-scale matrix-product-state simulations and two complementary effective-field-theory calculations. The striking agreement between the numerical and analytical results rules out finite-size effects. The topological phase considered here should be experimentally observable in a recently developed trapped-ion quantum simulator. 1 aGong, Zhe-Xuan1 aMaghrebi, Mohammad, F.1 aHu, Anzi1 aWall, Michael, L.1 aFoss-Feig, Michael1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1505.0314601656nas a2200193 4500008004100000245007500041210006900116260001500185300001400200490000800214520108600222100001801308700001501326700001901341700002401360700002301384700001801407856003701425 2015 eng d00a2D Superexchange mediated magnetization dynamics in an optical lattice0 a2D Superexchange mediated magnetization dynamics in an optical l c2015/04/30 a540 - 5440 v3483 a The competition of magnetic exchange interactions and tunneling underlies many complex quantum phenomena observed in real materials. We study non-equilibrium magnetization dynamics in an extended 2D system by loading effective spin-1/2 bosons into a spin-dependent optical lattice, and we use the lattice to separately control the resonance conditions for tunneling and superexchange. After preparing a non-equilibrium anti-ferromagnetically ordered state, we observe relaxation dynamics governed by two well-separated rates, which scale with the underlying Hamiltonian parameters associated with superexchange and tunneling. Remarkably, with tunneling off-resonantly suppressed, we are able to observe superexchange dominated dynamics over two orders of magnitude in magnetic coupling strength, despite the presence of vacancies. In this regime, the measured timescales are in agreement with simple theoretical estimates, but the detailed dynamics of this 2D, strongly correlated, and far-from-equilibrium quantum system remain out of reach of current computational techniques. 1 aBrown, R., C.1 aWyllie, R.1 aKoller, S., B.1 aGoldschmidt, E., A.1 aFoss-Feig, Michael1 aPorto, J., V. uhttp://arxiv.org/abs/1411.7036v101507nas a2200229 4500008004100000245005700041210005700098260001500155300001100170490000800181520087400189100002701063700002101090700001601111700001301127700001501140700002001155700001801175700002101193700002501214856003801239 2015 eng d00aCoulomb bound states of strongly interacting photons0 aCoulomb bound states of strongly interacting photons c2015/09/16 a1236010 v1153 a We show that two photons coupled to Rydberg states via electromagnetically induced transparency can interact via an effective Coulomb potential. This interaction gives rise to a continuum of two-body bound states. Within the continuum, metastable bound states are distinguished in analogy with quasi-bound states tunneling through a potential barrier. We find multiple branches of metastable bound states whose energy spectrum is governed by the Coulomb potential, thus obtaining a photonic analogue of the hydrogen atom. Under certain conditions, the wavefunction resembles that of a diatomic molecule in which the two polaritons are separated by a finite "bond length." These states propagate with a negative group velocity in the medium, allowing for a simple preparation and detection scheme, before they slowly decay to pairs of bound Rydberg atoms. 1 aMaghrebi, Mohammad, F.1 aGullans, Michael1 aBienias, P.1 aChoi, S.1 aMartin, I.1 aFirstenberg, O.1 aLukin, M., D.1 aBüchler, H., P.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1505.03859v102223nas a2200193 4500008004100000245007100041210006900112260001500181300001200196490000800208520166400216100002001880700001901900700002301919700001701942700001601959700001801975856003601993 2015 eng d00aEntangling two transportable neutral atoms via local spin exchange0 aEntangling two transportable neutral atoms via local spin exchan c2015/11/02 a208-2110 v5273 a To advance quantum information science a constant pursuit is the search for physical systems that meet the stringent requirements for creating and preserving quantum entanglement. In atomic physics, robust two-qubit entanglement is typically achieved by strong, long-range interactions in the form of Coulomb interactions between ions or dipolar interactions between Rydberg atoms. While these interactions allow fast gates, atoms subject to these interactions must overcome the associated coupling to the environment and cross-talk among qubits. Local interactions, such as those requiring significant wavefunction overlap, can alleviate these detrimental effects yet present a new challenge: To distribute entanglement, qubits must be transported, merged for interaction, and then isolated for storage and subsequent operations. Here we show how, via a mobile optical tweezer, it is possible to prepare and locally entangle two ultracold neutral atoms, and then separate them while preserving their entanglement. While ultracold neutral atom experiments have measured dynamics consistent with spin entanglement, we are now able to demonstrate two-particle coherence via application of a local gradient and parity measurements; this new entanglement-verification protocol could be applied to arbitrary spin-entangled states of spatially-separated atoms. The local entangling operation is achieved via ultracold spin-exchange interactions, and quantum tunneling is used to combine and separate atoms. Our toolset provides a framework for dynamically entangling remote qubits via local operations within a large-scale quantum register. 1 aKaufman, A., M.1 aLester, B., J.1 aFoss-Feig, Michael1 aWall, M., L.1 aRey, A., M.1 aRegal, C., A. uhttp://arxiv.org/abs/1507.0558601270nas a2200193 4500008004100000245005700041210005700098260001500155300001100170490000700181520071900188100002700907700002000934700002100954700001700975700002200992700002501014856003701039 2015 eng d00aFractional Quantum Hall States of Rydberg Polaritons0 aFractional Quantum Hall States of Rydberg Polaritons c2015/03/31 a0338380 v913 a We propose a scheme for realizing fractional quantum Hall states of light. In our scheme, photons of two polarizations are coupled to different atomic Rydberg states to form two flavors of Rydberg polaritons that behave as an effective spin. An array of optical cavity modes overlapping with the atomic cloud enables the realization of an effective spin-1/2 lattice. We show that the dipolar interaction between such polaritons, inherited from the Rydberg states, can be exploited to create a flat, topological band for a single spin-flip excitation. At half filling, this gives rise to a photonic (or polaritonic) fractional Chern insulator -- a lattice-based, fractional quantum Hall state of light. 1 aMaghrebi, Mohammad, F.1 aYao, Norman, Y.1 aHafezi, Mohammad1 aPohl, Thomas1 aFirstenberg, Ofer1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1411.6624v101522nas a2200169 4500008004100000245007200041210006900113260001500182300001100197490000800208520100900216100002301225700001901248700002301267700002501290856003701315 2015 eng d00aNearly-linear light cones in long-range interacting quantum systems0 aNearlylinear light cones in longrange interacting quantum system c2015/04/13 a1572010 v1143 a In non-relativistic quantum theories with short-range Hamiltonians, a velocity $v$ can be chosen such that the influence of any local perturbation is approximately confined to within a distance $r$ until a time $t \sim r/v$, thereby defining a linear light cone and giving rise to an emergent notion of locality. In systems with power-law ($1/r^{\alpha}$) interactions, when $\alpha$ exceeds the dimension $D$, an analogous bound confines influences to within a distance $r$ only until a time $t\sim(\alpha/v)\log r$, suggesting that the velocity, as calculated from the slope of the light cone, may grow exponentially in time. We rule out this possibility; light cones of power-law interacting systems are algebraic for $\alpha>2D$, becoming linear as $\alpha\rightarrow\infty$. Our results impose strong new constraints on the growth of correlations and the production of entangled states in a variety of rapidly emerging, long-range interacting atomic, molecular, and optical systems. 1 aFoss-Feig, Michael1 aGong, Zhe-Xuan1 aClark, Charles, W.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1410.3466v101704nas a2200169 4500008004100000245006100041210006100102260001500163520120900178100001501387700002101402700001701423700002001440700001701460700001901477856003801496 2015 eng d00aObservation of optomechanical buckling phase transitions0 aObservation of optomechanical buckling phase transitions c2015/10/163 a

Correlated phases of matter provide long-term stability for systems as diverse as solids, magnets, and potential exotic quantum materials. Mechanical systems, such as relays and buckling transition spring switches can yield similar stability by exploiting non-equilibrium phase transitions. Curiously, in the optical domain, observations of such phase transitions remain elusive. However, efforts to integrate optical and mechanical systems -- optomechanics -- suggest that a hybrid approach combining the quantum control of optical systems with the engineerability of mechanical systems may provide a new avenue for such explorations. Here we report the first observation of the buckling of an optomechanical system, in which transitions between stable mechanical states corresponding to both first- and second-order phase transitions are driven by varying laser power and detuning. Our results enable new applications in photonics and, given rapid progress in pushing optomechanical systems into the quantum regime, the potential for explorations of quantum phase transitions.

1 aXu, Haitan1 aKemiktarak, Utku1 aFan, Jingyun1 aRagole, Stephen1 aLawall, John1 aTaylor, J., M. uhttp://arxiv.org/abs/1510.04971v101818nas a2200121 4500008004100000245004200041210003800083260001500121520148500136100002001621700001701641856003801658 2015 eng d00aThe Power of Quantum Fourier Sampling0 aPower of Quantum Fourier Sampling c2015/07/203 a A line of work initiated by Terhal and DiVincenzo and Bremner, Jozsa, and Shepherd, shows that quantum computers can efficiently sample from probability distributions that cannot be exactly sampled efficiently on a classical computer, unless the PH collapses. Aaronson and Arkhipov take this further by considering a distribution that can be sampled efficiently by linear optical quantum computation, that under two feasible conjectures, cannot even be approximately sampled classically within bounded total variation distance, unless the PH collapses. In this work we use Quantum Fourier Sampling to construct a class of distributions that can be sampled by a quantum computer. We then argue that these distributions cannot be approximately sampled classically, unless the PH collapses, under variants of the Aaronson and Arkhipov conjectures. In particular, we show a general class of quantumly sampleable distributions each of which is based on an "Efficiently Specifiable" polynomial, for which a classical approximate sampler implies an average-case approximation. This class of polynomials contains the Permanent but also includes, for example, the Hamiltonian Cycle polynomial, and many other familiar #P-hard polynomials. Although our construction, unlike that proposed by Aaronson and Arkhipov, likely requires a universal quantum computer, we are able to use this additional power to weaken the conjectures needed to prove approximate sampling hardness results. 1 aFefferman, Bill1 aUmans, Chris uhttp://arxiv.org/abs/1507.05592v101003nas a2200121 4500008004100000245005600041210005600097260001500153520063800168100002000806700001900826856003600845 2015 eng d00aQuantum vs Classical Proofs and Subset Verification0 aQuantum vs Classical Proofs and Subset Verification c2015/10/223 aWe study the ability of efficient quantum verifiers to decide properties of exponentially large subsets given either a classical or quantum witness. We develop a general framework that can be used to prove that QCMA machines, with only classical witnesses, cannot verify certain properties of subsets given implicitly via an oracle. We use this framework to prove an oracle separation between QCMA and QMA using an ``in-place'' permutation oracle, making the first progress on this question since Aaronson and Kuperberg in 2007. We also use the framework to prove a particularly simple standard oracle separation between QCMA and AM.1 aFefferman, Bill1 aKimmel, Shelby uhttp://arxiv.org/abs/1510.0675001142nas a2200157 4500008004100000245008300041210006900124260001500193520063900208100002300847700001800870700002400888700001900912700001600931856003700947 2014 eng d00aDifferent Strategies for Optimization Using the Quantum Adiabatic Algorithm 0 aDifferent Strategies for Optimization Using the Quantum Adiabati c2014/01/283 a We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses. The probability of obtaining this assignment at the end of the quantum evolution measures the success of the algorithm. Here we report three strategies which consistently increase the success probability for the hardest instances in our ensemble: decreasing the overall evolution time, initializing the system in excited states, and adding a random local Hamiltonian to the middle of the evolution. 1 aCrosson, Elizabeth1 aFarhi, Edward1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan1 aShor, Peter uhttp://arxiv.org/abs/1401.7320v101571nas a2200217 4500008004100000245007400041210006900115260001500184300001400199490000800213520093800221100002001159700001901179700002101198700001701219700002301236700002301259700001601282700001801298856003701316 2014 eng d00aHong-Ou-Mandel atom interferometry in tunnel-coupled optical tweezers0 aHongOuMandel atom interferometry in tunnelcoupled optical tweeze c2014/06/26 a306 - 3090 v3453 a The quantum statistics of atoms is typically observed in the behavior of an ensemble via macroscopic observables. However, quantum statistics modifies the behavior of even two particles, inducing remarkable consequences that are at the heart of quantum science. Here we demonstrate near-complete control over all the internal and external degrees of freedom of two laser-cooled 87Rb atoms trapped in two optical tweezers. This full controllability allows us to implement a massive-particle analog of a Hong-Ou-Mandel interferometer where atom tunneling plays the role of a photon beamsplitter. We use the interferometer to probe the effect of quantum statistics on the two-atom dynamics under tunable initial conditions, chosen to adjust the degree of atomic indistinguishability. Our work thereby establishes laser-cooled atoms in optical tweezers as a new route to bottom-up engineering of scalable, low-entropy quantum systems. 1 aKaufman, A., M.1 aLester, B., J.1 aReynolds, C., M.1 aWall, M., L.1 aFoss-Feig, Michael1 aHazzard, K., R. A.1 aRey, A., M.1 aRegal, C., A. uhttp://arxiv.org/abs/1312.7182v202029nas a2200241 4500008004100000245006600041210006500107260001400172490000800186520133800194100002601532700001801558700002301576700001201599700002201611700002101633700002001654700002301674700001201697700002101709700002001730856003701750 2014 eng d00aMany-body dynamics of dipolar molecules in an optical lattice0 aManybody dynamics of dipolar molecules in an optical lattice c2014/11/70 v1133 a Understanding the many-body dynamics of isolated quantum systems is one of the central challenges in modern physics. To this end, the direct experimental realization of strongly correlated quantum systems allows one to gain insights into the emergence of complex phenomena. Such insights enable the development of theoretical tools that broaden our understanding. Here, we theoretically model and experimentally probe with Ramsey spectroscopy the quantum dynamics of disordered, dipolar-interacting, ultracold molecules in a partially filled optical lattice. We report the capability to control the dipolar interaction strength, and we demonstrate that the many-body dynamics extends well beyond a nearest-neighbor or mean-field picture, and cannot be quantitatively described using previously available theoretical tools. We develop a novel cluster expansion technique and demonstrate that our theoretical method accurately captures the measured dependence of the spin dynamics on molecule number and on the dipolar interaction strength. In the spirit of quantum simulation, this agreement simultaneously benchmarks the new theoretical method and verifies our microscopic understanding of the experiment. Our findings pave the way for numerous applications in quantum information science, metrology, and condensed matter physics. 1 aHazzard, Kaden, R. A.1 aGadway, Bryce1 aFoss-Feig, Michael1 aYan, Bo1 aMoses, Steven, A.1 aCovey, Jacob, P.1 aYao, Norman, Y.1 aLukin, Mikhail, D.1 aYe, Jun1 aJin, Deborah, S.1 aRey, Ana, Maria uhttp://arxiv.org/abs/1402.2354v102028nas a2200229 4500008004100000245008700041210006900128260001300197300001400210490000800224520134100232100002101573700001901594700001501613700001901628700001701647700002301664700002501687700002501712700002401737856003701761 2014 eng d00aNon-local propagation of correlations in long-range interacting quantum systems 0 aNonlocal propagation of correlations in longrange interacting qu c2014/7/9 a198 - 2010 v5113 a The maximum speed with which information can propagate in a quantum many-body system directly affects how quickly disparate parts of the system can become correlated and how difficult the system will be to describe numerically. For systems with only short-range interactions, Lieb and Robinson derived a constant-velocity bound that limits correlations to within a linear effective light cone. However, little is known about the propagation speed in systems with long-range interactions, since the best long-range bound is too loose to give the correct light-cone shape for any known spin model and since analytic solutions rarely exist. In this work, we experimentally determine the spatial and time-dependent correlations of a far-from-equilibrium quantum many-body system evolving under a long-range Ising- or XY-model Hamiltonian. For several different interaction ranges, we extract the shape of the light cone and measure the velocity with which correlations propagate through the system. In many cases we find increasing propagation velocities, which violate the Lieb-Robinson prediction, and in one instance cannot be explained by any existing theory. Our results demonstrate that even modestly-sized quantum simulators are well-poised for studying complicated many-body systems that are intractable to classical computation. 1 aRicherme, Philip1 aGong, Zhe-Xuan1 aLee, Aaron1 aSenko, Crystal1 aSmith, Jacob1 aFoss-Feig, Michael1 aMichalakis, Spyridon1 aGorshkov, Alexey, V.1 aMonroe, Christopher uhttp://arxiv.org/abs/1401.5088v101399nas a2200157 4500008004100000245006700041210006600108260001400174490000800188520091600196100001901112700002301131700002501154700002501179856003701204 2014 eng d00aPersistence of locality in systems with power-law interactions0 aPersistence of locality in systems with powerlaw interactions c2014/7/160 v1133 a Motivated by recent experiments with ultra-cold matter, we derive a new bound on the propagation of information in $D$-dimensional lattice models exhibiting $1/r^{\alpha}$ interactions with $\alpha>D$. The bound contains two terms: One accounts for the short-ranged part of the interactions, giving rise to a bounded velocity and reflecting the persistence of locality out to intermediate distances, while the other contributes a power-law decay at longer distances. We demonstrate that these two contributions not only bound but, except at long times, \emph{qualitatively reproduce} the short- and long-distance dynamical behavior following a local quench in an $XY$ chain and a transverse-field Ising chain. In addition to describing dynamics in numerous intractable long-range interacting lattice models, our results can be experimentally verified in a variety of ultracold-atomic and solid-state systems. 1 aGong, Zhe-Xuan1 aFoss-Feig, Michael1 aMichalakis, Spyridon1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1401.6174v201850nas a2200205 4500008004100000245008200041210006900123260001500192490000700207520120600214100002601420700002601446700002301472700002701495700002701522700001701549700002101566700002001587856003701607 2014 eng d00aQuantum correlations and entanglement in far-from-equilibrium spin systems 0 aQuantum correlations and entanglement in farfromequilibrium spin c2014/12/150 v903 a By applying complementary analytic and numerical methods, we investigate the dynamics of spin-$1/2$ XXZ models with variable-range interactions in arbitrary dimensions. The dynamics we consider is initiated from uncorrelated states that are easily prepared in experiments, and can be equivalently viewed as either Ramsey spectroscopy or a quantum quench. Our primary focus is the dynamical emergence of correlations and entanglement in these far-from-equilibrium interacting quantum systems: we characterize these correlations by the entanglement entropy, concurrence, and squeezing, which are inequivalent measures of entanglement corresponding to different quantum resources. In one spatial dimension, we show that the time evolution of correlation functions manifests a non-perturbative dynamic singularity. This singularity is characterized by a universal power-law exponent that is insensitive to small perturbations. Explicit realizations of these models in current experiments using polar molecules, trapped ions, Rydberg atoms, magnetic atoms, and alkaline-earth and alkali atoms in optical lattices, along with the relative merits and limitations of these different systems, are discussed. 1 aHazzard, Kaden, R. A.1 avan den Worm, Mauritz1 aFoss-Feig, Michael1 aManmana, Salvatore, R.1 aTorre, Emanuele, Dalla1 aPfau, Tilman1 aKastner, Michael1 aRey, Ana, Maria uhttp://arxiv.org/abs/1406.0937v101278nas a2200205 4500008004100000245009000041210006900131260001400200490000700214520065300221100001600874700001300890700002000903700002700923700002100950700001800971700002500989700002101014856003701035 2014 eng d00aScattering resonances and bound states for strongly interacting Rydberg polaritons 0 aScattering resonances and bound states for strongly interacting  c2014/11/30 v903 a We provide a theoretical framework describing slow-light polaritons interacting via atomic Rydberg states. We use a diagrammatic method to analytically derive the scattering properties of two polaritons. We identify parameter regimes where polariton-polariton interactions are repulsive. Furthermore, in the regime of attractive interactions, we identify multiple two-polariton bound states, calculate their dispersion, and study the resulting scattering resonances. Finally, the two-particle scattering properties allow us to derive the effective low-energy many-body Hamiltonian. This theoretical platform is applicable to ongoing experiments. 1 aBienias, P.1 aChoi, S.1 aFirstenberg, O.1 aMaghrebi, Mohammad, F.1 aGullans, Michael1 aLukin, M., D.1 aGorshkov, Alexey, V.1 aBüchler, H., P. uhttp://arxiv.org/abs/1402.7333v102020nas a2200265 4500008004100000245009000041210006900131260001400200490000800214520123900222100001501461700001801476700002301494700002801517700001801545700002601563700001201589700002201601700002101623700002101644700001201665700002001677700002001697856003701717 2014 eng d00aSuppressing the loss of ultracold molecules via the continuous quantum Zeno effect 0 aSuppressing the loss of ultracold molecules via the continuous q c2014/2/200 v1123 a We investigate theoretically the suppression of two-body losses when the on-site loss rate is larger than all other energy scales in a lattice. This work quantitatively explains the recently observed suppression of chemical reactions between two rotational states of fermionic KRb molecules confined in one-dimensional tubes with a weak lattice along the tubes [Yan et al., Nature 501, 521-525 (2013)]. New loss rate measurements performed for different lattice parameters but under controlled initial conditions allow us to show that the loss suppression is a consequence of the combined effects of lattice confinement and the continuous quantum Zeno effect. A key finding, relevant for generic strongly reactive systems, is that while a single-band theory can qualitatively describe the data, a quantitative analysis must include multiband effects. Accounting for these effects reduces the inferred molecule filling fraction by a factor of five. A rate equation can describe much of the data, but to properly reproduce the loss dynamics with a fixed filling fraction for all lattice parameters we develop a mean-field model and benchmark it with numerically exact time-dependent density matrix renormalization group calculations. 1 aZhu, Bihui1 aGadway, Bryce1 aFoss-Feig, Michael1 aSchachenmayer, Johannes1 aWall, Michael1 aHazzard, Kaden, R. A.1 aYan, Bo1 aMoses, Steven, A.1 aCovey, Jacob, P.1 aJin, Deborah, S.1 aYe, Jun1 aHolland, Murray1 aRey, Ana, Maria uhttp://arxiv.org/abs/1310.2221v201306nas a2200145 4500008004100000245011100041210006900152260001300221490000700234520073400241100001600975700001800991700002101009856013001030 2014 eng d00aWhen the asymptotic limit offers no advantage in the local-operations-and-classical-communication paradigm0 aWhen the asymptotic limit offers no advantage in the localoperat c5/9/20140 v893 a

We consider bipartite LOCC, the class of operations implementable by local quantum operations and classical communication between two parties. Surprisingly, there are operations that can be approximated to arbitrary precision but are impossible to implement exactly if only a finite number of messages are exchanged. This significantly complicates the analysis of what can or cannot be approximated with LOCC. Toward alleviating this problem, we exhibit two scenarios in which allowing vanishing error does not help. The first scenario is implementation of projective measurements with product measurement operators. The second scenario is the discrimination of unextendable product bases on two three-dimensional systems.

1 aFu, Honghao1 aLeung, Debbie1 aMancinska, Laura uhttps://www.quics.umd.edu/publications/when-asymptotic-limit-offers-no-advantage-local-operations-and-classical-communication00504nas a2200169 4500008004100000245005300041210005300094300000700147490000800154100002200162700002300184700001700207700002500224700002300249700002000272856004200292 2013 eng d00aAttractive Photons in a Quantum Nonlinear Medium0 aAttractive Photons in a Quantum Nonlinear Medium a710 v5021 aFirstenberg, Ofer1 aPeyronel, Thibault1 aLiang, Qi-Yu1 aGorshkov, Alexey, V.1 aLukin, Mikhail, D.1 aVuletic, Vladan uhttp://dx.doi.org/10.1038/nature1251202138nas a2200181 4500008004100000245011400041210006900155260001500224300001100239490000700250520155000257100002301807700002401830700002301854700002001877700002201897856003701919 2013 eng d00aDynamical quantum correlations of Ising models on an arbitrary lattice and their resilience to decoherence 0 aDynamical quantum correlations of Ising models on an arbitrary l c2013/11/07 a1130080 v153 a Ising models, and the physical systems described by them, play a central role in generating entangled states for use in quantum metrology and quantum information. In particular, ultracold atomic gases, trapped ion systems, and Rydberg atoms realize long-ranged Ising models, which even in the absence of a transverse field can give rise to highly non-classical dynamics and long-range quantum correlations. In the first part of this paper, we present a detailed theoretical framework for studying the dynamics of such systems driven (at time t=0) into arbitrary unentangled non-equilibrium states, thus greatly extending and unifying the work of Ref. [1]. Specifically, we derive exact expressions for closed-time-path ordered correlation functions, and use these to study experimentally relevant observables, e.g. Bloch vector and spin-squeezing dynamics. In the second part, these correlation functions are then used to derive closed-form expressions for the dynamics of arbitrary spin-spin correlation functions in the presence of both T_1 (spontaneous spin relaxation/excitation) and T_2 (dephasing) type decoherence processes. Even though the decoherence is local, our solution reveals that the competition between Ising dynamics and T_1 decoherence gives rise to an emergent non-local dephasing effect, thereby drastically amplifying the degradation of quantum correlations. In addition to identifying the mechanism of this deleterious effect, our solution points toward a scheme to eliminate it via measurement-based coherent feedback. 1 aFoss-Feig, Michael1 aHazzard, Kaden, R A1 aBollinger, John, J1 aRey, Ana, Maria1 aClark, Charles, W uhttp://arxiv.org/abs/1306.0172v101291nas a2200157 4500008004100000245007400041210006900115260001400184490000800198520079400206100002601000700002701026700002301053700002001076856003701096 2013 eng d00aFar from equilibrium quantum magnetism with ultracold polar molecules0 aFar from equilibrium quantum magnetism with ultracold polar mole c2013/2/110 v1103 a Recent theory has indicated how to emulate tunable models of quantum magnetism with ultracold polar molecules. Here we show that present molecule optical lattice experiments can accomplish three crucial goals for quantum emulation, despite currently being well below unit filling and not quantum degenerate. The first is to verify and benchmark the models proposed to describe these systems. The second is to prepare correlated and possibly useful states in well-understood regimes. The third is to explore many-body physics inaccessible to existing theoretical techniques. Our proposal relies on a non-equilibrium protocol that can be viewed either as Ramsey spectroscopy or an interaction quench. It uses only routine experimental tools available in any ultracold molecule experiment. 1 aHazzard, Kaden, R. A.1 aManmana, Salvatore, R.1 aFoss-Feig, Michael1 aRey, Ana, Maria uhttp://arxiv.org/abs/1209.4076v101346nas a2200157 4500008004100000245008400041210006900125260001300194490000700207520084400214100002301058700002601081700002401107700002001131856003701151 2013 eng d00aNon-equilibrium dynamics of Ising models with decoherence: an exact solution 0 aNonequilibrium dynamics of Ising models with decoherence an exac c2013/4/30 v873 a The interplay between interactions and decoherence in many-body systems is of fundamental importance in quantum physics: Decoherence can degrade correlations, but can also give rise to a variety of rich dynamical and steady-state behaviors. We obtain an exact analytic solution for the non-equilibrium dynamics of Ising models with arbitrary interactions and subject to the most general form of local Markovian decoherence. Our solution shows that decoherence affects the relaxation of observables more than predicted by single-particle considerations. It also reveals a dynamical phase transition, specifically a Hopf bifurcation, which is absent at the single-particle level. These calculations are applicable to ongoing quantum information and emulation efforts using a variety of atomic, molecular, optical, and solid-state systems. 1 aFoss-Feig, Michael1 aHazzard, Kaden, R. A.1 aBollinger, John, J.1 aRey, Ana, Maria uhttp://arxiv.org/abs/1209.5795v200562nas a2200193 4500008004100000245005900041210005800100300000700158490000700165100001900172700001600191700001600207700001700223700001500240700002500255700001900280700001200299856005700311 2013 eng d00aQuantum Nonlinear Optics: Strongly Interacting Photons0 aQuantum Nonlinear Optics Strongly Interacting Photons a480 v241 aFirstenberg, O1 aLukin, M, D1 aPeyronel, T1 aLiang, Q, -Y1 aVuletic, V1 aGorshkov, Alexey, V.1 aHofferberth, S1 aPohl, T uhttp://www.osa-opn.org/abstract.cfm?URI=opn-24-12-4802607nas a2200169 4500008004100000245003500041210003200076260001500108300001200123490000600135520215500141100002002296700002002316700002302336700002002359856005802379 2012 eng d00aOn Beating the Hybrid Argument0 aBeating the Hybrid Argument c2013/11/14 a809-8430 v93 aThe hybrid argument allows one to relate the distinguishability of a distribution (from uniform) to the predictability of individual bits given a prefix. The argument incurs a loss of a factor k equal to the bit-length of the distributions: -distinguishability implies only /k-predictability. This paper studies the consequences of avoiding this loss – what we call “beating the hybrid argument” – and develops new proof techniques that circumvent the loss in certain natural settings. Specifically, we obtain the following results: 1. We give an instantiation of the Nisan-Wigderson generator (JCSS ’94) that can be broken by quantum computers, and that is o(1)-unpredictable against AC0 . This is not enough to imply indistinguishability via the hybrid argument because of the hybrid-argument loss; nevertheless, we conjecture that this generator indeed fools AC0 , and we prove this statement for a simplified version of the problem. Our conjecture implies the existence of an oracle relative to which BQP is not in the PH, a longstanding open problem. 2. We show that the “INW” generator by Impagliazzo, Nisan, and Wigderson (STOC ’94) with seed length O(log n log log n) produces a distribution that is 1/ log n-unpredictable against poly-logarithmic width (general) read-once oblivious branching programs. Thus avoiding the hybrid-argument loss would lead to a breakthrough in generators against small space. 3. We study pseudorandom generators obtained from a hard function by repeated sampling. We identify a property of functions, “resamplability,” that allows us to beat the hybrid argument, leading to new pseudorandom generators for AC0 [p] and similar classes. Although the generators have sub-linear stretch, they represent the best-known generators for these classes. Thus we establish that “beating” or bypassing the hybrid argument would have two significant consequences in complexity, and we take steps toward that goal by developing techniques that indeed beat the hybrid argument in related (but simpler) settings, leading to best-known PRGs for certain complexity classes. 1 aFefferman, Bill1 aShaltiel, Ronen1 aUmans, Christopher1 aViola, Emanuele uhttp://users.cms.caltech.edu/~umans/papers/FSUV10.pdf02074nas a2200157 4500008004100000245008100041210006900122260001500191490000700206520159700213100001501810700002001825700001901845700001501864856003701879 2012 eng d00aThe equilibrium states of open quantum systems in the strong coupling regime0 aequilibrium states of open quantum systems in the strong couplin c2012/12/260 v863 aIn this work we investigate the late-time stationary states of open quantum systems coupled to a thermal reservoir in the strong coupling regime. In general such systems do not necessarily relax to a Boltzmann distribution if the coupling to the thermal reservoir is non-vanishing or equivalently if the relaxation timescales are finite. Using a variety of non-equilibrium formalisms valid for non-Markovian processes, we show that starting from a product state of the closed system = system + environment, with the environment in its thermal state, the open system which results from coarse graining the environment will evolve towards an equilibrium state at late-times. This state can be expressed as the reduced state of the closed system thermal state at the temperature of the environment. For a linear (harmonic) system and environment, which is exactly solvable, we are able to show in a rigorous way that all multi-time correlations of the open system evolve towards those of the closed system thermal state. Multi-time correlations are especially relevant in the non-Markovian regime, since they cannot be generated by the dynamics of the single-time correlations. For more general systems, which cannot be exactly solved, we are able to provide a general proof that all single-time correlations of the open system evolve to those of the closed system thermal state, to first order in the relaxation rates. For the special case of a zero-temperature reservoir, we are able to explicitly construct the reduced closed system thermal state in terms of the environmental correlations. 1 aSubasi, Y.1 aFleming, C., H.1 aTaylor, J., M.1 aHu, B., L. uhttp://arxiv.org/abs/1206.2707v101519nas a2200217 4500008004100000245008300041210006900124260001400193490000800207520087700215100002001092700002101112700002201133700001201155700002101167700002301188700002001211700002101231700001201252856003701264 2012 eng d00aLong-lived dipolar molecules and Feshbach molecules in a 3D optical lattice 0 aLonglived dipolar molecules and Feshbach molecules in a 3D optic c2012/2/230 v1083 a We have realized long-lived ground-state polar molecules in a 3D optical lattice, with a lifetime of up to 25 s, which is limited only by off-resonant scattering of the trapping light. Starting from a 2D optical lattice, we observe that the lifetime increases dramatically as a small lattice potential is added along the tube-shaped lattice traps. The 3D optical lattice also dramatically increases the lifetime for weakly bound Feshbach molecules. For a pure gas of Feshbach molecules, we observe a lifetime of >20 s in a 3D optical lattice; this represents a 100-fold improvement over previous results. This lifetime is also limited by off-resonant scattering, the rate of which is related to the size of the Feshbach molecule. Individually trapped Feshbach molecules in the 3D lattice can be converted to pairs of K and Rb atoms and back with nearly 100% efficiency. 1 aChotia, Amodsen1 aNeyenhuis, Brian1 aMoses, Steven, A.1 aYan, Bo1 aCovey, Jacob, P.1 aFoss-Feig, Michael1 aRey, Ana, Maria1 aJin, Deborah, S.1 aYe, Jun uhttp://arxiv.org/abs/1110.4420v101154nas a2200205 4500008004100000245004700041210004700088260001400135490000800149520061400157100002100771700001500792700001800807700001400825700002100839700001800860700001500878700001800893856003700911 2012 eng d00aNanoplasmonic Lattices for Ultracold atoms0 aNanoplasmonic Lattices for Ultracold atoms c2012/12/60 v1093 a We propose to use sub-wavelength confinement of light associated with the near field of plasmonic systems to create nanoscale optical lattices for ultracold atoms. Our approach combines the unique coherence properties of isolated atoms with the sub-wavelength manipulation and strong light-matter interaction associated with nano-plasmonic systems. It allows one to considerably increase the energy scales in the realization of Hubbard models and to engineer effective long-range interactions in coherent and dissipative many-body dynamics. Realistic imperfections and potential applications are discussed. 1 aGullans, Michael1 aTiecke, T.1 aChang, D., E.1 aFeist, J.1 aThompson, J., D.1 aCirac, J., I.1 aZoller, P.1 aLukin, M., D. uhttp://arxiv.org/abs/1208.6293v300654nas a2200193 4500008004100000245008700041210006900128300000700197490000800204100002300212700002200235700001700257700002700274700002500301700001700326700002300343700002000366856007400386 2012 eng d00aQuantum nonlinear optics with single photons enabled by strongly interacting atoms0 aQuantum nonlinear optics with single photons enabled by strongly a570 v4881 aPeyronel, Thibault1 aFirstenberg, Ofer1 aLiang, Qi-Yu1 aHofferberth, Sebastian1 aGorshkov, Alexey, V.1 aPohl, Thomas1 aLukin, Mikhail, D.1 aVuletic, Vladan uhttp://www.nature.com/nature/journal/v488/n7409/full/nature11361.html02431nas a2200169 4500008004100000245010800041210006900149260001500218300001100233490000700244520189900251100002402150700001702174700001602191700001702207856003702224 2012 eng d00aQuantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators 0 aQuantum Tomography via Compressed Sensing Error Bounds Sample Co c2012/09/27 a0950220 v143 a Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition. First, we show that a low-rank density matrix can be estimated using fewer copies of the state, i.e., the sample complexity of tomography decreases with the rank. Second, we show that unknown low-rank states can be reconstructed from an incomplete set of measurements, using techniques from compressed sensing and matrix completion. These techniques use simple Pauli measurements, and their output can be certified without making any assumptions about the unknown state. We give a new theoretical analysis of compressed tomography, based on the restricted isometry property (RIP) for low-rank matrices. Using these tools, we obtain near-optimal error bounds, for the realistic situation where the data contains noise due to finite statistics, and the density matrix is full-rank with decaying eigenvalues. We also obtain upper-bounds on the sample complexity of compressed tomography, and almost-matching lower bounds on the sample complexity of any procedure using adaptive sequences of Pauli measurements. Using numerical simulations, we compare the performance of two compressed sensing estimators with standard maximum-likelihood estimation (MLE). We find that, given comparable experimental resources, the compressed sensing estimators consistently produce higher-fidelity state reconstructions than MLE. In addition, the use of an incomplete set of measurements leads to faster classical processing with no loss of accuracy. Finally, we show how to certify the accuracy of a low rank estimate using direct fidelity estimation and we describe a method for compressed quantum process tomography that works for processes with small Kraus rank. 1 aFlammia, Steven, T.1 aGross, David1 aLiu, Yi-Kai1 aEisert, Jens uhttp://arxiv.org/abs/1205.2300v201932nas a2200169 4500008004100000245005700041210005500098260001500153300001200168520144400180100002701624700002101651700001601672700002101688700001601709856003701725 2012 eng d00aA Spectral Algorithm for Latent Dirichlet Allocation0 aSpectral Algorithm for Latent Dirichlet Allocation c2012/04/30 a193-2143 a The problem of topic modeling can be seen as a generalization of the clustering problem, in that it posits that observations are generated due to multiple latent factors (e.g., the words in each document are generated as a mixture of several active topics, as opposed to just one). This increased representational power comes at the cost of a more challenging unsupervised learning problem of estimating the topic probability vectors (the distributions over words for each topic), when only the words are observed and the corresponding topics are hidden. We provide a simple and efficient learning procedure that is guaranteed to recover the parameters for a wide class of mixture models, including the popular latent Dirichlet allocation (LDA) model. For LDA, the procedure correctly recovers both the topic probability vectors and the prior over the topics, using only trigram statistics (i.e., third order moments, which may be estimated with documents containing just three words). The method, termed Excess Correlation Analysis (ECA), is based on a spectral decomposition of low order moments (third and fourth order) via two singular value decompositions (SVDs). Moreover, the algorithm is scalable since the SVD operations are carried out on $k\times k$ matrices, where $k$ is the number of latent factors (e.g. the number of topics), rather than in the $d$-dimensional observed space (typically $d \gg k$). 1 aAnandkumar, Animashree1 aFoster, Dean, P.1 aHsu, Daniel1 aKakade, Sham, M.1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1204.6703v401233nas a2200157 4500008004100000245006500041210006300106260001400169490000800183520075800191100002300949700002200972700002400994700002001018856003701038 2012 eng d00aSteady-state many-body entanglement of hot reactive fermions0 aSteadystate manybody entanglement of hot reactive fermions c2012/12/40 v1093 a Entanglement is typically created via systematic intervention in the time evolution of an initially unentangled state, which can be achieved by coherent control, carefully tailored non-demolition measurements, or dissipation in the presence of properly engineered reservoirs. In this paper we show that two-component Fermi gases at ~\mu K temperatures naturally evolve, in the presence of reactive two-body collisions, into states with highly entangled (Dicke-type) spin wavefunctions. The entanglement is a steady-state property that emerges---without any intervention---from uncorrelated initial states, and could be used to improve the accuracy of spectroscopy in experiments with fermionic alkaline earth atoms or fermionic groundstate molecules. 1 aFoss-Feig, Michael1 aDaley, Andrew, J.1 aThompson, James, K.1 aRey, Ana, Maria uhttp://arxiv.org/abs/1207.4741v100981nas a2200133 4500008004100000245005900041210005900100260001300159490000800172520059000180100002400770700001600794856003700810 2011 eng d00aDirect Fidelity Estimation from Few Pauli Measurements0 aDirect Fidelity Estimation from Few Pauli Measurements c2011/6/80 v1063 a We describe a simple method for certifying that an experimental device prepares a desired quantum state rho. Our method is applicable to any pure state rho, and it provides an estimate of the fidelity between rho and the actual (arbitrary) state in the lab, up to a constant additive error. The method requires measuring only a constant number of Pauli expectation values, selected at random according to an importance-weighting rule. Our method is faster than full tomography by a factor of d, the dimension of the state space, and extends easily and naturally to quantum channels. 1 aFlammia, Steven, T.1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1104.4695v301461nas a2200133 4500008004100000245005000041210004900091260001500140490000700155520108500162100002301247700002001270856003701290 2011 eng d00aPhase diagram of the Bose Kondo-Hubbard model0 aPhase diagram of the Bose KondoHubbard model c2011/11/160 v843 a We study a bosonic version of the Kondo lattice model with an on-site repulsion in the conduction band, implemented with alkali atoms in two bands of an optical lattice. Using both weak and strong-coupling perturbation theory, we find that at unit filling of the conduction bosons the superfluid to Mott insulator transition should be accompanied by a magnetic transition from a ferromagnet (in the superfluid) to a paramagnet (in the Mott insulator). Furthermore, an analytic treatment of Gutzwiller mean-field theory reveals that quantum spin fluctuations induced by the Kondo exchange cause the otherwise continuous superfluid to Mott-insulator phase transition to be first order. We show that lattice separability imposes a serious constraint on proposals to exploit excited bands for quantum simulations, and discuss a way to overcome this constraint in the context of our model by using an experimentally realized non-separable lattice. A method to probe the first-order nature of the transition based on collapses and revivals of the matter-wave field is also discussed. 1 aFoss-Feig, Michael1 aRey, Ana, Maria uhttp://arxiv.org/abs/1103.0245v201088nas a2200169 4500008004100000245005200041210005100093260001400144490000800158520060000166100002500766700002400791700002600815700001700841700002300858856003700881 2011 eng d00aPhoton-Photon Interactions via Rydberg Blockade0 aPhotonPhoton Interactions via Rydberg Blockade c2011/9/220 v1073 a We develop the theory of light propagation under the conditions of electromagnetically induced transparency (EIT) in systems involving strongly interacting Rydberg states. Taking into account the quantum nature and the spatial propagation of light, we analyze interactions involving few-photon pulses. We demonstrate that this system can be used for the generation of nonclassical states of light including trains of single photons with an avoided volume between them, for implementing photon-photon quantum gates, as well as for studying many-body phenomena with strongly correlated photons. 1 aGorshkov, Alexey, V.1 aOtterbach, Johannes1 aFleischhauer, Michael1 aPohl, Thomas1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1103.3700v101775nas a2200229 4500008004100000245003900041210003900080260001500119300000800134490000600142520116900148100001901317700002301336700002401359700001701383700002601400700001901426700002901445700001601474700001801490856003701508 2010 eng d00aEfficient quantum state tomography0 aEfficient quantum state tomography c2010/12/21 a1490 v13 a Quantum state tomography, the ability to deduce the state of a quantum system from measured data, is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger systems it becomes infeasible because the number of quantum measurements and the amount of computation required to process them grows exponentially in the system size. Here we show that we can do exponentially better than direct state tomography for a wide range of quantum states, in particular those that are well approximated by a matrix product state ansatz. We present two schemes for tomography in 1-D quantum systems and touch on generalizations. One scheme requires unitary operations on a constant number of subsystems, while the other requires only local measurements together with more elaborate post-processing. Both schemes rely only on a linear number of experimental operations and classical postprocessing that is polynomial in the system size. A further strength of the methods is that the accuracy of the reconstructed states can be rigorously certified without any a priori assumptions. 1 aCramer, Marcus1 aPlenio, Martin, B.1 aFlammia, Steven, T.1 aGross, David1 aBartlett, Stephen, D.1 aSomma, Rolando1 aLandon-Cardinal, Olivier1 aLiu, Yi-Kai1 aPoulin, David uhttp://arxiv.org/abs/1101.4366v101646nas a2200157 4500008004100000245004100041210004100082260001500123490000700138520122200145100002301367700002101390700002001411700002001431856003701451 2010 eng d00aHeavy fermions in an optical lattice0 aHeavy fermions in an optical lattice c2010/11/220 v823 a We employ a mean-field theory to study ground-state properties and transport of a two-dimensional gas of ultracold alklaline-earth metal atoms governed by the Kondo Lattice Hamiltonian plus a parabolic confining potential. In a homogenous system this mean-field theory is believed to give a qualitatively correct description of heavy fermion metals and Kondo insulators: it reproduces the Kondo-like scaling of the quasiparticle mass in the former, and the same scaling of the excitation gap in the latter. In order to understand ground-state properties in a trap we extend this mean-field theory via local-density approximation. We find that the Kondo insulator gap manifests as a shell structure in the trapped density profile. In addition, a strong signature of the large Fermi surface expected for heavy fermion systems survives the confinement, and could be probed in time-of-flight experiments. From a full self-consistent diagonalization of the mean-field theory we are able to study dynamics in the trap. We find that the mass enhancement of quasiparticle excitations in the heavy Fermi liquid phase manifests as slowing of the dipole oscillations that result from a sudden displacement of the trap center. 1 aFoss-Feig, Michael1 aHermele, Michael1 aGurarie, Victor1 aRey, Ana, Maria uhttp://arxiv.org/abs/1007.5083v101038nas a2200169 4500008004100000245008300041210006900124260001300193490000800206520050000214100002500714700002400739700001900763700002600782700002300808856003700831 2010 eng d00aPhotonic Phase Gate via an Exchange of Fermionic Spin Waves in a Spin Chain 0 aPhotonic Phase Gate via an Exchange of Fermionic Spin Waves in a c2010/8/50 v1053 a We propose a new protocol for implementing the two-qubit photonic phase gate. In our approach, the pi phase is acquired by mapping two single photons into atomic excitations with fermionic character and exchanging their positions. The fermionic excitations are realized as spin waves in a spin chain, while photon storage techniques provide the interface between the photons and the spin waves. Possible imperfections and experimental systems suitable for implementing the gate are discussed. 1 aGorshkov, Alexey, V.1 aOtterbach, Johannes1 aDemler, Eugene1 aFleischhauer, Michael1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1001.0968v300925nas a2200145 4500008004100000245006200041210006200103260001300165490000700178520049300185100002300678700002100701700002000722856003700742 2010 eng d00aProbing the Kondo Lattice Model with Alkaline Earth Atoms0 aProbing the Kondo Lattice Model with Alkaline Earth Atoms c2010/5/70 v813 a We study transport properties of alkaline-earth atoms governed by the Kondo Lattice Hamiltonian plus a harmonic confining potential, and suggest simple dynamical probes of several different regimes of the phase diagram that can be implemented with current experimental techniques. In particular, we show how Kondo physics at strong coupling, low density, and in the heavy fermion phase is manifest in the dipole oscillations of the conduction band upon displacement of the trap center. 1 aFoss-Feig, Michael1 aHermele, Michael1 aRey, Ana, Maria uhttp://arxiv.org/abs/0912.4762v102256nas a2200121 4500008004100000245005500041210005400096260001500150520188900165100002002054700002302074856003702097 2010 eng d00aPseudorandom generators and the BQP vs. PH problem0 aPseudorandom generators and the BQP vs PH problem c2010/07/023 a It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity of the Nisan-Wigderson pseudorandom generator [NW94] to fool AC_0, with MAJORITY as its hard function. Our conjecture is essentially that the loss due to the hybrid argument (which is a component of the standard proof from [NW94]) can be avoided in this setting. This is a question that has been asked previously in the pseudorandomness literature [BSW03]. We then make three main contributions: (1) We show that our conjecture implies the existence of an oracle relative to which BQP is not in the PH. This entails giving an explicit construction of unitary matrices, realizable by small quantum circuits, whose row-supports are "nearly-disjoint." (2) We give a simple framework (generalizing the setting of Aaronson [A10]) in which any efficiently quantumly computable unitary gives rise to a distribution that can be distinguished from the uniform distribution by an efficient quantum algorithm. When applied to the unitaries we construct, this framework yields a problem that can be solved quantumly, and which forms the basis for the desired oracle. (3) We prove that Aaronson's "GLN conjecture" [A10] implies our conjecture; our conjecture is thus formally easier to prove. The GLN conjecture was recently proved false for depth greater than 2 [A10a], but it remains open for depth 2. If true, the depth-2 version of either conjecture would imply an oracle relative to which BQP is not in AM, which is itself an outstanding open problem. Taken together, our results have the following interesting interpretation: they give an instantiation of the Nisan-Wigderson generator that can be broken by quantum computers, but not by the relevant modes of classical computation, if our conjecture is true. 1 aFefferman, Bill1 aUmans, Christopher uhttp://arxiv.org/abs/1007.0305v301338nas a2200169 4500008004100000245005200041210005200093260001400145490000800159520087000167100001701037700001601054700002401070700002001094700001701114856003701131 2010 eng d00aQuantum state tomography via compressed sensing0 aQuantum state tomography via compressed sensing c2010/10/40 v1053 a We establish methods for quantum state tomography based on compressed sensing. These methods are specialized for quantum states that are fairly pure, and they offer a significant performance improvement on large quantum systems. In particular, they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rd log^2 d) measurement settings, compared to standard methods that require d^2 settings. Our methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements, use fast convex optimization, are stable against noise, and can be applied to states that are only approximately low-rank. The acquired data can be used to certify that the state is indeed close to pure, so no a priori assumptions are needed. We present both theoretical bounds and numerical simulations. 1 aGross, David1 aLiu, Yi-Kai1 aFlammia, Steven, T.1 aBecker, Stephen1 aEisert, Jens uhttp://arxiv.org/abs/0909.3304v401016nas a2200145 4500008004100000245015100041210006900192260001500261300001000276490000700286520049000293100002300783700002700806856003700833 2009 eng d00aGeometric-Phase-Effect Tunnel-Splitting Oscillations in Single-Molecule Magnets with Fourth-Order Anisotropy Induced by Orthorhombic Distortion 0 aGeometricPhaseEffect TunnelSplitting Oscillations in SingleMolec c2009/04/30 a270020 v863 a We analyze the interference between tunneling paths that occurs for a spin system with both fourth-order and second-order transverse anisotropy. Using an instanton approach, we find that as the strength of the second-order transverse anisotropy is increased, the tunnel splitting is modulated, with zeros occurring periodically. This effect results from the interference of four tunneling paths connecting easy-axis spin orientations and occurs in the absence of any magnetic field. 1 aFoss-Feig, Michael1 aFriedman, Jonathan, R. uhttp://arxiv.org/abs/0809.2289v201152nas a2200133 4500008004100000245004500041210004500086260001400131490000700145520078700152100002400939700001800963856003700981 2008 eng d00aPerturbative Gadgets at Arbitrary Orders0 aPerturbative Gadgets at Arbitrary Orders c2008/6/190 v773 a Adiabatic quantum algorithms are often most easily formulated using many-body interactions. However, experimentally available interactions are generally two-body. In 2004, Kempe, Kitaev, and Regev introduced perturbative gadgets, by which arbitrary three-body effective interactions can be obtained using Hamiltonians consisting only of two-body interactions. These three-body effective interactions arise from the third order in perturbation theory. Since their introduction, perturbative gadgets have become a standard tool in the theory of quantum computation. Here we construct generalized gadgets so that one can directly obtain arbitrary k-body effective interactions from two-body Hamiltonians. These effective interactions arise from the kth order in perturbation theory. 1 aJordan, Stephen, P.1 aFarhi, Edward uhttp://arxiv.org/abs/0802.1874v401446nas a2200157 4500008004100000245003200041210002800073260001500101520104100116100002001157700001801177700002001195700002001215700001601235856003701251 2008 eng d00aThe Power of Unentanglement0 aPower of Unentanglement c2008/04/043 a The class QMA(k), introduced by Kobayashi et al., consists of all languages that can be verified using k unentangled quantum proofs. Many of the simplest questions about this class have remained embarrassingly open: for example, can we give any evidence that k quantum proofs are more powerful than one? Does QMA(k)=QMA(2) for k>=2? Can QMA(k) protocols be amplified to exponentially small error? In this paper, we make progress on all of the above questions. First, we give a protocol by which a verifier can be convinced that a 3SAT formula of size n is satisfiable, with constant soundness, given ~O(sqrt(n)) unentangled quantum witnesses with O(log n) qubits each. Our protocol relies on the existence of very short PCPs. Second, we show that assuming a weak version of the Additivity Conjecture from quantum information theory, any QMA(2) protocol can be amplified to exponentially small error, and QMA(k)=QMA(2) for all k>=2. Third, we prove the nonexistence of "perfect disentanglers" for simulating multiple Merlins with one. 1 aAaronson, Scott1 aBeigi, Salman1 aDrucker, Andrew1 aFefferman, Bill1 aShor, Peter uhttp://arxiv.org/abs/0804.0802v201151nas a2200169 4500008004100000245006500041210006500106260001400171490000700185520063000192100002500822700001600847700002600863700002500889700002300914856004400937 2007 eng d00aUniversal Approach to Optimal Photon Storage in Atomic Media0 aUniversal Approach to Optimal Photon Storage in Atomic Media c2007/3/190 v983 a We present a universal physical picture for describing storage and retrieval of photon wave packets in a Lambda-type atomic medium. This physical picture encompasses a variety of different approaches to pulse storage ranging from adiabatic reduction of the photon group velocity and pulse-propagation control via off-resonant Raman fields to photon-echo based techniques. Furthermore, we derive an optimal control strategy for storage and retrieval of a photon wave packet of any given shape. All these approaches, when optimized, yield identical maximum efficiencies, which only depend on the optical depth of the medium. 1 aGorshkov, Alexey, V.1 aAndre, Axel1 aFleischhauer, Michael1 aSorensen, Anders, S.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/quant-ph/0604037v301177nas a2200145 4500008004100000245006100041210006100102260001500163490000700178520074000185100002400925700001800949700002000967856004400987 2006 eng d00aError correcting codes for adiabatic quantum computation0 aError correcting codes for adiabatic quantum computation c2006/11/140 v743 a Recently, there has been growing interest in using adiabatic quantum computation as an architecture for experimentally realizable quantum computers. One of the reasons for this is the idea that the energy gap should provide some inherent resistance to noise. It is now known that universal quantum computation can be achieved adiabatically using 2-local Hamiltonians. The energy gap in these Hamiltonians scales as an inverse polynomial in the problem size. Here we present stabilizer codes which can be used to produce a constant energy gap against 1-local and 2-local noise. The corresponding fault-tolerant universal Hamiltonians are 4-local and 6-local respectively, which is the optimal result achievable within this framework. 1 aJordan, Stephen, P.1 aFarhi, Edward1 aShor, Peter, W. uhttp://arxiv.org/abs/quant-ph/0512170v301113nas a2200169 4500008004100000245005200041210005200093260001500145520061800160100002300778700001900801700001900820700001800839700001700857700002500874856004400899 2002 eng d00aExponential algorithmic speedup by quantum walk0 aExponential algorithmic speedup by quantum walk c2002/09/243 a We construct an oracular (i.e., black box) problem that can be solved exponentially faster on a quantum computer than on a classical computer. The quantum algorithm is based on a continuous time quantum walk, and thus employs a different technique from previous quantum algorithms based on quantum Fourier transforms. We show how to implement the quantum walk efficiently in our oracular setting. We then show how this quantum walk can be used to solve our problem by rapidly traversing a graph. Finally, we prove that no classical algorithm can solve this problem with high probability in subexponential time. 1 aChilds, Andrew, M.1 aCleve, Richard1 aDeotto, Enrico1 aFarhi, Edward1 aGutmann, Sam1 aSpielman, Daniel, A. uhttp://arxiv.org/abs/quant-ph/0209131v201366nas a2200169 4500008004100000245008200041210006900123260001500192490000700207520083000214100002301044700002001067700002201087700002101109700002301130856004301153 2002 eng d00a`Flat Phase' Loading of a Bose-Einstein Condensate into an Optical Lattice 0 aFlat Phase Loading of a BoseEinstein Condensate into an Optical  c2002/11/260 v663 a It has been proposed that the adiabatic loading of a Bose-Einstein Condensate (BEC) into an optical lattice via the Mott-insulator transition can be used to initialize a quantum computer [D. Jaksch, {\it et al.}, Phys. Rev. Lett. {\bf 81}, 3108 (1998)]. The loading of a BEC into the lattice without causing band excitation is readily achievable; however, unless one switches on an optical lattice very slowly, the optical lattice causes a phase to accumulate across the condensate. We show analytically and numerically that a cancellation of this effect is possible by adjusting the harmonic trap force-constant of the magnetic trap appropriately, thereby facilitating quick loading of an optical lattice for quantum computing purposes. A simple analytical theory is developed for a non-stationary BEC in a harmonic trap. 1 aSklarz, Shlomo, E.1 aFriedler, Inbal1 aTannor, David, J.1 aBand, Yehuda, B.1 aWilliams, Carl, J. uhttp://arxiv.org/abs/physics/0209071v101071nas a2200181 4500008004100000245003400041210003400075260001400109490000700123520059100130100002300721700001900744700001800763700002300781700001700804700002400821856004400845 2002 eng d00aQuantum search by measurement0 aQuantum search by measurement c2002/9/230 v663 a We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the ground state of a time-varying Hamiltonian. Indeed, we show that the running times of the two algorithms are closely related. We also show how to achieve the quadratic speedup for Grover's unstructured search problem with only two measurements. Finally, we discuss some similarities and differences between the adiabatic and measurement algorithms. 1 aChilds, Andrew, M.1 aDeotto, Enrico1 aFarhi, Edward1 aGoldstone, Jeffrey1 aGutmann, Sam1 aLandahl, Andrew, J. uhttp://arxiv.org/abs/quant-ph/0204013v100814nas a2200157 4500008004100000245007600041210006900117260001500186300001200201490000600213520033500219100002300554700001800577700001700595856004400612 2001 eng d00aAn example of the difference between quantum and classical random walks0 aexample of the difference between quantum and classical random w c2002/04/01 a35 - 430 v13 a In this note, we discuss a general definition of quantum random walks on graphs and illustrate with a simple graph the possibility of very different behavior between a classical random walk and its quantum analogue. In this graph, propagation between a particular pair of nodes is exponentially faster in the quantum case. 1 aChilds, Andrew, M.1 aFarhi, Edward1 aGutmann, Sam uhttp://arxiv.org/abs/quant-ph/0103020v100767nas a2200145 4500008004100000245004800041210004800089260001500137490000700152520035800159100002300517700001800540700001900558856004400577 2001 eng d00aRobustness of adiabatic quantum computation0 aRobustness of adiabatic quantum computation c2001/12/140 v653 a We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm. 1 aChilds, Andrew, M.1 aFarhi, Edward1 aPreskill, John uhttp://arxiv.org/abs/quant-ph/0108048v101120nas a2200145 4500008004100000245005100041210005100092260001500143520069100158100002300849700001800872700002300890700001700913856004400930 2000 eng d00aFinding cliques by quantum adiabatic evolution0 aFinding cliques by quantum adiabatic evolution c2000/12/193 a Quantum adiabatic evolution provides a general technique for the solution of combinatorial search problems on quantum computers. We present the results of a numerical study of a particular application of quantum adiabatic evolution, the problem of finding the largest clique in a random graph. An n-vertex random graph has each edge included with probability 1/2, and a clique is a completely connected subgraph. There is no known classical algorithm that finds the largest clique in a random graph with high probability and runs in a time polynomial in n. For the small graphs we are able to investigate (n <= 18), the quantum algorithm appears to require only a quadratic run time. 1 aChilds, Andrew, M.1 aFarhi, Edward1 aGoldstone, Jeffrey1 aGutmann, Sam uhttp://arxiv.org/abs/quant-ph/0012104v1