@article {3489, title = {Efficient and practical Hamiltonian simulation from time-dependent product formulas}, year = {2024}, month = {3/13/2024}, abstract = {

In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive application of well-known Trotter formulas, for systems where the evolution is determined by a Hamiltonian with different energy scales (i.e., one part is \"large\" and another part is \"small\"). Our algorithms generate a decomposition of the evolution operator into a product of simple unitaries that are directly implementable on a quantum computer. Although the theoretical scaling is suboptimal compared with state-of-the-art algorithms (e.g., quantum signal processing), the performance of the algorithms we propose is highly competitive in practice. We illustrate this via extensive numerical simulations for several models. For instance, in the strong-field regime of the 1D transverse-field Ising model, our algorithms achieve an improvement of one order of magnitude in both the system size and evolution time that can be simulated with a fixed budget of 1000 arbitrary 2-qubit gates, compared with standard Trotter formulas.

}, url = {https://arxiv.org/abs/2403.08729}, author = {Jan Lukas Bosse and Andrew M. Childs and Charles Derby and Filippo Maria Gambetta and Ashley Montanaro and Raul A. Santos} } @article {3462, title = {Estimation of Hamiltonian parameters from thermal states}, year = {2024}, month = {1/18/2024}, abstract = {

We upper- and lower-bound the optimal precision with which one can estimate an unknown Hamiltonian parameter via measurements of Gibbs thermal states with a known temperature. The bounds depend on the uncertainty in the Hamiltonian term that contains the parameter and on the term\&$\#$39;s degree of noncommutativity with the full Hamiltonian: higher uncertainty and commuting operators lead to better precision. We apply the bounds to show that there exist entangled thermal states such that the parameter can be estimated with an error that decreases faster than 1/n\−\−\√, beating the standard quantum limit. This result governs Hamiltonians where an unknown scalar parameter (e.g. a component of a magnetic field) is coupled locally and identically to n qubit sensors. In the high-temperature regime, our bounds allow for pinpointing the optimal estimation error, up to a constant prefactor. Our bounds generalize to joint estimations of multiple parameters. In this setting, we recover the high-temperature sample scaling derived previously via techniques based on quantum state discrimination and coding theory. In an application, we show that noncommuting conserved quantities hinder the estimation of chemical potentials.

}, url = {https://arxiv.org/abs/2401.10343}, author = {Luis Pedro Garc{\'\i}a-Pintos and Kishor Bharti and Jacob Bringewatt and Hossein Dehghani and Adam Ehrenberg and Nicole Yunger Halpern and Alexey V. Gorshkov} } @article {3498, title = {Experimental roadmap for optimal state transfer and entanglement generation in power-law systems}, year = {2024}, month = {2/12/2024}, abstract = {

Experimental systems with power-law interactions have recently garnered interest as promising platforms for quantum information processing. Such systems are capable of spreading entanglement superballistically and achieving an asymptotic speed-up over locally interacting systems. Recently, protocols developed by Eldredge et al. [Phys. Rev. Lett. 119, 170503 (2017)] and Tran et al. [Phys. Rev. X 11, 031016 (2021)] for the task of transferring a quantum state between distant particles quickly were shown to be optimal and saturate theoretical bounds. However, the implementation of these protocols in physical systems with long-range interactions remains to be fully realized. In this work, we provide an experimental roadmap towards realizing fast state-transfer protocols in three classes of atomic and molecular systems with dipolar interactions: polar molecules composed of alkali-metal dimers, neutral atoms in excited Rydberg states, and atoms with strong magnetic moments (e.g. dysprosium). As a guide to near-term experimental implementation, we numerically evaluate the tradeoffs between the two protocols for small system sizes and develop methods to address potential crosstalk errors that may arise during the execution of the protocols.

}, url = {https://arxiv.org/abs/2402.07974}, author = {Andrew Y. Guo and Jeremy T. Young and Ron Belyansky and Przemyslaw Bienias and Alexey V. Gorshkov} } @article {3503, title = {High-Energy Collision of Quarks and Mesons in the Schwinger Model: From Tensor Networks to Circuit QED}, journal = {Physical Review Letters}, volume = {132}, year = {2024}, month = {2/28/2024}, abstract = {

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.

}, issn = {1079-7114}, doi = {http://dx.doi.org/10.1103/PhysRevLett.132.091903}, url = {https://arxiv.org/abs/2307.02522}, author = {Belyansky, Ron and Whitsitt, Seth and Mueller, Niklas and Fahimniya, Ali and Bennewitz, Elizabeth R. and Davoudi, Zohreh and Gorshkov, Alexey V.} } @article {3501, title = {Optimal function estimation with photonic quantum sensor networks}, journal = {Physical Review Research}, volume = {6}, year = {2024}, month = {3/6/2024}, abstract = {

The problem of optimally measuring an analytic function of unknown local parameters each linearly coupled to a qubit sensor is well understood, with applications ranging from field interpolation to noise characterization. Here, we resolve a number of open questions that arise when extending this framework to Mach-Zehnder interferometers and quadrature displacement sensing. In particular, we derive lower bounds on the achievable mean square error in estimating a linear function of either local phase shifts or quadrature displacements. In the case of local phase shifts, these results prove, and somewhat generalize, a conjecture by Proctor et al. [arXiv:1702.04271 (2017)]. For quadrature displacements, we extend proofs of lower bounds to the case of arbitrary linear functions. We provide optimal protocols achieving these bounds up to small (multiplicative) constants and describe an algebraic approach to deriving new optimal protocols, possibly subject to additional constraints. Using this approach, we prove necessary conditions for the amount of entanglement needed for any optimal protocol for both local phase and displacement sensing.

}, issn = {2643-1564}, doi = {https://doi.org/10.48550/arXiv.2401.16472}, url = {https://arxiv.org/abs/2401.16472}, author = {Bringewatt, Jacob and Ehrenberg, Adam and Goel, Tarushii and Gorshkov, Alexey V.} } @article {3485, title = {Properties and Applications of the Kirkwood-Dirac Distribution}, year = {2024}, month = {3/27/2024}, abstract = {

The most famous quasi-probability distribution, the Wigner function, has played a pivotal role in the development of a continuous-variable quantum theory that has clear analogues of position and momentum. However, the Wigner function is ill-suited for much modern quantum-information research, which is focused on finite-dimensional systems and general observables. Instead, recent years have seen the Kirkwood-Dirac (KD) distribution come to the forefront as a powerful quasi-probability distribution for analysing quantum mechanics. The KD distribution allows tools from statistics and probability theory to be applied to problems in quantum-information processing. A notable difference to the Wigner function is that the KD distribution can represent a quantum state in terms of arbitrary observables. This paper reviews the KD distribution, in three parts. First, we present definitions and basic properties of the KD distribution and its generalisations. Second, we summarise the KD distribution\&$\#$39;s extensive usage in the study or development of measurement disturbance; quantum metrology; weak values; direct measurements of quantum states; quantum thermodynamics; quantum scrambling and out-of-time-ordered correlators; and the foundations of quantum mechanics, including Leggett-Garg inequalities, the consistent-histories interpretation, and contextuality. We emphasise connections between operational quantum advantages and negative or non-real KD quasi-probabilities. Third, we delve into the KD distribution\&$\#$39;s mathematical structure. We summarise the current knowledge regarding the geometry of KD-positive states (the states for which the KD distribution is a classical probability distribution), describe how to witness and quantify KD non-positivity, and outline relationships between KD non-positivity and observables\&$\#$39; incompatibility.

}, url = {https://arxiv.org/abs/2403.18899}, author = {David R. M. Arvidsson-Shukur and William F. Braasch Jr. and Stephan De Bievre and Justin Dressel and Andrew N. Jordan and Christopher Langrenez and Matteo Lostaglio and Jeff S. Lundeen and Nicole Yunger Halpern} } @article {3508, title = {Randomized measurement protocols for lattice gauge theories}, journal = {Quantum}, volume = {8}, year = {2024}, month = {3/20/2024}, pages = {1300}, abstract = {

Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum states. While unraveling the intricate structure of quantum states is generally difficult and resource-intensive, quantum systems in nature are often tightly constrained by symmetries. This can be leveraged by the symmetry-conscious randomized measurement schemes we propose, yielding clear advantages over symmetry-blind randomization such as reducing measurement costs, enabling symmetry-based error mitigation in experiments, allowing differentiated measurement of (lattice) gauge theory entanglement structure, and, potentially, the verification of topologically ordered states in existing and near-term experiments. Crucially, unlike symmetry-blind randomized measurement protocols, these latter tasks can be performed without relearning symmetries via full reconstruction of the density matrix.

}, issn = {2521-327X}, doi = {http://dx.doi.org/10.22331/q-2024-03-27-1300}, url = {https://arxiv.org/abs/2303.15519}, author = {Bringewatt, Jacob and Kunjummen, Jonathan and Mueller, Niklas} } @article {3491, title = {Simulating Meson Scattering on Spin Quantum Simulators}, year = {2024}, month = {3/11/2024}, abstract = {

Studying high-energy collisions of composite particles, such as hadrons and nuclei, is an outstanding goal for quantum simulators. However, preparation of hadronic wave packets has posed a significant challenge, due to the complexity of hadrons and the precise structure of wave packets. This has limited demonstrations of hadron scattering on quantum simulators to date. Observations of confinement and composite excitations in quantum spin systems have opened up the possibility to explore scattering dynamics in spin models. In this article, we develop two methods to create entangled spin states corresponding to wave packets of composite particles in analog quantum simulators of Ising spin Hamiltonians. One wave-packet preparation method uses the blockade effect enabled by beyond-nearest-neighbor Ising spin interactions. The other method utilizes a quantum-bus-mediated exchange, such as the native spin-phonon coupling in trapped-ion arrays. With a focus on trapped-ion simulators, we numerically benchmark both methods and show that high-fidelity wave packets can be achieved in near-term experiments. We numerically study scattering of wave packets for experimentally realizable parameters in the Ising model and find inelastic-scattering regimes, corresponding to particle production in the scattering event, with prominent and distinct experimental signals. Our proposal, therefore, demonstrates the potential of observing inelastic scattering in near-term quantum simulators.

}, url = {https://arxiv.org/abs/2403.07061}, author = {Elizabeth R. Bennewitz and Brayden Ware and Alexander Schuckert and Alessio Lerose and Federica M. Surace and Ron Belyansky and William Morong and De Luo and Arinjoy De and Kate S. Collins and Or Katz and Christopher Monroe and Zohreh Davoudi and Alexey V. Gorshkov} } @article {3509, title = {Trainability Barriers in Low-Depth QAOA Landscapes}, year = {2024}, month = {2/15/2024}, abstract = {

The Quantum Alternating Operator Ansatz (QAOA) is a prominent variational quantum algorithm for solving combinatorial optimization problems. Its effectiveness depends on identifying input parameters that yield high-quality solutions. However, understanding the complexity of training QAOA remains an under-explored area. Previous results have given analytical performance guarantees for a small, fixed number of parameters. At the opposite end of the spectrum, barren plateaus are likely to emerge at Ω(n) parameters for n qubits. In this work, we study the difficulty of training in the intermediate regime, which is the focus of most current numerical studies and near-term hardware implementations. Through extensive numerical analysis of the quality and quantity of local minima, we argue that QAOA landscapes can exhibit a superpolynomial growth in the number of low-quality local minima even when the number of parameters scales logarithmically with n. This means that the common technique of gradient descent from randomly initialized parameters is doomed to fail beyond small n, and emphasizes the need for good initial guesses of the optimal parameters.

}, url = {https://arxiv.org/abs/2402.10188}, author = {Joel Rajakumar and John Golden and Andreas B{\"a}rtschi and Stephan Eidenbenz} } @article {3505, title = {Ultrastrong light-matter interaction in a multimode photonic crystal}, year = {2024}, month = {2/21/2024}, abstract = {

Harnessing the interaction between light and matter at the quantum level has been a central theme in atomic physics and quantum optics, with applications from quantum computation to quantum metrology. Combining complex interactions with photonic synthetic materials provides an opportunity to investigate novel quantum phases and phenomena, establishing interesting connections to condensed matter physics. Here we explore many-body phenomena with a single artificial atom coupled to the many discrete modes of a photonic crystal. This experiment reaches the ultrastrong light-matter coupling regime using the circuit quantum electrodynamics paradigm, by galvanically coupling a highly nonlinear fluxonium qubit to a tight-binding lattice of microwave resonators. In this regime, the transport of a single photon becomes a many-body problem, owing to the strong participation of multi-photon bound states arising from interactions that break particle number conservation. Exploiting the effective photon-photon interactions mediated by the qubit, the transport of multiple photons leads to complex multimode dynamics that can be employed for generating a continuous reservoir of strongly-correlated photons, an important resource for quantum networks. This work opens exciting prospects for exploring nonlinear quantum optics at the single-photon level and stabilizing entangled many-body phases of light.

}, url = {https://arxiv.org/abs/2209.14972}, author = {Andrei Vrajitoarea and Ron Belyansky and Rex Lundgren and Seth Whitsitt and Alexey V. Gorshkov and Andrew A. Houck} } @article {3257, title = {Accelerating Progress Towards Practical Quantum Advantage: The Quantum Technology Demonstration Project Roadmap}, year = {2023}, month = {3/20/2023}, abstract = {

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 \&$\#$39;quantum advantage\&$\#$39; 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.

}, url = {https://arxiv.org/abs/2210.14757}, author = {Paul Alsing and Phil Battle and Joshua C. Bienfang and Tammie Borders and Tina Brower-Thomas and Lincoln D. Carr and Fred Chong and Siamak Dadras and Brian DeMarco and Ivan Deutsch and Eden Figueroa and Danna Freedman and Henry Everitt and Daniel Gauthier and Ezekiel Johnston-Halperin and Jungsang Kim and Mackillo Kira and Prem Kumar and Paul Kwiat and John Lekki and Anjul Loiacono and Marko Lon{\v c}ar and John R. Lowell and Mikhail Lukin and Celia Merzbacher and Aaron Miller and Christopher Monroe and Johannes Pollanen and David Pappas and Michael Raymer and Ronald Reano and Brandon Rodenburg and Martin Savage and Thomas Searles and Jun Ye} } @article {3056, title = {Advantages and limitations of quantum routing}, journal = {PRX Quantum}, volume = {4}, year = {2023}, month = {2/1/2023}, abstract = {

The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform Swap for the task of permuting qubits within an architecture, which we call routing. We consider quantum routing in two models: (1) allowing arbitrary two-qubit unitaries, or (2) allowing Hamiltonians with norm-bounded interactions. We lower bound the circuit depth or time of quantum routing in terms of spectral properties of graphs representing the architecture interaction constraints, and give a generalized upper bound for all simple connected n-vertex graphs. In particular, we give conditions for a superpolynomial classical-quantum routing separation, which exclude graphs with a small spectral gap and graphs of bounded degree. Finally, we provide examples of a quadratic separation between gate-based and Hamiltonian routing models with a constant number of local ancillas per qubit and of an Ω(n) speedup if we also allow fast local interactions.

}, keywords = {Data Structures and Algorithms (cs.DS), FOS: Computer and information sciences, FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {https://doi.org/10.1103/PRXQuantum.4.010313}, url = {https://arxiv.org/abs/2206.01766}, author = {Bapat, Aniruddha and Andrew M. Childs and Alexey V. Gorshkov and Schoute, Eddie} } @article {3248, title = {Collision-resolved pressure sensing}, year = {2023}, month = {3/17/2023}, abstract = {

Heat and pressure are ultimately transmitted via quantized degrees of freedom, like gas particles and phonons. While a continuous Brownian description of these noise sources is adequate to model measurements with relatively long integration times, sufficiently precise measurements can resolve the detailed time dependence coming from individual bath-system interactions. We propose the use of nanomechanical devices operated with impulse readout sensitivity around the {\textquoteleft}{\textquoteleft}standard quantum limit\&$\#$39;\&$\#$39; to sense ultra-low gas pressures by directly counting the individual collisions of gas particles on a sensor. We illustrate this in two paradigmatic model systems: an optically levitated nanobead and a tethered membrane system in a phononic bandgap shield.

}, url = {https://arxiv.org/abs/2303.09922}, author = {Daniel S. Barker and Daniel Carney and Thomas W. LeBrun and David C. Moore and Jacob M. Taylor} } @article {3396, title = {Data Needs and Challenges of Quantum Dot Devices Automation: Workshop Report}, year = {2023}, month = {12/21/2023}, abstract = {

Gate-defined quantum dots are a promising candidate system to realize scalable, coupled qubit systems and serve as a fundamental building block for quantum computers. However, present-day quantum dot devices suffer from imperfections that must be accounted for, which hinders the characterization, tuning, and operation process. Moreover, with an increasing number of quantum dot qubits, the relevant parameter space grows sufficiently to make heuristic control infeasible. Thus, it is imperative that reliable and scalable autonomous tuning approaches are developed. In this report, we outline current challenges in automating quantum dot device tuning and operation with a particular focus on datasets, benchmarking, and standardization. We also present ideas put forward by the quantum dot community on how to overcome them.

}, doi = {https://doi.org/10.48550/arXiv.2312.14322}, url = {https://arxiv.org/abs/2312.14322}, author = {Justyna P. Zwolak and Jacob M. Taylor and Reed Andrews and Jared Benson and Garnett Bryant and Donovan Buterakos and Anasua Chatterjee and Sankar Das Sarma and Mark A. Eriksson and Eli{\v s}ka Greplov{\'a} and Michael Gullans and Fabian Hader and Tyler J. Kovach and Pranav S. Mundada and Mick Ramsey and Torbjoern Rasmussen and Brandon Severin and Anthony Sigillito and Brennan Undseth and Brian Weber} } @article {3421, title = {Digital quantum simulation of NMR experiments}, journal = {Science Advances}, volume = {9}, year = {2023}, month = {11/29/2023}, abstract = {

Simulations of nuclear magnetic resonance (NMR) experiments can be an important tool for extracting information about molecular structure and optimizing experimental protocols but are often intractable on classical computers for large molecules such as proteins and for protocols such as zero-field NMR. We demonstrate the first quantum simulation of an NMR spectrum, computing the zero-field spectrum of the methyl group of acetonitrile using four qubits of a trapped-ion quantum computer. We reduce the sampling cost of the quantum simulation by an order of magnitude using compressed sensing techniques. We show how the intrinsic decoherence of NMR systems may enable the zero-field simulation of classically hard molecules on relatively near-term quantum hardware and discuss how the experimentally demonstrated quantum algorithm can be used to efficiently simulate scientifically and technologically relevant solid-state NMR experiments on more mature devices. Our work opens a practical application for quantum computation.

}, issn = {2375-2548}, doi = {10.1126/sciadv.adh2594}, url = {https://arxiv.org/abs/2109.13298}, author = {Seetharam, Kushal and Biswas, Debopriyo and Noel, Crystal and Risinger, Andrew and Zhu, Daiwei and Katz, Or and Chattopadhyay, Sambuddha and Cetina, Marko and Monroe, Christopher and Demler, Eugene and Sels, Dries} } @article {3426, title = {The discrete adiabatic quantum linear system solver has lower constant factors than the randomized adiabatic solver}, year = {2023}, month = {12/12/2023}, abstract = {

The solution of linear systems of equations is the basis of many other quantum algorithms, and recent results provided an algorithm with optimal scaling in both the condition number κ and the allowable error ϵ [PRX Quantum \textbf{3}, 0403003 (2022)]. That work was based on the discrete adiabatic theorem, and worked out an explicit constant factor for an upper bound on the complexity. Here we show via numerical testing on random matrices that the constant factor is in practice about 1,500 times smaller than the upper bound found numerically in the previous results. That means that this approach is far more efficient than might naively be expected from the upper bound. In particular, it is over an order of magnitude more efficient than using a randomised approach from [arXiv:2305.11352] that claimed to be more efficient.

}, url = {https://arxiv.org/abs/2312.07690}, author = {Pedro C. S. Costa and Dong An and Ryan Babbush and Dominic Berry} } @article {3316, title = {Experimental Observation of Thermalization with Noncommuting Charges}, journal = {PRX Quantum}, volume = {4}, year = {2023}, month = {4/28/2023}, abstract = {

Quantum simulators have recently enabled experimental observations of quantum many-body systems\&$\#$39; internal thermalization. Often, the global energy and particle number are conserved, and the system is prepared with a well-defined particle number - in a microcanonical subspace. However, quantum evolution can also conserve quantities, or charges, that fail to commute with each other. Noncommuting charges have recently emerged as a subfield at the intersection of quantum thermodynamics and quantum information. Until now, this subfield has remained theoretical. We initiate the experimental testing of its predictions, with a trapped-ion simulator. We prepare 6-21 spins in an approximate microcanonical subspace, a generalization of the microcanonical subspace for accommodating noncommuting charges, which cannot necessarily have well-defined nontrivial values simultaneously. We simulate a Heisenberg evolution using laser-induced entangling interactions and collective spin rotations. The noncommuting charges are the three spin components. We find that small subsystems equilibrate to near a recently predicted non-Abelian thermal state. This work bridges quantum many-body simulators to the quantum thermodynamics of noncommuting charges, whose predictions can now be tested.

}, doi = {10.1103/prxquantum.4.020318}, url = {https://arxiv.org/abs/2202.04652}, author = {Florian Kranzl and Aleksander Lasek and Manoj K. Joshi and Amir Kalev and Rainer Blatt and Christian F. Roos and Nicole Yunger Halpern} } @article {3348, title = {A family of permutationally invariant quantum codes}, year = {2023}, month = {10/9/2023}, abstract = {

We construct a new family of permutationally invariant codes that correct t Pauli errors for any t\≥1. We also show that codes in the new family correct spontaneous decay errors as well as deletion errors. In many cases the codes in this family are shorter than the best previously known explicit families of permutationally invariant codes both for Pauli errors, deletions, and for the amplitude damping channel. As a separate result, we generalize the conditions for permutationally invariant codes to correct t Pauli errors from the previously known results for t=1 to any number of errors. For small t, these conditions can be used to construct new examples of codes by computer.

}, url = {https://arxiv.org/abs/2310.05358}, author = {Arda Aydin and Max A. Alekseyev and Alexander Barg} } @article {3359, title = {Fault-tolerant hyperbolic Floquet quantum error correcting codes}, year = {2023}, month = {9/18/2023}, abstract = {

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.

}, url = {https://arxiv.org/abs/2309.10033}, author = {Ali Fahimniya and Hossein Dehghani and Kishor Bharti and Sheryl Mathew and Alicia J. Koll{\'a}r and Alexey V. Gorshkov and Michael Gullans} } @article {3404, title = {Fault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes}, year = {2023}, month = {11/29/2023}, abstract = {

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 \&$\#$39;\&$\#$39;tropical\&$\#$39;\&$\#$39; 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.

}, url = {https://arxiv.org/abs/2311.17985}, author = {Jon Nelson and Gregory Bentsen and Steven T. Flammia and Michael Gullans} } @conference {3370, title = {Fixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium}, booktitle = {Advances in Cryptology {\textendash} CRYPTO 2023}, year = {2023}, month = {8/9/2023}, publisher = {Springer Nature Switzerland}, organization = {Springer Nature Switzerland}, address = {Cham}, abstract = {

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.

}, isbn = {978-3-031-38554-4}, author = {Barbosa, Manuel and Barthe, Gilles and Doczkal, Christian and Don, Jelle and Fehr, Serge and Gr{\'e}goire, Benjamin and Huang, Yu-Hsuan and H{\"u}lsing, Andreas and Lee, Yi and Wu, Xiaodi}, editor = {Handschuh, Helena and Lysyanskaya, Anna} } @article {3305, title = {High-Energy Collision of Quarks and Hadrons in the Schwinger Model: From Tensor Networks to Circuit QED}, year = {2023}, month = {7/5/2023}, abstract = {

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.

}, url = {https://arxiv.org/abs/2307.02522}, author = {Ron Belyansky and Seth Whitsitt and Niklas Mueller and Ali Fahimniya and Elizabeth R. Bennewitz and Zohreh Davoudi and Alexey V. Gorshkov} } @article {3423, title = {Improved Digital Quantum Simulation by Non-Unitary Channels}, year = {2023}, month = {7/24/2023}, abstract = {

Simulating quantum systems is one of the most promising avenues to harness the computational power of quantum computers. However, hardware errors in noisy near-term devices remain a major obstacle for applications. Ideas based on the randomization of Suzuki-Trotter product formulas have been shown to be a powerful approach to reducing the errors of quantum simulation and lowering the gate count. In this paper, we study the performance of non-unitary simulation channels and consider the error structure of channels constructed from a weighted average of unitary circuits. We show that averaging over just a few simulation circuits can significantly reduce the Trotterization error for both single-step short-time and multi-step long-time simulations. We focus our analysis on two approaches for constructing circuit ensembles for averaging: (i) permuting the order of the terms in the Hamiltonian and (ii) applying a set of global symmetry transformations. We compare our analytical error bounds to empirical performance and show that empirical error reduction surpasses our analytical estimates in most cases. Finally, we test our method on an IonQ trapped-ion quantum computer accessed via the Amazon Braket cloud platform, and benchmark the performance of the averaging approach.

}, url = {https://arxiv.org/abs/2307.13028}, author = {W. Gong and Yaroslav Kharkov and Minh C. Tran and Przemyslaw Bienias and Alexey V. Gorshkov} } @article {3401, title = {Logical quantum processor based on reconfigurable atom arrays}, journal = {Nature}, year = {2023}, month = {12/7/2023}, issn = {1476-4687}, doi = {10.1038/s41586-023-06927-3}, url = {https://arxiv.org/abs/2312.03982}, author = {Bluvstein, Dolev and Evered, Simon J. and Geim, Alexandra A. and Li, Sophie H. and Zhou, Hengyun and Manovitz, Tom and Ebadi, Sepehr and Cain, Madelyn and Kalinowski, Marcin and Dominik Hangleiter and Ataides, J. Pablo Bonilla and Maskara, Nishad and Cong, Iris and Gao, Xun and Rodriguez, Pedro Sales and Karolyshyn, Thomas and Semeghini, Giulia and Michael Gullans and Greiner, Markus and Vuletic, Vladan and Lukin, Mikhail D.} } @article {3185, title = {Lower Bounds on Quantum Annealing Times}, journal = {Phys. Rev. Lett.}, volume = {130}, year = {2023}, month = {4/5/2023}, abstract = {

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {https://doi.org/10.1103/PhysRevLett.130.140601}, url = {https://arxiv.org/abs/2210.15687}, author = {Garc{\'\i}a-Pintos, Luis Pedro and Brady, Lucas T. and Bringewatt, Jacob and Liu, Yi-Kai} } @article {3369, title = {Minimum-entanglement protocols for function estimation}, journal = {Physical Review Research}, volume = {5}, year = {2023}, month = {9/29/2023}, abstract = {

We derive a family of optimal protocols, in the sense of saturating the quantum Cram{\'e}r-Rao bound, for measuring a linear combination of d field amplitudes with quantum sensor networks, a key subprotocol of general quantum sensor network applications. We demonstrate how to select different protocols from this family under various constraints. Focusing primarily on entanglement-based constraints, we prove the surprising result that highly entangled states are not necessary to achieve optimality in many cases. Specifically, we prove necessary and sufficient conditions for the existence of optimal protocols using at most k-partite entanglement. We prove that the protocols which satisfy these conditions use the minimum amount of entanglement possible, even when given access to arbitrary controls and ancilla. Our protocols require some amount of time-dependent control, and we show that a related class of time-independent protocols fail to achieve optimal scaling for generic functions.

}, doi = {10.1103/physrevresearch.5.033228}, url = {https://arxiv.org/abs/2110.07613}, author = {Adam Ehrenberg and Jacob Bringewatt and Alexey V. Gorshkov} } @article {3055, title = {Non-Abelian eigenstate thermalization hypothesis}, journal = {Phys. Rev. Lett.}, volume = {130}, year = {2023}, month = {4/6/2023}, chapter = {140402}, abstract = {

The eigenstate thermalization hypothesis (ETH) explains why chaotic quantum many-body systems thermalize internally if the Hamiltonian lacks symmetries. If the Hamiltonian conserves one quantity (\"charge\"), the ETH implies thermalization within a charge sector -- in a microcanonical subspace. But quantum systems can have charges that fail to commute with each other and so share no eigenbasis; microcanonical subspaces may not exist. Furthermore, the Hamiltonian will have degeneracies, so the ETH need not imply thermalization. We adapt the ETH to noncommuting charges by positing a non-Abelian ETH and invoking the approximate microcanonical subspace introduced in quantum thermodynamics. Illustrating with SU(2) symmetry, we apply the non-Abelian ETH in calculating local observables\&$\#$39; time-averaged and thermal expectation values. In many cases, we prove, the time average thermalizes. However, we also find cases in which, under a physically reasonable assumption, the time average converges to the thermal average unusually slowly as a function of the global-system size. This work extends the ETH, a cornerstone of many-body physics, to noncommuting charges, recently a subject of intense activity in quantum thermodynamics.

}, keywords = {FOS: Physical sciences, High Energy Physics - Theory (hep-th), Quantum Gases (cond-mat.quant-gas), Quantum Physics (quant-ph), Statistical Mechanics (cond-mat.stat-mech), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.130.140402}, url = {https://arxiv.org/abs/2206.05310}, author = {Murthy, Chaitanya and Babakhani, Arman and Iniguez, Fernando and Srednicki, Mark and Nicole Yunger Halpern} } @article {3366, title = {Noncommuting conserved charges in quantum thermodynamics and beyond}, journal = {Nature Reviews Physics}, year = {2023}, month = {9/7/2023}, abstract = {

Thermodynamic systems typically conserve quantities (\"charges\") such as energy and particle number. The charges are often assumed implicitly to commute with each other. Yet quantum phenomena such as uncertainty relations rely on observables\&$\#$39; failure to commute. How do noncommuting charges affect thermodynamic phenomena? This question, upon arising at the intersection of quantum information theory and thermodynamics, spread recently across many-body physics. Charges\&$\#$39; noncommutation has been found to invalidate derivations of the thermal state\&$\#$39;s form, decrease entropy production, conflict with the eigenstate thermalization hypothesis, and more. This Perspective surveys key results in, opportunities for, and work adjacent to the quantum thermodynamics of noncommuting charges. Open problems include a conceptual puzzle: Evidence suggests that noncommuting charges may hinder thermalization in some ways while enhancing thermalization in others.

}, doi = {10.1038/s42254-023-00641-9}, url = {https://arxiv.org/abs/2306.00054}, author = {Shayan Majidy and William F. Braasch and Aleksander Lasek and Twesh Upadhyaya and Amir Kalev and Nicole Yunger Halpern} } @article {3262, title = {Parallelization techniques for quantum simulation of fermionic systems}, year = {2023}, month = {3/30/2023}, abstract = {

Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.

}, url = {https://arxiv.org/abs/2207.12470}, author = {Jacob Bringewatt and Zohreh Davoudi} } @article {3364, title = {Partial Syndrome Measurement for Hypergraph Product Codes}, year = {2023}, month = {9/26/2023}, abstract = {

Hypergraph product codes are a promising avenue to achieving fault-tolerant quantum computation with constant overhead. When embedding these and other constant-rate qLDPC codes into 2D, a significant number of nonlocal connections are required, posing difficulties for some quantum computing architectures. In this work, we introduce a fault-tolerance scheme that aims to alleviate the effects of implementing this nonlocality by measuring generators acting on spatially distant qubits less frequently than those which do not. We investigate the performance of a simplified version of this scheme, where the measured generators are randomly selected. When applied to hypergraph product codes and a modified small-set-flip decoding algorithm, we prove that for a sufficiently high percentage of generators being measured, a threshold still exists. We also find numerical evidence that the logical error rate is exponentially suppressed even when a large constant fraction of generators are not measured.

}, url = {https://arxiv.org/abs/2306.17122}, author = {Noah Berthusen and Daniel Gottesman} } @article {3400, title = {Quantum Algorithms for Simulating Nuclear Effective Field Theories}, year = {2023}, month = {12/8/2023}, abstract = {

Quantum computers offer the potential to simulate nuclear processes that are classically intractable. With the goal of understanding the necessary quantum resources, we employ state-of-the-art Hamiltonian-simulation methods, and conduct a thorough algorithmic analysis, to estimate the qubit and gate costs to simulate low-energy effective field theories (EFTs) of nuclear physics. In particular, within the framework of nuclear lattice EFT, we obtain simulation costs for the leading-order pionless and pionful EFTs. We consider both static pions represented by a one-pion-exchange potential between the nucleons, and dynamical pions represented by relativistic bosonic fields coupled to non-relativistic nucleons. We examine the resource costs for the tasks of time evolution and energy estimation for physically relevant scales. We account for model errors associated with truncating either long-range interactions in the one-pion-exchange EFT or the pionic Hilbert space in the dynamical-pion EFT, and for algorithmic errors associated with product-formula approximations and quantum phase estimation. Our results show that the pionless EFT is the least costly to simulate and the dynamical-pion theory is the costliest. We demonstrate how symmetries of the low-energy nuclear Hamiltonians can be utilized to obtain tighter error bounds on the simulation algorithm. By retaining the locality of nucleonic interactions when mapped to qubits, we achieve reduced circuit depth and substantial parallelization. We further develop new methods to bound the algorithmic error for classes of fermionic Hamiltonians that preserve the number of fermions, and demonstrate that reasonably tight Trotter error bounds can be achieved by explicitly computing nested commutators of Hamiltonian terms. This work highlights the importance of combining physics insights and algorithmic advancement in reducing quantum-simulation costs.

}, url = {https://arxiv.org/abs/2312.05344}, author = {James D. Watson and Jacob Bringewatt and Alexander F. Shaw and Andrew M. Childs and Alexey V. Gorshkov and Zohreh Davoudi} } @article {3355, title = {Quantum Sensing with Erasure Qubits}, year = {2023}, month = {10/2/2023}, abstract = {

The dominant noise in an \"erasure qubit\" is an erasure -- a type of error whose occurrence and location can be detected. Erasure qubits have potential to reduce the overhead associated with fault tolerance. To date, research on erasure qubits has primarily focused on quantum computing and quantum networking applications. Here, we consider the applicability of erasure qubits to quantum sensing and metrology. We show theoretically that, for the same level of noise, an erasure qubit acts as a more precise sensor or clock compared to its non-erasure counterpart. We experimentally demonstrate this by artificially injecting either erasure errors (in the form of atom loss) or dephasing errors into a differential optical lattice clock comparison, and observe enhanced precision in the case of erasure errors for the same injected error rate. Similar benefits of erasure qubits to sensing can be realized in other quantum platforms like Rydberg atoms and superconducting qubits

}, url = {https://arxiv.org/abs/2310.01512}, author = {Pradeep Niroula and Jack Dolde and Xin Zheng and Jacob Bringewatt and Adam Ehrenberg and Kevin C. Cox and Jeff Thompson and Michael Gullans and Shimon Kolkowitz and Alexey V. Gorshkov} } @article {3479, title = {Quantum Simulating Nature{\textquoteright}s Fundamental Fields}, journal = {Nature Reviews Physics}, volume = {5}, year = {2023}, month = {4/9/2024}, pages = {420{\textendash}432}, abstract = {

Simulating key static and dynamic properties of matter -- from creation in the Big Bang to evolution into sub-atomic and astrophysical environments -- arising from the underlying fundamental quantum fields of the Standard Model and their effective descriptions, lies beyond the capabilities of classical computation alone. Advances in quantum technologies have improved control over quantum entanglement and coherence to the point where robust simulations are anticipated to be possible in the foreseeable future. We discuss the emerging area of quantum simulations of Standard-Model physics, challenges that lie ahead, and opportunities for progress in the context of nuclear and high-energy physics.

}, issn = {2522-5820}, doi = {https://doi.org/10.1038/s42254-023-00599-8}, url = {https://arxiv.org/abs/2404.06298}, author = {Christian W. Bauer and Zohreh Davoudi and Natalie Klco and Martin J. Savage} } @article {3417, title = {Quantum spherical codes}, year = {2023}, month = {12/7/2023}, abstract = {

We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions while requiring a similar type of overhead. Our polytope-based cat codes consist of sets of points with large separation that at the same time form averaging sets known as spherical designs. We also recast concatenations of CSS codes with cat codes as quantum spherical codes, revealing a new way to autonomously protect against dephasing noise

}, url = {https://arxiv.org/abs/2302.11593}, author = {Shubham P. Jain and Joseph T. Iosue and Alexander Barg and Victor V. Albert} } @article {3397, title = {Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions}, year = {2023}, month = {12/14/2023}, abstract = {

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.

}, url = {https://arxiv.org/abs/2312.09733}, author = {Yuri Alexeev and Maximilian Amsler and Paul Baity and Marco Antonio Barroca and Sanzio Bassini and Torey Battelle and Daan Camps and David Casanova and Young jai Choi and Frederic T. Chong and Charles Chung and Chris Codella and Antonio D. Corcoles and James Cruise and Alberto Di Meglio and Jonathan Dubois and Ivan Duran and Thomas Eckl and Sophia Economou and Stephan Eidenbenz and Bruce Elmegreen and Clyde Fare and Ismael Faro and Cristina Sanz Fern{\'a}ndez and Rodrigo Neumann Barros Ferreira and Keisuke Fuji and Bryce Fuller and Laura Gagliardi and Giulia Galli and Jennifer R. Glick and Isacco Gobbi and Pranav Gokhale and Salvador de la Puente Gonzalez and Johannes Greiner and Bill Gropp and Michele Grossi and Emmanuel Gull and Burns Healy and Benchen Huang and Travis S. Humble and Nobuyasu Ito and Artur F. Izmaylov and Ali Javadi-Abhari and Douglas Jennewein and Shantenu Jha and Liang Jiang and Barbara Jones and Wibe Albert de Jong and Petar Jurcevic and William Kirby and Stefan Kister and Masahiro Kitagawa and Joel Klassen and Katherine Klymko and Kwangwon Koh and Masaaki Kondo and Doga Murat Kurkcuoglu and Krzysztof Kurowski and Teodoro Laino and Ryan Landfield and Matt Leininger and Vicente Leyton-Ortega and Ang Li and Meifeng Lin and Junyu Liu and Nicolas Lorente and Andre Luckow and Simon Martiel and Francisco Martin-Fernandez and Margaret Martonosi and Claire Marvinney and Arcesio Castaneda Medina and Dirk Merten and Antonio Mezzacapo and Kristel Michielsen and Abhishek Mitra and Tushar Mittal and Kyungsun Moon and Joel Moore and Mario Motta and Young-Hye Na and Yunseong Nam and Prineha Narang and Yu-ya Ohnishi and Daniele Ottaviani and Matthew Otten and Scott Pakin and Vincent R. Pascuzzi and Ed Penault and Tomasz Piontek and Jed Pitera and Patrick Rall and Gokul Subramanian Ravi and Niall Robertson and Matteo Rossi and Piotr Rydlichowski and Hoon Ryu and Georgy Samsonidze and Mitsuhisa Sato and Nishant Saurabh and Vidushi Sharma and Kunal Sharma and Soyoung Shin and George Slessman and Mathias Steiner and Iskandar Sitdikov and In-Saeng Suh and Eric Switzer and Wei Tang and Joel Thompson and Synge Todo and Minh Tran and Dimitar Trenev and Christian Trott and Huan-Hsin Tseng and Esin Tureci and David Garc{\'\i}a Valinas and Sofia Vallecorsa and Christopher Wever and Konrad Wojciechowski and Xiaodi Wu and Shinjae Yoo and Nobuyuki Yoshioka and Victor Wen-zhe Yu and Seiji Yunoki and Sergiy Zhuk and Dmitry Zubarev} } @article {3309, title = {Realization of 1D Anyons with Arbitrary Statistical Phase}, year = {2023}, month = {6/2/2023}, abstract = {

Low-dimensional quantum systems can host anyons, particles with exchange statistics that are neither bosonic nor fermionic. Despite indications of a wealth of exotic phenomena, the physics of anyons in one dimension (1D) remains largely unexplored. Here, we realize Abelian anyons in 1D with arbitrary exchange statistics using ultracold atoms in an optical lattice, where we engineer the statistical phase via a density-dependent Peierls phase. We explore the dynamical behavior of two anyons undergoing quantum walks, and observe the anyonic Hanbury Brown-Twiss effect, as well as the formation of bound states without on-site interactions. Once interactions are introduced, we observe spatially asymmetric transport in contrast to the symmetric dynamics of bosons and fermions. Our work forms the foundation for exploring the many-body behavior of 1D anyons.

}, url = {https://arxiv.org/abs/2306.01737}, author = {Joyce Kwan and Perrin Segura and Yanfei Li and Sooshin Kim and Alexey V. Gorshkov and Andr{\'e} Eckardt and Brice Bakkali-Hassani and Markus Greiner} } @article {3260, title = {On the stability of solutions to Schr{\"o}dinger{\textquoteright}s equation short of the adiabatic limit}, year = {2023}, month = {3/23/2023}, abstract = {

We prove an adiabatic theorem that applies at timescales short of the adiabatic limit. Our proof analyzes the stability of solutions to Schrodinger\&$\#$39;s equation under perturbation. We directly characterize cross-subspace effects of perturbation, which are typically significantly less than suggested by the perturbation\&$\#$39;s operator norm. This stability has numerous consequences: we can (1) find timescales where the solution of Schrodinger\&$\#$39;s equation converges to the ground state of a block, (2) lower bound the convergence to the global ground state by demonstrating convergence to some other known quantum state, (3) guarantee faster convergence than the standard adiabatic theorem when the ground state of the perturbed Hamiltonian (H) is close to that of the unperturbed H, and (4) bound tunneling effects in terms of the global spectral gap when H is {\textquoteleft}{\textquoteleft}stoquastic\&$\#$39;\&$\#$39; (a Z-matrix). Our results apply to quantum annealing protocols with faster convergence than usually guaranteed by a standard adiabatic theorem. Our upper and lower bounds demonstrate that at timescales short of the adiabatic limit, subspace dynamics can dominate over global dynamics. Thus, we see that convergence to particular target states can be understood as the result of otherwise local dynamics.

}, url = {https://arxiv.org/abs/2303.13478}, author = {Jacob Bringewatt and Michael Jarret and T. C. Mooney} } @article {3308, title = {On the Two-sided Permutation Inversion Problem}, year = {2023}, month = {6/23/2023}, abstract = {

In the permutation inversion problem, the task is to find the preimage of some challenge value, given oracle access to the permutation. This is a fundamental problem in query complexity, and appears in many contexts, particularly cryptography. In this work, we examine the setting in which the oracle allows for quantum queries to both the forward and the inverse direction of the permutation -- except that the challenge value cannot be submitted to the latter. Within that setting, we consider two options for the inversion algorithm: whether it can get quantum advice about the permutation, and whether it must produce the entire preimage (search) or only the first bit (decision). We prove several theorems connecting the hardness of the resulting variations of the inversion problem, and establish a number of lower bounds. Our results indicate that, perhaps surprisingly, the inversion problem does not become significantly easier when the adversary is granted oracle access to the inverse, provided it cannot query the challenge itself.

}, url = {https://arxiv.org/abs/2306.13729}, author = {Gorjan Alagic and Chen Bai and Alexander Poremba and Kaiyan Shi} } @article {3363, title = {Verifiable measurement-based quantum random sampling with trapped ions}, year = {2023}, month = {7/26/2023}, abstract = {

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.

}, doi = {https://doi.org/10.48550/arXiv.2307.14424}, url = {https://arxiv.org/abs/2307.14424}, author = {Martin Ringbauer and Marcel Hinsche and Thomas Feldker and Paul K. Faehrmann and Juani Bermejo-Vega and Claire Edmunds and Lukas Postler and Roman Stricker and Christian D. Marciniak and Michael Meth and Ivan Pogorelov and Rainer Blatt and Philipp Schindler and Jens Eisert and Thomas Monz and Dominik Hangleiter} } @article {3289, title = {What happens to entropy production when conserved quantities fail to commute with each other}, year = {2023}, month = {5/24/2023}, abstract = {

We extend entropy production to a deeply quantum regime involving noncommuting conserved quantities. Consider a unitary transporting conserved quantities (\"charges\") between two systems initialized in thermal states. Three common formulae model the entropy produced. They respectively cast entropy as an extensive thermodynamic variable, as an information-theoretic uncertainty measure, and as a quantifier of irreversibility. Often, the charges are assumed to commute with each other (e.g., energy and particle number). Yet quantum charges can fail to commute. Noncommutation invites generalizations, which we posit and justify, of the three formulae. Charges\&$\#$39; noncommutation, we find, breaks the formulae\&$\#$39;s equivalence. Furthermore, different formulae quantify different physical effects of charges\&$\#$39; noncommutation on entropy production. For instance, entropy production can signal contextuality - true nonclassicality - by becoming nonreal. This work opens up stochastic thermodynamics to noncommuting - and so particularly quantum - charges.

}, url = {https://arxiv.org/abs/2305.15480}, author = {Twesh Upadhyaya and William F. Braasch, Jr. and Gabriel T. Landi and Nicole Yunger Halpern} } @article {3075, title = {Certifying Temporal Correlations}, year = {2022}, month = {6/13/2022}, abstract = {

Self-testing has been established as a major approach for quantum device certification based on experimental statistics under minimal assumptions. However, despite more than 20 years of research effort most of the self-testing protocols are restricted to spatial scenarios (Bell scenarios), without any temporal generalisations known. Under the scenario of sequential measurements performed on a single quantum system, we build upon previous works which used semi-definite programming (SDP) based methods to bound sequential measurement inequalities. For such SDPs, we show that the optimiser matrix is unique and moreover this uniqueness is robust to small deviations from the quantum bound. Further, we consider a generalised scenario in presence of quantum channels and draw analogies in the structure of Bell and sequential inequalities using the pseudo-density matrix formalism. These analogies allow us to show a practical use of maximal violations of sequential inequalities in the form of certification of quantum channels up to isometries.\ 

}, url = {https://arxiv.org/abs/2206.06092}, author = {Harshank Shrotriya and Leong-Chuan Kwek, Kishor Bharti and Kishor Bharti} } @article {2930, title = {Classification of (2+1)D invertible fermionic topological phases with symmetry}, journal = {Phys. Rev. B}, volume = {105}, year = {2022}, month = {5/30/2022}, abstract = {

We provide a classification of invertible topological phases of interacting fermions with symmetry in two spatial dimensions for general fermionic symmetry groups Gf and general values of the chiral central charge c\−. Here Gf is a central extension of a bosonic symmetry group Gb by fermion parity, (\−1)F, specified by a second cohomology class [ω2]\∈H2(Gb,Z2). Our approach proceeds by gauging fermion parity and classifying the resulting Gb symmetry-enriched topological orders while keeping track of certain additional data and constraints. We perform this analysis through two perspectives, using G-crossed braided tensor categories and Spin(2c\−)1 Chern-Simons theory coupled to a background G gauge field. These results give a way to characterize and classify invertible fermionic topological phases in terms of a concrete set of data and consistency equations, which is more physically transparent and computationally simpler than the more abstract methods using cobordism theory and spectral sequences. Our results also generalize and provide a different approach to the recent classification of fermionic symmetry-protected topological phases by Wang and Gu, which have chiral central charge c\−=0. We show how the 10-fold way classification of topological insulators and superconductors fits into our scheme, along with general non-perturbative constraints due to certain choices of c\− and Gf. Mathematically, our results also suggest an explicit general parameterization of deformation classes of (2+1)D invertible topological quantum field theories with Gf symmetry.\ 

}, doi = {https://doi.org/10.1103/PhysRevB.105.235143}, url = {https://arxiv.org/abs/2109.11039}, author = {Maissam Barkeshli and Yu-An Chen and Po-Shen Hsin and Naren Manjunath} } @article {3082, title = {Closing the Locality and Detection Loopholes in Multiparticle Entanglement Self-Testing}, journal = {Physical Review Letters}, volume = {128}, year = {2022}, month = {06/23/2022}, pages = {250401}, abstract = {

First proposed by Mayers and Yao, self-testing provides a certification method to infer the underlying physics of quantum experiments in a black-box scenario. Numerous demonstrations have been reported to self-test various types of entangled states. However, all the multiparticle self-testing experiments reported so far suffer from both detection and locality loopholes. Here, we report the first experimental realization of multiparticle entanglement self-testing closing the locality loophole in a photonic system, and the detection loophole in a superconducting system, respectively. We certify three-party and four-party GHZ states with at least 0.84 (1) and 0.86 (3) fidelities in a device-independent way. These results can be viewed as a meaningful advance in multiparticle loophole-free self-testing, and also significant progress on the foundations of quantum entanglement certification.

}, doi = {https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.128.250401}, url = {https://www.researchgate.net/profile/Dian-Wu/publication/361497881_Closing_the_Locality_and_Detection_Loopholes_in_Multiparticle_Entanglement_Self-Testing/links/62b55a8c1010dc02cc57530c/Closing-the-Locality-and-Detection-Loopholes-in-Multiparticle-Entangl}, author = {Dian Wu and Qi Zhao and Can Wang and Liang Huang and Yang-Fan Jiang and Bing Bai and You Zhou and Xue-Mei Gu and Feng-Ming Liu and Ying-Qiu Mao and Qi-Chao Sun and Ming-Cheng Chen and Jun Zhang and Cheng-Zhi Peng and Xiao-Bo Zhu and Qiang Zhang and Chao-Yang Lu and Jian-Wei Pan} } @article {3144, title = {Codimension-2 defects and higher symmetries in (3+1)D topological phases}, year = {2022}, month = {8/15/2022}, abstract = {

(3+1)D topological phases of matter can host a broad class of non-trivial topological defects of codimension-1, 2, and 3, of which the well-known point charges and flux loops are special cases. The complete algebraic structure of these defects defines a higher category, and can be viewed as an emergent higher symmetry. This plays a crucial role both in the classification of phases of matter and the possible fault-tolerant logical operations in topological quantum error correcting codes. In this paper, we study several examples of such higher codimension defects from distinct perspectives. We mainly study a class of invertible codimension-2 topological defects, which we refer to as twist strings. We provide a number of general constructions for twist strings, in terms of gauging lower dimensional invertible phases, layer constructions, and condensation defects. We study some special examples in the context of Z2 gauge theory with fermionic charges, in Z2\×Z2 gauge theory with bosonic charges, and also in non-Abelian discrete gauge theories based on dihedral (Dn) and alternating (A6) groups. The intersection between twist strings and Abelian flux loops sources Abelian point charges, which defines an H4 cohomology class that characterizes part of an underlying 3-group symmetry of the topological order. The equations involving background gauge fields for the 3-group symmetry have been explicitly written down for various cases. We also study examples of twist strings interacting with non-Abelian flux loops (defining part of a non-invertible higher symmetry), examples of non-invertible codimension-2 defects, and examples of interplay of codimension-2 defects with codimension-1 defects. We also find an example of geometric, not fully topological, twist strings in (3+1)D A6 gauge theory.

}, keywords = {FOS: Mathematics, FOS: Physical sciences, High Energy Physics - Theory (hep-th), Mathematical Physics (math-ph), Quantum Algebra (math.QA), Quantum Physics (quant-ph), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {10.48550/ARXIV.2208.07367}, url = {https://arxiv.org/abs/2208.07367}, author = {Barkeshli, Maissam and Chen, Yu-An and Huang, Sheng-Jie and Kobayashi, Ryohei and Tantivasadakarn, Nathanan and Zhu, Guanyu} } @article {3007, title = {Convex optimization for non-equilibrium steady states on a hybrid quantum processor}, year = {2022}, month = {4/7/2022}, abstract = {

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semi-definite program, we bypass several well known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {https://doi.org/10.48550/arXiv.2204.03203}, url = {https://arxiv.org/abs/2204.03203}, author = {Lau, Jonathan Wei Zhong and Lim, Kian Hwee and Bharti, Kishor and Kwek, Leong-Chuan and Vinjanampathy, Sai} } @article {3128, title = {CoVault: A Secure Analytics Platform}, year = {2022}, month = {8/7/2022}, abstract = {

In a secure analytics platform, data sources consent to the exclusive use of their data for a pre-defined set of analytics queries performed by a specific group of analysts, and for a limited period. If the platform is secure under a sufficiently strong threat model, it can provide the missing link to enabling powerful analytics of sensitive personal data, by alleviating data subjects\&$\#$39; concerns about leakage and misuse of data. For instance, many types of powerful analytics that benefit public health, mobility, infrastructure, finance, or sustainable energy can be made differentially private, thus alleviating concerns about privacy. However, no platform currently exists that is sufficiently secure to alleviate concerns about data leakage and misuse; as a result, many types of analytics that would be in the interest of data subjects and the public are not done. CoVault uses a new multi-party implementation of functional encryption (FE) for secure analytics, which relies on a unique combination of secret sharing, multi-party secure computation (MPC), and different trusted execution environments (TEEs). CoVault is secure under a very strong threat model that tolerates compromise and side-channel attacks on any one of a small set of parties and their TEEs. Despite the cost of MPC, we show that CoVault scales to very large data sizes using map-reduce based query parallelization. For example, we show that CoVault can perform queries relevant to epidemic analytics at scale.

}, keywords = {and Cluster Computing (cs.DC), Cryptography and Security (cs.CR), Distributed, FOS: Computer and information sciences, Parallel}, doi = {10.48550/ARXIV.2208.03784}, url = {https://arxiv.org/abs/2208.03784}, author = {De Viti, Roberta and Sheff, Isaac and Glaeser, Noemi and Dinis, Baltasar and Rodrigues, Rodrigo and Katz, Jonathan and Bhattacharjee, Bobby and Hithnawi, Anwar and Garg, Deepak and Druschel, Peter} } @article {3013, title = {Deconfinement and Error Thresholds in Holography}, year = {2022}, month = {2/9/2022}, abstract = {

We study the error threshold properties of holographic quantum error-correcting codes. We demonstrate that holographic CFTs admit an algebraic threshold, which is related to the confinement-deconfinement phase transition. We then apply geometric intuition from holography and the Hawking-Page phase transition to motivate the CFT result, and comment on potential extensions to other confining theories.

}, keywords = {FOS: Physical sciences, High Energy Physics - Theory (hep-th), Nuclear Theory (nucl-th), Quantum Physics (quant-ph), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {10.48550/ARXIV.2202.04710}, url = {https://arxiv.org/abs/2202.04710}, author = {Bao, Ning and Cao, Charles and Zhu, Guanyu} } @article {3127, title = {Disordered Lieb-Robinson bounds in one dimension}, year = {2022}, month = {8/10/2022}, abstract = {

By tightening the conventional Lieb-Robinson bounds to better handle systems which lack translation invariance, we determine the extent to which \"weak links\" suppress operator growth in disordered one-dimensional spin chains. In particular, we prove that ballistic growth is impossible when the distribution of coupling strengths μ(J) has a sufficiently heavy tail at small J, and identify the correct dynamical exponent to use instead. Furthermore, through a detailed analysis of the special case in which the couplings are genuinely random and independent, we find that the standard formulation of Lieb-Robinson bounds is insufficient to capture the complexity of the dynamics -- we must distinguish between bounds which hold for all sites of the chain and bounds which hold for a subsequence of sites, and we show by explicit example that these two can have dramatically different behaviors. All the same, our result for the dynamical exponent is tight, in that we prove by counterexample that there cannot exist any Lieb-Robinson bound with a smaller exponent. We close by discussing the implications of our results, both major and minor, for numerous applications ranging from quench dynamics to the structure of ground states.

}, keywords = {Disordered Systems and Neural Networks (cond-mat.dis-nn), FOS: Physical sciences, Mathematical Physics (math-ph), Quantum Physics (quant-ph)}, doi = {10.48550/ARXIV.2208.05509}, url = {https://arxiv.org/abs/2208.05509}, author = {Baldwin, Christopher L. and Ehrenberg, Adam and Guo, Andrew Y. and Alexey V. Gorshkov} } @article {3081, title = {Estimating gate complexities for the site-by-site preparation of fermionic vacua}, year = {2022}, month = {07/04/2022}, abstract = {

An important aspect of quantum simulation is the preparation of physically interesting states on a quantum computer, and this task can often be costly or challenging to implement. A digital, {\textquoteleft}{\textquoteleft}site-by-site\&$\#$39;\&$\#$39; scheme of state preparation was introduced in arXiv:1911.03505 as a way to prepare the vacuum state of certain fermionic field theory Hamiltonians with a mass gap. More generally, this algorithm may be used to prepare ground states of Hamiltonians by adding one site at a time as long as successive intermediate ground states share a non-zero overlap and the Hamiltonian has a non-vanishing spectral gap at finite lattice size. In this paper, we study the ground state overlap as a function of the number of sites for a range of quadratic fermionic Hamiltonians. Using analytical formulas known for free fermions, we are able to explore the large-N behavior and draw conclusions about the state overlap. For all models studied, we find that the overlap remains large (e.g. \>0.1) up to large lattice sizes (N=64,72) except near quantum phase transitions or in the presence of gapless edge modes. For one-dimensional systems, we further find that two N/2-site ground states also share a large overlap with the N-site ground state everywhere except a region near the phase boundary. Based on these numerical results, we additionally propose a recursive alternative to the site-by-site state preparation algorithm.

}, url = {https://arxiv.org/abs/2207.01692}, author = {Troy Sewell and Aniruddha Bapat and Stephen Jordan} } @article {3139, title = {Experimental Implementation of an Efficient Test of Quantumness}, year = {2022}, month = {9/28/2022}, abstract = {

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\&$\#$39;s success.

}, keywords = {FOS: Physical sciences, Other Condensed Matter (cond-mat.other), Quantum Physics (quant-ph)}, doi = {10.48550/ARXIV.2209.14316}, url = {https://arxiv.org/abs/2209.14316}, author = {Lewis, Laura and Zhu, Daiwei and Gheorghiu, Alexandru and Noel, Crystal and Katz, Or and Harraz, Bahaa and Wang, Qingfeng and Risinger, Andrew and Feng, Lei and Biswas, Debopriyo and Egan, Laird and Vidick, Thomas and Cetina, Marko and Monroe, Christopher} } @article {3002, title = {Experimental observation of thermalisation with noncommuting charges}, year = {2022}, month = {2/9/2022}, abstract = {

Quantum simulators have recently enabled experimental observations of quantum many-body systems\&$\#$39; internal thermalisation. Often, the global energy and particle number are conserved, and the system is prepared with a well-defined particle number - in a microcanonical subspace. However, quantum evolution can also conserve quantities, or charges, that fail to commute with each other. Noncommuting charges have recently emerged as a subfield at the intersection of quantum thermodynamics and quantum information. Until now, this subfield has remained theoretical. We initiate the experimental testing of its predictions, with a trapped-ion simulator. We prepare 6-15 spins in an approximate microcanonical subspace, a generalisation of the microcanonical subspace for accommodating noncommuting charges, which cannot necessarily have well-defined nontrivial values simultaneously. We simulate a Heisenberg evolution using laser-induced entangling interactions and collective spin rotations. The noncommuting charges are the three spin components. We find that small subsystems equilibrate to near a recently predicted non-Abelian thermal state. This work bridges quantum many-body simulators to the quantum thermodynamics of noncommuting charges, whose predictions can now be tested.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph), Statistical Mechanics (cond-mat.stat-mech)}, doi = {10.48550/ARXIV.2202.04652}, url = {https://arxiv.org/abs/2202.04652}, author = {Kranzl, Florian and Lasek, Aleksander and Joshi, Manoj K. and Kalev, Amir and Blatt, Rainer and Roos, Christian F. and Nicole Yunger Halpern} } @article {3077, title = {Experimentally Measuring Rolling and Sliding in Three-Dimensional Dense Granular Packings}, journal = {Phys. Rev. Lett.}, volume = {129}, year = {2022}, month = {06/18/2022}, pages = {048001}, abstract = {

We experimentally measure a three-dimensional (3D) granular system\’s reversibility under cyclic compression. We image the grains using a refractive-index-matched fluid, then analyze the images using the artificial intelligence of variational autoencoders. These techniques allow us to track all the grains\’ translations and 3D rotations with accuracy sufficient to infer sliding and rolling displacements. Our observations reveal unique roles played by 3D rotational motions in granular flows. We find that rotations and contact-point motion dominate the dynamics in the bulk, far from the perturbation\’s source. Furthermore, we determine that 3D rotations are irreversible under cyclic compression. Consequently, contact-point sliding, which is dissipative, accumulates throughout the cycle. Using numerical simulations whose accuracy our experiment supports, we discover that much of the dissipation occurs in the bulk, where grains rotate more than they translate. Our observations suggest that the analysis of 3D rotations is needed for understanding granular materials\’ unique and powerful ability to absorb and dissipate energy.

}, doi = {https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.129.048001}, url = {https://arxiv.org/abs/2108.11975}, author = {Zackery A. Benson and Anton Peshkov and Nicole Yunger Halpern and Derek C. Richardson and Wolfgang Losert} } @article {3122, title = {Extracting Wilson loop operators and fractional statistics from a single bulk ground state}, year = {2022}, month = {9/28/2022}, abstract = {

An essential aspect of topological phases of matter is the existence of Wilson loop operators that keep the ground state subspace invariant. Here we present and implement an unbiased numerical optimization scheme to systematically find the Wilson loop operators given a single ground state wave function of a gapped Hamiltonian on a disk. We then show how these Wilson loop operators can be cut and glued through further optimization to give operators that can create, move, and annihilate anyon excitations. We subsequently use these operators to determine the braiding statistics and topological twists of the anyons, yielding a way to fully extract topological order from a single wave function. We apply our method to the ground state of the perturbed toric code and doubled semion models with a magnetic field that is up to a half of the critical value. From a contemporary perspective, this can be thought of as a machine learning approach to discover emergent 1-form symmetries of a ground state wave function. From an application perspective, our approach can be relevant to find Wilson loop operators in current quantum simulators.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {10.48550/ARXIV.2209.14302}, url = {https://arxiv.org/abs/2209.14302}, author = {Cian, Ze-Pei and Hafezi, Mohammad and Barkeshli, Maissam} } @article {3190, title = {Higher-group symmetry in finite gauge theory and stabilizer codes}, year = {2022}, month = {11/21/2022}, abstract = {

A large class of gapped phases of matter can be described by topological finite group gauge theories. In this paper, we derive the d-group global symmetry and its \&$\#$39;t Hooft anomaly for topological finite group gauge theories in (d+1) space-time dimensions, including non-Abelian gauge groups and Dijkgraaf-Witten twists. We focus on the 1-form symmetry generated by invertible (Abelian) magnetic defects and the higher-form symmetries generated by invertible topological defects decorated with lower dimensional gauged symmetry-protected topological (SPT) phases. We show that due to a generalization of the Witten effect and charge-flux attachment, the 1-form symmetry generated by the magnetic defects mixes with other symmetries into a higher group. We describe such higher-group symmetry in various lattice model examples. We discuss several applications, including the classification of fermionic SPT phases in (3+1)D for general fermionic symmetry groups, where we also derive a simpler formula for the [O5]\∈H5(BG,U(1)) obstruction than has appeared in previous work. We also show how the d-group symmetry is related to fault-tolerant non-Pauli logical gates and a refined Clifford hierarchy in stabilizer codes. We construct new logical gates in stabilizer codes using the d-group symmetry, such as the control-Z gate in (3+1)D Z2 toric code.

}, keywords = {FOS: Mathematics, FOS: Physical sciences, High Energy Physics - Theory (hep-th), Quantum Algebra (math.QA), Quantum Physics (quant-ph), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {10.48550/ARXIV.2211.11764}, url = {https://arxiv.org/abs/2211.11764}, author = {Barkeshli, Maissam and Chen, Yu-An and Hsin, Po-Shen and Kobayashi, Ryohei} } @article {2607, title = {Implementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions}, journal = {Phys. Rev. Research}, volume = {4}, year = {2022}, month = {10/27/2022}, abstract = {

The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as 1/rα in the distance r provide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. Our implementation allows the quantum Fourier transform (QFT) and Shor\&$\#$39;s algorithm to be performed on a D-dimensional lattice in time logarithmic in the number of qubits for interactions with α\≤D. As a corollary, we show that power-law systems with α\≤D are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable. Complementarily, we develop a new technique to give a general lower bound, linear in the size of the system, on the time required to implement the QFT and the fanout gate in systems that are constrained by a linear light cone. This allows us to prove an asymptotically tighter lower bound for long-range systems than is possible with previously available techniques.\ 

}, doi = {https://doi.org/10.1103/PhysRevResearch.4.L042016}, url = {https://arxiv.org/abs/2007.00662}, author = {Andrew Y. Guo and Abhinav Deshpande and Su-Kuan Chu and Zachary Eldredge and Przemyslaw Bienias and Dhruv Devulapalli and Yuan Su and Andrew M. Childs and Alexey V. Gorshkov} } @article {3135, title = {Isolation and manipulation of a single-donor detector in a silicon quantum dot}, journal = {Phys. Rev. B}, volume = {106}, year = {2022}, month = {9/27/2022}, pages = {125423}, abstract = {

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\&$\#$39;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.

}, doi = {10.1103/PhysRevB.106.125423}, url = {https://link.aps.org/doi/10.1103/PhysRevB.106.125423}, author = {Lasek, A. A. and Barnes, C. H. W. and Ferrus, T.} } @article {3054, title = {Negative Quasiprobabilities Enhance Phase Estimation in Quantum-Optics Experiment}, journal = {Phys. Rev. Lett.}, volume = {128}, year = {2022}, month = {6/2/2022}, pages = {220504}, abstract = {

Operator noncommutation, a hallmark of quantum theory, limits measurement precision, according to uncertainty principles. Wielded correctly, though, noncommutation can boost precision. A recent foundational result relates a metrological advantage with negative quasiprobabilities\—quantum extensions of probabilities\—engendered by noncommuting operators. We crystallize the relationship in an equation that we prove theoretically and observe experimentally. Our proof-of-principle optical experiment features a filtering technique that we term partially postselected amplification (PPA). Using PPA, we measure a wave plate\’s birefringent phase. PPA amplifies, by over two orders of magnitude, the information obtained about the phase per detected photon. In principle, PPA can boost the information obtained from the average filtered photon by an arbitrarily large factor. The filter\’s amplification of systematic errors, we find, bounds the theoretically unlimited advantage in practice. PPA can facilitate any phase measurement and mitigates challenges that scale with trial number, such as proportional noise and detector saturation. By quantifying PPA\’s metrological advantage with quasiprobabilities, we reveal deep connections between quantum foundations and precision measurement.

}, doi = {10.1103/PhysRevLett.128.220504}, url = {https://link.aps.org/doi/10.1103/PhysRevLett.128.220504}, author = {Lupu-Gladstein, Noah and Yilmaz, Y. Batuhan and Arvidsson-Shukur, David R. M. and Brodutch, Aharon and Pang, Arthur O. T. and Steinberg, Aephraim M. and Nicole Yunger Halpern} } @article {3076, title = {NISQ algorithm for the matrix elements of a generic observable}, year = {2022}, month = {5/20/2022}, abstract = {

The calculation of off-diagonal matrix elements has various applications in fields such as nuclear physics and quantum chemistry. In this paper, we present a noisy intermediate scale quantum algorithm for estimating the diagonal and off-diagonal matrix elements of a generic observable in the energy eigenbasis of a given Hamiltonian. Several numerical simulations indicate that this approach can find many of the matrix elements even when the trial functions are randomly initialized across a wide range of parameter values without, at the same time, the need to prepare the energy eigenstates.\ 

}, url = {https://arxiv.org/abs/2205.10058}, author = {Rebecca Erbanni and Kishor Bharti and Leong-Chuan Kwek and Dario Poletti} } @article {3196, title = {Optimal scaling quantum linear systems solver via discrete adiabatic theorem}, journal = {PRX Quantum}, volume = {3}, year = {2022}, month = {10/7/2022}, pages = {040303}, abstract = {

Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure. However, the most efficient of those procedures is still asymptotically sub-optimal by a factor of log(κ). Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete time evolutions. We use this discrete adiabatic theorem to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity. Our O(κlog(1/ϵ)) complexity is also optimal in terms of the combined scaling in κ and the precision ϵ. Compared to existing suboptimal methods, our algorithm is simpler and easier to implement. Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {https://journals.aps.org/prxquantum/pdf/10.1103/PRXQuantum.3.040303}, url = {https://arxiv.org/abs/2111.08152}, author = {Costa, Pedro C. S. and Dong An and Sanders, Yuval R. and Su, Yuan and Babbush, Ryan and Berry, Dominic W.} } @article {2931, title = {Post-Quantum Security of the Even-Mansour Cipher}, journal = {Eurocrypt}, year = {2022}, month = {12/14/2021}, abstract = {

The Even-Mansour cipher is a simple method for constructing a (keyed) pseudorandom permutation E from a public random permutation~P:{0,1}n\→{0,1}n. It is secure against classical attacks, with optimal attacks requiring qE queries to E and qP queries to P such that qE\⋅qP\≈2n. If the attacker is given \emph{quantum} access to both E and P, however, the cipher is completely insecure, with attacks using qE,qP=O(n) queries known. In any plausible real-world setting, however, a quantum attacker would have only \emph{classical} access to the keyed permutation~E implemented by honest parties, even while retaining quantum access to~P. Attacks in this setting with qE\⋅q2P\≈2n are known, showing that security degrades as compared to the purely classical case, but leaving open the question as to whether the Even-Mansour cipher can still be proven secure in this natural, \"post-quantum\" setting. We resolve this question, showing that any attack in that setting requires qE\⋅q2P+qP\⋅q2E\≈2n. Our results apply to both the two-key and single-key variants of Even-Mansour. Along the way, we establish several generalizations of results from prior work on quantum-query lower bounds that may be of independent interest.\ 

}, doi = {https://doi.org/10.48550/arXiv.2112.07530}, url = {https://arxiv.org/abs/2112.07530}, author = {Gorjan Alagic and Chen Bai and Jonathan Katz and Christian Majenz} } @article {3201, title = {Post-Quantum Security of the (Tweakable) FX Construction, and Applications}, year = {2022}, month = {8/29/2022}, abstract = {

The FX construction provides a way to increase the effective key length of a block cipher E. We prove security of a tweakable version of the FX construction in the post-quantum setting, i.e., against a quantum attacker given only classical access to the secretly keyed construction while retaining quantum access to E, a setting that seems to be the most relevant one for real-world applications. We then use our results to prove post-quantum security\—in the same model\—of the (plain) FX construction, Elephant (a finalist of NIST\&$\#$39;s lightweight cryptography standardization effort), and Chaskey (an ISO-standardized lightweight MAC

}, url = {https://eprint.iacr.org/2022/1097}, author = {Gorjan Alagic and Chen Bai and Jonathan Katz and Christian Majenz and Patrick Struck} } @article {2996, title = {Quantum Routing with Teleportation}, year = {2022}, month = {4/8/2022}, abstract = {

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation - showing an O(NlogN\−\−\−\−\−\−\−\√) upper bound on the separation in routing time for any interaction graph - and give tighter bounds for some common classes of graphs.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {10.48550/ARXIV.2204.04185}, url = {https://arxiv.org/abs/2204.04185}, author = {Devulapalli, Dhruv and Schoute, Eddie and Bapat, Aniruddha and Andrew M. Childs and Alexey V. Gorshkov} } @article {2997, title = {Quantum Simulation for High Energy Physics}, year = {2022}, month = {4/7/2022}, abstract = {

It is for the first time that Quantum Simulation for High Energy Physics (HEP) is studied in the U.S. decadal particle-physics community planning, and in fact until recently, this was not considered a mainstream topic in the community. This fact speaks of a remarkable rate of growth of this subfield over the past few years, stimulated by the impressive advancements in Quantum Information Sciences (QIS) and associated technologies over the past decade, and the significant investment in this area by the government and private sectors in the U.S. and other countries. High-energy physicists have quickly identified problems of importance to our understanding of nature at the most fundamental level, from tiniest distances to cosmological extents, that are intractable with classical computers but may benefit from quantum advantage. They have initiated, and continue to carry out, a vigorous program in theory, algorithm, and hardware co-design for simulations of relevance to the HEP mission. This community whitepaper is an attempt to bring this exciting and yet challenging area of research to the spotlight, and to elaborate on what the promises, requirements, challenges, and potential solutions are over the next decade and beyond.

}, keywords = {FOS: Physical sciences, High Energy Physics - Lattice (hep-lat), High Energy Physics - Phenomenology (hep-ph), High Energy Physics - Theory (hep-th), Nuclear Theory (nucl-th), Quantum Physics (quant-ph)}, doi = {10.48550/ARXIV.2204.03381}, url = {https://arxiv.org/abs/2204.03381}, author = {Bauer, Christian W. and Zohreh Davoudi and Balantekin, A. Baha and Bhattacharya, Tanmoy and Carena, Marcela and de Jong, Wibe A. and Draper, Patrick and El-Khadra, Aida and Gemelke, Nate and Hanada, Masanori and Kharzeev, Dmitri and Lamm, Henry and Li, Ying-Ying and Liu, Junyu and Lukin, Mikhail and Meurice, Yannick and Monroe, Christopher and Nachman, Benjamin and Pagano, Guido and Preskill, John and Rinaldi, Enrico and Roggero, Alessandro and Santiago, David I. and Savage, Martin J. and Siddiqi, Irfan and Siopsis, George and Van Zanten, David and Wiebe, Nathan and Yamauchi, Yukari and Yeter-Aydeniz, K{\"u}bra and Zorzetti, Silvia} } @article {3009, title = {Self-Testing of a Single Quantum System: Theory and Experiment}, year = {2022}, month = {3/17/2022}, abstract = {

Certifying individual quantum devices with minimal assumptions is crucial for the development of quantum technologies. Here, we investigate how to leverage single-system contextuality to realize self-testing. We develop a robust self-testing protocol based on the simplest contextuality witness for the simplest contextual quantum system, the Klyachko-Can-Binicio{\u g}lu-Shumovsky (KCBS) inequality for the qutrit. We establish a lower bound on the fidelity of the state and the measurements (to an ideal configuration) as a function of the value of the witness under a pragmatic assumption on the measurements we call the KCBS orthogonality condition. We apply the method in an experiment with randomly chosen measurements on a single trapped 40Ca+ and near-perfect detection efficiency. The observed statistics allow us to self-test the system and provide the first experimental demonstration of quantum self-testing of a single system. Further, we quantify and report that deviations from our assumptions are minimal, an aspect previously overlooked by contextuality experiments.

}, keywords = {Atomic Physics (physics.atom-ph), FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {https://doi.org/10.48550/arXiv.2203.09003}, url = {https://arxiv.org/abs/2203.09003}, author = {Hu, Xiao-Min and Xie, Yi and Arora, Atul Singh and Ai, Ming-Zhong and Bharti, Kishor and Zhang, Jie and Wu, Wei and Chen, Ping-Xing and Cui, Jin-Ming and Liu, Bi-Heng and Huang, Yun-Feng and Li, Chuan-Feng and Guo, Guang-Can and Roland, J{\'e}r{\'e}mie and Cabello, Ad{\'a}n and Kwek, Leong-Chuan} } @article {3071, title = {Simulation Complexity of Many-Body Localized Systems}, year = {2022}, month = {5/25/2022}, abstract = {

We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of motion (LIOMs), we demonstrate a transition in the classical complexity of simulating such systems as a function of evolution time. On one side, we construct a quasipolynomial-time tensor-network-inspired algorithm for strong simulation of 1D MBL systems (i.e., calculating the expectation value of arbitrary products of local observables) evolved for any time polynomial in the system size. On the other side, we prove that even weak simulation, i.e. sampling, becomes formally hard after an exponentially long evolution time, assuming widely believed conjectures in complexity theory. Finally, using the consequences of our classical simulation results, we also show that the quantum circuit complexity for MBL systems is sublinear in evolution time. This result is a counterpart to a recent proof that the complexity of random quantum circuits grows linearly in time.\ 

}, url = {https://arxiv.org/abs/2205.12967}, author = {Adam Ehrenberg and Abhinav Deshpande and Christopher L. Baldwin and Dmitry A. Abanin and Alexey V. Gorshkov} } @article {3018, title = {Simultaneous Stoquasticity}, journal = {Phys. Rev. A}, volume = {105}, year = {2022}, month = {06/09/2022}, abstract = {

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {https://doi.org/10.1103/PhysRevA.105.062601}, url = {https://arxiv.org/abs/2202.08863}, author = {Jacob Bringewatt and Brady, Lucas T.} } @article {3000, title = {Snowmass 2021 White Paper: The Windchime Project}, year = {2022}, month = {3/14/2022}, abstract = {

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.

}, keywords = {Cosmology and Nongalactic Astrophysics (astro-ph.CO), FOS: Physical sciences, High Energy Physics - Experiment (hep-ex), High Energy Physics - Phenomenology (hep-ph)}, doi = {10.48550/ARXIV.2203.07242}, url = {https://arxiv.org/abs/2203.07242}, author = {The Windchime Collaboration and Attanasio, Alaina and Bhave, Sunil A. and Blanco, Carlos and Carney, Daniel and Demarteau, Marcel and Elshimy, Bahaa and Febbraro, Michael and Feldman, Matthew A. and Ghosh, Sohitri and Hickin, Abby and Hong, Seongjin and Lang, Rafael F. and Lawrie, Benjamin and Li, Shengchao and Liu, Zhen and Maldonado, Juan P. A. and Marvinney, Claire and Oo, Hein Zay Yar and Pai, Yun-Yi and Pooser, Raphael and Qin, Juehang and Sparmann, Tobias J. and Taylor, Jacob M. and Tian, Hao and Tunnell, Christopher} } @article {3008, title = {Spectral Form Factor of a Quantum Spin Glass}, year = {2022}, month = {4/4/2022}, abstract = {

It is widely expected that systems which fully thermalize are chaotic in the sense of exhibiting random-matrix statistics of their energy level spacings, whereas integrable systems exhibit Poissonian statistics. In this paper, we investigate a third class: spin glasses. These systems are partially chaotic but do not achieve full thermalization due to large free energy barriers. We examine the level spacing statistics of a canonical infinite-range quantum spin glass, the quantum p-spherical model, using an analytic path integral approach. We find statistics consistent with a direct sum of independent random matrices, and show that the number of such matrices is equal to the number of distinct metastable configurations -- the exponential of the spin glass \"complexity\" as obtained from the quantum Thouless-Anderson-Palmer equations. We also consider the statistical properties of the complexity itself and identify a set of contributions to the path integral which suggest a Poissonian distribution for the number of metastable configurations. Our results show that level spacing statistics can probe the ergodicity-breaking in quantum spin glasses and provide a way to generalize the notion of spin glass complexity beyond models with a semi-classical limit.

}, keywords = {Disordered Systems and Neural Networks (cond-mat.dis-nn), FOS: Physical sciences, High Energy Physics - Theory (hep-th), Statistical Mechanics (cond-mat.stat-mech), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {https://doi.org/10.48550/arXiv.2203.12753}, url = {https://arxiv.org/abs/2203.12753}, author = {Winer, Michael and Barney, Richard and Christopher L. Baldwin and Galitski, Victor and Swingle, Brian} } @article {3069, title = {Topological Edge Mode Tapering}, year = {2022}, month = {6/14/2022}, abstract = {

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.

}, url = {https://arxiv.org/abs/2206.07056}, author = {Christopher J. Flower and Sabyasachi Barik and Sunil Mittal and Mohammad Hafezi} } @article {3120, title = {Ultrastrong light-matter interaction in a photonic crystal}, year = {2022}, month = {9/29/2022}, abstract = {

Harnessing the interaction between light and matter at the quantum level has been a central theme in the fields of atomic physics and quantum optics, with applications from quantum computation to quantum metrology. Combining complex interactions with photonic synthetic materials provides an opportunity to investigate novel quantum phases and phenomena, establishing interesting connections to condensed matter physics. Here we explore many-body phenomena with a single artificial atom coupled to the many discrete modes of a photonic crystal. This experiment reaches the ultrastrong light-matter coupling regime using the circuit QED paradigm, by galvanically coupling a highly nonlinear fluxonium qubit to a tight-binding lattice of microwave resonators. In this regime, the transport of a single photon is strongly modified by the presence of multi-photon bound states, owing to interactions that break particle number conservation. Exploiting the effective photon-photon interactions mediated by the qubit, the driven system can be configured as a continuous reservoir of strongly-correlated photons, a resource of interest for quantum networks. This work opens exciting prospects for exploring nonlinear quantum optics at the single-photon level and stabilizing entangled many-body phases of light.

}, keywords = {FOS: Physical sciences, Quantum Gases (cond-mat.quant-gas), Quantum Physics (quant-ph)}, doi = {10.48550/ARXIV.2209.14972}, url = {https://arxiv.org/abs/2209.14972}, author = {Vrajitoarea, Andrei and Belyansky, Ron and Lundgren, Rex and Whitsitt, Seth and Alexey V. Gorshkov and Houck, Andrew A.} } @article {3020, title = {Unlimited non-causal correlations and their relation to non-locality}, journal = {Quantum}, volume = {6}, year = {2022}, month = {3/22/2022}, pages = {673}, abstract = {

Non-causal correlations certify the lack of a definite causal order among localized space-time regions. In stark contrast to scenarios where a single region influences its own causal past, some processes that distribute non-causal correlations satisfy a series of natural desiderata: logical consistency, linear and reversible dynamics, and computational tameness. Here, we present such processes among arbitrary many regions where each region influences every other but itself, and show that the above desiderata are altogether insufficient to limit the amount of \"acausality\" of non-causal correlations. This leaves open the identification of a principle that forbids non-causal correlations. Our results exhibit qualitative and quantitative parallels with the non-local correlations due to Ardehali and Svetlichny.

}, doi = {https://doi.org/10.22331\%2Fq-2022-03-29-673}, url = {https://arxiv.org/abs/2104.06234}, author = {{\"A}min Baumeler and Amin Shiraz Gilani and Jibran Rashid} } @article {2809, title = {Behavior of Analog Quantum Algorithms}, year = {2021}, month = {7/2/2021}, abstract = {

Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the quantum approximate optimization algorithm (QAOA). These algorithms are promising candidates for near-term quantum applications, but they often require fine tuning via the annealing schedule or variational parameters. In this work, we explore connections between these analog algorithms, as well as limits in which they become approximations of the optimal procedure.Notably, we explore how the optimal procedure approaches a smooth adiabatic procedure but with a superposed oscillatory pattern that can be explained in terms of the interactions between the ground state and first excited state that effect the coherent error cancellation of diabatic transitions. Furthermore, we provide numeric and analytic evidence that QAOA emulates this optimal procedure with the length of each QAOA layer equal to the period of the oscillatory pattern. Additionally, the ratios of the QAOA bangs are determined by the smooth, non-oscillatory part of the optimal procedure. We provide arguments for these phenomena in terms of the product formula expansion of the optimal procedure. With these arguments, we conclude that different analog algorithms can emulate the optimal protocol under different limits and approximations. Finally, we present a new algorithm for better approximating the optimal protocol using the analytic and numeric insights from the rest of the paper. In practice, numerically, we find that this algorithm outperforms standard QAOA and naive quantum annealing procedures.\ 

}, url = {https://arxiv.org/abs/2107.01218}, author = {Lucas T. Brady and Lucas Kocia and Przemyslaw Bienias and Aniruddha Bapat and Yaroslav Kharkov and Alexey V. Gorshkov} } @article {2813, title = {Circuit Quantum Electrodynamics in Hyperbolic Space: From Photon Bound States to Frustrated Spin Models}, year = {2021}, month = {5/13/2021}, abstract = {

Circuit quantum electrodynamics is one of the most promising platforms for efficient quantum simulation and computation. In recent groundbreaking experiments, the immense flexibility of superconducting microwave resonators was utilized to realize hyperbolic lattices that emulate quantum physics in negatively curved space. Here we investigate experimentally feasible settings in which a few superconducting qubits are coupled to a bath of photons evolving on the hyperbolic lattice. We compare our numerical results for finite lattices with analytical results for continuous hyperbolic space on the Poincar{\'e} disk. We find good agreement between the two descriptions in the long-wavelength regime. We show that photon-qubit bound states have a curvature-limited size. We propose to use a qubit as a local probe of the hyperbolic bath, for example by measuring the relaxation dynamics of the qubit. We find that, although the boundary effects strongly impact the photonic density of states, the spectral density is well described by the continuum theory. We show that interactions between qubits are mediated by photons propagating along geodesics. We demonstrate that the photonic bath can give rise to geometrically-frustrated hyperbolic quantum spin models with finite-range or exponentially-decaying interaction.

}, url = {https://arxiv.org/abs/2105.06490}, author = {Przemyslaw Bienias and Igor Boettcher and Ron Belyansky and Alicia J. Koll{\'a}r and Alexey V. Gorshkov} } @article {2919, title = {Cross-Platform Comparison of Arbitrary Quantum Computations}, year = {2021}, month = {7/27/2021}, abstract = {

As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform fidelities.

}, url = {https://arxiv.org/abs/2107.11387}, author = {Daiwei Zhu and Ze-Pei Cian and Crystal Noel and Andrew Risinger and Debopriyo Biswas and Laird Egan and Yingyue Zhu and Alaina M. Green and Cinthia Huerta Alderete and Nhung H. Nguyen and Qingfeng Wang and Andrii Maksymov and Yunseong Nam and Marko Cetina and Norbert M. Linke and Mohammad Hafezi and Christopher Monroe} } @article {2815, title = {Crystallography of Hyperbolic Lattices}, year = {2021}, month = {5/3/2021}, abstract = {

Hyperbolic lattices are a revolutionary platform for tabletop simulations of holography and quantum physics in curved space and facilitate efficient quantum error correcting codes. Their underlying geometry is non-Euclidean, and the absence of Bloch\&$\#$39;s theorem precludes a simple understanding of their band structure. Motivated by recent insights into hyperbolic band theory, we initiate a crystallography of hyperbolic lattices. We show that many hyperbolic lattices feature a hidden crystal structure characterized by unit cells, hyperbolic Bravais lattices, and associated symmetry groups. Using the mathematical framework of higher-genus Riemann surfaces and Fuchsian groups, we derive, for the first time, a list of example hyperbolic {p,q} lattices and their hyperbolic Bravais lattices, including five infinite families and several graphs relevant for experiments in circuit quantum electrodynamics and topolectrical circuits. Our results find application for both finite and infinite hyperbolic lattices. We describe a method to efficiently generate finite hyperbolic lattices of arbitrary size and explain why the present crystallography is the first step towards a complete band theory of hyperbolic lattices and apply it to construct Bloch wave Hamiltonians. This work lays the foundation for generalizing some of the most powerful concepts of solid state physics, such as crystal momentum and Brillouin zone, to the emerging field of hyperbolic lattices and tabletop simulations of gravitational theories, and reveals the connections to concepts from topology and algebraic geometry.

}, url = {https://arxiv.org/abs/2105.01087}, author = {Igor Boettcher and Alexey V. Gorshkov and Alicia J. Koll{\'a}r and Joseph Maciejko and Steven Rayan and Ronny Thomale} } @article {2631, title = {Device-independent Randomness Expansion with Entangled Photons}, journal = {Nat. Phys. }, year = {2021}, month = {01/28/2021}, abstract = {

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.

}, doi = {https://doi.org/10.1038/s41567-020-01153-4}, url = {https://arxiv.org/abs/1912.11158}, author = {Lynden K. Shalm and Yanbao Zhang and Joshua C. Bienfang and Collin Schlager and Martin J. Stevens and Michael D. Mazurek and Carlos Abell{\'a}n and Waldimar Amaya and Morgan W. Mitchell and Mohammad A. Alhejji and Honghao Fu and Joel Ornstein and Richard P. Mirin and Sae Woo Nam and Emanuel Knill} } @article {2916, title = {Discovering hydrodynamic equations of many-body quantum systems}, year = {2021}, month = {11/3/2021}, abstract = {

Simulating and predicting dynamics of quantum many-body systems is extremely challenging, even for state-of-the-art computational methods, due to the spread of entanglement across the system. However, in the long-wavelength limit, quantum systems often admit a simplified description, which involves a small set of physical observables and requires only a few parameters such as sound velocity or viscosity. Unveiling the relationship between these hydrodynamic equations and the underlying microscopic theory usually requires a great effort by condensed matter theorists. In the present paper, we develop a new machine-learning framework for automated discovery of effective equations from a limited set of available data, thus bypassing complicated analytical derivations. The data can be generated from numerical simulations or come from experimental quantum simulator platforms. Using integrable models, where direct comparisons can be made, we reproduce previously known hydrodynamic equations, strikingly discover novel equations and provide their derivation whenever possible. We discover new hydrodynamic equations describing dynamics of interacting systems, for which the derivation remains an outstanding challenge. Our approach provides a new interpretable method to study properties of quantum materials and quantum simulators in non-perturbative regimes.

}, url = {https://arxiv.org/abs/2111.02385}, author = {Yaroslav Kharkov and Oles Shtanko and Alireza Seif and Przemyslaw Bienias and Mathias Van Regemortel and Mohammad Hafezi and Alexey V. Gorshkov} } @article {2881, title = {EasyPQC: Verifying Post-Quantum Cryptography}, journal = {ACM CCS 2021}, year = {2021}, month = {9/20/2021}, abstract = {

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.

}, doi = {https://dx.doi.org/10.1145/3460120.3484567}, author = {Manuel Barbosa and Gilles Barthe and Xiong Fan and Benjamin Gr{\'e}goire and Shih-Han Hung and Jonathan Katz and Pierre-Yves Strub and Xiaodi Wu and Li Zhou} } @article {2426, title = {Efficient quantum measurement of Pauli operators}, journal = {Quantum}, volume = {5}, year = {2021}, month = {01/19/2021}, chapter = {385}, abstract = {

Estimating the expectation value of an observable is a fundamental task in quantum computation. Unfortunately, it is often impossible to obtain such estimates directly, as the computer is restricted to measuring in a fixed computational basis. One common solution splits the observable into a weighted sum of Pauli operators and measures each separately, at the cost of many measurements. An improved version first groups mutually commuting Pauli operators together and then measures all operators within each group simultaneously. The effectiveness of this depends on two factors. First, to enable simultaneous measurement, circuits are required to rotate each group to the computational basis. In our work, we present two efficient circuit constructions that suitably rotate any group of k commuting n-qubit Pauli operators using at most kn\−k(k+1)/2 and O(kn/logk) two-qubit gates respectively. Second, metrics that justifiably measure the effectiveness of a grouping are required. In our work, we propose two natural metrics that operate under the assumption that measurements are distributed optimally among groups. Motivated by our new metrics, we introduce SORTED INSERTION, a grouping strategy that is explicitly aware of the weighting of each Pauli operator in the observable. Our methods are numerically illustrated in the context of the Variational Quantum Eigensolver, where the observables in question are molecular Hamiltonians. As measured by our metrics, SORTED INSERTION outperforms four conventional greedy colouring algorithms that seek the minimum number of groups.

}, doi = {https://doi.org/10.22331/q-2021-01-20-385}, url = {https://arxiv.org/abs/1908.06942}, author = {Ophelia Crawford and Barnaby van Straaten and Daochen Wang and Thomas Parks and Earl Campbell and Stephen Brierley} } @article {2932, title = {Entangled quantum cellular automata, physical complexity, and Goldilocks rules}, journal = {Quantum Science and Technology}, volume = {6}, year = {2021}, month = {9/29/2021}, pages = {045017}, abstract = {

Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under \"Goldilocks rules\" that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms -- Rydberg arrays, trapped ions, and superconducting qubits -- can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.

}, issn = {2058-9565}, doi = {10.1088/2058-9565/ac1c41}, url = {http://dx.doi.org/10.1088/2058-9565/ac1c41}, author = {Hillberry, Logan E and Jones, Matthew T and Vargas, David L and Rall, Patrick and Nicole Yunger Halpern and Bao, Ning and Notarnicola, Simone and Montangero, Simone and Carr, Lincoln D} } @article {2762, title = {Frustration-induced anomalous transport and strong photon decay in waveguide QED}, journal = {Phys. Rev. Research}, volume = {3}, year = {2021}, month = {9/16/2021}, abstract = {

We study the propagation of photons in a one-dimensional environment consisting of two non-interacting species of photons frustratingly coupled to a single spin-1/2. The ultrastrong frustrated coupling leads to an extreme mixing of the light and matter degrees of freedom, resulting in the disintegration of the spin and a breakdown of the \"dressed-spin\", or polaron, description. Using a combination of numerical and analytical methods, we show that the elastic response becomes increasingly weak at the effective spin frequency, showing instead an increasingly strong and broadband response at higher energies. We also show that the photons can decay into multiple photons of smaller energies. The total probability of these inelastic processes can be as large as the total elastic scattering rate, or half of the total scattering rate, which is as large as it can be. The frustrated spin induces strong anisotropic photon-photon interactions that are dominated by inter-species interactions. Our results are relevant to state-of-the-art circuit and cavity quantum electrodynamics experiments.

}, doi = {https://doi.org/10.1103/PhysRevResearch.3.L032058}, url = {https://arxiv.org/abs/2007.03690}, author = {Ron Belyansky and Seth Whitsitt and Rex Lundgren and Yidan Wang and Andrei Vrajitoarea and Andrew A. Houck and Alexey V. Gorshkov} } @article {2908, title = {Interactive Protocols for Classically-Verifiable Quantum Advantage}, year = {2021}, month = {12/9/2021}, abstract = {

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\&$\#$39;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\&$\#$39;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.

}, url = {https://arxiv.org/abs/2112.05156}, author = {Daiwei Zhu and Gregory D. Kahanamoku-Meyer and Laura Lewis and Crystal Noel and Or Katz and Bahaa Harraz and Qingfeng Wang and Andrew Risinger and Lei Feng and Debopriyo Biswas and Laird Egan and Alexandru Gheorghiu and Yunseong Nam and Thomas Vidick and Umesh Vazirani and Norman Y. Yao and Marko Cetina and Christopher Monroe} } @article {2929, title = {Lefschetz Thimble Quantum Monte Carlo for Spin Systems}, year = {2021}, month = {10/20/2021}, abstract = {

Monte Carlo simulations are often useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, which manifests as an oscillating phase attached to the probabilities being sampled. This sign problem generally leads to an exponential slow down in the time taken by a Monte Carlo algorithm to reach any given level of accuracy, and it has been shown that completely solving the sign problem for an arbitrary quantum system is NP-hard. However, a variety of techniques exist for mitigating the sign problem in specific cases; in particular, the technique of deforming the Monte Carlo simulation\&$\#$39;s plane of integration onto Lefschetz thimbles (that is, complex hypersurfaces of stationary phase) has seen success for many problems of interest in the context of quantum field theories. We extend this methodology to discrete spin systems by utilizing spin coherent state path integrals to re-express the spin system\&$\#$39;s partition function in terms of continuous variables. This translation to continuous variables introduces additional challenges into the Lefschetz thimble method, which we address. We show that these techniques do indeed work to lessen the sign problem on some simple spin systems.

}, url = {https://arxiv.org/abs/2110.10699}, author = {T. C. Mooney and Jacob Bringewatt and Lucas T. Brady} } @article {2759, title = {The Lieb-Robinson light cone for power-law interactions}, year = {2021}, month = {3/29/2021}, abstract = {

The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as 1/rα at distance r? Here, we present a definitive answer to this question for all exponents α\>2d and all spatial dimensions d. Schematically, information takes time at least rmin{1,α\−2d} to propagate a distance~r. As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.

}, url = {https://arxiv.org/abs/2103.15828}, author = {Minh C. Tran and Andrew Y. Guo and Christopher L. Baldwin and Adam Ehrenberg and Alexey V. Gorshkov and Andrew Lucas} } @article {2865, title = {Linear and continuous variable spin-wave processing using a cavity-coupled atomic ensemble}, year = {2021}, month = {9/30/2021}, abstract = {

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.\ 

}, url = {https://arxiv.org/abs/2109.15246}, author = {Kevin C. Cox and Przemyslaw Bienias and David H. Meyer and Donald P. Fahey and Paul D. Kunz and Alexey V. Gorshkov} } @article {2871, title = {Localization crossover and subdiffusive transport in a classical facilitated network model of a disordered, interacting quantum spin chain}, year = {2021}, month = {9/22/2021}, abstract = {

We consider the random-field Heisenberg model, a paradigmatic model for many-body localization (MBL), and add a Markovian dephasing bath coupled to the Anderson orbitals of the model\&$\#$39;s non-interacting limit. We map this system to a classical facilitated hopping model that is computationally tractable for large system sizes, and investigate its dynamics. The classical model exhibits a robust crossover between an ergodic (thermal) phase and a frozen (localized) phase. The frozen phase is destabilized by thermal subregions (bubbles), which thermalize surrounding sites by providing a fluctuating interaction energy and so enable off-resonance particle transport. Investigating steady state transport, we observe that the interplay between thermal and frozen bubbles leads to a clear transition between diffusive and subdiffusive regimes. This phenomenology both describes the MBL system coupled to a bath, and provides a classical analogue for the many-body localization transition in the corresponding quantum model, in that the classical model displays long local memory times. It also highlights the importance of the details of the bath coupling in studies of MBL systems coupled to thermal environments.

}, url = {https://arxiv.org/abs/2109.10926}, author = {Kai Klocke and Christopher David White and Michael Buchhold} } @article {2810, title = {Magic State Distillation from Entangled States}, year = {2021}, month = {6/23/2021}, abstract = {

Magic can be distributed non-locally in many-body entangled states, such as the low energy states of condensed matter systems. Using the Bravyi-Kitaev magic state distillation protocol, we find that non-local magic is distillable and can improve the distillation outcome. We analyze a few explicit examples and show that spin squeezing can be used to convert non-distillable states into distillable ones.
Our analysis also suggests that the conventional product input states assumed by magic distillation protocols are extremely atypical among general states with distillable magic. It further justifies the need for studying a diverse range of entangled inputs that yield magic states with high probability.

}, url = {https://arxiv.org/abs/2106.12591}, author = {Ning Bao and ChunJun Cao and Vincent Paul Su} } @article {2777, title = {Maximum Refractive Index of an Atomic Medium}, journal = {Physical Review X}, volume = {11}, year = {2021}, month = {2/18/2021}, abstract = {

It is interesting to observe that all optical materials with a positive refractive index have a value of index that is of order unity. Surprisingly, though, a deep understanding of the mechanisms that lead to this universal behavior seems to be lacking. Moreover, this observation is difficult to reconcile with the fact that a single, isolated atom is known to have a giant optical response, as characterized by a resonant scattering cross section that far exceeds its physical size. Here, we theoretically and numerically investigate the evolution of the optical properties of an ensemble of ideal atoms as a function of density, starting from the dilute gas limit, including the effects of multiple scattering and near-field interactions. Interestingly, despite the giant response of an isolated atom, we find that the maximum index does not indefinitely grow with increasing density, but rather reaches a limiting value n\≈1.7. We propose an explanation based upon strong-disorder renormalization group theory, in which the near-field interaction combined with random atomic positions results in an inhomogeneous broadening of atomic resonance frequencies. This mechanism ensures that regardless of the physical atomic density, light at any given frequency only interacts with at most a few near-resonant atoms per cubic wavelength, thus limiting the maximum index attainable. Our work is a promising first step to understand the limits of refractive index from a bottom-up, atomic physics perspective, and also introduces renormalization group as a powerful tool to understand the generally complex problem of multiple scattering of light overall.

}, doi = {10.1103/PhysRevX.11.011026}, url = {https://arxiv.org/abs/2006.01680}, author = {Andreoli, Francesco and Michael Gullans and High, Alexander A. and Browaeys, Antoine and Chang, Darrick E.} } @article {2770, title = {Meta Hamiltonian Learning}, year = {2021}, month = {4/9/2021}, abstract = {

Efficient characterization of quantum devices is a significant challenge critical for the development of large scale quantum computers. We consider an experimentally motivated situation, in which we have a decent estimate of the Hamiltonian, and its parameters need to be characterized and fine-tuned frequently to combat drifting experimental variables. We use a machine learning technique known as meta-learning to learn a more efficient optimizer for this task. We consider training with the nearest-neighbor Ising model and study the trained model\&$\#$39;s generalizability to other Hamiltonian models and larger system sizes. We observe that the meta-optimizer outperforms other optimization methods in average loss over test samples. This advantage follows from the meta-optimizer being less likely to get stuck in local minima, which highly skews the distribution of the final loss of the other optimizers. In general, meta-learning decreases the number of calls to the experiment and reduces the needed classical computational resources.

}, url = {https://arxiv.org/abs/2104.04453}, author = {Przemyslaw Bienias and Alireza Seif and Mohammad Hafezi} } @article {2768, title = {Observation of a prethermal discrete time crystal}, year = {2021}, month = {2/2/2021}, abstract = {

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.

}, url = {https://arxiv.org/abs/2102.01695}, author = {Antonis Kyprianidis and Francisco Machado and William Morong and Patrick Becker and Kate S. Collins and Dominic V. Else and Lei Feng and Paul W. Hess and Chetan Nayak and Guido Pagano and Norman Y. Yao and Christopher Monroe} } @article {2805, title = {Observation of measurement-induced quantum phases in a trapped-ion quantum computer}, year = {2021}, month = {6/10/2021}, abstract = {

Many-body open quantum systems balance internal dynamics against decoherence from interactions with an environment. Here, we explore this balance via random quantum circuits implemented on a trapped ion quantum computer, where the system evolution is represented by unitary gates with interspersed projective measurements. As the measurement rate is varied, a purification phase transition is predicted to emerge at a critical point akin to a fault-tolerent threshold. We probe the \"pure\" phase, where the system is rapidly projected to a deterministic state conditioned on the measurement outcomes, and the \"mixed\" or \"coding\" phase, where the initial state becomes partially encoded into a quantum error correcting codespace. We find convincing evidence of the two phases and show numerically that, with modest system scaling, critical properties of the transition clearly emerge.

}, url = {https://arxiv.org/abs/2106.05881}, author = {Crystal Noel and Pradeep Niroula and Daiwei Zhu and Andrew Risinger and Laird Egan and Debopriyo Biswas and Marko Cetina and Alexey V. Gorshkov and Michael Gullans and David A. Huse and Christopher Monroe} } @article {2763, title = {Observation of Stark many-body localization without disorder}, year = {2021}, month = {2/14/2021}, abstract = {

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 {\textquoteleft}Stark MBL.\&$\#$39; 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.

}, url = {https://arxiv.org/abs/2102.07250}, author = {W. Morong and F. Liu and P. Becker and K. S. Collins and L. Feng and A. Kyprianidis and G. Pagano and T. You and Alexey V. Gorshkov and C. Monroe} } @article {2926, title = {Optimal scaling quantum linear systems solver via discrete adiabatic theorem}, year = {2021}, month = {11/15/2021}, abstract = {

Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure. However, the most efficient of those procedures is still asymptotically sub-optimal by a factor of log(κ). Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete time evolutions. We use this discrete adiabatic theorem to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity. Our O(κlog(1/ε)) complexity is also optimal in terms of the combined scaling in κ and the precision ε. Compared to existing suboptimal methods, our algorithm is simpler and easier to implement. Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.\ 

}, url = {https://arxiv.org/abs/2111.08152}, author = {Pedro C. S. Costa and Dong An and Yuval R. Sanders and Yuan Su and Ryan Babbush and Dominic W. Berry} } @article {2816, title = {Protocols for estimating multiple functions with quantum sensor networks: Geometry and performance}, journal = {Physical Review Research}, volume = {3}, year = {2021}, month = {5/3/2021}, abstract = {

We consider the problem of estimating multiple analytic functions of a set of local parameters via qubit sensors in a quantum sensor network. To address this problem, we highlight a generalization of the sensor symmetric performance bounds of Rubio et. al. [J. Phys. A: Math. Theor. 53 344001 (2020)] and develop a new optimized sequential protocol for measuring such functions. We compare the performance of both approaches to one another and to local protocols that do not utilize quantum entanglement, emphasizing the geometric significance of the coefficient vectors of the measured functions in determining the best choice of measurement protocol. We show that, in many cases, especially for a large number of sensors, the optimized sequential protocol results in more accurate measurements than the other strategies. In addition, in contrast to the the sensor symmetric approach, the sequential protocol is known to always be explicitly implementable. The sequential protocol is very general and has a wide range of metrological applications.

}, issn = {2643-1564}, doi = {10.1103/physrevresearch.3.033011}, url = {https://arxiv.org/abs/2104.09540}, author = {Jacob Bringewatt and Boettcher, Igor and Niroula, Pradeep and Bienias, Przemyslaw and Alexey V. Gorshkov} } @article {2917, title = {Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware}, journal = {Physical Review A}, volume = {104}, year = {2021}, month = {12/8/2021}, abstract = {

Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves to the multiqubit states of a quantum processor, we present different configurations of quantum circuits for the implementation of DTQWs in one-dimensional position space. We provide example circuits for a five-qubit processor and address scalability to higher dimensions as well as larger quantum processors.

}, issn = {2469-9934}, doi = {https://doi.org/10.1103/PhysRevA.104.062401}, url = {https://arxiv.org/abs/2001.11197}, author = {Singh, Shivani and Alderete, C. Huerta and Balu, Radhakrishnan and Monroe, Christopher and Linke, Norbert M. and Chandrashekar, C. M.} } @article {2875, title = {Quantum Machine Learning for Finance}, year = {2021}, month = {9/9/2021}, abstract = {

Quantum computers are expected to surpass the computational capabilities of classical computers during this decade, and achieve disruptive impact on numerous industry sectors, particularly finance. In fact, finance is estimated to be the first industry sector to benefit from Quantum Computing not only in the medium and long terms, but even in the short term. This review paper presents the state of the art of quantum algorithms for financial applications, with particular focus to those use cases that can be solved via Machine Learning.

}, url = {https://arxiv.org/abs/2109.04298}, author = {Marco Pistoia and Syed Farhan Ahmad and Akshay Ajagekar and Alexander Buts and Shouvanik Chakrabarti and Dylan Herman and Shaohan Hu and Andrew Jena and Pierre Minssen and Pradeep Niroula and Arthur Rattew and Yue Sun and Romina Yalovetzky} } @article {2751, title = {Quantum routing with fast reversals}, journal = {Quantum}, volume = {5}, year = {2021}, month = {8/24/2021}, chapter = {533}, abstract = {

We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length n, we show that there exists a constant ϵ\≈0.034 such that the quantum routing time is at most (1\−ϵ)n, whereas any swap-based protocol needs at least time n\−1. This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures such as grids. Furthermore, we show that our algorithm approaches a quantum routing time of 2n/3 in expectation for uniformly random permutations, whereas swap-based protocols require time n asymptotically. Additionally, we consider sparse permutations that route k\≤n qubits and give algorithms with quantum routing time at most n/3+O(k2) on paths and at most 2r/3+O(k2) on general graphs with radius r.

}, doi = {https://doi.org/10.22331/q-2021-08-31-533}, url = {https://arxiv.org/abs/2103.03264}, author = {Aniruddha Bapat and Andrew M. Childs and Alexey V. Gorshkov and Samuel King and Eddie Schoute and Hrishee Shastri} } @article {2671, title = {Quench Dynamics of a Fermi Gas with Strong Long-Range Interactions}, journal = {Phys. Rev. X}, volume = {11}, year = {2021}, month = {5/24/2021}, abstract = {

We induce strong non-local interactions in a 2D Fermi gas in an optical lattice using Rydberg dressing. The system is approximately described by a t\−V model on a square lattice where the fermions experience isotropic nearest-neighbor interactions and are free to hop only along one direction. We measure the interactions using many-body Ramsey interferometry and study the lifetime of the gas in the presence of tunneling, finding that tunneling does not reduce the lifetime. To probe the interplay of non-local interactions with tunneling, we investigate the short-time relaxation dynamics of charge density waves in the gas. We find that strong nearest-neighbor interactions slow down the relaxation. Our work opens the door for quantum simulations of systems with strong non-local interactions such as extended Fermi-Hubbard models.

}, doi = {https://doi.org/10.1103/PhysRevX.11.021036}, url = {https://arxiv.org/abs/2010.05871}, author = {Elmer Guardado-Sanchez and Benjamin M. Spar and Peter Schauss and Ron Belyansky and Jeremy T. Young and Przemyslaw Bienias and Alexey V. Gorshkov and Thomas Iadecola and Waseem S. Bakr} } @article {2761, title = {Singularities in nearly-uniform 1D condensates due to quantum diffusion}, year = {2021}, month = {3/10/2021}, abstract = {

Dissipative systems can often exhibit wavelength-dependent loss rates. One prominent example is Rydberg polaritons formed by electromagnetically-induced transparency, which have long been a leading candidate for studying the physics of interacting photons and also hold promise as a platform for quantum information. In this system, dissipation is in the form of quantum diffusion, i.e., proportional to k2 (k being the wavevector) and vanishing at long wavelengths as k\→0. Here, we show that one-dimensional condensates subject to this type of loss are unstable to long-wavelength density fluctuations in an unusual manner: after a prolonged period in which the condensate appears to relax to a uniform state, local depleted regions quickly form and spread ballistically throughout the system. We connect this behavior to the leading-order equation for the nearly-uniform condensate -- a dispersive analogue to the Kardar-Parisi-Zhang (KPZ) equation -- which develops singularities in finite time. Furthermore, we show that the wavefronts of the depleted regions are described by purely dissipative solitons within a pair of hydrodynamic equations, with no counterpart in lossless condensates. We close by discussing conditions under which such singularities and the resulting solitons can be physically realized.

}, url = {https://arxiv.org/abs/2103.06293}, author = {Christopher L. Baldwin and P. Bienias and Alexey V. Gorshkov and Michael Gullans and M. Maghrebi} } @article {2864, title = {Spin-Wave Quantum Computing with Atoms in a Single-Mode Cavity}, year = {2021}, month = {9/30/2021}, abstract = {

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.\ 

}, url = {https://arxiv.org/abs/2109.15252}, author = {Kevin C. Cox and Przemyslaw Bienias and David H. Meyer and Paul D. Kunz and Donald P. Fahey and Alexey V. Gorshkov} } @article {2933, title = {Surface code compilation via edge-disjoint paths}, year = {2021}, month = {10/21/2021}, abstract = {

We provide an efficient algorithm to compile quantum circuits for fault-tolerant execution. We target surface codes, which form a 2D grid of logical qubits with nearest-neighbor logical operations. Embedding an input circuit\&$\#$39;s qubits in surface codes can result in long-range two-qubit operations across the grid. We show how to prepare many long-range Bell pairs on qubits connected by edge-disjoint paths of ancillas in constant depth which can be used to perform these long-range operations. This forms one core part of our Edge-Disjoint Paths Compilation (EDPC) algorithm, by easily performing parallel long-range Clifford operations in constant depth. It also allows us to establish a connection between surface code compilation and several well-studied edge-disjoint paths problems. Similar techniques allow us to perform non-Clifford single-qubit rotations far from magic state distillation factories. In this case, we can easily find the maximum set of paths by a max-flow reduction, which forms the other major part of our EDPC algorithm. We compare EDPC to other compilation approaches including a SWAP-based algorithm, and find significantly improved performance for circuits built from parallel CNOTs, and for circuits which implement the multi-controlled X gate.

}, url = {https://arxiv.org/abs/2110.11493}, author = {Michael Beverland and Vadym Kliuchnikov and Eddie Schoute} } @article {2682, title = {Tunable three-body loss in a nonlinear Rydberg medium}, journal = {Phys. Rev. Lett., in press }, year = {2021}, month = {9/28/2020}, abstract = {

Long-range Rydberg interactions, in combination with electromagnetically induced transparency (EIT), give rise to strongly interacting photons where the strength, sign, and form of the interactions are widely tunable and controllable. Such control can be applied to both coherent and dissipative interactions, which provides the potential to generate novel few-photon states. Recently it has been shown that Rydberg-EIT is a rare system in which three-body interactions can be as strong or stronger than two-body interactions. In this work, we study a three-body scattering loss for Rydberg-EIT in a wide regime of single and two-photon detunings. Our numerical simulations of the full three-body wavefunction and analytical estimates based on Fermi\&$\#$39;s Golden Rule strongly suggest that the observed features in the outgoing photonic correlations are caused by the resonant enhancement of the three-body losses.

}, url = {https://arxiv.org/abs/2009.13599}, author = {Dalia P. Ornelas Huerta and Przemyslaw Bienias and Alexander N. Craddock and Michael Gullans and Andrew J. Hachtel and Marcin Kalinowski and Mary E. Lyon and Alexey V. Gorshkov and Steven L. Rolston and J. V. Porto} } @article {2694, title = {Approximate optimization of MAXCUT with a local spin algorithm}, year = {2020}, month = {8/13/2020}, abstract = {

Local tensor methods are a class of optimization algorithms that was introduced in [Hastings,arXiv:1905.07047v2][1] as a classical analogue of the quantum approximate optimization algorithm (QAOA). These algorithms treat the cost function as a Hamiltonian on spin degrees of freedom and simulate the relaxation of the system to a low energy configuration using local update rules on the spins. Whereas the emphasis in [1] was on theoretical worst-case analysis, we here investigate performance in practice through benchmarking experiments on instances of the MAXCUT problem.Through heuristic arguments we propose formulas for choosing the hyperparameters of the algorithm which are found to be in good agreement with the optimal choices determined from experiment. We observe that the local tensor method is closely related to gradient descent on a relaxation of maxcut to continuous variables, but consistently outperforms gradient descent in all instances tested. We find time to solution achieved by the local tensor method is highly uncorrelated with that achieved by a widely used commercial optimization package; on some MAXCUT instances the local tensor method beats the commercial solver in time to solution by up to two orders of magnitude and vice-versa. Finally, we argue that the local tensor method closely follows discretized, imaginary-time dynamics of the system under the problem Hamiltonian.

}, url = {https://arxiv.org/abs/2008.06054}, author = {Aniruddha Bapat and Stephen P. Jordan} } @article {2594, title = {Asymmetric blockade and multi-qubit gates via dipole-dipole interactions}, year = {2020}, month = {6/3/2020}, abstract = {

Due to their strong and tunable interactions, Rydberg atoms can be used to realize fast two-qubit entangling gates. We propose a generalization of a generic two-qubit Rydberg-blockade gate to multi-qubit Rydberg-blockade gates which involve both many control qubits and many target qubits simultaneously. This is achieved by using strong microwave fields to dress nearby Rydberg states, leading to asymmetric blockade in which control-target interactions are much stronger than control-control and target-target interactions. The implementation of these multi-qubit gates can drastically simplify both quantum algorithms and state preparation. To illustrate this, we show that a 25-atom GHZ state can be created using only three gates with an error of 7.8\%.

}, url = {https://arxiv.org/abs/2006.02486}, author = {Jeremy T. Young and Przemyslaw Bienias and Ron Belyansky and Adam M. Kaufman and Alexey V. Gorshkov} } @article {2585, title = {Collisions of room-temperature helium with ultracold lithium and the van der Waals bound state of HeLi}, journal = {Phys. Rev. A }, volume = {101}, year = {2020}, month = {1/6/2020}, abstract = {

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{\"o}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 \…

}, doi = {https://doi.org/10.1103/PhysRevA.101.012702}, author = {Constantinos Makrides and Daniel S Barker and James A Fedchak and Julia Scherschligt and Stephen Eckel and Eite Tiesinga} } @article {2695, title = {Confronting lattice parton distributions with global QCD analysis}, year = {2020}, month = {10/1/2020}, abstract = {

We present the first Monte Carlo based global QCD analysis of spin-averaged and spin-dependent parton distribution functions (PDFs) that includes nucleon isovector matrix elements in coordinate space from lattice QCD. We investigate the degree of universality of the extracted PDFs when the lattice and experimental data are treated under the same conditions within the Bayesian likelihood analysis. For the unpolarized sector, we find rather weak constraints from the current lattice data on the phenomenological PDFs, and difficulties in describing the lattice matrix elements at large spatial distances. In contrast, for the polarized PDFs we find good agreement between experiment and lattice data, with the latter providing significant constraints on the spin-dependent isovector quark and antiquark distributions

}, url = {https://arxiv.org/abs/2010.00548}, author = {Jacob Bringewatt and N. Sato and W. Melnitchouk and Jian-Wei Qiu and F. Steffens and M. Constantinou} } @article {2637, title = {Critical Theory for the Breakdown of Photon Blockade}, year = {2020}, month = {6/9/2020}, abstract = {

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.

}, url = {https://arxiv.org/abs/2006.05593}, author = {Jonathan B. Curtis and Igor Boettcher and Jeremy T. Young and Mohammad F. Maghrebi and Howard Carmichael and Alexey V. Gorshkov and Michael Foss-Feig} } @article {2688, title = {Distinct Critical Behaviors from the Same State in Quantum Spin and Population Dynamics Perspectives}, year = {2020}, month = {9/10/2020}, abstract = {

There is a deep connection between the ground states of transverse-field spin systems and the late-time distributions of evolving viral populations -- within simple models, both are obtained from the principal eigenvector of the same matrix. However, that vector is the wavefunction amplitude in the quantum spin model, whereas it is the probability itself in the population model. We show that this seemingly minor difference has significant consequences: phase transitions which are discontinuous in the spin system become continuous when viewed through the population perspective, and transitions which are continuous become governed by new critical exponents. We introduce a more general class of models which encompasses both cases, and that can be solved exactly in a mean-field limit. Numerical results are also presented for a number of one-dimensional chains with power-law interactions. We see that well-worn spin models of quantum statistical mechanics can contain unexpected new physics and insights when treated as population-dynamical models and beyond, motivating further studies.\ 

}, url = {https://arxiv.org/abs/2009.05064}, author = {Christopher L. Baldwin and S. Shivam and S. L. Sondhi and M. Kardar} } @article {2584, title = {Effective gaps are not effective: quasipolynomial classical simulation of obstructed stoquastic Hamiltonians}, year = {2020}, month = {4/21/2020}, abstract = {

All known examples confirming the possibility of an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (AQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to efficiently sample from the effective subspace of a k-local stoquastic Hamiltonian H, without a priori knowledge of its symmetries (or near-symmetries). Our algorithm maps any k-local Hamiltonian to a graph G=(V,E) with |V|=O(poly(n)) where n is the number of qubits. Given the well-known result of Babai, we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasi-polynomial in |V| for producing samples from the effective subspace eigenstates of H. Our results rule out exponential separations between stoquastic AQC and classical computation that arise from hidden symmetries in k-local Hamiltonians. Furthermore, our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in non-stoquastic cases, or be useful in studying additional properties of k-local Hamiltonians.

}, url = {https://arxiv.org/abs/2004.08681}, author = {Jacob Bringewatt and Michael Jarret} } @article {2457, title = {Entanglement Bounds on the Performance of Quantum Computing Architectures}, journal = {Phys. Rev. Research}, volume = {2}, year = {2020}, month = {9/22/2020}, abstract = {

There are many possible architectures for future quantum computers that designers will need to choose between. However, the process of evaluating a particular connectivity graph\&$\#$39;s performance as a quantum architecture can be difficult. In this paper, we establish a connection between a quantity known as the isoperimetric number and a lower bound on the time required to create highly entangled states. The metric we propose counts resources based on the use of two-qubit unitary operations, while allowing for arbitrarily fast measurements and classical feedback. We describe how these results can be applied to the evaluation of the hierarchical architecture proposed in Phys. Rev. A 98, 062328 (2018). We also show that the time-complexity bound we place on the creation of highly-entangled states can be saturated up to a multiplicative factor logarithmic in the number of qubits.

}, doi = {https://doi.org/10.1103/PhysRevResearch.2.033316}, url = {https://arxiv.org/abs/1908.04802}, author = {Zachary Eldredge and Leo Zhou and Aniruddha Bapat and James R. Garrison and Abhinav Deshpande and Frederic T. Chong and Alexey V. Gorshkov} } @article {2567, title = {Exotic photonic molecules via Lennard-Jones-like potentials}, journal = {Phys. Rev. Lett.}, volume = {125}, year = {2020}, month = {9/19/2020}, abstract = {

Ultracold systems offer an unprecedented level of control of interactions between atoms. An important challenge is to achieve a similar level of control of the interactions between photons. Towards this goal, we propose a realization of a novel Lennard-Jones-like potential between photons coupled to the Rydberg states via electromagnetically induced transparency (EIT). This potential is achieved by tuning Rydberg states to a F{{\"o}}rster resonance with other Rydberg states. We consider few-body problems in 1D and 2D geometries and show the existence of self-bound clusters (\"molecules\") of photons. We demonstrate that for a few-body problem, the multi-body interactions have a significant impact on the geometry of the molecular ground state. This leads to phenomena without counterparts in conventional systems: For example, three photons in 2D preferentially arrange themselves in a line-configuration rather than in an equilateral-triangle configuration. Our result opens a new avenue for studies of many-body phenomena with strongly interacting photons.

}, doi = {https://doi.org/10.1103/PhysRevLett.125.093601}, url = {https://arxiv.org/abs/2003.07864}, author = {Przemyslaw Bienias and Michael Gullans and Marcin Kalinowski and Alexander N. Craddock and Dalia P. Ornelas-Huerta and Steven L. Rolston and J. V. Porto and Alexey V. Gorshkov} } @article {2329, title = {Experimental Low-Latency Device-Independent Quantum Randomness}, journal = {Phys. Rev. Lett. }, volume = {124}, year = {2020}, month = {12/24/2019}, abstract = {

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.

}, doi = {https://doi.org/10.1103/PhysRevLett.124.010505}, url = {https://arxiv.org/abs/1812.07786}, author = {Yanbao Zhang and Lynden K. Shalm and Joshua C. Bienfang and Martin J. Stevens and Michael D. Mazurek and Sae Woo Nam and Carlos Abell{\'a}n and Waldimar Amaya and Morgan W. Mitchell and Honghao Fu and Carl Miller and Alan Mink and Emanuel Knill} } @article {2686, title = {Fault-Tolerant Operation of a Quantum Error-Correction Code}, year = {2020}, month = {9/24/2020}, abstract = {

Quantum error correction protects fragile quantum information by encoding it in a larger quantum system whose extra degrees of freedom enable the detection and correction of errors. An encoded logical qubit thus carries increased complexity compared to a bare physical qubit. Fault-tolerant protocols contain the spread of errors and are essential for realizing error suppression with an error-corrected logical qubit. Here we experimentally demonstrate fault-tolerant preparation, rotation, error syndrome extraction, and measurement on a logical qubit encoded in the 9-qubit Bacon-Shor code. For the logical qubit, we measure an average fault-tolerant preparation and measurement error of 0.6\% and a transversal Clifford gate with an error of 0.3\% after error correction. The result is an encoded logical qubit whose logical fidelity exceeds the fidelity of the entangling operations used to create it. We compare these operations with non-fault-tolerant protocols capable of generating arbitrary logical states, and observe the expected increase in error. We directly measure the four Bacon-Shor stabilizer generators and are able to detect single qubit Pauli errors. These results show that fault-tolerant quantum systems are currently capable of logical primitives with error rates lower than their constituent parts. With the future addition of intermediate measurements, the full power of scalable quantum error-correction can be achieved.\ 

}, url = {https://arxiv.org/abs/2009.11482}, author = {Laird Egan and Dripto M. Debroy and Crystal Noel and Andrew Risinger and Daiwei Zhu and Debopriyo Biswas and Michael Newman and Muyuan Li and Kenneth R. Brown and Marko Cetina and Christopher Monroe} } @article {2625, title = {Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits}, year = {2020}, month = {5/13/2020}, abstract = {

Virtual black-box obfuscation is a strong cryptographic primitive: it encrypts a circuit while maintaining its full input/output functionality. A remarkable result by Barak et al. (Crypto 2001) shows that a general obfuscator that obfuscates classical circuits into classical circuits cannot exist. A promising direction that circumvents this impossibility result is to obfuscate classical circuits into quantum states, which would potentially be better capable of hiding information about the obfuscated circuit. We show that, under the assumption that learning-with-errors (LWE) is hard for quantum computers, this quantum variant of virtual black-box obfuscation of classical circuits is generally impossible. On the way, we show that under the presence of dependent classical auxiliary input, even the small class of classical point functions cannot be quantum virtual black-box obfuscated.

}, url = {https://arxiv.org/abs/2005.06432}, author = {Gorjan Alagic and Zvika Brakerski and Yfke Dulek and Christian Schaffner} } @article {2720, title = {Localization and criticality in antiblockaded 2D Rydberg atom arrays}, year = {2020}, month = {12/7/2020}, abstract = {

Controllable Rydberg atom arrays have provided new insights into fundamental properties of quantum matter both in and out of equilibrium. In this work, we study the effect of experimentally relevant positional disorder on Rydberg atoms trapped in a 2D square lattice under anti-blockade (facilitation) conditions. We show that the facilitation conditions lead the connectivity graph of a particular subspace of the full Hilbert space to form a 2D Lieb lattice, which features a singular flat band. Remarkably, we find three distinct regimes as the disorder strength is varied: a critical regime, a delocalized but nonergodic regime, and a regime with a disorder-induced flat band. The critical regime\&$\#$39;s existence depends crucially upon the singular flat band in our model, and is absent in any 1D array or ladder system. We propose to use quench dynamics to probe the three different regimes experimentally.\ 

}, url = {https://arxiv.org/abs/2012.03946}, author = {Fangli Liu and Zhi-Cheng Yang and Przemyslaw Bienias and Thomas Iadecola and Alexey V. Gorshkov} } @article {2687, title = {Mechanical Quantum Sensing in the Search for Dark Matter}, year = {2020}, month = {8/13/2020}, type = {FERMILAB-PUB-20-378-QIS-T}, abstract = {

Numerous astrophysical and cosmological observations are best explained by the existence of dark matter, a mass density which interacts only very weakly with visible, baryonic matter. Searching for the extremely weak signals produced by this dark matter strongly motivate the development of new, ultra-sensitive detector technologies. Paradigmatic advances in the control and readout of massive mechanical systems, in both the classical and quantum regimes, have enabled unprecedented levels of sensitivity. In this white paper, we outline recent ideas in the potential use of a range of solid-state mechanical sensing technologies to aid in the search for dark matter in a number of energy scales and with a variety of coupling mechanisms.

}, url = {https://arxiv.org/abs/2008.06074}, author = {D. Carney and G. Krnjaic and D. C. Moore and C. A. Regal and G. Afek and S. Bhave and B. Brubaker and T. Corbitt and J. Cripe and N. Crisosto and A.Geraci and S. Ghosh and J. G. E. Harris and A. Hook and E. W. Kolb and J. Kunjummen and R. F. Lang and T. Li and T. Lin and Z. Liu and J. Lykken and L. Magrini and J. Manley and N. Matsumoto and A. Monte and F. Monteiro and T. Purdy and C. J. Riedel and R. Singh and S. Singh and K. Sinha and J. M. Taylor and J. Qin and D. J. Wilson and Y. Zhao} } @article {2595, title = {Minimal model for fast scrambling}, journal = {Phys. Rev. Lett.}, volume = {125}, year = {2020}, month = {9/22/2020}, abstract = {

We study quantum information scrambling in spin models with both long-range all-to-all and short-range interactions. We argue that a simple global, spatially homogeneous interaction together with local chaotic dynamics is sufficient to give rise to fast scrambling, which describes the spread of quantum information over the entire system in a time that is logarithmic in the system size. This is illustrated in two exactly solvable models: (1) a random circuit with Haar random local unitaries and a global interaction and (2) a classical model of globally coupled non-linear oscillators. We use exact numerics to provide further evidence by studying the time evolution of an out-of-time-order correlator and entanglement entropy in spin chains of intermediate sizes. Our results can be verified with state-of-the-art quantum simulators.

}, doi = {https://doi.org/10.1103/PhysRevLett.125.130601}, url = {https://arxiv.org/abs/2005.05362}, author = {Ron Belyansky and Przemyslaw Bienias and Yaroslav A. Kharkov and Alexey V. Gorshkov and Brian Swingle} } @article {2692, title = {More of the Bulk from Extremal Area Variations}, journal = {Classical and Quantum Gravity}, volume = {38}, year = {2020}, month = {12/24/2020}, pages = {047001}, abstract = {

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.

}, doi = {https://iopscience.iop.org/article/10.1088/1361-6382/abcfd0/pdf}, url = {https://arxiv.org/abs/2009.07850}, author = {Ning Bao and ChunJun Cao and Sebastian Fischetti and Jason Pollack and Yibo Zhong} } @article {2556, title = {Nearly optimal time-independent reversal of a spin chain}, journal = {accepted for publication in Physical Review Research}, year = {2020}, month = {3/5/2020}, abstract = {

We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of N spins. Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with time-independent, non-uniform couplings. Under appropriate normalization, we implement this state reversal three times faster than a naive approach using SWAP gates, in time comparable to a protocol of Raussendorf [Phys. Rev. A 72, 052301 (2005)] that requires dynamical control. We also prove lower bounds on state reversal by using results on the entanglement capacity of Hamiltonians and show that we are within a factor 1.502(1+1/N) of the shortest time possible. Our lower bound holds for all nearest-neighbor qubit protocols with arbitrary finite ancilla spaces and local operations and classical communication. Finally, we extend our protocol to an infinite family of nearest-neighbor, time-independent Hamiltonian protocols for state reversal. This includes chains with nearly uniform coupling that may be especially feasible for experimental implementation.\ 

}, url = {https://arxiv.org/abs/2003.02843}, author = {Aniruddha Bapat and Eddie Schoute and Alexey V. Gorshkov and Andrew M. Childs} } @article {2560, title = {Noncommuting conserved charges in quantum many-body thermalization}, journal = {Phys. Rev. E }, volume = {101}, year = {2020}, month = {4/15/2020}, abstract = {

In statistical mechanics, a small system exchanges conserved quantities\—heat, particles, electric charge, etc.\—with a bath. The small system thermalizes to the canonical ensemble or the grand canonical ensemble, etc., depending on the quantities. The conserved quantities are represented by operators usually assumed to commute with each other. This assumption was removed within quantum-information-theoretic (QI-theoretic) thermodynamics recently. The small system\&$\#$39;s long-time state was dubbed \“the non-Abelian thermal state (NATS).\” We propose an experimental protocol for observing a system thermalize to the NATS. We illustrate with a chain of spins, a subset of which forms the system of interest. The conserved quantities manifest as spin components. Heisenberg interactions push the conserved quantities between the system and the effective bath, the rest of the chain. We predict long-time expectation values, extending the NATS theory from abstract idealization to finite systems that thermalize with finite couplings for finite times. Numerical simulations support the analytics: The system thermalizes to near the NATS, rather than to the canonical prediction. Our proposal can be implemented with ultracold atoms, nitrogen-vacancy centers, trapped ions, quantum dots, and perhaps nuclear magnetic resonance. This work introduces noncommuting conserved quantities from QI-theoretic thermodynamics into quantum many-body physics: atomic, molecular, and optical physics and condensed matter.

}, doi = {https://doi.org/10.1103/PhysRevE.101.042117}, url = {https://journals.aps.org/pre/abstract/10.1103/PhysRevE.101.042117}, author = {Nicole Yunger Halpern and Michael E. Beverland and Amir Kalev} } @article {2568, title = {On-demand indistinguishable single photons from an efficient and pure source based on a Rydberg ensemble}, year = {2020}, month = {3/4/2020}, abstract = {

Single photons coupled to atomic systems have shown to be a promising platform for developing quantum technologies. Yet a bright on-demand, highly pure and highly indistinguishable single-photon source compatible with atomic platforms is lacking. In this work, we demonstrate such a source based on a strongly interacting Rydberg system. The large optical nonlinearities in a blockaded Rydberg ensemble convert coherent light into a single-collective excitation that can be coherently retrieved as a quantum field. We observe a single-transverse-mode efficiency up to 0.18(2), g(2)=2.0(1.5)\×10\−4, and indistinguishability of 0.982(7), making this system promising for scalable quantum information applications. Accounting for losses, we infer a generation probability up to 0.40(4). Furthermore, we investigate the effects of contaminant Rydberg excitations on the source efficiency. Finally, we introduce metrics to benchmark the performance of on-demand single-photon sources.\ 

}, url = {https://arxiv.org/abs/2003.02202}, author = {Dalia P. Ornelas-Huerta and Alexander N. Craddock and Elizabeth A. Goldschmidt and Andrew J. Hachtel and Yidan Wang and P. Bienias and Alexey V. Gorshkov and Steve L. Rolston and James V. Porto} } @article {2721, title = {Optimal Measurement of Field Properties with Quantum Sensor Networks}, year = {2020}, month = {11/2/2020}, abstract = {

We consider a quantum sensor network of qubit sensors coupled to a field f(x⃗ ;θ⃗ ) analytically parameterized by the vector of parameters θ⃗ . The qubit sensors are fixed at positions x⃗ 1,\…,x⃗ d. While the functional form of f(x⃗ ;θ⃗ ) is known, the parameters θ⃗\  are not. We derive saturable bounds on the precision of measuring an arbitrary analytic function q(θ⃗ ) of these parameters and construct the optimal protocols that achieve these bounds. Our results are obtained from a combination of techniques from quantum information theory and duality theorems for linear programming. They can be applied to many problems, including optimal placement of quantum sensors, field interpolation, and the measurement of functionals of parametrized fields.

}, url = {https://arxiv.org/abs/2011.01259}, author = {Timothy Qian and Jacob Bringewatt and Igor Boettcher and Przemyslaw Bienias and Alexey V. Gorshkov} } @article {2564, title = {Optimal Protocols in Quantum Annealing and QAOA Problems}, year = {2020}, month = {3/19/2020}, abstract = {

Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or \"bang-bang\") structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. Through simulations of various transverse field Ising models, we demonstrate that bang-anneal-bang protocols are more common. The general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.

}, url = {https://arxiv.org/abs/2003.08952}, author = {Lucas T. Brady and Christopher L. Baldwin and Aniruddha Bapat and Yaroslav Kharkov and Alexey V. Gorshkov} } @article {2557, title = {Quantum Coupon Collector}, journal = {Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), Leibniz International Proceedings in Informatics}, volume = {158}, year = {2020}, month = {2/18/2020}, pages = {10:1-10:17}, abstract = {

We study how efficiently a k-element set S\⊆[n] can be learned from a uniform superposition |S\⟩ of its elements. One can think of |S\⟩=\∑i\∈S|i\⟩/|S|\−\−\−\√ as the quantum version of a uniformly random sample over S, as in the classical analysis of the {\textquoteleft}{\textquoteleft}coupon collector problem.\&$\#$39;\&$\#$39; We show that if k is close to n, then we can learn S using asymptotically fewer quantum samples than random samples. In particular, if there are n\−k=O(1) missing elements then O(k) copies of |S\⟩ suffice, in contrast to the Θ(klogk) random samples needed by a classical coupon collector. On the other hand, if n\−k=Ω(k), then Ω(klogk) quantum samples are~necessary. More generally, we give tight bounds on the number of quantum samples needed for every k and n, and we give efficient quantum learning algorithms. We also give tight bounds in the model where we can additionally reflect through |S\⟩. Finally, we relate coupon collection to a known example separating proper and improper PAC learning that turns out to show no separation in the quantum case.

}, doi = {10.4230/LIPIcs.TQC.2020.10}, url = {https://arxiv.org/abs/2002.07688}, author = {Srinivasan Arunachalam and Aleksandrs Belovs and Andrew M. Childs and Robin Kothari and Ansis Rosmanis and Ronald de Wolf} } @article {2497, title = {Quantum Simulation of Hyperbolic Space with Circuit Quantum Electrodynamics: From Graphs to Geometry}, journal = {Phys. Rev. A}, volume = {102}, year = {2020}, month = {9/11/2020}, abstract = {

We show how quantum many-body systems on hyperbolic lattices with nearest-neighbor hopping and local interactions can be mapped onto quantum field theories in continuous negatively curved space. The underlying lattices have recently been realized experimentally with superconducting resonators and therefore allow for a table-top quantum simulation of quantum physics in curved background. Our mapping provides a computational tool to determine observables of the discrete system even for large lattices, where exact diagonalization fails. As an application and proof of principle we quantitatively reproduce the ground state energy, spectral gap, and correlation functions of the noninteracting lattice system by means of analytic formulas on the Poincar{\'e} disk, and show how conformal symmetry emerges for large lattices. This sets the stage for studying interactions and disorder on hyperbolic graphs in the future. Our analysis also reveals in which sense discrete hyperbolic lattices emulate the continuous geometry of negatively curved space and thus can be used to resolve fundamental open problems at the interface of interacting many-body systems, quantum field theory in curved space, and quantum gravity.

}, doi = {https://doi.org/10.1103/PhysRevA.102.032208}, url = {https://arxiv.org/abs/1910.12318}, author = {Igor Boettcher and Przemyslaw Bienias and Ron Belyansky and Alicia J. Koll{\'a}r and Alexey V. Gorshkov} } @article {2570, title = {Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer}, year = {2020}, month = {2/6/2020}, abstract = {

The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.

}, url = {https://arxiv.org/abs/2002.02537}, author = {C. Huerta Alderete and Shivani Singh and Nhung H. Nguyen and Daiwei Zhu and Radhakrishnan Balu and Christopher Monroe and C. M. Chandrashekar and Norbert M. Linke} } @article {2636, title = {Realizing and Probing Baryonic Excitations in Rydberg Atom Arrays}, year = {2020}, month = {7/14/2020}, abstract = {

We propose a realization of mesonic and baryonic quasiparticle excitations in Rydberg atom arrays with programmable interactions. Recent experiments have shown that such systems possess a Z3-ordered crystalline phase whose low-energy quasiparticles are defects in the crystalline order. By engineering a Z3-translational-symmetry breaking field on top of the Rydberg-blockaded Hamiltonian, we show that different types of defects experience confinement, and as a consequence form mesonic or baryonic quasiparticle excitations. We illustrate the formation of these quasiparticles by studying a quantum chiral clock model related to the Rydberg Hamiltonian. We then propose an experimental protocol involving out-of-equilibrium dynamics to directly probe the spectrum of the confined excitations. We show that the confined quasiparticle spectrum can limit quantum information spreading in this system. This proposal is readily applicable to current Rydberg experiments, and the method can be easily generalized to more complex confined excitations (e.g. {\textquoteleft}tetraquarks\&$\#$39;, {\textquoteleft}pentaquarks\&$\#$39;) in phases with Zq order for q\>3.\ 

}, url = {https://arxiv.org/abs/2007.07258}, author = {Fangli Liu and Seth Whitsitt and Przemyslaw Bienias and Rex Lundgren and Alexey V. Gorshkov} } @article {2681, title = {Resonant enhancement of three-body loss between strongly interacting photons}, year = {2020}, month = {10/19/2020}, abstract = {

Rydberg polaritons provide an example of a rare type of system where three-body interactions can be as strong or even stronger than two-body interactions. The three-body interactions can be either dispersive or dissipative, with both types possibly giving rise to exotic, strongly-interacting, and topological phases of matter. Despite past theoretical and experimental studies of the regime with dispersive interaction, the dissipative regime is still mostly unexplored. Using a renormalization group technique to solve the three-body Schr{\"o}dinger equation, we show how the shape and strength of dissipative three-body forces can be universally enhanced for Rydberg polaritons. We demonstrate how these interactions relate to the transmission through a single-mode cavity, which can be used as a probe of the three-body physics in current experiment

}, url = {https://arxiv.org/abs/2010.09772}, author = {Marcin Kalinowski and Yidan Wang and Przemyslaw Bienias and Michael Gullans and Dalia P. Ornelas-Huerta and Alexander N. Craddock and Steven L. Rolston and J. V. Porto and Hans Peter B{\"u}chler and Alexey V. Gorshkov} } @article {2610, title = {Security Limitations of Classical-Client Delegated Quantum Computing}, year = {2020}, month = {7/3/2020}, abstract = {

Secure delegated quantum computing allows a computationally weak client to outsource an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. One of the promising candidates to achieve classical delegation of quantum computation is classical-client remote state preparation (RSPCC), where a client remotely prepares a quantum state using a classical channel. However, the privacy loss incurred by employing RSPCC as a sub-module is unclear.
In this work, we investigate this question using the Constructive Cryptography framework by Maurer and Renner (ICS\&$\#$39;11). We first identify the goal of RSPCC as the construction of ideal RSP resources from classical channels and then reveal the security limitations of using RSPCC. First, we uncover a fundamental relationship between constructing ideal RSP resources (from classical channels) and the task of cloning quantum states. Any classically constructed ideal RSP resource must leak to the server the full classical description (possibly in an encoded form) of the generated quantum state, even if we target computational security only. As a consequence, we find that the realization of common RSP resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem. Second, the above result does not rule out that a specific RSPCC protocol can replace the quantum channel at least in some contexts, such as the Universal Blind Quantum Computing (UBQC) protocol of Broadbent et al. (FOCS \&$\#$39;09). However, we show that the resulting UBQC protocol cannot maintain its proven composable security as soon as RSPCC is used as a subroutine. Third, we show that replacing the quantum channel of the above UBQC protocol by the RSPCC protocol QFactory of Cojocaru et al. (Asiacrypt \&$\#$39;19), preserves the weaker, game-based, security of UBQC.

}, url = {https://arxiv.org/abs/2007.01668}, author = {Christian Badertscher and Alexandru Cojocaru and L{\'e}o Colisson and Elham Kashefi and Dominik Leichtle and Atul Mantri and Petros Wallden} } @article {2644, title = {Spin-Mediated Mott Excitons}, year = {2020}, month = {4/22/2020}, abstract = {

Motivated by recent experiments on Mott insulators, in both iridates and ultracold atoms, we theoretically study the effects of magnetic order on the Mott-Hubbard excitons. In particular, we focus on spin-mediated doublon-holon pairing in Hubbard materials. We use several complementary theoretical techniques: mean-field theory to describe the spin degrees of freedom, the self-consistent Born approximation to characterize individual charge excitations across the Hubbard gap, and the Bethe-Salpeter equation to identify bound states of doublons and holons. The binding energy of the Hubbard exciton is found to increase with increasing the N{{\'e}}el order parameter, while the exciton mass decreases. We observe that these trends rely significantly on the retardation of the effective interaction, and require consideration of multiple effects from changing the magnetic order. Our results are consistent with the key qualitative trends observed in recent experiments on iridates. Moreover, the findings could have direct implications on ultracold atom Mott insulators, where the Hubbard model is the exact description of the system and the microscopic degrees of freedom can be directly accessed.\ 

}, url = {https://arxiv.org/abs/2004.10825}, author = {T. -S. Huang and Christopher L. Baldwin and M. Hafezi and V. Galitski} } @article {2579, title = {Studying viral populations with tools from quantum spin chains}, year = {2020}, month = {3/24/2020}, abstract = {

We study Eigen\&$\#$39;s model of quasi-species, characterized by sequences that replicate with a specified fitness and mutate independently at single sites. The evolution of the population vector in time is then closely related to that of quantum spins in imaginary time. We employ multiple perspectives and tools from interacting quantum systems to examine growth and collapse of realistic viral populations, specifically certain HIV proteins. All approaches used, including the simplest perturbation theory, give consistent results.

}, url = {https://arxiv.org/abs/2003.10668}, author = {Saumya Shivam and Christopher L. Baldwin and John Barton and Mehran Kardar and S. L. Sondhi} } @conference {2599, title = {Symmetries, graph properties, and quantum speedups}, booktitle = {Proceedings of the 61st IEEE Symposium on Foundations of Computer Science (FOCS 2020), pp. 649{\textendash}660 (2020)}, year = {2020}, month = {6/23/2020}, abstract = {

Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup?
In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent super-polynomial quantum speedups. We prove this by fully characterizing the primitive permutation groups that allow super-polynomial quantum speedups.
In contrast, in the adjacency list model for bounded-degree graphs (where graph symmetry is manifested differently), we exhibit a property testing problem that shows an exponential quantum speedup. These results resolve open questions posed by Ambainis, Childs, and Liu (2010) and Montanaro and de Wolf (2013).

}, doi = {https://doi.org/10.1109/FOCS46700.2020.00066}, url = {https://arxiv.org/abs/2006.12760}, author = {Shalev Ben-David and Andrew M. Childs and Andras Gilyen and William Kretschmer and Supartha Podder and Daochen Wang} } @article {2690, title = {Symmetry breaking and error correction in open quantum systems}, journal = {Phys. Rev. Lett. }, volume = {125}, year = {2020}, month = {8/6/2020}, pages = {240405}, abstract = {

Symmetry-breaking transitions are a well-understood phenomenon of closed quantum systems in quantum optics, condensed matter, and high energy physics. However, symmetry breaking in open systems is less thoroughly understood, in part due to the richer steady-state and symmetry structure that such systems possess. For the prototypical open system---a Lindbladian---a unitary symmetry can be imposed in a \"weak\" or a \"strong\" way. We characterize the possible Zn symmetry breaking transitions for both cases. In the case of Z2, a weak-symmetry-broken phase guarantees at most a classical bit steady-state structure, while a strong-symmetry-broken phase admits a partially-protected steady-state qubit. Viewing photonic cat qubits through the lens of strong-symmetry breaking, we show how to dynamically recover the logical information after any gap-preserving strong-symmetric error; such recovery becomes perfect exponentially quickly in the number of photons. Our study forges a connection between driven-dissipative phase transitions and error correctio

}, doi = {https://doi.org/10.1103/PhysRevLett.125.240405}, url = {https://arxiv.org/abs/2008.02816}, author = {Simon Lieu and Ron Belyansky and Jeremy T. Young and Rex Lundgren and Victor V. Albert and Alexey V. Gorshkov} } @article {2402, title = {Time-dependent Hamiltonian simulation with L1-norm scaling}, journal = {Quantum}, volume = {4}, year = {2020}, month = {4/20/2020}, abstract = {

The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the simulation complexity should only depend on this quantity instantaneously. We develop quantum simulation algorithms that exploit this intuition. For the case of sparse Hamiltonian simulation, the gate complexity scales with the L1 norm \∫t0dτ||H(τ)||max, whereas the best previous results scale with tmaxτ\∈[0,t]||H(τ)||max. We also show analogous results for Hamiltonians that are linear combinations of unitaries. Our approaches thus provide an improvement over previous simulation algorithms that can be substantial when the Hamiltonian varies significantly. We introduce two new techniques: a classical sampler of time-dependent Hamiltonians and a rescaling principle for the Schr{\"o}dinger equation. The rescaled Dyson-series algorithm is nearly optimal with respect to all parameters of interest, whereas the sampling-based approach is easier to realize for near-term simulation. By leveraging the L1-norm information, we obtain polynomial speedups for semi-classical simulations of scattering processes in quantum chemistry.

}, doi = {https://doi.org/10.22331/q-2020-04-20-254}, url = {https://arxiv.org/abs/1906.07115}, author = {Dominic W. Berry and Andrew M. Childs and Yuan Su and Xin Wang and Nathan Wiebe} } @article {2609, title = {Transport and dynamics in the frustrated two-bath spin-boson model}, year = {2020}, month = {7/7/2020}, abstract = {

We study the strong coupling dynamics as well as transport properties of photons in the two-bath spin-boson model, in which a spin-1/2 particle is frustratingly coupled to two independent Ohmic bosonic baths. Using a combination of numerical and analytical methods, we show that the frustration in this model gives rise to rich physics in a very wide range of energies. This is in contrast to the one-bath spin-boson model, where the non-trivial physics occurs at an energy scale close to the renormalized spin frequency. The renormalized spin frequency in the two-bath spin-boson model is still important, featuring in different observables, including the non-equiblirum dynamics of both the spin and the baths along with the elastic transport properties of a photon. The latter however reveals a much more complex structure. The elastic scattering displays non-monotonic behavior at high frequencies, and is very different in the two channels: intra- and inter-bath scattering. The photon can also be inelastically scattered, a process in which it is split into several photons of smaller energies. We show that such inelastic processes are highly anisotropic, with the outgoing particles being preferentially emitted into only one of the baths. Moreover, the inelastic scattering rate is parameterically larger than in the one-bath case, and can even exceed the total elastic rate. Our results can be verified with state-of-the-art circuit and cavity quantum electrodynamics experiments.\ 

}, url = {https://arxiv.org/abs/2007.03690}, author = {Ron Belyansky and Seth Whitsitt and Rex Lundgren and Yidan Wang and Andrei Vrajitoarea and Andrew A. Houck and Alexey V. Gorshkov} } @article {2673, title = {Understanding the Frauchiger-Renner Argument}, year = {2020}, month = {9/4/2020}, abstract = {

In 2018, Daniela Frauchiger and Renato Renner published an article in Nature Communications entitled {\textquoteleft}Quantum theory cannot consistently describe the use of itself.\&$\#$39; I clarify the significance of the result and point out a common and persistent misunderstanding of the argument, which has been attacked as flawed from a variety of interpretational perspectives.

}, url = {https://arxiv.org/abs/2008.08538}, author = {Jeffrey Bub} } @article {2578, title = {Universal one-dimensional discrete-time quantum walks and their implementation on near term quantum hardware}, year = {2020}, month = {1/30/2020}, abstract = {

Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. Quantum walks represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves onto the multi-qubit states in a quantum processor, we present different configurations of quantum circuits for the implementation of discrete-time quantum walks in one-dimensional position space. With example circuits for a five qubit machine we address scalability to higher dimensions and larger quantum processors.

}, url = {https://arxiv.org/abs/2001.11197}, author = {Shivani Singh and Cinthia H. Alderete and Radhakrishnan Balu and Christopher Monroe and Norbert M. Linke and C. M. Chandrashekar} } @article {2562, title = {Accelerated Variational Quantum Eigensolver}, journal = {Phys. Rev. Lett. }, volume = {122}, year = {2019}, month = {3/25/2019}, abstract = {

The problem of finding the ground state energy of a Hamiltonian using a quantum computer is currently solved using either the quantum phase estimation (QPE) or variational quantum eigensolver (VQE) algorithms. For precision ε, QPE requires O(1) repetitions of circuits with depth O(1/ε), whereas each expectation estimation subroutine within VQE requires O(1/ε2) samples from circuits with depth O(1). We propose a generalised VQE algorithm that interpolates between these two regimes via a free parameter α\∈[0,1] which can exploit quantum coherence over a circuit depth of O(1/εα) to reduce the number of samples to O(1/ε2(1\−α)). Along the way, we give a new routine for expectation estimation under limited quantum resources that is of independent interest.

}, doi = {https://doi.org/10.1103/PhysRevLett.122.140504}, url = {https://arxiv.org/abs/1802.00171}, author = {Daochen Wang and Oscar Higgott and Stephen Brierley} } @article {2321, title = {Bang-bang control as a design principle for classical and quantum optimization algorithms}, journal = {Quantum Information \& Computation }, volume = {19}, year = {2019}, month = {8/1/2019}, pages = {424-446}, abstract = {

Physically motivated classical heuristic optimization algorithms such as simulated annealing (SA) treat the objective function as an energy landscape, and allow walkers to escape local minima. It has been argued that quantum properties such as tunneling may give quantum algorithms advantage in finding ground states of vast, rugged cost landscapes. Indeed, the Quantum Adiabatic Algorithm (QAO) and the recent Quantum Approximate Optimization Algorithm (QAOA) have shown promising results on various problem instances that are considered classically hard. Here, we argue that the type of control strategy used by the optimization algorithm may be crucial to its success. Along with SA, QAO and QAOA, we define a new, bang-bang version of simulated annealing, BBSA, and study the performance of these algorithms on two well-studied problem instances from the literature. Both classically and quantumly, the successful control strategy is found to be bang-bang, exponentially outperforming the quasistatic analogues on the same instances. Lastly, we construct O(1)-depth QAOA protocols for a class of symmetric cost functions, and provide an accompanying physical picture.

}, url = {https://arxiv.org/abs/1812.02746}, author = {Aniruddha Bapat and Stephen Jordan} } @article {2451, title = {Classifying single-qubit noise using machine learning}, year = {2019}, month = {8/30/2019}, abstract = {

Quantum characterization, validation, and verification (QCVV) techniques are used to probe, characterize, diagnose, and detect errors in quantum information processors (QIPs). An important component of any QCVV protocol is a mapping from experimental data to an estimate of a property of a QIP. Machine learning (ML) algorithms can help automate the development of QCVV protocols, creating such maps by learning them from training data. We identify the critical components of \"machine-learned\" QCVV techniques, and present a rubric for developing them. To demonstrate this approach, we focus on the problem of determining whether noise affecting a single qubit is coherent or stochastic (incoherent) using the data sets originally proposed for gate set tomography. We leverage known ML algorithms to train a classifier distinguishing these two kinds of noise. The accuracy of the classifier depends on how well it can approximate the \"natural\" geometry of the training data. We find GST data sets generated by a noisy qubit can reliably be separated by linear surfaces, although feature engineering can be necessary. We also show the classifier learned by a support vector machine (SVM) is robust under finite-sample noise.\ 

}, url = {https://arxiv.org/abs/1908.11762}, author = {Travis L. Scholten and Yi-Kai Liu and Kevin Young and Robin Blume-Kohout} } @article {2407, title = {Competing (Semi)-Selfish Miners in Bitcoin}, year = {2019}, month = {06/11/2019}, abstract = {

The Bitcoin protocol prescribes certain behavior by the miners who are responsible for maintaining and extending the underlying blockchain; in particular, miners who successfully solve a puzzle, and hence can extend the chain by a block, are supposed to release that block immediately. Eyal and Sirer showed, however, that a selfish miner is incentivized to deviate from the protocol and withhold its blocks under certain conditions. The analysis by Eyal and Sirer, as well as in followup work, considers a \emph{single} deviating miner (who may control a large fraction of the hashing power in the network) interacting with a remaining pool of honest miners. Here, we extend this analysis to the case where there are \emph{multiple} (non-colluding) selfish miners. We find that with multiple strategic miners, specific deviations from honest mining by multiple strategic agents can outperform honest mining, even if individually miners would not be incentivised to be dishonest. This previous point effectively renders the Bitcoin protocol to be less secure than previously thought.\ 

}, url = {https://arxiv.org/abs/1906.04502}, author = {Francisco J. Marmolejo-Coss{\'\i}o and Eric Brigham and Benjamin Sela and Jonathan Katz} } @article {2533, title = {Development of Quantum InterConnects for Next-Generation Information Technologies}, year = {2019}, month = {12/13/2019}, abstract = {

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.\ 

}, url = {https://arxiv.org/abs/1912.06642}, author = {David Awschalom and Karl K. Berggren and Hannes Bernien and Sunil Bhave and Lincoln D. Carr and Paul Davids and Sophia E. Economou and Dirk Englund and Andrei Faraon and Marty Fejer and Saikat Guha and Martin V. Gustafsson and Evelyn Hu and Liang Jiang and Jungsang Kim and Boris Korzh and Prem Kumar and Paul G. Kwiat and Marko Lon{\v c}ar and Mikhail D. Lukin and David A. B. Miller and Christopher Monroe and Sae Woo Nam and Prineha Narang and Jason S. Orcutt} } @article {2405, title = {Equilibration to the non-Abelian thermal state in quantum many-body physics}, year = {2019}, month = {6/21/2019}, abstract = {

In statistical mechanics, a small system exchanges conserved charges---heat, particles, electric charge, etc.---with a bath. The small system thermalizes to the canonical ensemble, or the grand canonical ensemble, etc., depending on the charges. The charges are usually represented by operators assumed to commute with each other. This assumption was removed within quantum-information-theoretic (QI-theoretic) thermodynamics recently. The small system\&$\#$39;s long-time state was dubbed \"the non-Abelian thermal state (NATS).\" We propose an experimental protocol for observing a system thermalize to the NATS. We illustrate with a chain of spins, a subset of which form the system of interest. The conserved charges manifest as spin components. Heisenberg interactions push the charges between the system and the effective bath, the rest of the chain. We predict long-time expectation values, extending the NATS theory from abstract idealization to finite systems that thermalize with finite couplings for finite times. Numerical simulations support the analytics: The system thermalizes to the NATS, rather than to the canonical prediction. Our proposal can be implemented with ultracold atoms, nitrogen-vacancy centers, trapped ions, quantum dots, and perhaps nuclear magnetic resonance. This work introduces noncommuting charges from QI-theoretic thermodynamics into quantum many-body physics: atomic, molecular, and optical physics and condensed matter.\ 

}, url = {https://arxiv.org/abs/1906.09227}, author = {Nicole Yunger Halpern and Michael E. Beverland and Amir Kalev} } @article {2409, title = {Floquet engineering of optical lattices with spatial features and periodicity below the diffraction limit}, year = {2019}, month = {06/18/2019}, abstract = {

Floquet engineering or coherent time periodic driving of quantum systems has been successfully used to synthesize Hamiltonians with novel properties. In ultracold atomic systems, this has led to experimental realizations of artificial gauge fields, topological band structures, and observation of dynamical localization, to name just a few. Here we present a Floquet-based framework to stroboscopically engineer Hamiltonians with spatial features and periodicity below the diffraction limit of light used to create them by time-averaging over various configurations of a 1D optical Kronig-Penney (KP) lattice. The KP potential is a lattice of narrow subwavelength barriers spaced by half the optical wavelength (λ/2) and arises from the non-linear optical response of the atomic dark state. Stroboscopic control over the strength and position of this lattice requires time-dependent adiabatic manipulation of the dark state spin composition. We investigate adiabaticity requirements and shape our time-dependent light fields to respect the requirements. We apply this framework to show that a λ/4-spaced lattice can be synthesized using realistic experimental parameters as an example, discuss mechanisms that limit lifetimes in these lattices, explore candidate systems and their limitations, and treat adiabatic loading into the ground band of these lattices.

}, url = {https://arxiv.org/abs/1906.07646}, author = {S. Subhankar and P. Bienias and P. Titum and T-C. Tsui and Y. Wang and Alexey V. Gorshkov and S. L. Rolston and J. V. Porto} } @article {1995, title = {Graphical Methods in Device-Independent Quantum Cryptography}, journal = {Quantum}, volume = {3}, year = {2019}, month = {05/20/2019}, abstract = {

We introduce a framework for graphical security proofs in device-independent quantum cryptography using the methods of categorical quantum mechanics. We are optimistic that this approach will make some of the highly complex proofs in quantum cryptography more accessible, facilitate the discovery of new proofs, and enable automated proof verification. As an example of our framework, we reprove a recent result from device-independent quantum cryptography: any linear randomness expansion protocol can be converted into an unbounded randomness expansion protocol. We give a graphical exposition of a proof of this result and implement parts of it in the Globular proof assistant.

}, doi = {https://doi.org/10.22331/q-2019-05-27-146}, url = {https://arxiv.org/abs/1705.09213}, author = {Spencer Breiner and Carl Miller and Neil J. Ross} } @article {2369, title = {Ground-state energy estimation of the water molecule on a trapped ion quantum computer}, year = {2019}, month = {03/07/2019}, abstract = {

Quantum computing leverages the quantum resources of superposition and entanglement to efficiently solve computational problems considered intractable for classical computers. Examples include calculating molecular and nuclear structure, simulating strongly-interacting electron systems, and modeling aspects of material function. While substantial theoretical advances have been made in mapping these problems to quantum algorithms, there remains a large gap between the resource requirements for solving such problems and the capabilities of currently available quantum hardware. Bridging this gap will require a co-design approach, where the expression of algorithms is developed in conjunction with the hardware itself to optimize execution. Here, we describe a scalable co-design framework for solving chemistry problems on a trapped ion quantum computer, and apply it to compute the ground-state energy of the water molecule. The robust operation of the trapped ion quantum computer yields energy estimates with errors approaching the chemical accuracy, which is the target threshold necessary for predicting the rates of chemical reaction dynamics.

}, url = {https://arxiv.org/abs/1902.10171}, author = {Yunseong Nam and Jwo-Sy Chen and Neal C. Pisenti and Kenneth Wright and Conor Delaney and Dmitri Maslov and Kenneth R. Brown and Stewart Allen and Jason M. Amini and Joel Apisdorf and Kristin M. Beck and Aleksey Blinov and Vandiver Chaplin and Mika Chmielewski and Coleman Collins and Shantanu Debnath and Andrew M. Ducore and Kai M. Hudek and Matthew Keesan and Sarah M. Kreikemeier and Jonathan Mizrahi and Phil Solomon and Mike Williams and Jaime David Wong-Campos and Christopher Monroe and Jungsang Kim} } @article {2460, title = {Nondestructive cooling of an atomic quantum register via state-insensitive Rydberg interactions}, year = {2019}, month = {7/28/2019}, abstract = {

We propose a protocol for sympathetically cooling neutral atoms without destroying the quantum information stored in their internal states. This is achieved by designing state-insensitive Rydberg interactions between the data-carrying atoms and cold auxiliary atoms. The resulting interactions give rise to an effective phonon coupling, which leads to the transfer of heat from the data atoms to the auxiliary atoms, where the latter can be cooled by conventional methods. This can be used to extend the lifetime of quantum storage based on neutral atoms and can have applications for long quantum computations. The protocol can also be modified to realize state-insensitive interactions between the data and the auxiliary atoms but tunable and non-trivial interactions among the data atoms, allowing one to simultaneously cool and simulate a quantum spin-model.\ 

}, url = {https://arxiv.org/abs/1907.11156}, author = {Ron Belyansky and Jeremy T. Young and Przemyslaw Bienias and Zachary Eldredge and Adam M. Kaufman and Peter Zoller and Alexey V. Gorshkov} } @article {2520, title = {Observation of Domain Wall Confinement and Dynamics in a Quantum Simulator}, year = {2019}, month = {12/23/2019}, abstract = {

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

}, url = {https://arxiv.org/abs/1912.11117}, author = {W. L. Tan and P. Becker and F. Liu and G. Pagano and K. S. Collins and A. De and L. Feng and H. B. Kaplan and A. Kyprianidis and R. Lundgren and W. Morong and S. Whitsitt and Alexey V. Gorshkov and C. Monroe} } @article {2362, title = {Opportunities for Nuclear Physics \& Quantum Information Science}, year = {2019}, month = {03/13/2019}, abstract = {

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.

}, url = {https://arxiv.org/abs/1903.05453}, author = {I. C. Clo{\"e}t and Matthew R. Dietrich and John Arrington and Alexei Bazavov and Michael Bishof and Adam Freese and Alexey V. Gorshkov and Anna Grassellino and Kawtar Hafidi and Zubin Jacob and Michael McGuigan and Yannick Meurice and Zein-Eddine Meziani and Peter Mueller and Christine Muschik and James Osborn and Matthew Otten and Peter Petreczky and Tomas Polakovic and Alan Poon and Raphael Pooser and Alessandro Roggero and Mark Saffman and Brent VanDevender and Jiehang Zhang and Erez Zohar} } @article {2223, title = {Parallel Self-Testing of the GHZ State with a Proof by Diagrams}, journal = {EPTCS }, volume = {287}, year = {2019}, month = {01/29/2019}, pages = {43-66}, abstract = {

Quantum self-testing addresses the following question: is it possible to verify the existence of a multipartite state even when one\&$\#$39;s measurement devices are completely untrusted? This problem has seen abundant activity in the last few years, particularly with the advent of parallel self-testing (i.e., testing several copies of a state at once), which has applications not only to quantum cryptography but also quantum computing. In this work we give the first error-tolerant parallel self-test in a three-party (rather than two-party) scenario, by showing that an arbitrary number of copies of the GHZ state can be self-tested. In order to handle the additional complexity of a three-party setting, we use a diagrammatic proof based on categorical quantum mechanics, rather than a typical symbolic proof. The diagrammatic approach allows for manipulations of the complicated tensor networks that arise in the proof, and gives a demonstration of the importance of picture-languages in quantum information.

}, doi = {https://doi.org/10.4204/EPTCS.287.3}, url = {https://arxiv.org/abs/1806.04744}, author = {Spencer Breiner and Amir Kalev and Carl Miller} } @article {2415, title = {Polynomial Time Algorithms for Estimating Spectra of Adiabatic Hamiltonians}, journal = {Phys. Rev. A}, volume = {100}, year = {2019}, month = {10/1/2020}, abstract = {

Much research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians with Hamming symmetric potentials, such as the well studied \"spike\" example. Due to the large amount of symmetry in these potentials such problems are readily open to analysis both analytically and computationally. However, more realistic potentials do not have such a high degree of symmetry and may have many local minima. Here we present a somewhat more realistic class of problems consisting of many individually Hamming symmetric potential wells. For two or three such wells we demonstrate that such a problem can be solved exactly in time polynomial in the number of qubits and wells. For greater than three wells, we present a tight binding approach with which to efficiently analyze the performance of such Hamiltonians in an adiabatic computation. We provide several basic examples designed to highlight the usefulness of this toy model and to give insight into using the tight binding approach to examining it, including: (1) adiabatic unstructured search with a transverse field driver and a prior guess to the marked item and (2) a scheme for adiabatically simulating the ground states of small collections of strongly interacting spins, with an explicit demonstration for an Ising model Hamiltonian.

}, doi = {https://doi.org/10.1103/PhysRevA.100.032336}, url = {https://arxiv.org/abs/1905.07461}, author = {Jacob Bringewatt and William Dorland and Stephen P. Jordan} } @article {2410, title = {Quantum Approximate Optimization with a Trapped-Ion Quantum Simulator}, year = {2019}, month = {06/06/2019}, abstract = {

Quantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly solving exponentially hard problems, such as optimization and satisfiability. Here we report the first implementation of a shallow-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator to estimate the ground state energy of the transverse field Ising model with tunable long-range interactions. First, we exhaustively search the variational control parameters to approximate the ground state energy with up to 40 trapped-ion qubits. We then interface the quantum simulator with a classical algorithm to more efficiently find the optimal set of parameters that minimizes the resulting energy of the system. We finally sample from the full probability distribution of the QAOA output with single-shot and efficient measurements of every qubit.\ 

}, url = {https://arxiv.org/abs/1906.02700}, author = {G. Pagano and A. Bapat and P. Becker and K. S. Collins and A. De and P. W. Hess and H. B. Kaplan and A. Kyprianidis and W. L. Tan and Christopher L. Baldwin and L. T. Brady and A. Deshpande and F. Liu and S. Jordan and Alexey V. Gorshkov and C. Monroe} } @article {2530, title = {Quantum Computer Systems for Scientific Discovery}, year = {2019}, month = {12/16/2019}, abstract = {

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.

}, url = {https://arxiv.org/abs/1912.07577}, author = {Yuri Alexeev and Dave Bacon and Kenneth R. Brown and Robert Calderbank and Lincoln D. Carr and Frederic T. Chong and Brian DeMarco and Dirk Englund and Edward Farhi and Bill Fefferman and Alexey V. Gorshkov and Andrew Houck and Jungsang Kim and Shelby Kimmel and Michael Lange and Seth Lloyd and Mikhail D. Lukin and Dmitri Maslov and Peter Maunz and Christopher Monroe and John Preskill and Martin Roetteler and Martin Savage and Jeff Thompson and Umesh Vazirani} } @article {2486, title = {Quantum Computing at the Frontiers of Biological Sciences}, year = {2019}, month = {2019/11/16}, abstract = {

The search for meaningful structure in biological data has relied on cutting-edge advances in computational technology and data science methods. However, challenges arise as we push the limits of scale and complexity in biological problems. Innovation in massively parallel, classical computing hardware and algorithms continues to address many of these challenges, but there is a need to simultaneously consider new paradigms to circumvent current barriers to processing speed. Accordingly, we articulate a view towards quantum computation and quantum information science, where algorithms have demonstrated potential polynomial and exponential computational speedups in certain applications, such as machine learning. The maturation of the field of quantum computing, in hardware and algorithm development, also coincides with the growth of several collaborative efforts to address questions across length and time scales, and scientific disciplines. We use this coincidence to explore the potential for quantum computing to aid in one such endeavor: the merging of insights from genetics, genomics, neuroimaging and behavioral phenotyping. By examining joint opportunities for computational innovation across fields, we highlight the need for a common language between biological data analysis and quantum computing. Ultimately, we consider current and future prospects for the employment of quantum computing algorithms in the biological sciences.\ 

}, url = {https://arxiv.org/abs/1911.07127}, author = {Prashant S. Emani and Jonathan Warrell and Alan Anticevic and Stefan Bekiranov and Michael Gandal and Michael J. McConnell and Guillermo Sapiro and Al{\'a}n Aspuru-Guzik and Justin Baker and Matteo Bastiani and Patrick McClure and John Murray and Stamatios N Sotiropoulos and J. M. Taylor and Geetha Senthil and Thomas Lehner and Mark B. Gerstein and Aram W. Harrow} } @article {2490, title = {Quantum Gravity in the Lab: Teleportation by Size and Traversable Wormholes}, year = {2019}, month = {2019/11/14}, abstract = {

With the long-term goal of studying quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in recent traversable wormhole constructions: information that is scrambled into one half of an entangled system will, following a weak coupling between the two halves, unscramble into the other half. We introduce the concept of \"teleportation by size\" to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semi-classical holographic wormhole corresponds to a rather special property of the operator-size distribution we call \"size winding\". For more general setups (which may not have a clean emergent geometry), we argue that imperfect size winding is a generalization of the traversable wormhole phenomenon. For example, a form of signalling continues to function at high temperature and at large times for generic chaotic systems, even though it does not correspond to a signal going through a geometrical wormhole, but rather to an interference effect involving macroscopically different emergent geometries. Finally, we outline implementations feasible with current technology in two experimental platforms: Rydberg atom arrays and trapped ions.\ 

}, url = {https://arxiv.org/abs/1911.06314}, author = {Adam R. Brown and Hrant Gharibyan and Stefan Leichenauer and Henry W. Lin and Sepehr Nezami and Grant Salton and Leonard Susskind and Brian Swingle and Michael Walter} } @article {2532, title = {Quantum Simulators: Architectures and Opportunities}, year = {2019}, month = {12/14/2019}, abstract = {

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.\ 

}, url = {https://arxiv.org/abs/1912.06938}, author = {Ehud Altman and Kenneth R. Brown and Giuseppe Carleo and Lincoln D. Carr and Eugene Demler and Cheng Chin and Brian DeMarco and Sophia E. Economou and Mark A. Eriksson and Kai-Mei C. Fu and Markus Greiner and Kaden R. A. Hazzard and Randall G. Hulet and Alicia J. Koll{\'a}r and Benjamin L. Lev and Mikhail D. Lukin and Ruichao Ma and Xiao Mi and Shashank Misra and Christopher Monroe and Kater Murch and Zaira Nazario and Kang-Kuen Ni and Andrew C. Potter and Pedram Roushan} } @article {2580, title = {Quenched vs Annealed: Glassiness from SK to SYK}, year = {2019}, month = {11/26/2019}, abstract = {

We show that any SYK-like model with finite-body interactions among \textit{local} degrees of freedom, e.g., bosons or spins, has a fundamental difference from the standard fermionic model: the former fails to be described by an annealed free energy at low temperature. In this respect, such models more closely resemble spin glasses. We demonstrate this by two means: first, a general theorem proving that the annealed free energy is divergent at low temperature in any model with a tensor product Hilbert space; and second, a replica treatment of two prominent examples which exhibit phase transitions from an \"annealed\" phase to a \"non-annealed\" phase as a function of temperature. We further show that this effect appears only at O(N)\&$\#$39;th order in a 1/N expansion, even though lower-order terms misleadingly seem to converge. Our results prove that the non-bosonic nature of the particles in SYK is an essential ingredient for its physics, highlight connections between local models and spin glasses, and raise important questions as to the role of fermions and/or glassiness in holography.

}, url = {https://arxiv.org/abs/1911.11865}, author = {Christopher L. Baldwin and Brian Swingle} } @article {2418, title = {Resource theory of entanglement for bipartite quantum channels}, year = {2019}, month = {07/08/2019}, abstract = {

The traditional perspective in quantum resource theories concerns how to use free operations to convert one resourceful quantum state to another one. For example, a fundamental and well known question in entanglement theory is to determine the distillable entanglement of a bipartite state, which is equal to the maximum rate at which fresh Bell states can be distilled from many copies of a given bipartite state by employing local operations and classical communication for free. It is the aim of this paper to take this kind of question to the next level, with the main question being: What is the best way of using free channels to convert one resourceful quantum channel to another? Here we focus on the the resource theory of entanglement for bipartite channels and establish several fundamental tasks and results regarding it. In particular, we establish bounds on several pertinent information processing tasks in channel entanglement theory, and we define several entanglement measures for bipartite channels, including the logarithmic negativity and the κ-entanglement. We also show that the max-Rains information of [B{\"a}uml et al., Physical Review Letters, 121, 250504 (2018)] has a divergence interpretation, which is helpful for simplifying the results of this earlier work.\ 

}, url = {https://arxiv.org/abs/1907.04181}, author = {Stefan B{\"a}uml and Siddhartha Das and Xin Wang and Mark M. Wilde} } @article {2217, title = {Scale-Invariant Continuous Entanglement Renormalization of a Chern Insulator}, journal = {Phys. Rev. Lett}, volume = {122}, year = {2019}, month = {03/27/2019}, abstract = {

The multi-scale entanglement renormalization ansatz (MERA) postulates the existence of quantum circuits that renormalize entanglement in real space at different length scales. Chern insulators, however, cannot have scale-invariant discrete MERA circuits with finite bond dimension. In this Letter, we show that the continuous MERA (cMERA), a modified version of MERA adapted for field theories, possesses a fixed point wavefunction with nonzero Chern number. Additionally, it is well known that reversed MERA circuits can be used to prepare quantum states efficiently in time that scales logarithmically with the size of the system. However, state preparation via MERA typically requires the advent of a full-fledged universal quantum computer. In this Letter, we demonstrate that our cMERA circuit can potentially be realized in existing analog quantum computers, i.e., an ultracold atomic Fermi gas in an optical lattice with light-induced spin-orbit coupling.\ 

}, doi = {https://doi.org/10.1103/PhysRevLett.122.120502}, url = {https://arxiv.org/abs/1807.11486}, author = {Su-Kuan Chu and Guanyu Zhu and James R. Garrison and Zachary Eldredge and Ana Vald{\'e}s Curiel and Przemyslaw Bienias and I. B. Spielman and Alexey V. Gorshkov} } @article {2401, title = {Towards Bulk Metric Reconstruction from Extremal Area Variations}, year = {2019}, month = {04/09/19}, abstract = {

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.

}, url = {https://arxiv.org/abs/1904.04834}, author = {Ning Bao and ChunJun Cao and Sebastian Fischetti and Cynthia Keeler} } @article {2574, title = {{\textquoteleft}Two Dogmas{\textquoteright} Redux}, year = {2019}, month = {7/14/2019}, publisher = {Springer, Cham}, abstract = {

I revisit the paper \‘Two dogmas about quantum mechanics,\’ co-authored with Itamar Pitowsky, in which we outlined an information-theoretic interpretation of quantum mechanics as an alternative to the Everett interpretation. Following the analysis by Frauchiger and Renner of \‘encapsulated\’ measurements (where a super-observer, with unrestricted ability to measure any arbitrary observable of a complex quantum system, measures the memory of an observer system after that system measures the spin of a qubit), I show that the Everett interpretation leads to modal contradictions. In this sense, the Everett interpretation is inconsistent.

}, url = {https://arxiv.org/abs/1907.06240}, author = {Jeffrey Bub} } @article {2412, title = {Two-qubit entangling gates within arbitrarily long chains of trapped ions}, year = {2019}, month = {05/28/2019}, abstract = {

Ion trap systems are a leading platform for large scale quantum computers. Trapped ion qubit crystals are fully-connected and reconfigurable, owing to their long range Coulomb interaction that can be modulated with external optical forces. However, the spectral crowding of collective motional modes could pose a challenge to the control of such interactions for large numbers of qubits. Here, we show that high-fidelity quantum gate operations are still possible with very large trapped ion crystals, simplifying the scaling of ion trap quantum computers. To this end, we present analytical work that determines how parallel entangling gates produce a crosstalk error that falls off as the inverse cube of the distance between the pairs. We also show experimental work demonstrating entangling gates on a fully-connected chain of seventeen 171Yb+ ions with fidelities as high as 97(1)\%.

}, url = {https://arxiv.org/abs/1905.10421}, author = {Kevin A. Landsman and Yukai Wu and Pak Hong Leung and Daiwei Zhu and Norbert M. Linke and Kenneth R. Brown and Luming Duan and Christopher R. Monroe} } @article {2416, title = {Variational Quantum Computation of Excited States}, journal = {Quantum }, volume = {3}, year = {2019}, month = {06/28/2019}, abstract = {

The calculation of excited state energies of electronic structure Hamiltonians has many important applications, such as the calculation of optical spectra and reaction rates. While low-depth quantum algorithms, such as the variational quantum eigenvalue solver (VQE), have been used to determine ground state energies, methods for calculating excited states currently involve the implementation of high-depth controlled-unitaries or a large number of additional samples. Here we show how overlap estimation can be used to deflate eigenstates once they are found, enabling the calculation of excited state energies and their degeneracies. We propose an implementation that requires the same number of qubits as VQE and at most twice the circuit depth. Our method is robust to control errors, is compatible with error-mitigation strategies and can be implemented on near-term quantum compute

}, doi = {https://doi.org/10.22331/q-2019-07-01-156}, url = {https://arxiv.org/abs/1805.08138}, author = {Oscar Higgott and Daochen Wang and Stephen Brierley} } @article {2221, title = {Classical lower bounds from quantum upper bounds}, year = {2018}, abstract = {

We prove lower bounds on complexity measures, such as the approximate degree of a Boolean function and the approximate rank of a Boolean matrix, using quantum arguments. We prove these lower bounds using a quantum query algorithm for the combinatorial group testing problem.\ 
We show that for any function f, the approximate degree of computing the OR of n copies of f is Omega(sqrt{n}) times the approximate degree of f, which is optimal. No such general result was known prior to our work, and even the lower bound for the OR of ANDs function was only resolved in 2013.\ 
We then prove an analogous result in communication complexity, showing that the logarithm of the approximate rank (or more precisely, the approximate gamma_2 norm) of F: X x Y -\> {0,1} grows by a factor of Omega~(sqrt{n}) when we take the OR of n copies of F, which is also essentially optimal. As a corollary, we give a new proof of Razborov\&$\#$39;s celebrated Omega(sqrt{n}) lower bound on the quantum communication complexity of the disjointness problem.\ 
Finally, we generalize both these results from composition with the OR function to composition with arbitrary symmetric functions, yielding nearly optimal lower bounds in this setting as well.

}, url = {https://arxiv.org/abs/1807.06256}, author = {Shalev Ben-David and Adam Bouland and Ankit Garg and Robin Kothari} } @article {2216, title = {Coherent optical nano-tweezers for ultra-cold atoms}, year = {2018}, abstract = {

There has been a recent surge of interest and progress in creating subwavelength free-space optical potentials for ultra-cold atoms. A key open question is whether geometric potentials, which are repulsive and ubiquitous in the creation of subwavelength free-space potentials, forbid the creation of narrow traps with long lifetimes. Here, we show that it is possible to create such traps. We propose two schemes for realizing subwavelength traps and demonstrate their superiority over existing proposals. We analyze the lifetime of atoms in such traps and show that long-lived bound states are possible. This work opens a new frontier for the subwavelength control and manipulation of ultracold matter, with applications in quantum chemistry and quantum simulation.

}, url = {https://arxiv.org/abs/1808.02487}, author = {P. Bienias and S. Subhankar and Y. Wang and T-C Tsui and F. Jendrzejewski and T. Tiecke and G. Juzeliunas and L. Jiang and S. L. Rolston and J. V. Porto and Alexey V. Gorshkov} } @article {2283, title = {A Coherent Spin-Photon Interface in Silicon}, journal = {Nature }, volume = {555}, year = {2018}, month = {2018/03/29}, pages = {599-603}, abstract = {

Electron spins in silicon quantum dots are attractive systems for quantum computing due to their long coherence times and the promise of rapid scaling using semiconductor fabrication techniques. While nearest neighbor exchange coupling of two spins has been demonstrated, the interaction of spins via microwave frequency photons could enable long distance spin-spin coupling and \"all-to-all\" qubit connectivity. Here we demonstrate strong-coupling between a single spin in silicon and a microwave frequency photon with spin-photon coupling rates g_s/(2π) \> 10 MHz. The mechanism enabling coherent spin-photon interactions is based on spin-charge hybridization in the presence of a magnetic field gradient. In addition to spin-photon coupling, we demonstrate coherent control of a single spin in the device and quantum non-demolition spin state readout using cavity photons. These results open a direct path toward entangling single spins using microwave frequency photons.

}, doi = {https://doi.org/10.1038/nature25769}, url = {https://arxiv.org/abs/1710.03265}, author = {X. Mi and M. Benito and S. Putz and D. M. Zajac and J. M. Taylor and Guido Burkard and J. R. Petta} } @article {2148, title = {A coherent spin{\textendash}photon interface in silicon}, journal = {Nature}, year = {2018}, month = {2018/02/14}, abstract = {

Electron spins in silicon quantum dots are attractive systems for quantum computing owing to their long coherence times and the promise of rapid scaling of the number of dots in a system using semiconductor fabrication techniques. Although nearest-neighbour exchange coupling of two spins has been demonstrated, the interaction of spins via microwave-frequency photons could enable long-distance spin\–spin coupling and connections between arbitrary pairs of qubits (\‘all-to-all\’ connectivity) in a spin-based quantum processor. Realizing coherent spin\–photon coupling is challenging because of the small magnetic-dipole moment of a single spin, which limits magnetic-dipole coupling rates to less than 1 kilohertz. Here we demonstrate strong coupling between a single spin in silicon and a single microwave-frequency photon, with spin\–photon coupling rates of more than 10 megahertz. The mechanism that enables the coherent spin\–photon interactions is based on spin\–charge hybridization in the presence of a magnetic-field gradient. In addition to spin\–photon coupling, we demonstrate coherent control and dispersive readout of a single spin. These results open up a direct path to entangling single spins using microwave-frequency photons.

}, doi = {10.1038/nature25769}, url = {https://www.nature.com/articles/nature25769$\#$author-information}, author = {X. Mi and M. Benito and S. Putz and D. M. Zajac and J. M. Taylor and Guido Burkard and J. R. Petta} } @article {2289, title = {Cryogenic Trapped-Ion System for Large Scale Quantum Simulation}, year = {2018}, abstract = {

We present a cryogenic ion trapping system designed for large scale quantum simulation of spin models. Our apparatus is based on a segmented-blade ion trap enclosed in a 4 K cryostat, which enables us to routinely trap over 100 171Yb+ ions in a linear configuration for hours due to a low background gas pressure from differential cryo-pumping. We characterize the cryogenic vacuum by using trapped ion crystals as a pressure gauge, measuring both inelastic and elastic collision rates with the molecular background gas. We demonstrate nearly equidistant ion spacing for chains of up to 44 ions using anharmonic axial potentials. This reliable production and lifetime enhancement of large linear ion chains will enable quantum simulation of spin models that are intractable with classical computer modelling.

}, url = {https://arxiv.org/abs/1802.03118}, author = {G. Pagano and P. W. Hess and H. B. Kaplan and W. L. Tan and P. Richerme and P. Becker and A. Kyprianidis and J. Zhang and E. Birckelbaw and M. R. Hernandez and Y. Wu and C. Monroe} } @article {2141, title = {Dark state optical lattice with sub-wavelength spatial structure}, journal = {Phys. Rev. Lett.}, volume = {120}, year = {2018}, month = {2018/02/20}, pages = {083601}, abstract = {

We report on the experimental realization of a conservative optical lattice for cold atoms with a subwavelength spatial structure. The potential is based on the nonlinear optical response of three-level atoms in laser-dressed dark states, which is not constrained by the diffraction limit of the light generating the potential. The lattice consists of a one-dimensional array of ultranarrow barriers with widths less than 10\ nm, well below the wavelength of the lattice light, physically realizing a Kronig-Penney potential. We study the band structure and dissipation of this lattice and find good agreement with theoretical predictions. Even on resonance, the observed lifetimes of atoms trapped in the lattice are as long as 44\ ms, nearly\ 105times the excited state lifetime, and could be further improved with more laser intensity. The potential is readily generalizable to higher dimensions and different geometries, allowing, for example, nearly perfect box traps, narrow tunnel junctions for atomtronics applications, and dynamically generated lattices with subwavelength spacings.

}, doi = {10.1103/PhysRevLett.120.083601}, url = {https://link.aps.org/doi/10.1103/PhysRevLett.120.083601}, author = {Yang Wang and Sarthak Subhankar and Przemyslaw Bienias and Mateusz Lacki and Tsz-Chun Tsui and Mikhail A. Baranov and Alexey V. Gorshkov and Peter Zoller and James V. Porto and Steven L. Rolston} } @article {2288, title = {Demonstration of Bayesian quantum game on an ion trap quantum computer}, year = {2018}, abstract = {

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.

}, url = {https://arxiv.org/abs/1802.08116}, author = {Neal Solmeyer and Norbert M. Linke and Caroline Figgatt and Kevin A. Landsman and Radhakrishnan Balu and George Siopsis and Christopher Monroe} } @article {2047, title = {Diffusion Monte Carlo Versus Adiabatic Computation for Local Hamiltonians}, journal = {Physical Review A}, volume = {97}, year = {2018}, month = {2018/02/15}, pages = {022323}, abstract = {

Most research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians, whose ground states can be expressed with only real, nonnegative amplitudes. This raises the question of whether classical Monte Carlo algorithms can efficiently simulate quantum adiabatic optimization with stoquastic Hamiltonians. Recent results have given counterexamples in which path integral and diffusion Monte Carlo fail to do so. However, most adiabatic optimization algorithms, such as for solving MAX-k-SAT problems, use k-local Hamiltonians, whereas our previous counterexample for diffusion Monte Carlo involved n-body interactions. Here we present a new 6-local counterexample which demonstrates that even for these local Hamiltonians there are cases where diffusion Monte Carlo cannot efficiently simulate quantum adiabatic optimization. Furthermore, we perform empirical testing of diffusion Monte Carlo on a standard well-studied class of permutation-symmetric tunneling problems and similarly find large advantages for quantum optimization over diffusion Monte Carlo.

}, doi = {10.1103/PhysRevA.97.022323}, url = {https://journals.aps.org/pra/abstract/10.1103/PhysRevA.97.022323}, author = {Jacob Bringewatt and William Dorland and Stephen P. Jordan and Alan Mink} } @article {2142, title = {Dissipation induced dipole blockade and anti-blockade in driven Rydberg systems}, journal = {Phys. Rev. A}, volume = {97}, year = {2018}, month = {2018/02/28}, pages = {023424}, abstract = {

We study theoretically and experimentally the competing blockade and antiblockade effects induced by spontaneously generated contaminant Rydberg atoms in driven Rydberg systems. These contaminant atoms provide a source of strong dipole-dipole interactions and play a crucial role in the system\&$\#$39;s behavior. We study this problem theoretically using two different approaches. The first is a cumulant expansion approximation, in which we ignore third-order and higher connected correlations. Using this approach for the case of resonant drive, a many-body blockade radius picture arises, and we find qualitative agreement with previous experimental results. We further predict that as the atomic density is increased, the Rydberg population\&$\#$39;s dependence on Rabi frequency will transition from quadratic to linear dependence at lower Rabi frequencies. We study this behavior experimentally by observing this crossover at two different atomic densities. We confirm that the larger density system has a smaller crossover Rabi frequency than the smaller density system. The second theoretical approach is a set of phenomenological inhomogeneous rate equations. We compare the results of our rate-equation model to the experimental observations [E. A. Goldschmidt\ et al.,\ Phys. Rev. Lett.116, 113001 (2016)] and find that these rate equations provide quantitatively good scaling behavior of the steady-state Rydberg population for both resonant and off-resonant drives.

}, doi = {10.1103/PhysRevA.97.023424}, url = {https://link.aps.org/doi/10.1103/PhysRevA.97.023424}, author = {Jeremy T. Young and Thomas Boulier and Eric Magnan and Elizabeth A. Goldschmidt and Ryan M. Wilson and Steven L. Rolston and James V. Porto and Alexey V. Gorshkov} } @article {2273, title = {Dynamic suppression of Rayleigh light scattering in dielectric resonators}, year = {2018}, abstract = {

The ultimate limits of performance for any classical optical system are set by sub-wavelength fluctuations within the host material, that may be frozen-in or even dynamically induced. The most common manifestation of such sub-wavelength disorder is Rayleigh light scattering, which is observed in nearly all wave-guiding technologies today and can lead to both irreversible radiative losses as well as undesirable intermodal coupling. While it has been shown that backscattering from disorder can be suppressed by breaking time-reversal symmetry in magneto-optic and topological insulator materials, common optical dielectrics possess neither of these properties. Here we demonstrate an optomechanical approach for dynamically suppressing Rayleigh backscattering within dielectric resonators. We achieve this by locally breaking time-reversal symmetry in a silica resonator through a Brillouin scattering interaction that is available in all materials. Near-complete suppression of Rayleigh backscattering is experimentally confirmed through three independent measurements -- the reduction of the back-reflections caused by scatterers, the elimination of a commonly seen normal-mode splitting effect, and by measurement of the reduction in intrinsic optical loss. More broadly, our results provide new evidence that it is possible to dynamically suppress Rayleigh backscattering within any optical dielectric medium, for achieving robust light propagation in nanophotonic devices in spite of the presence of scatterers or defects.

}, url = {https://arxiv.org/abs/1803.02366}, author = {Seunghwi Kim and J. M. Taylor and Gaurav Bahl} } @article {2282, title = {Experimentally Generated Randomness Certified by the Impossibility of Superluminal Signals}, journal = {Nature}, volume = {556}, year = {2018}, month = {2018/04/11}, pages = {223-226}, abstract = {

From dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A key challenge with random number generators is that it is hard to ensure that their outputs are unpredictable. For a random number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model describing the underlying physics is required to assert unpredictability. Such a model must make a number of assumptions that may not be valid, thereby compromising the integrity of the device. However, it is possible to exploit the phenomenon of quantum nonlocality with a loophole-free Bell test to build a random number generator that can produce output that is unpredictable to any adversary limited only by general physical principles. With recent technological developments, it is now possible to carry out such a loophole-free Bell test. Here we present certified randomness obtained from a photonic Bell experiment and extract 1024 random bits uniform to within 10\−12. These random bits could not have been predicted within any physical theory that prohibits superluminal signaling and allows one to make independent measurement choices. To certify and quantify the randomness, we describe a new protocol that is optimized for apparatuses characterized by a low per-trial violation of Bell inequalities. We thus enlisted an experimental result that fundamentally challenges the notion of determinism to build a system that can increase trust in random sources. In the future, random number generators based on loophole-free Bell tests may play a role in increasing the security and trust of our cryptographic systems and infrastructure.

}, doi = {https://doi.org/10.1038/s41586-018-0019-0}, url = {https://arxiv.org/abs/1803.06219}, author = {Peter Bierhorst and Emanuel Knill and Scott Glancy and Yanbao Zhang and Alan Mink and Stephen Jordan and Andrea Rommal and Yi-Kai Liu and Bradley Christensen and Sae Woo Nam and Martin J. Stevens and Lynden K. Shalm} } @article {2256, title = {Fractional quantum Hall phases of bosons with tunable interactions: From the Laughlin liquid to a fractional Wigner crystal}, year = {2018}, abstract = {

Highly tunable platforms for realizing topological phases of matter are emerging from atomic and photonic systems, and offer the prospect of designing interactions between particles. The shape of the potential, besides playing an important role in the competition between different fractional quantum Hall phases, can also trigger the transition to symmetry-broken phases, or even to phases where topological and symmetry-breaking order coexist. Here, we explore the phase diagram of an interacting bosonic model in the lowest Landau level at half-filling as two-body interactions are tuned. Apart from the well-known Laughlin liquid, Wigner crystal phase, stripe, and bubble phases, we also find evidence of a phase that exhibits crystalline order at fractional filling per crystal site. The Laughlin liquid transits into this phase when pairs of bosons strongly repel each other at relative angular momentum 4ℏ. We show that such interactions can be achieved by dressing ground-state cold atoms with multiple different-parity Rydberg states.

}, url = {https://arxiv.org/abs/1809.04493}, author = {Tobias Gra{\ss} and Przemyslaw Bienias and Michael Gullans and Rex Lundgren and Joseph Maciejko and Alexey V. Gorshkov} } @article {2147, title = {High-fidelity quantum gates in Si/SiGe double quantum dots}, journal = {Physical Review B}, volume = {97}, year = {2018}, month = {2018/02/15}, pages = {085421}, abstract = {

Motivated by recent experiments of Zajac\ et\ al.\ [Science359, 439 (2018)], we theoretically describe high-fidelity two-qubit gates using the exchange interaction between the spins in neighboring quantum dots subject to a magnetic field gradient. We use a combination of analytical calculations and numerical simulations to provide the optimal pulse sequences and parameter settings for the gate operation. We present a synchronization method which avoids detrimental spin flips during the gate operation and provide details about phase mismatches accumulated during the two-qubit gates which occur due to residual exchange interaction, nonadiabatic pulses, and off-resonant driving. By adjusting the gate times, synchronizing the resonant and off-resonant transitions, and compensating these phase mismatches by phase control, the overall gate fidelity can be increased significantly.

}, doi = {10.1103/PhysRevB.97.085421}, url = {https://journals.aps.org/prb/abstract/10.1103/PhysRevB.97.085421}, author = {Maximilian Russ and D. M. Zajac and A. J. Sigillito and F. Borjans and J. M. Taylor and J. R. Petta and Guido Burkard} } @article {2250, title = {In Defense of a "Single-World" Interpretation of Quantum Mechanics}, journal = {forthcoming in Studies in History and Philosophy of Modern Physics}, year = {2018}, pages = {15}, abstract = {

In a recent result, Frauchiger and Renner argue that if quantum theory accurately describes complex systems like observers who perform measurements, then \"we are forced to give up the view that there is one single reality.\" Following a review of the Frauchiger-Renner argument, I argue that quantum mechanics should be understood probabilistically, as a new sort of non-Boolean probability theory, rather than representationally, as a theory about the elementary constituents of the physical world and how these elements evolve dynamically over time. I show that this way of understanding quantum mechanics is not in conflict with a consistent \"single-world\" interpretation of the theory.

}, url = {https://arxiv.org/abs/1804.03267}, author = {Jeffrey Bub} } @article {2218, title = {Photon propagation through dissipative Rydberg media at large input rates}, year = {2018}, abstract = {

We study the dissipative propagation of quantized light in interacting Rydberg media under the conditions of electromagnetically induced transparency (EIT). Rydberg blockade physics in optically dense atomic media leads to strong dissipative interactions between single photons. The regime of high incoming photon flux constitutes a challenging many-body dissipative problem. We experimentally study in detail for the first time the pulse shapes and the second-order correlation function of the outgoing field and compare our data with simulations based on two novel theoretical approaches well-suited to treat this many-photon limit. At low incoming flux, we report good agreement between both theories and the experiment. For higher input flux, the intensity of the outgoing light is lower than that obtained from theoretical predictions. We explain this discrepancy using a simple phenomenological model taking into account pollutants, which are nearly-stationary Rydberg excitations coming from the reabsorption of scattered probe photons. At high incoming photon rates, the blockade physics results in unconventional shapes of measured correlation functions.\ 

}, url = {https://arxiv.org/abs/1807.07586}, author = {Przemyslaw Bienias and James Douglas and Asaf Paris-Mandoki and Paraj Titum and Ivan Mirgorodskiy and Christoph Tresp and Emil Zeuthen and Michael Gullans and Marco Manzoni and Sebastian Hofferberth and Darrick Chang and Alexey V. Gorshkov} } @article {2144, title = {Photon Subtraction by Many-Body Decoherence}, year = {2018}, month = {2018/03/13}, abstract = {

We present an experimental and theoretical investigation of the scattering-induced decoherence of multiple photons stored in a strongly interacting atomic ensemble. We derive an exact solution to this many-body problem, allowing for a rigorous understanding of the underlying dissipative quantum dynamics. Combined with our experiments, this analysis demonstrates a correlated coherence-protection process, in which the induced decoherence of one photon can preserve the spatial coherence of all others. We discuss how this effect can be used to manipulate light at the quantum level, providing a robust mechanism for single-photon subtraction, and experimentally demonstrate this capability.

}, doi = {https://doi.org/10.1103/PhysRevLett.120.113601}, url = {https://arxiv.org/abs/1710.10047}, author = {Callum R. Murray and Ivan Mirgorodskiy and Christoph Tresp and Christoph Braun and Asaf Paris-Mandoki and Alexey V. Gorshkov and Sebastian Hofferberth and Thomas Pohl} } @article {2317, title = {Quantum Channel Simulation and the Channel{\textquoteright}s Smooth Max-Information}, year = {2018}, abstract = {

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\&$\#$39;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\&$\#$39;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\&$\#$39;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.

}, url = {https://arxiv.org/abs/1807.05354}, author = {Kun Fang and Xin Wang and Marco Tomamichel and Mario Berta} } @article {2309, title = {Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning}, journal = {To appear at the 46th International Colloquium on Automata, Languages and Programming (ICALP 2019)}, year = {2018}, abstract = {

We give two new quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with m constraint matrices, each of dimension n, rank r, and sparsity s. The first algorithm assumes an input model where one is given access to entries of the matrices at unit cost. We show that it has run time O~(s2(m\−\−\√ε\−10+n\−\−\√ε\−12)), where ε is the error. This gives an optimal dependence in terms of m,n and quadratic improvement over previous quantum algorithms when m\≈n. The second algorithm assumes a fully quantum input model in which the matrices are given as quantum states. We show that its run time is O~(m\−\−\√+poly(r))\⋅poly(logm,logn,B,ε\−1), with B an upper bound on the trace-norm of all input matrices. In particular the complexity depends only poly-logarithmically in n and polynomially in r. We apply the second SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and copies of an unknown state ρ, we show we can find in time m\−\−\√\⋅poly(logm,logn,r,ε\−1) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements, up to error ε. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes\&$\#$39; principle from statistical mechanics. As in previous work, we obtain our algorithm by \"quantizing\" classical SDP solvers based on the matrix multiplicative weight method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension, which could be of independent interest.

}, url = {https://arxiv.org/abs/1710.02581}, author = {Fernando G. S. L. Brand{\~a}o and Amir Kalev and Tongyang Li and Cedric Yen-Yu Lin and Krysta M. Svore and Xiaodi Wu} } @article {2311, title = {Quantum Supremacy and the Complexity of Random Circuit Sampling}, year = {2018}, abstract = {

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.\ 

}, url = {https://arxiv.org/abs/1803.04402}, author = {Adam Bouland and Bill Fefferman and Chinmay Nirkhe and Umesh Vazirani} } @article {2150, title = {Resonantly driven CNOT gate for electron spins}, journal = {Science}, volume = {359}, year = {2018}, month = {2018/01/26}, pages = {439-442}, abstract = {

Single-qubit rotations and two-qubit CNOT operations are crucial ingredients for universal quantum computing. Although high-fidelity single-qubit operations have been achieved using the electron spin degree of freedom, realizing a robust CNOT gate has been challenging because of rapid nuclear spin dephasing and charge noise. We demonstrate an efficient resonantly driven CNOT gate for electron spins in silicon. Our platform achieves single-qubit rotations with fidelities greater than 99\%, as verified by randomized benchmarking. Gate control of the exchange coupling allows a quantum CNOT gate to be implemented with resonant driving in ~200 nanoseconds. We used the CNOT gate to generate a Bell state with 78\% fidelity (corrected for errors in state preparation and measurement). Our quantum dot device architecture enables multi-qubit algorithms in silicon.

}, doi = {10.1126/science.aao5965}, url = {http://science.sciencemag.org/content/359/6374/439}, author = {D. M. Zajac and A. J. Sigillito and M. Russ and F. Borjans and J. M. Taylor and Guido Burkard and J. R. Petta} } @article {2052, title = {Robust two-qubit gates in a linear ion crystal using a frequency-modulated driving force}, journal = {Physical Review Letters}, volume = {120}, year = {2018}, month = {2018/01/09}, pages = {020501}, abstract = {

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{\o}lmer-S{\o}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.

}, doi = {10.1103/PhysRevLett.120.020501}, url = {https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.120.020501}, author = {Pak Hong Leung and Kevin A. Landsman and Caroline Figgatt and Norbert M. Linke and Christopher Monroe and Kenneth R. Brown} } @article {2213, title = {Single-photon bound states in atomic ensembles}, year = {2018}, abstract = {

We illustrate the existence of single-excitation bound states for propagating photons interacting with N two-level atoms. These bound states can be calculated from an effective spin model, and their existence relies on dissipation in the system. The appearance of these bound states is in a one-to-one correspondence with zeros in the single-photon transmission and with divergent bunching in the second-order photon-photon correlation function. We also formulate a dissipative version of Levinson\&$\#$39;s theorem for this system by looking at the relation between the number of bound states and the winding number of the transmission phases. This theorem allows a direct experimental measurement of the number of bound states using the measured transmission phases.

}, url = {https://arxiv.org/abs/1809.01147}, author = {Yidan Wang and Michael Gullans and Antoine Browaeys and J. V. Porto and Darrick E. Chang and Alexey V. Gorshkov} } @article {1837, title = {Spectrum estimation of density operators with alkaline-earth atoms}, volume = {120}, year = {2018}, month = {2018/01/09}, abstract = {

We show that Ramsey spectroscopy of fermionic alkaline-earth atoms in a square-well trap provides an efficient and accurate estimate for the eigenspectrum of a density matrix whose n copies are stored in the nuclear spins of n such atoms. This spectrum estimation is enabled by the high symmetry of the interaction Hamiltonian, dictated, in turn, by the decoupling of the nuclear spin from the electrons and by the shape of the square-well trap. Practical performance of this procedure and its potential applications to quantum computing, quantum simulation, and time-keeping with alkalineearth atoms are discussed.

}, doi = {https://doi.org/10.1103/PhysRevLett.120.025301}, url = {http://arxiv.org/abs/1608.02045}, author = {Michael E. Beverland and Jeongwan Haah and Gorjan Alagic and Gretchen K. Campbell and Ana Maria Rey and Alexey V. Gorshkov} } @article {2205, title = {A spinor Bose-Einstein condensate phase-sensitive amplifier for SU(1,1) interferometry}, journal = {Phys. Rev}, volume = {A 98}, year = {2018}, abstract = {

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\%.\ 

}, url = {https://arxiv.org/abs/1807.06676}, author = {J. P. Wrubel and A. Schwettmann and D. P. Fahey and Z. Glassman and H. K. Pechkis and P. F. Griffin and R. Barnett and E. Tiesinga and P. D. Lett} } @article {2257, title = {Structure of Correlated Worldline Theories of Quantum Gravity}, journal = {Phys. Rev.}, volume = {D}, year = {2018}, month = {2018/06/21}, pages = {084052}, abstract = {

We consider the general form of \"Correlated Worldline\" (CWL) theories of quantum gravity. We show that one can have 2 different kinds of CWL theory, in which the generating functional is written as either a sum or a product over multiple copies of the coupled matter and gravitational fields. In both versions, the paths in a functional formulation are correlated via gravity itself, causing a breakdown of the superposition principle; however, the product form survives consistency tests not satisfied by the summed form. To better understand the structure of these two theories, we show how to perform diagrammatic expansions in the gravitational coupling for each version of CWL theory, using particle propagation and scalar fields as examples. We explicitly calculate contributions to 2-point and 4-point functions, again for each version of the theory, up to 2nd-order in the gravitational coupling.

}, doi = {https://doi.org/10.1103/PhysRevD.98.084052}, url = {https://arxiv.org/abs/1806.08043}, author = {Andrei O. Barvinsky and Daniel Carney and Philip C. E. Stamp} } @article {2322, title = {Study of radon reduction in gases for rare event search experiments}, year = {2018}, abstract = {

The noble elements, argon and xenon, are frequently employed as the target and event detector for weakly interacting particles such as neutrinos and Dark Matter. For such rare processes, background radiation must be carefully minimized. Radon provides one of the most significant contaminants since it is an inevitable product of trace amounts of natural uranium. To design a purification system for reducing such contamination, the adsorption characteristics of radon in nitrogen, argon, and xenon carrier gases on various types of charcoals with different adsorbing properties and intrinsic radioactive purities have been studied in the temperature range of 190-295 K at flow rates of 0.5 and 2 standard liters per minute. Essential performance parameters for the various charcoals include the average breakthrough times (τ), dynamic adsorption coefficients (ka) and the number of theoretical stages (n). It is shown that the ka-values for radon in nitrogen, argon, and xenon increase as the temperature of the charcoal traps decreases, and that they are significantly larger in nitrogen and argon than in xenon gas due to adsorption saturation effects. It is found that, unlike in xenon, the dynamic adsorption coefficients for radon in nitrogen and argon strictly obey the Arrhenius law. The experimental results strongly indicate that nitric acid etched Saratech is the best candidate among all used charcoal brands. It allows reducing total radon concentration in the LZ liquid Xe detector to meet the ultimate goal in the search for Dark Matter.

}, doi = {https://doi.org/10.1016/j.nima.2018.06.076}, url = {https://arxiv.org/abs/1805.11306}, author = {K. Pushkin and C. Akerlof and D. Anbajagane and J. Armstrong and M. Arthurs and Jacob Bringewatt and T. Edberg and C. Hall and M. Lei and R. Raymond and M. Reh and D. Saini and A. Sander and J. Schaefer and D. Seymour and N. Swanson and Y. Wang and W. Lorenzon} } @book {2249, title = {Totally random: why nobody understands quantum mechanics (a serious comic on entanglement)}, year = {2018}, publisher = {Princeton University Press}, organization = {Princeton University Press}, author = {Jeffrey Bub and Tanya Bub} } @article {2215, title = {Unitary Entanglement Construction in Hierarchical Networks}, year = {2018}, abstract = {

The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the preparation of entangled states. We begin by explaining a formal framework, the hierarchical product, in which modular graphs can be easily constructed. This framework naturally leads us to suggest a class of graphs, which we dub hierarchies. We argue that such graphs have favorable properties for quantum information processing, such as a small diameter and small total edge weight, and use the concept of Pareto efficiency to identify promising quantum graph architectures. We present numerical and analytical results on the speed at which large entangled states can be created on nearest-neighbor grids and hierarchy graphs. We also present a scheme for performing circuit placement--the translation from circuit diagrams to machine qubits--on quantum systems whose connectivity is described by hierarchies.

}, url = {https://arxiv.org/abs/1808.07876}, author = {Aniruddha Bapat and Zachary Eldredge and James R. Garrison and Abhinav Desphande and Frederic T. Chong and Alexey V. Gorshkov} } @article {2267, title = {Advances in Quantum Reinforcement Learning}, journal = {IEEE SMC, Banff, AB}, year = {2017}, month = {2017}, pages = {282-287}, abstract = {

In recent times, there has been much interest in quantum enhancements of machine learning, specifically in the context of data mining and analysis. Reinforcement learning, an interactive form of learning, is, in turn, vital in artificial intelligence-type applications. Also in this case, quantum mechanics was shown to be useful, in certain instances. Here, we elucidate these results, and show that quantum enhancements can be achieved in a new setting: the setting of learning models which learn how to improve themselves -- that is, those that meta-learn. While not all learning models meta-learn, all non-trivial models have the potential of being \"lifted\", enhanced, to meta-learning models. Our results show that also such models can be quantum-enhanced to make even better learners. In parallel, we address one of the bottlenecks of current quantum reinforcement learning approaches: the need for so-called oracularized variants of task environments. Here we elaborate on a method which realizes these variants, with minimal changes in the setting, and with no corruption of the operative specification of the environments. This result may be important in near-term experimental demonstrations of quantum reinforcement learning.

}, doi = {https://doi.org/10.1109/SMC.2017.8122616}, url = {https://arxiv.org/abs/1811.08676}, author = {Vedran Dunjko and J. M. Taylor and Hans J. Briegel} } @article {2305, title = {Development of a new UHV/XHV pressure standard (cold atom vacuum standard)}, journal = {Metrologia}, volume = {54}, year = {2017}, month = {2017/11/3}, abstract = {

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.

}, doi = {https://doi.org/10.1088/1681-7575/aa8a7b}, url = {https://arxiv.org/abs/1801.10120}, author = {Julia Scherschligt and James A Fedchak and Daniel S Barker and Stephen Eckel and Nikolai Klimov and Constantinos Makrides and Eite Tiesinga} } @article {1913, title = {Dynamically induced robust phonon transport and chiral cooling in an optomechanical system}, journal = {Nature Communications}, volume = {8}, year = {2017}, month = {2017/06/19}, pages = {205}, abstract = {

The transport of sound and heat, in the form of phonons, has a fundamental material limit: disorder-induced scattering. In electronic and optical settings, introduction of chiral transport - in which carrier propagation exhibits broken parity symmetry - provides robustness against such disorder by preventing elastic backscattering. Here we experimentally demonstrate a path for achieving robust phonon transport even in the presence of material disorder, by dynamically inducing chirality through traveling-wave optomechanical coupling. Using this approach, we demonstrate dramatic optically-induced chiral transport for clockwise and counterclockwise phonons in a symmetric resonator. This induced chirality also enhances isolation from the thermal bath and leads to gain-free reduction of the intrinsic damping of the phonons. Surprisingly, this passive mechanism is also accompanied by a chiral reduction in heat load leading to a novel optical cooling of the mechanics. This technique has the potential to improve upon the fundamental thermal limits of resonant mechanical sensor, which cannot be otherwise attained through conventional optomechanical cooling.

}, doi = {10.1038/s41467-017-00247-7}, url = {https://arxiv.org/abs/1609.08674}, author = {Seunghwi Kim and Xunnong Xu and J. M. Taylor and Gaurav Bahl} } @article {2001, title = {{E}ntanglement area laws for long-range interacting systems}, journal = {Physical Review Letters}, volume = {119}, year = {2017}, month = {2017/07/31}, pages = {050501}, abstract = {

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.

}, doi = {10.1103/PhysRevLett.119.050501}, url = {https://arxiv.org/abs/1702.05368}, author = {Zhe-Xuan Gong and Michael Foss-Feig and Fernando G. S. L. Brand{\~a}o and Alexey V. Gorshkov} } @article {2130, title = {Experimental Study of Optimal Measurements for Quantum State Tomography}, journal = {Physical Review Letters}, volume = {119}, year = {2017}, month = {2017/10/13}, pages = {150401}, abstract = {

Quantum tomography is a critically important tool to evaluate quantum hardware, making it essential to develop optimized measurement strategies that are both accurate and efficient. We compare a variety of strategies using nearly pure test states. Those that are informationally complete for all states are found to be accurate and reliable even in the presence of errors in the measurements themselves, while those designed to be complete only for pure states are far more efficient but highly sensitive to such errors. Our results highlight the unavoidable trade-offs inherent in quantum tomography.

}, doi = {10.1103/PhysRevLett.119.150401}, url = {https://link.aps.org/doi/10.1103/PhysRevLett.119.150401}, author = {Sosa-Martinez, H. and Lysne, N. K. and Baldwin, C. H. and Kalev, A. and Deutsch, I. H. and Jessen, P. S.} } @article {1945, title = {Experimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling}, year = {2017}, month = {2017/02/16}, abstract = {

Random numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the phenomenon of quantum nonlocality in a loophole-free photonic Bell test experiment for the generation of randomness that cannot be predicted within any physical theory that allows one to make independent measurement choices and prohibits superluminal signaling. To certify and quantify the randomness, we describe a new protocol that performs well in an experimental regime characterized by low violation of Bell inequalities. Applying an extractor function to our data, we obtained 256 new random bits, uniform to within 0.001.

}, url = {https://arxiv.org/abs/1702.05178$\#$}, author = {Peter Bierhorst and Emanuel Knill and Scott Glancy and Alan Mink and Stephen P. Jordan and Andrea Rommal and Yi-Kai Liu and Bradley Christensen and Sae Woo Nam and Lynden K. Shalm} } @article {2106, title = {Exponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum Learning}, year = {2017}, month = {2017/10/06}, abstract = {

We give semidefinite program (SDP) quantum solvers with an exponential speed-up over classical ones. Specifically, we consider SDP instances with m constraint matrices of dimension n, each of rank at most r, and assume that the input matrices of the SDP are given as quantum states (after a suitable normalization). Then we show there is a quantum algorithm that solves the SDP feasibility problem with accuracy ǫ by using \√ m log m \· poly(log n,r, ǫ \−1 ) quantum gates. The dependence on n provides an exponential improvement over the work of Brand \˜ao and Svore [6] and the work of van Apeldoorn et al. [23], and demonstrates an exponential quantum speed-up when m and r are small. We apply the SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and a supply of copies of an unknown state ρ, we show we can find in time \√ m log m \· poly(log n,r, ǫ \−1 ) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements up to error ǫ. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes\’ principle. As in previous work, we obtain our algorithm by \“quantizing\” classical SDP solvers based on the matrix multiplicative weight update method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension based on the techniques developed in quantum principal component analysis, which could be of independent interest. Our quantum SDP solver is different from previous ones in the following two aspects: (1) it follows from a zero-sum game approach of Hazan [11] of solving SDPs rather than the primal-dual approach by Arora and Kale [5]; and (2) it does not rely on any sparsity assumption of the input matrices.

}, url = {https://arxiv.org/abs/1710.02581}, author = {Fernando G. S. L. Brand{\~a}o and Amir Kalev and Tongyang Li and Cedric Yen-Yu Lin and Krysta M. Svore and Xiaodi Wu} } @article {1986, title = {Extracting entanglement geometry from quantum states}, journal = {Physical Review Letters}, volume = {119}, year = {2017}, month = {2017/10/06}, abstract = {

Tensor networks impose a notion of geometry on the entanglement of a quantum system. In some cases, this geometry is found to reproduce key properties of holographic dualities, and subsequently much work has focused on using tensor networks as tractable models for holographic dualities. Conventionally, the structure of the network - and hence the geometry - is largely fixed a priori by the choice of tensor network ansatz. Here, we evade this restriction and describe an unbiased approach that allows us to extract the appropriate geometry from a given quantum state. We develop an algorithm that iteratively finds a unitary circuit that transforms a given quantum state into an unentangled product state. We then analyze the structure of the resulting unitary circuits. In the case of non-interacting, critical systems in one dimension, we recover signatures of scale invariance in the unitary network, and we show that appropriately defined geodesic paths between physical degrees of freedom exhibit known properties of a hyperbolic geometry.

}, doi = {10.1103/PhysRevLett.119.140502}, url = {https://arxiv.org/abs/1704.01974}, author = {Katharine Hyatt and James R. Garrison and Bela Bauer} } @article {1991, title = {Fast optimization algorithms and the cosmological constant}, journal = {Physical Review D}, volume = {96}, year = {2017}, month = {2017/11/13}, pages = {103512}, abstract = {

Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of an NP-hard problem. The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable universe. Here we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10\−120 in a randomly generated 109 -dimensional ADK landscape.

}, doi = {10.1103/PhysRevD.96.103512}, url = {https://arxiv.org/abs/1706.08503}, author = {Ning Bao and Raphael Bousso and Stephen P. Jordan and Brad Lackey} } @article {2149, title = {Input-output theory for spin-photon coupling in Si double quantum dots}, journal = {Physical Review B}, volume = {96}, year = {2017}, month = {2017/12/22}, pages = {235434}, abstract = {

The interaction of qubits via microwave frequency photons enables long-distance qubit-qubit coupling and facilitates the realization of a large-scale quantum processor. However, qubits based on electron spins in semiconductor quantum dots have proven challenging to couple to microwave photons. In this theoretical work we show that a sizable coupling for a single electron spin is possible via spin-charge hybridization using a magnetic field gradient in a silicon double quantum dot. Based on parameters already shown in recent experiments, we predict optimal working points to achieve a coherent spin-photon coupling, an essential ingredient for the generation of long-range entanglement. Furthermore, we employ input-output theory to identify observable signatures of spin-photon coupling in the cavity output field, which may provide guidance to the experimental search for strong coupling in such spin-photon systems and opens the way to cavity-based readout of the spin qubit.

}, doi = {10.1103/PhysRevB.96.235434}, url = {https://link.aps.org/doi/10.1103/PhysRevB.96.235434}, author = {Benito, M. and Mi, X. and J. M. Taylor and Petta, J. R. and Burkard, Guido} } @article {2053, title = {Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator}, journal = {Nature}, volume = {551}, year = {2017}, month = {2017/11/29}, pages = {601-604}, abstract = {

A quantum simulator is a restricted class of quantum computer that controls the interactions between quantum bits in a way that can be mapped to certain difficult quantum many-body problems. As more control is exerted over larger numbers of qubits, the simulator can tackle a wider range of problems, with the ultimate limit being a universal quantum computer that can solve general classes of hard problems. We use a quantum simulator composed of up to 53 qubits to study a non-equilibrium phase transition in the transverse field Ising model of magnetism, in a regime where conventional statistical mechanics does not apply. The qubits are represented by trapped ion spins that can be prepared in a variety of initial pure states. We apply a global long-range Ising interaction with controllable strength and range, and measure each individual qubit with near 99\% efficiency. This allows the single-shot measurement of arbitrary many-body correlations for the direct probing of the dynamical phase transition and the uncovering of computationally intractable features that rely on the long-range interactions and high connectivity between the qubits.

}, doi = {10.1038/nature24654}, url = {https://www.nature.com/articles/nature24654}, author = {J. Zhang and G. Pagano and P. W. Hess and A. Kyprianidis and P. Becker and H. Kaplan and Alexey V. Gorshkov and Z. -X. Gong and C. Monroe} } @article {1965, title = {Optimal length of decomposition sequences composed of imperfect gates}, journal = {Quantum Information Processing}, volume = {16}, year = {2017}, month = {2017/03/24}, pages = {123}, abstract = {

Quantum error correcting circuitry is both a resource for correcting errors and a source for generating errors. A balance has to be struck between these two aspects. Perfect quantum gates do not exist in nature. Therefore, it is important to investigate how flaws in the quantum hardware affect quantum computing performance. We do this in two steps. First, in the presence of realistic, faulty quantum hardware, we establish how quantum error correction circuitry achieves reduction in the extent of quantum information corruption. Then, we investigate fault-tolerant gate sequence techniques that result in an approximate phase rotation gate, and establish the existence of an optimal length\ Lopt\ of the length\ L\ of the decomposition sequence. The existence of\ Lopt\ is due to the competition between the increase in gate accuracy with increasing\ L, but the decrease in gate performance due to the diffusive proliferation of gate errors due to faulty basis gates. We present an analytical formula for the gate fidelity as a function of\ L\ that is in satisfactory agreement with the results of our simulations and allows the determination of\ Lopt\ via the solution of a transcendental equation. Our result is universally applicable since gate sequence approximations also play an important role, e.g., in atomic and molecular physics and in nuclear magnetic resonance.

}, issn = {1573-1332}, doi = {10.1007/s11128-017-1571-5}, url = {https://link.springer.com/article/10.1007/s11128-017-1571-5}, author = {Yunseong Nam and R. Bl{\"u}mel} } @article {2107, title = {Provable quantum state tomography via non-convex methods}, year = {2017}, month = {2017/11/19}, abstract = {

With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from non-convex optimization. The algorithm excels in the compressed-sensing-like setting, where only a few data points are measured from a lowrank or highly-pure quantum state of a high-dimensional system. We show that the algorithm can practically be used in quantum tomography problems that are beyond the reach of convex solvers, and, moreover, is faster than other state-of-the-art non-convex approaches. Crucially, we prove that, despite being a non-convex program, under mild conditions, the algorithm is guaranteed to converge to the global minimum of the problem; thus, it constitutes a provable quantum state tomography protocol.

}, url = {https://arxiv.org/abs/1711.02524}, author = {Anastasios Kyrillidis and Amir Kalev and Dohuyng Park and Srinadh Bhojanapalli and Constantine Caramanis and Sujay Sanghavi} } @article {1923, title = {Quantum algorithm for linear differential equations with exponentially improved dependence on precision}, journal = {Communications in Mathematical Physics}, volume = {356}, year = {2017}, month = {2017/12/01}, pages = {1057-1081}, abstract = {

We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time. The complexity of the algorithm is polynomial in the logarithm of the inverse error, an exponential improvement over previous quantum algorithms for this problem. Our result builds upon recent advances in quantum linear systems algorithms by encoding the simulation into a sparse, well-conditioned linear system that approximates evolution according to the propagator using a Taylor series. Unlike with finite difference methods, our approach does not require additional hypotheses to ensure numerical stability.

}, url = {https://arxiv.org/abs/1701.03684}, author = {Dominic W. Berry and Andrew M. Childs and Aaron Ostrander and Guoming Wang} } @article {2048, title = {On the readiness of quantum optimization machines for industrial applications}, year = {2017}, month = {2017/08/31}, abstract = {

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.

}, url = {https://arxiv.org/abs/1708.09780}, author = {Alejandro Perdomo-Ortiz and Alexander Feldman and Asier Ozaeta and Sergei V. Isakov and Zheng Zhu and Bryan O{\textquoteright}Gorman and Helmut G. Katzgraber and Alexander Diedrich and Hartmut Neven and Johan de Kleer and Brad Lackey and Rupak Biswas} } @article {2097, title = {Why Bohr was (Mostly) Right}, year = {2017}, month = {2017/11/05}, abstract = {

After a discussion of the Frauchiger-Renner argument that no \“singleworld\” interpretation of quantum mechanics can be self-consistent, I propose a \“Bohrian\” alternative to many-worlds or QBism as the rational option.

}, url = {https://arxiv.org/abs/1711.01604}, author = {Jeffrey Bub} } @article {1678, title = {Anomalous broadening in driven dissipative Rydberg systems}, journal = {Physical Review Letters}, volume = {116}, year = {2016}, month = {2016/03/16}, pages = {113001}, abstract = {We observe interaction-induced broadening of the two-photon 5s-18s transition in 87Rb atoms trapped in a 3D optical lattice. The measured linewidth increases by nearly two orders of magnitude with increasing atomic density and excitation strength, with corresponding suppression of resonant scattering and enhancement of off-resonant scattering. We attribute the increased linewidth to resonant dipole-dipole interactions of 18s atoms with spontaneously created populations of nearby np states. Over a range of initial atomic densities and excitation strengths, the transition width is described by a single function of the steady-state density of Rydberg atoms, and the observed resonant excitation rate corresponds to that of a two-level system with the measured, rather than natural, linewidth. The broadening mechanism observed here is likely to have negative implications for many proposals with coherently interacting Rydberg atoms.}, doi = {10.1103/PhysRevLett.116.113001}, url = {http://arxiv.org/abs/1510.08710}, author = {E. A. Goldschmidt and T. Boulier and R. C. Brown and S. B. Koller and J. T. Young and Alexey V. Gorshkov and S. L. Rolston and J. V. Porto} } @book {1318, title = {Bananaworld: Quantum Mechanics for Primates}, year = {2016}, month = {2012/11/13}, publisher = {Oxford University Press}, organization = {Oxford University Press}, abstract = {

This is intended to be a serious paper, in spite of the title. The idea is that quantum mechanics is about probabilistic correlations, i.e., about the structure of information, since a theory of information is essentially a theory of probabilistic correlations. To make this clear, it suffices to consider measurements of two binary-valued observables, x with outcomes a = 0 or 1, performed by Alice in a region A, and y with outcomes b = 0 or 1 performed by Bob in a separated region B --or, to emphasize the banality of the phenomena, two ways of peeling a banana, resulting in one of two tastes. The imagined bananas of Bananaworld are non-standard, with operational or phenomenal probabilistic correlations for peelings and tastes that lie outside the polytope of local correlations. The \&$\#$39;no go\&$\#$39; theorems tell us that we can\&$\#$39;t shoe-horn these correlations into a classical correlation polytope, which has the structure of a simplex, by supposing that something has been left out of the story, without giving up fundamental principles that define what we mean by a physical system. The nonclassical features of quantum mechanics, including the irreducible information loss on measurement, are shown to be generic features of correlations that lie outside the local correlation polytope. As far as the conceptual problems are concerned, we might as well talk about bananas.

}, url = {http://arxiv.org/abs/1211.3062v2}, author = {Jeffrey Bub} } @article {1716, title = {Co-Designing a Scalable Quantum Computer with Trapped Atomic Ions}, year = {2016}, month = {2016/02/09}, abstract = {The first generation of quantum computers are on the horizon, fabricated from quantum hardware platforms that may soon be able to tackle certain tasks that cannot be performed or modelled with conventional computers. These quantum devices will not likely be universal or fully programmable, but special-purpose processors whose hardware will be tightly co-designed with particular target applications. Trapped atomic ions are a leading platform for first generation quantum computers, but are also fundamentally scalable to more powerful general purpose devices in future generations. This is because trapped ion qubits are atomic clock standards that can be made identical to a part in 10^15, and their quantum circuit connectivity can be reconfigured through the use of external fields, without modifying the arrangement or architecture of the qubits themselves. In this article we show how a modular quantum computer of any size can be engineered from ion crystals, and how the wiring between ion trap qubits can be tailored to a variety of applications and quantum computing protocols.}, url = {http://arxiv.org/abs/1602.02840}, author = {Kenneth R. Brown and Jaewan Kim and Christopher Monroe} } @conference {1712, title = {Computational Security of Quantum Encryption}, booktitle = {Computational Security of Quantum Encryption. In: Nascimento A., Barreto P. (eds) Information Theoretic Security. }, year = {2016}, month = {2016/11/10}, abstract = {

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.

}, url = {https://link.springer.com/chapter/10.1007\%2F978-3-319-49175-2_3}, author = {Gorjan Alagic and Anne Broadbent and Bill Fefferman and Tommaso Gagliardoni and Christian Schaffner and Michael St. Jules} } @article {1910, title = {Experimental demonstration of quantum fault tolerance}, year = {2016}, month = {2016/11/21}, abstract = {

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.

}, url = {https://arxiv.org/abs/1611.06946}, author = {N. M. Linke and M. Gutierrez and K. A. Landsman and C. Figgatt and S. Debnath and K. R. Brown and C. Monroe} } @article {1597, title = {Grover search and the no-signaling principle}, journal = {Physical Review Letters}, volume = {117}, year = {2016}, month = {2016/09/14}, pages = {120501}, abstract = {

From an information processing point of view, two of the key properties of quantum physics are the no-signaling principle and the Grover search lower bound. That is, despite admitting stronger-than-classical correlations, quantum mechanics does not imply superluminal signaling, and despite a form of exponential parallelism, quantum mechanics does not imply polynomial-time brute force solution of NP-complete problems. Here, we investigate the degree to which these two properties are connected. We examine four classes of deviations from quantum mechanics, for which we draw inspiration from the literature on the black hole information paradox: nonunitary dynamics, non-Born-rule measurement, cloning, and postselection. We find that each model admits superluminal signaling if and only if it admits a query complexity speedup over Grover\&$\#$39;s algorithm. Furthermore, we show that the physical resources required to send a superluminal signal scale polynomially with the resources needed to speed up Grover\&$\#$39;s algorithm. Hence, one can perform a physically reasonable experiment demonstrating superluminal signaling if and only if one can perform a reasonable experiment inducing a speedup over Grover\&$\#$39;s algorithm.

}, url = {http://arxiv.org/abs/1511.00657}, author = {Ning Bao and Adam Bouland and Stephen P. Jordan} } @article {1774, title = {Mapping constrained optimization problems to quantum annealing with application to fault diagnosis}, year = {2016}, abstract = {Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware. The mapping technique is locally-structured, as hardware compatible Ising models are generated for each problem constraint, and variables appearing in different constraints are chained together using ferromagnetic couplings. In contrast, global embedding techniques generate a hardware independent Ising model for all the constraints, and then use a minor-embedding algorithm to generate a hardware compatible Ising model. We give an example of a class of CSPs for which the scaling performance of D-Wave{\textquoteright}s QA hardware using the local mapping technique is significantly better than global embedding. We validate the approach by applying D-Wave{\textquoteright}s hardware to circuit-based fault-diagnosis. For circuits that embed directly, we find that the hardware is typically able to find all solutions from a min-fault diagnosis set of size N using 1000N samples, using an annealing rate that is 25 times faster than a leading SAT-based sampling method. Further, we apply decomposition algorithms to find min-cardinality faults for circuits that are up to 5 times larger than can be solved directly on current hardware.}, url = {http://arxiv.org/abs/1603.03111}, author = {Bian, Zhengbing and Chudak, Fabian and Israel, Robert and Lackey, Brad and Macready, William G and Roy, Aidan} } @article {1859, title = {Mapping contrained optimization problems to quantum annealing with application to fault diagnosis}, journal = {Frontiers in ICT}, volume = {3}, year = {2016}, month = {2016/07/28}, pages = {14}, abstract = {

Current quantum annealing (QA) hardware suffers from practical limitations such as finite\ temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for\ mapping Boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations.\ In particular, we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with\ a fixed sparse set of interactions and propose two new decomposition algorithms for solving problems too\ large to map directly into hardware. The mapping technique is locally structured, as hardware compatible\ Ising models are generated for each problem constraint, and variables appearing in different constraints are\ chained together using ferromagnetic couplings. By contrast, global embedding techniques generate a\ hardware-independent Ising model for all the constraints, and then use a minor-embedding algorithm to\ generate\ a hardware compatible Ising model. We give an example of a class of CSPs for which the scaling\ performance\ of the D-Wave hardware using the local mapping technique is significantly better than global\ embedding. We validate\ the approach by applying D- Wave\’s QA hardware to circuit-based fault diagnosis.\ For circuits that embed directly, we\ find that the hardware is typically able to find all solutions from a\ min-fault diagnosis set of size N using 1000 N samples,\ using an annealing rate that is 25 times faster than\ a leading SAT-based sampling method. Furthermore, we apply\ decomposition algorithms to find min-cardinality\ faults for circuits that are up to 5 times larger than can be solved directly on current hardware.

}, url = {http://journal.frontiersin.org/article/10.3389/fict.2016.00014/full}, author = {Bian, Zhengbing and Chudak, Fabian and Robert Brian Israel and Brad Lackey and Macready, William G and Aiden Roy} } @article {1914, title = {Multiple scattering dynamics of fermions at an isolated p-wave resonance}, journal = {Nature Communications}, volume = {7}, year = {2016}, month = {2016/07/11}, pages = {12069}, abstract = {

The wavefunction for indistinguishable fermions is anti-symmetric under particle exchange, which directly leads to the Pauli exclusion principle, and hence underlies the structure of atoms and the properties of almost all materials. In the dynamics of collisions between two indistinguishable fermions this requirement strictly prohibits scattering into 90 degree angles. Here we experimentally investigate the collisions of ultracold clouds fermionic\ 40K\ atoms by directly measuring scattering distributions. With increasing collision energy we identify the Wigner threshold for p-wave scattering with its tell-tale dumb-bell shape and no\ 90o\ yield. Above this threshold effects of multiple scattering become manifest as deviations from the underlying binary p-wave shape, adding particles either isotropically or axially. A shape resonance for\ 40K\ facilitates the separate observation of these two processes. The isotropically enhanced multiple scattering mode is a generic p-wave threshold phenomenon, while the axially enhanced mode should occur in any colliding particle system with an elastic scattering resonance.

}, doi = {10.1038/ncomms12069}, url = {http://www.nature.com/articles/ncomms12069}, author = {Ryan Thomas and Kris O. Roberts and Eite Tiesinga and Andrew C.J. Wade and P. Blair Blakie and Amita B. Deb and Niels Kj{\ae}rgaard} } @article {1697, title = {Photoassociation of spin polarized Chromium}, journal = {Physical Review A}, volume = {93}, year = {2016}, month = {2016/02/29}, pages = {021406}, abstract = {We report the homonuclear photoassociation (PA) of ultracold 52Cr atoms in an optical dipole trap. This constitutes the first measurement of PA in an element with total electron spin S~>1. Although Cr, with its 7S3 ground and 7P4,3,2 excited states, is expected to have a complicated PA spectrum we show that a spin polarized cloud exhibits a remarkably simple PA spectrum when circularly polarized light is applied. Over a scan range of 20 GHz below the 7P3 asymptote we observe two distinct vibrational series each following a LeRoy-Bernstein law for a C3/R3 potential with excellent agreement. We determine the C3 coefficients of the Hund{\textquoteright}s case c) relativistic adiabatic potentials to be -1.83{\textpm}0.02 a.u. and -1.46{\textpm}0.01a.u.. Theoretical non-rotating Movre-Pichler calculations enable a first assignment of the series to Ω=6u and 5g potential energy curves. In a different set of experiments we disturb the selection rules by a transverse magnetic field which leads to additional PA series.}, doi = {10.1103/PhysRevA.93.021406}, url = {http://arxiv.org/abs/1512.04378}, author = {Jahn R{\"u}hrig and Tobias B{\"a}uerle and Paul S. Julienne and Eite Tiesinga and Tilman Pfau} } @article {1911, title = {Quantum-Enhanced Machine Learning}, journal = {Physical Review Letters}, volume = {117}, year = {2016}, month = {2016/09/20}, pages = {130501}, abstract = {

The emerging field of quantum machine learning has the potential to substantially aid in the problems and scope of artificial intelligence. This is only enhanced by recent successes in the field of classical machine learning. In this work we propose an approach for the systematic treatment of machine learning, from the perspective of quantum information. Our approach is general and covers all three main branches of machine learning: supervised, unsupervised, and reinforcement learning. While quantum improvements in supervised and unsupervised learning have been reported, reinforcement learning has received much less attention. Within our approach, we tackle the problem of quantum enhancements in reinforcement learning as well, and propose a systematic scheme for providing improvements. As an example, we show that quadratic improvements in learning efficiency, and exponential improvements in performance over limited time periods, can be obtained for a broad class of learning problems.

}, doi = {10.1103/PhysRevLett.117.130501}, url = {http://link.aps.org/doi/10.1103/PhysRevLett.117.130501}, author = {Dunjko, Vedran and J. M. Taylor and Briegel, Hans J.} } @article {1957, title = {A quasi-mode theory of chiral phonons}, year = {2016}, month = {2016/12/29}, abstract = {

The coherence properties of mechanical resonators are often limited by multiple unavoidable forms of loss -- including phonon-phonon and phonon-defect scattering -- which result in the scattering of sound into other resonant modes and into the phonon bath. Dynamic suppression of this scattering loss can lift constraints on device structure and can improve tolerance to defects in the material, even after fabrication. Inspired by recent experiments, here we introduce a model of phonon losses resulting from disorder in a whispering gallery mode resonator with acousto-optical coupling between optical and mechanical modes. We show that a typical elastic scattering mechanism of high quality factor (Q) mechanical modes flips the direction of phonon propagation via high-angle scattering, leading to damping into modes with the opposite parity. When the optical mode overlaps co-propagating high-Q and bulk mechanical modes, the addition of laser cooling via sideband-resolved damping of the mechanical mode of a chosen parity also damps and modifies the response of the bulk modes of the same parity. This, in turn, simultaneously improves the quality factor and reduces the thermal load of the counter-propagating high-Q modes, leading to the dynamical creation of a cold phononic shield. We compare our theoretical results to the recent experiments of Kim et al., and find quantitative agreement with our theory.

}, url = {https://arxiv.org/abs/1612.09240}, author = {Xunnong Xu and Seunghwi Kim and Gaurav Bahl and J. M. Taylor} } @article {1187, title = {Realizing Exactly Solvable SU(N) Magnets with Thermal Atoms}, journal = {Physical Review A}, volume = {93}, year = {2016}, month = {2016/05/06}, abstract = {

We show that n thermal fermionic alkaline-earth-metal atoms in a flat-bottom trap allow one to robustly implement a spin model displaying two symmetries: the Sn symmetry that permutes atoms occupying different vibrational levels of the trap and the SU(N) symmetry associated with N nuclear spin states. The symmetries make the model exactly solvable, which, in turn, enables the analytic study of dynamical processes such as spin diffusion in this SU(N) system. We also show how to use this system to generate entangled states that allow for Heisenberg-limited metrology. This highly symmetric spin model should be experimentally realizable even when the vibrational levels are occupied according to a high-temperature thermal or an arbitrary nonthermal distribution.

}, doi = {10.1103/PhysRevA.93.051601}, url = {http://journals.aps.org/pra/abstract/10.1103/PhysRevA.93.051601}, author = {Michael E. Beverland and Gorjan Alagic and Michael J. Martin and Andrew P. Koller and Ana M. Rey and Alexey V. Gorshkov} } @article {1689, title = {Tomography is necessary for universal entanglement detection with single-copy observables}, journal = {Physical Review Letters}, volume = {116}, year = {2016}, month = {2016/06/07}, pages = {230501}, abstract = {Entanglement, one of the central mysteries of quantum mechanics, plays an essential role in numerous applications of quantum information theory. A natural question of both theoretical and experimental importance is whether universal entanglement detection is possible without full state tomography. In this work, we prove a no-go theorem that rules out this possibility for any non-adaptive schemes that employ single-copy measurements only. We also examine in detail a previously implemented experiment, which claimed to detect entanglement of two-qubit states via adaptive single-copy measurements without full state tomography. By performing the experiment and analyzing the data, we demonstrate that the information gathered is indeed sufficient to reconstruct the state. These results reveal a fundamental limit for single-copy measurements in entanglement detection, and provides a general framework to study the detection of other interesting properties of quantum states, such as the positivity of partial transpose and the k-symmetric extendibility.}, doi = {10.1103/PhysRevLett.116.230501}, url = {http://arxiv.org/abs/1511.00581}, author = {Dawei Lu and Tao Xin and Nengkun Yu and Zhengfeng Ji and Jianxin Chen and Guilu Long and Jonathan Baugh and Xinhua Peng and Bei Zeng and Raymond Laflamme} } @article {1602, title = {Whose Information? Information About What?}, journal = {Quantum [Un]Speakables II: 50 Years of Bell{\textquoteright}s Theorem}, year = {2016}, month = {2016/01/01}, author = {Jeffrey Bub and Anton Zeilinger and Reinhold Bertlmann} } @article {1472, title = {2D Superexchange mediated magnetization dynamics in an optical lattice}, journal = {Science}, volume = {348}, year = {2015}, month = {2015/04/30}, pages = {540 - 544}, abstract = { 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. }, doi = {10.1126/science.aaa1385}, url = {http://arxiv.org/abs/1411.7036v1}, author = {R. C. Brown and R. Wyllie and S. B. Koller and E. A. Goldschmidt and Michael Foss-Feig and J. V. Porto} } @article {1190, title = {Bilayer fractional quantum Hall states with ultracold dysprosium}, journal = {Physical Review A}, volume = {92}, year = {2015}, month = {2015/09/10}, pages = {033609}, abstract = { We show how dipolar interactions between dysprosium atoms in an optical lattice can be used to obtain fractional quantum Hall states. In our approach, dysprosium atoms are trapped one atom per site in a deep optical lattice with negligible tunneling. Microwave and spatially dependent optical dressing fields are used to define an effective spin-1/2 or spin-1 degree of freedom in each atom. Thinking of spin-1/2 particles as hardcore bosons, dipole-dipole interactions give rise to boson hopping, topological flat bands with Chern number 1, and the \nu = 1/2 Laughlin state. Thinking of spin-1 particles as two-component hardcore bosons, dipole-dipole interactions again give rise to boson hopping, topological flat bands with Chern number 2, and the bilayer Halperin (2,2,1) state. By adjusting the optical fields, we find a phase diagram, in which the (2,2,1) state competes with superfluidity. Generalizations to solid-state magnetic dipoles are discussed. }, doi = {10.1103/PhysRevA.92.033609}, url = {http://arxiv.org/abs/1505.03099v1}, author = {Norman Y. Yao and Steven D. Bennett and Chris R. Laumann and Benjamin L. Lev and Alexey V. Gorshkov} } @article {1507, title = {Coulomb bound states of strongly interacting photons}, journal = {Physical Review Letters}, volume = {115}, year = {2015}, month = {2015/09/16}, pages = {123601}, abstract = { 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. }, doi = {10.1103/PhysRevLett.115.123601}, url = {http://arxiv.org/abs/1505.03859v1}, author = {Mohammad F. Maghrebi and Michael Gullans and P. Bienias and S. Choi and I. Martin and O. Firstenberg and M. D. Lukin and H. P. B{\"u}chler and Alexey V. Gorshkov} } @article {1331, title = {Framework for learning agents in quantum environments}, year = {2015}, month = {2015/07/30}, abstract = {In this paper we provide a broad framework for describing learning agents in general quantum environments. We analyze the types of classically specified environments which allow for quantum enhancements in learning, by contrasting environments to quantum oracles. We show that whether or not quantum improvements are at all possible depends on the internal structure of the quantum environment. If the environments are constructed and the internal structure is appropriately chosen, or if the agent has limited capacities to influence the internal states of the environment, we show that improvements in learning times are possible in a broad range of scenarios. Such scenarios we call luck-favoring settings. The case of constructed environments is particularly relevant for the class of model-based learning agents, where our results imply a near-generic improvement. }, url = {http://arxiv.org/abs/1507.08482v1}, author = {Vedran Dunjko and J. M. Taylor and Hans J. Briegel} } @article {1247, title = {Hamiltonian simulation with nearly optimal dependence on all parameters}, journal = {Proceedings of the 56th IEEE Symposium on Foundations of Computer Science}, year = {2015}, month = {2015/01/08}, pages = {792-809}, abstract = { We present an algorithm for sparse Hamiltonian simulation that has optimal dependence on all parameters of interest (up to log factors). Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of poor scaling in others. Hamiltonian simulation via a quantum walk has optimal dependence on the sparsity $d$ at the expense of poor scaling in the allowed error $\epsilon$. In contrast, an approach based on fractional-query simulation provides optimal scaling in $\epsilon$ at the expense of poor scaling in $d$. Here we combine the two approaches, achieving the best features of both. By implementing a linear combination of quantum walk steps with coefficients given by Bessel functions, our algorithm achieves near-linear scaling in $\tau := d \|H\|_{\max} t$ and sublogarithmic scaling in $1/\epsilon$. Our dependence on $\epsilon$ is optimal, and we prove a new lower bound showing that no algorithm can have sublinear dependence on $\tau$. }, doi = {10.1109/FOCS.2015.54}, url = {http://arxiv.org/abs/1501.01715}, author = {Dominic W. Berry and Andrew M. Childs and Robin Kothari} } @article {1599, title = {The Measurement Problem from the Perspective of an Information Theoretic Interpretation of Quantum Mechanics}, journal = {Entropy}, volume = {17}, year = {2015}, month = {10/28/2015}, pages = {7374-7386}, abstract = {The aim of this paper is to consider the consequences of an information-theoretic interpretation of quantum mechanics for the measurement problem. The motivating idea of the interpretation is that the relation between quantum mechanics and the structure of information is analogous to the relation between special relativity and the structure of space-time. Insofar as quantum mechanics deals with a class of probabilistic correlations that includes correlations structurally different from classical correlations, the theory is about the structure of information: the possibilities for representing, manipulating, and communicating information in a genuinely indeterministic quantum world in which measurement outcomes are intrinsically random are different than we thought. Part of the measurement problem is deflated as a pseudo-problem on this view, and the theory has the resources to deal with the remaining part, given certain idealizations in the treatment of macrosystems.}, doi = {10.3390/e17117374}, url = {http://www.mdpi.com/1099-4300/17/11/7374}, author = {Jeffrey Bub} } @article {1601, title = {Quantum Entanglement and Information}, journal = {The Stanford Encyclopedia of Philosophy}, year = {2015}, month = {02/07/2015}, abstract = {Quantum entanglement is a physical resource, like energy, associated with the peculiar nonclassical correlations that are possible between separated quantum systems. Entanglement can be measured, transformed, and purified. A pair of quantum systems in an entangled state can be used as a quantum information channel to perform computational and cryptographic tasks that are impossible for classical systems. The general study of the information-processing capabilities of quantum systems is the subject of quantum information theory.}, url = {http://plato.stanford.edu/archives/sum2015/entries/qt-entangle/}, author = {Jeffrey Bub and Edward N. Zalta} } @article {1265, title = {Simulating Hamiltonian dynamics with a truncated Taylor series}, journal = {Physical Review Letters}, volume = {114}, year = {2015}, month = {2015/03/03}, pages = {090502}, abstract = { We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations to directly apply the truncated Taylor series. }, doi = {10.1103/PhysRevLett.114.090502}, url = {http://arxiv.org/abs/1412.4687v1}, author = {Dominic W. Berry and Andrew M. Childs and Richard Cleve and Robin Kothari and Rolando D. Somma} } @article {1839, title = {Beyond the spin model approximation for Ramsey spectroscopy}, journal = {Phys. Rev. Lett.}, volume = {112}, year = {2014}, pages = {123001}, url = {http://link.aps.org/doi/10.1103/PhysRevLett.112.123001}, author = {A P Koller and M Beverland and Alexey V. Gorshkov and A M Rey} } @article {1391, title = {Classical simulation of Yang-Baxter gates}, journal = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)}, volume = {27}, year = {2014}, month = {2014/07/05}, pages = {161-175}, abstract = { A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary representation of the braid group B n for every $n \ge 2$. If we view such an operator as a quantum-computational gate, then topological braiding corresponds to a quantum circuit. A basic question is when such a representation affords universal quantum computation. In this work, we show how to classically simulate these circuits when the gate in question belongs to certain families of solutions to the Yang-Baxter equation. These include all of the qubit (i.e., $d = 2$) solutions, and some simple families that include solutions for arbitrary $d \ge 2$. Our main tool is a probabilistic classical algorithm for efficient simulation of a more general class of quantum circuits. This algorithm may be of use outside the present setting. }, doi = {10.4230/LIPIcs.TQC.2014.161}, url = {http://arxiv.org/abs/1407.1361v1}, author = {Gorjan Alagic and Aniruddha Bapat and Stephen P. Jordan} } @article {1230, title = {The computational power of matchgates and the XY interaction on arbitrary graphs}, journal = {Quantum Information and Computation}, volume = {14}, year = {2014}, month = {2014/09/01}, pages = {901-916}, abstract = { Matchgates are a restricted set of two-qubit gates known to be classically simulable when acting on nearest-neighbor qubits on a path, but universal for quantum computation when the qubits are arranged on certain other graphs. Here we characterize the power of matchgates acting on arbitrary graphs. Specifically, we show that they are universal on any connected graph other than a path or a cycle, and that they are classically simulable on a cycle. We also prove the same dichotomy for the XY interaction, a proper subset of matchgates related to some implementations of quantum computing. }, url = {http://arxiv.org/abs/1308.1463v1}, author = {Daniel J. Brod and Andrew M. Childs} } @article {1518, title = {The computational power of normalizer circuits over black-box groups}, year = {2014}, month = {2014/09/16}, abstract = { This work presents a precise connection between Clifford circuits, Shor{\textquoteright}s factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems. We show that all these different forms of quantum computation belong to a common new restricted model of quantum operations that we call \emph{black-box normalizer circuits}. To define these, we extend the previous model of normalizer circuits [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208], which are built of quantum Fourier transforms, group automorphism and quadratic phase gates associated to an Abelian group $G$. In previous works, the group $G$ is always given in an explicitly decomposed form. In our model, we remove this assumption and allow $G$ to be a black-box group. While standard normalizer circuits were shown to be efficiently classically simulable [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208], we find that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting. We further set upper limits to their computational power by showing that decomposing finite Abelian groups is complete for the associated complexity class. In particular, solving this problem renders black-box normalizer circuits efficiently classically simulable by exploiting the generalized stabilizer formalism in [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208]. Lastly, we employ our connection to draw a few practical implications for quantum algorithm design: namely, we give a no-go theorem for finding new quantum algorithms with black-box normalizer circuits, a universality result for low-depth normalizer circuits, and identify two other complete problems. }, url = {http://arxiv.org/abs/1409.4800v1}, author = {Juan Bermejo-Vega and Cedric Yen-Yu Lin and Maarten Van den Nest} } @article {bian2014discrete, title = {Discrete optimization using quantum annealing on sparse Ising models}, journal = {Frontiers in Physics}, volume = {2}, year = {2014}, month = {2014/09/01}, pages = {56}, publisher = {Frontiers}, abstract = {This paper discusses techniques for solving discrete optimization problems using quantum annealing. Practical issues likely to affect the computation include precision limitations, finite temperature, bounded energy range, sparse connectivity, and small numbers of qubits. To address these concerns we propose a way of finding energy representations with large classical gaps between ground and first excited states, efficient algorithms for mapping non-compatible Ising models into the hardware, and the use of decomposition methods for problems that are too large to fit in hardware. We validate the approach by describing experiments with D-Wave quantum hardware for low density parity check decoding with up to 1000 variables.}, author = {Bian, Zhengbing and Chudak, Fabian and Israel, Robert and Brad Lackey and Macready, William G and Roy, Aidan} } @article {1600, title = {"Einstein and Bohr Meet Alice and Bob{\textquoteright}, Logic and Science Facing the New Technologies}, journal = {Proceedings of the 14th Congress for Logic (Nancy), Logic, Methodology and Philosophy of Science}, year = {2014}, month = {2014/01/01}, author = {Jeffrey Bub and Peter Schroeder-Heister and Gerhard Heinzmann and Wilfrid Hodges and Pierre Edouard Bour} } @article {1264, title = {Exponential improvement in precision for simulating sparse Hamiltonians}, journal = {Proceedings of the 46th ACM Symposium on Theory of Computing (STOC 2014)}, year = {2014}, month = {2014/05/31}, pages = {283-292}, abstract = { We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a $d$-sparse Hamiltonian $H$ acting on $n$ qubits can be simulated for time $t$ with precision $\epsilon$ using $O\big(\tau \frac{\log(\tau/\epsilon)}{\log\log(\tau/\epsilon)}\big)$ queries and $O\big(\tau \frac{\log^2(\tau/\epsilon)}{\log\log(\tau/\epsilon)}n\big)$ additional 2-qubit gates, where $\tau = d^2 \|{H}\|_{\max} t$. Unlike previous approaches based on product formulas, the query complexity is independent of the number of qubits acted on, and for time-varying Hamiltonians, the gate complexity is logarithmic in the norm of the derivative of the Hamiltonian. Our algorithm is based on a significantly improved simulation of the continuous- and fractional-query models using discrete quantum queries, showing that the former models are not much more powerful than the discrete model even for very small error. We also simplify the analysis of this conversion, avoiding the need for a complex fault correction procedure. Our simplification relies on a new form of "oblivious amplitude amplification" that can be applied even though the reflection about the input state is unavailable. Finally, we prove new lower bounds showing that our algorithms are optimal as a function of the error. }, isbn = {978-1-4503-2710-7}, doi = {10.1145/2591796.2591854}, url = {http://arxiv.org/abs/1312.1414v2}, author = {Dominic W. Berry and Andrew M. Childs and Richard Cleve and Robin Kothari and Rolando D. Somma} } @article {1519, title = {Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems }, year = {2014}, month = {2014/09/10}, abstract = { $\textit{Normalizer circuits}$ [1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems $\mathcal{H}_{d_1}\otimes ... \otimes \mathcal{H}_{d_n}$ with a standard basis labeled by the elements of a finite Abelian group $G=\mathbb{Z}_{d_1}\times... \times \mathbb{Z}_{d_n}$. Normalizer gates implement operations associated with the group $G$ and can be of three types: quantum Fourier transforms, group automorphism gates and quadratic phase gates. In this work, we extend the normalizer formalism [1,2] to infinite dimensions, by allowing normalizer gates to act on systems of the form $\mathcal{H}_\mathbb{Z}^{\otimes a}$: each factor $\mathcal{H}_\mathbb{Z}$ has a standard basis labeled by $\textit{integers}$ $\mathbb{Z}$, and a Fourier basis labeled by $\textit{angles}$, elements of the circle group $\mathbb{T}$. Normalizer circuits become hybrid quantum circuits acting both on continuous- and discrete-variable systems. We show that infinite-dimensional normalizer circuits can be efficiently simulated classically with a generalized $\textit{stabilizer formalism}$ for Hilbert spaces associated with groups of the form $\mathbb{Z}^a\times \mathbb{T}^b \times \mathbb{Z}_{d_1}\times...\times \mathbb{Z}_{d_n}$. We develop new techniques to track stabilizer-groups based on normal forms for group automorphisms and quadratic functions. We use our normal forms to reduce the problem of simulating normalizer circuits to that of finding general solutions of systems of mixed real-integer linear equations [3] and exploit this fact to devise a robust simulation algorithm: the latter remains efficient even in pathological cases where stabilizer groups become infinite, uncountable and non-compact. The techniques developed in this paper might find applications in the study of fault-tolerant quantum computation with superconducting qubits [4,5]. }, url = {http://arxiv.org/abs/1409.3208v2}, author = {Juan Bermejo-Vega and Cedric Yen-Yu Lin and Maarten Van den Nest} } @article {1342, title = {Optical detection of radio waves through a nanomechanical transducer}, journal = {Nature}, volume = {507}, year = {2014}, month = {2014/3/5}, pages = {81 - 85}, abstract = {Low-loss transmission and sensitive recovery of weak radio-frequency (rf) and microwave signals is an ubiquitous technological challenge, crucial in fields as diverse as radio astronomy, medical imaging, navigation and communication, including those of quantum states. Efficient upconversion of rf-signals to an optical carrier would allow transmitting them via optical fibers dramatically reducing losses, and give access to the mature toolbox of quantum optical techniques, routinely enabling quantum-limited signal detection. Research in the field of cavity optomechanics has shown that nanomechanical oscillators can couple very strongly to either microwave or optical fields. An oscillator accommodating both functionalities would bear great promise as the intermediate platform in a radio-to-optical transduction cascade. Here, we demonstrate such an opto-electro-mechanical transducer utilizing a high-Q nanomembrane. A moderate voltage bias (<10V) is sufficient to induce strong coupling between the voltage fluctuations in a rf resonance circuit and the membrane{\textquoteright}s displacement, which is simultaneously coupled to light reflected off its metallized surface. The circuit acts as an antenna; the voltage signals it induces are detected as an optical phase shift with quantum-limited sensitivity. The half-wave voltage is in the microvolt range, orders of magnitude below that of standard optical modulators. The noise added by the membrane is suppressed by the electro-mechanical cooperativity C~6800 and has a temperature of 40mK, far below 300K where the entire device is operated. This corresponds to a sensitivity limit as low as 5 pV/Hz^1/2, or -210dBm/Hz in a narrow band around 1 MHz. Our work introduces an entirely new approach to all-optical, ultralow-noise detection of classical electronic signals, and sets the stage for coherent upconversion of low-frequency quantum signals to the optical domain. }, doi = {10.1038/nature13029}, url = {http://arxiv.org/abs/1307.3467v2}, author = {T. Bagci and A. Simonsen and S. Schmid and L. G. Villanueva and E. Zeuthen and J. Appel and J. M. Taylor and A. S{\o}rensen and K. Usami and A. Schliesser and E. S. Polzik} } @article {1840, title = {Probing many-body interactions in an optical lattice clock}, journal = {Ann. Phys.}, volume = {340}, year = {2014}, pages = {311}, url = {http://www.sciencedirect.com/science/article/pii/S0003491613002546}, author = {Rey, A M and Alexey V. Gorshkov and Kraus, C V and Martin, M J and Bishof, M and Swallows, M D and Zhang, X and Benko, C and Ye, J and Lemke, N D and Ludlow, A D} } @article {1320, title = {Quantum Correlations and the Measurement Problem}, journal = {International Journal of Theoretical Physics}, volume = {53}, year = {2014}, month = {2013/6/30}, pages = {3346 - 3369}, abstract = { The transition from classical to quantum mechanics rests on the recognition that the structure of information is not what we thought it was: there are operational, i.e., phenomenal, probabilistic correlations that lie outside the polytope of local correlations. Such correlations cannot be simulated with classical resources, which generate classical correlations represented by the points in a simplex, where the vertices of the simplex represent joint deterministic states that are the common causes of the correlations. The {\textquoteleft}no go{\textquoteright} hidden variable theorems tell us that we can{\textquoteright}t shoe-horn correlations outside the local polytope into a classical simplex by supposing that something has been left out of the story. The replacement of the classical simplex by the quantum convex set as the structure representing probabilistic correlations is the analogue for quantum mechanics of the replacement of Newton{\textquoteright}s Euclidean space and time by Minkowski spacetime in special relativity. The nonclassical features of quantum mechanics, including the irreducible information loss on measurement, are generic features of correlations that lie outside the local correlation polytope. This paper is an elaboration of these ideas, and its consequences for the measurement problem of quantum mechanics. A large part of the difficulty is removed by seeing that the inconsistency in reconciling the entangled state at the end of a quantum measurement process with the definiteness of the macroscopic pointer reading and the definiteness of the correlated value of the measured micro-observable is only apparent and depends on a stipulation that is not required by the structure of the quantum possibility space. Replacing this stipulation by an alternative consistent stipulation resolves the problem. }, doi = {10.1007/s10773-013-1695-z}, url = {http://arxiv.org/abs/1210.6371v3}, author = {Jeffrey Bub} } @article {1326, title = {Quantum Interactions with Closed Timelike Curves and Superluminal Signaling }, journal = {Physical Review A}, volume = {89}, year = {2014}, month = {2014/2/12}, abstract = { There is now a significant body of results on quantum interactions with closed timelike curves (CTCs) in the quantum information literature, for both the Deutsch model of CTC interactions (D-CTCs) and the projective model (P-CTCs). As a consequence, there is a prima facie argument exploiting entanglement that CTC interactions would enable superluminal and, indeed, effectively instantaneous signaling. In cases of spacelike separation between the sender of a signal and the receiver, whether a receiver measures the local part of an entangled state or a disentangled state to access the signal can depend on the reference frame. We propose a consistency condition that gives priority to either an entangled perspective or a disentangled perspective in spacelike separated scenarios. For D-CTC interactions, the consistency condition gives priority to frames of reference in which the state is disentangled, while for P-CTC interactions the condition selects the entangled state. Using the consistency condition, we show that there is a procedure that allows Alice to signal to Bob in the past via relayed superluminal communications between spacelike separated Alice and Clio, and spacelike separated Clio and Bob. This opens the door to time travel paradoxes in the classical domain. Ralph (arXiv:1107.4675) first pointed this out for P-CTCs, but we show that Ralph{\textquoteright}s procedure for a {\textquoteright}radio to the past{\textquoteright} is flawed. Since both D-CTCs and P-CTCs allow classical information to be sent around a spacetime loop, it follows from a result by Aaronson and Watrous (Proc.Roy.Soc.A, 465:631-647 (2009)) for CTC-enhanced classical computation that a quantum computer with access to P-CTCs would have the power of PSPACE, equivalent to a D-CTC-enhanced quantum computer. }, doi = {10.1103/PhysRevA.89.022311}, url = {http://arxiv.org/abs/1309.4751v4}, author = {Jeffrey Bub and Allen Stairs} } @article {1506, title = {Scattering resonances and bound states for strongly interacting Rydberg polaritons }, journal = {Physical Review A}, volume = {90}, year = {2014}, month = {2014/11/3}, abstract = { 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. }, doi = {10.1103/PhysRevA.90.053804}, url = {http://arxiv.org/abs/1402.7333v1}, author = {P. Bienias and S. Choi and O. Firstenberg and Mohammad F. Maghrebi and Michael Gullans and M. D. Lukin and Alexey V. Gorshkov and H. P. B{\"u}chler} } @article {1505, title = {All-Optical Switch and Transistor Gated by One Stored Photon}, journal = {Science}, volume = {341}, year = {2013}, month = {2013/07/04}, pages = {768 - 770}, abstract = { The realization of an all-optical transistor where one {\textquoteright}gate{\textquoteright} photon controls a {\textquoteright}source{\textquoteright} light beam, is a long-standing goal in optics. By stopping a light pulse in an atomic ensemble contained inside an optical resonator, we realize a device in which one stored gate photon controls the resonator transmission of subsequently applied source photons. A weak gate pulse induces bimodal transmission distribution, corresponding to zero and one gate photons. One stored gate photon produces fivefold source attenuation, and can be retrieved from the atomic ensemble after switching more than one source photon. Without retrieval, one stored gate photon can switch several hundred source photons. With improved storage and retrieval efficiency, our work may enable various new applications, including photonic quantum gates, and deterministic multiphoton entanglement. }, doi = {10.1126/science.1238169}, url = {http://arxiv.org/abs/1401.3194v1}, author = {Wenlan Chen and Kristin M. Beck and Robert B{\"u}cker and Michael Gullans and Mikhail D. Lukin and Haruka Tanji-Suzuki and Vladan Vuletic} } @article {1186, title = {Controllable quantum spin glasses with magnetic impurities embedded in quantum solids }, journal = {Physical Review B}, volume = {88}, year = {2013}, month = {2013/7/24}, abstract = { Magnetic impurities embedded in inert solids can exhibit long coherence times and interact with one another via their intrinsic anisotropic dipolar interaction. We argue that, as a consequence of these properties, disordered ensembles of magnetic impurities provide an effective platform for realizing a controllable, tunable version of the dipolar quantum spin glass seen in LiHo$_x$Y$_{1-x}$F$_4$. Specifically, we propose and analyze a system composed of dysprosium atoms embedded in solid helium. We describe the phase diagram of the system and discuss the realizability and detectability of the quantum spin glass and antiglass phases. }, doi = {10.1103/PhysRevB.88.014426}, url = {http://arxiv.org/abs/1307.1130v1}, author = {Mikhail Lemeshko and Norman Y. Yao and Alexey V. Gorshkov and Hendrik Weimer and Steven D. Bennett and Takamasa Momose and Sarang Gopalakrishnan} } @article {1475, title = {Dynamical quantum correlations of Ising models on an arbitrary lattice and their resilience to decoherence }, journal = {New Journal of Physics}, volume = {15}, year = {2013}, month = {2013/11/07}, pages = {113008}, abstract = { 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. }, doi = {10.1088/1367-2630/15/11/113008}, url = {http://arxiv.org/abs/1306.0172v1}, author = {Michael Foss-Feig and Kaden R A Hazzard and John J Bollinger and Ana Maria Rey and Charles W Clark} } @article {1471, title = {Non-equilibrium dynamics of Ising models with decoherence: an exact solution }, journal = {Physical Review A}, volume = {87}, year = {2013}, month = {2013/4/3}, abstract = { 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. }, doi = {10.1103/PhysRevA.87.042101}, url = {http://arxiv.org/abs/1209.5795v2}, author = {Michael Foss-Feig and Kaden R. A. Hazzard and John J. Bollinger and Ana Maria Rey} } @article {1199, title = {Quantum Logic between Remote Quantum Registers}, journal = {Physical Review A}, volume = {87}, year = {2013}, month = {2013/2/6}, abstract = { We analyze two approaches to quantum state transfer in solid-state spin systems. First, we consider unpolarized spin-chains and extend previous analysis to various experimentally relevant imperfections, including quenched disorder, dynamical decoherence, and uncompensated long range coupling. In finite-length chains, the interplay between disorder-induced localization and decoherence yields a natural optimal channel fidelity, which we calculate. Long-range dipolar couplings induce a finite intrinsic lifetime for the mediating eigenmode; extensive numerical simulations of dipolar chains of lengths up to L=12 show remarkably high fidelity despite these decay processes. We further consider the extension of the protocol to bosonic systems of coupled oscillators. Second, we introduce a quantum mirror based architecture for universal quantum computing which exploits all of the spins in the system as potential qubits. While this dramatically increases the number of qubits available, the composite operations required to manipulate "dark" spin qubits significantly raise the error threshold for robust operation. Finally, as an example, we demonstrate that eigenmode-mediated state transfer can enable robust long-range logic between spatially separated Nitrogen-Vacancy registers in diamond; numerical simulations confirm that high fidelity gates are achievable even in the presence of moderate disorder. }, doi = {10.1103/PhysRevA.87.022306}, url = {http://arxiv.org/abs/1206.0014v1}, author = {Norman Y. Yao and Zhe-Xuan Gong and Chris R. Laumann and Steven D. Bennett and L. -M. Duan and Mikhail D. Lukin and Liang Jiang and Alexey V. Gorshkov} } @article {1842, title = {A quantum many-body spin system in an optical lattice clock}, journal = {Science}, volume = {341}, year = {2013}, pages = {632}, url = {http://www.sciencemag.org/content/341/6146/632.abstract}, author = {M J Martin and Bishof, M and Swallows, M D and X Zhang and C Benko and J von-Stecher and Alexey V. Gorshkov and Rey, A M and Jun Ye} } @article {1344, title = {The Resonant Exchange Qubit}, journal = {Physical Review Letters}, volume = {111}, year = {2013}, month = {2013/7/31}, abstract = {We introduce a solid-state qubit in which exchange interactions among confined electrons provide both the static longitudinal field and the oscillatory transverse field, allowing rapid and full qubit control via rf gate-voltage pulses. We demonstrate two-axis control at a detuning sweet-spot, where leakage due to hyperfine coupling is suppressed by the large exchange gap. A {\pi}/2-gate time of 2.5 ns and a coherence time of 19 {\mu}s, using multi-pulse echo, are also demonstrated. Model calculations that include effects of hyperfine noise are in excellent quantitative agreement with experiment. }, doi = {10.1103/PhysRevLett.111.050501}, url = {http://arxiv.org/abs/1304.3413v2}, author = {J. Medford and J. Beil and J. M. Taylor and E. I. Rashba and H. Lu and A. C. Gossard and C. M. Marcus} } @article {1345, title = {Self-Consistent Measurement and State Tomography of an Exchange-Only Spin Qubit}, journal = {Nature Nanotechnology}, volume = {8}, year = {2013}, month = {2013/9/1}, pages = {654 - 659}, abstract = {We report initialization, complete electrical control, and single-shot readout of an exchange-only spin qubit. Full control via the exchange interaction is fast, yielding a demonstrated 75 qubit rotations in under 2 ns. Measurement and state tomography are performed using a maximum-likelihood estimator method, allowing decoherence, leakage out of the qubit state space, and measurement fidelity to be quantified. The methods developed here are generally applicable to systems with state leakage, noisy measurements, and non-orthogonal control axes. }, doi = {10.1038/nnano.2013.168}, url = {http://arxiv.org/abs/1302.1933v1}, author = {J. Medford and J. Beil and J. M. Taylor and S. D. Bartlett and A. C. Doherty and E. I. Rashba and D. P. DiVincenzo and H. Lu and A. C. Gossard and C. M. Marcus} } @article {1306, title = {Spinor dynamics in an antiferromagnetic spin-1 thermal Bose gas}, journal = {Physical Review Letters}, volume = {111}, year = {2013}, month = {2013/7/9}, abstract = { We present experimental observations of coherent spin-population oscillations in a cold thermal, Bose gas of spin-1 sodium-23 atoms. The population oscillations in a multi-spatial-mode thermal gas have the same behavior as those observed in a single-spatial-mode antiferromagnetic spinor Bose Einstein condensate. We demonstrate this by showing that the two situations are described by the same dynamical equations, with a factor of two change in the spin-dependent interaction coefficient, which results from the change to particles with distinguishable momentum states in the thermal gas. We compare this theory to the measured spin population evolution after times up to a few hundreds of ms, finding quantitative agreement with the amplitude and period. We also measure the damping time of the oscillations as a function of magnetic field. }, doi = {10.1103/PhysRevLett.111.025301}, url = {http://arxiv.org/abs/1306.4255v1}, author = {Hyewon K. Pechkis and Jonathan P. Wrubel and Arne Schwettmann and Paul F. Griffin and Ryan Barnett and Eite Tiesinga and Paul D. Lett} } @article {1460, title = {Symmetries of Codeword Stabilized Quantum Codes}, journal = {8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013)}, volume = {22}, year = {2013}, month = {2013/03/28}, pages = {192-206}, abstract = { Symmetry is at the heart of coding theory. Codes with symmetry, especially cyclic codes, play an essential role in both theory and practical applications of classical error-correcting codes. Here we examine symmetry properties for codeword stabilized (CWS) quantum codes, which is the most general framework for constructing quantum error-correcting codes known to date. A CWS code Q can be represented by a self-dual additive code S and a classical code C, i.,e., Q=(S,C), however this representation is in general not unique. We show that for any CWS code Q with certain permutation symmetry, one can always find a self-dual additive code S with the same permutation symmetry as Q such that Q=(S,C). As many good CWS codes have been found by starting from a chosen S, this ensures that when trying to find CWS codes with certain permutation symmetry, the choice of S with the same symmetry will suffice. A key step for this result is a new canonical representation for CWS codes, which is given in terms of a unique decomposition as union stabilizer codes. For CWS codes, so far mainly the standard form (G,C) has been considered, where G is a graph state. We analyze the symmetry of the corresponding graph of G, which in general cannot possess the same permutation symmetry as Q. We show that it is indeed the case for the toric code on a square lattice with translational symmetry, even if its encoding graph can be chosen to be translational invariant. }, doi = {10.4230/LIPIcs.TQC.2013.192}, url = {http://arxiv.org/abs/1303.7020v2}, author = {Salman Beigi and Jianxin Chen and Markus Grassl and Zhengfeng Ji and Qiang Wang and Bei Zeng} } @article {1402, title = {Testing quantum expanders is co-QMA-complete}, journal = {Physical Review A}, volume = {87}, year = {2013}, month = {2013/4/15}, abstract = { A quantum expander is a unital quantum channel that is rapidly mixing, has only a few Kraus operators, and can be implemented efficiently on a quantum computer. We consider the problem of estimating the mixing time (i.e., the spectral gap) of a quantum expander. We show that this problem is co-QMA-complete. This has applications to testing randomized constructions of quantum expanders, and studying thermalization of open quantum systems. }, doi = {10.1103/PhysRevA.87.042317}, url = {http://arxiv.org/abs/1210.0787v2}, author = {Adam D. Bookatz and Stephen P. Jordan and Yi-Kai Liu and Pawel Wocjan} } @article {1793, title = {Non-Recursively Constructible Recursive Families of Graphs}, journal = {The Electronic Journal of Combinatorics}, volume = {19}, year = {2012}, month = {2012/04/16}, abstract = {In a publication by Noy and Rib{\'o}, it was shown that recursively constructible families of graphs are recursive. The authors also conjecture that the converse holds; that is, recursive families are also recursively constructible. In this paper, we provide two specific counterexamples to this conjecture, which we then extend to an infinite family of counterexamples.}, url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/2211}, author = {Colleen Bouey and Christina Graves and Aaron Ostrander and Gregory Palma} } @article {2618, title = {Quantum Algorithms for Invariants of Triangulated Manifolds}, journal = {Quantum Info. Comput. Vol. }, volume = {12}, year = {2012}, pages = {843-863}, abstract = {

One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor networks. The graph underlying these networks is given by the triangulation of a manifold, and the structure of the tensors ensures that the overall tensor is independent of the choice of internal triangulation. This leads to quantum algorithms for additively approximating certain invariants of triangulated manifolds. We discuss the details of this construction in two specific cases. In the first case, we consider triangulated surfaces, where the triangle tensor is defined by the multiplication operator of a finite group; the resulting invariant has a simple closed-form expression involving the dimensions of the irreducible representations of the group and the Euler characteristic of the surface. In the second case, we consider triangulated 3-manifolds, where the tetrahedral tensor is defined by the so-called Fibonacci anyon model; the resulting invariant is the well-known Turaev-Viro invariant of 3-manifolds.

}, url = {http://dl.acm.org/citation.cfm?id=2481580.2481588}, author = {Gorjan Alagic and E. A. Bering} } @article {1201, title = {Topological Flat Bands from Dipolar Spin Systems}, journal = {Physical Review Letters}, volume = {109}, year = {2012}, month = {2012/12/26}, abstract = { We propose and analyze a physical system that naturally admits two-dimensional topological nearly flat bands. Our approach utilizes an array of three-level dipoles (effective S = 1 spins) driven by inhomogeneous electromagnetic fields. The dipolar interactions produce arbitrary uniform background gauge fields for an effective collection of conserved hardcore bosons, namely, the dressed spin-flips. These gauge fields result in topological band structures, whose bandgap can be larger than the corresponding bandwidth. Exact diagonalization of the full interacting Hamiltonian at half-filling reveals the existence of superfluid, crystalline, and supersolid phases. An experimental realization using either ultra-cold polar molecules or spins in the solid state is considered. }, doi = {10.1103/PhysRevLett.109.266804}, url = {http://arxiv.org/abs/1207.4479v3}, author = {Norman Y. Yao and Chris R. Laumann and Alexey V. Gorshkov and Steven D. Bennett and Eugene Demler and Peter Zoller and Mikhail D. Lukin} } @article {1319, title = {Why the Tsirelson bound?}, journal = {The Probable and the Improbable: The Meaning and Role of Probability in Physics}, year = {2012}, month = {2012/08/18}, pages = {167-185}, abstract = { Wheeler{\textquoteright}s question {\textquoteright}why the quantum{\textquoteright} has two aspects: why is the world quantum and not classical, and why is it quantum rather than superquantum, i.e., why the Tsirelson bound for quantum correlations? I discuss a remarkable answer to this question proposed by Pawlowski et al (2009), who provide an information-theoretic derivation of the Tsirelson bound from a principle they call {\textquoteright}information causality.{\textquoteright} }, doi = {10.1007/978-3-642-21329-8_11}, url = {http://arxiv.org/abs/1208.3744v1}, author = {Jeffrey Bub} } @article {1412, title = {Chern numbers hiding in time-of-flight images}, journal = {Physical Review A}, volume = {84}, year = {2011}, month = {2011/12/21}, abstract = { We present a technique for detecting topological invariants -- Chern numbers -- from time-of-flight images of ultra-cold atoms. We show that the Chern numbers of integer quantum Hall states of lattice fermions leave their fingerprints in the atoms{\textquoteright} momentum distribution. We analytically demonstrate that the number of local maxima in the momentum distribution is equal to the Chern number in two limiting cases, for large hopping anisotropy and in the continuum limit. In addition, our numerical simulations beyond these two limits show that these local maxima persist for a range of parameters. Thus, an everyday observable in cold atom experiments can serve as a useful tool to characterize and visualize quantum states with non-trivial topology. }, doi = {10.1103/PhysRevA.84.063629}, url = {http://arxiv.org/abs/1105.3100v3}, author = {Erhai Zhao and Noah Bray-Ali and Carl J. Williams and I. B. Spielman and Indubala I. Satija} } @article {1351, title = {Fast and robust quantum computation with ionic Wigner crystals}, journal = {Physical Review A}, volume = {83}, year = {2011}, month = {2011/4/15}, abstract = {We present a detailed analysis of the modulated-carrier quantum phase gate implemented with Wigner crystals of ions confined in Penning traps. We elaborate on a recent scheme, proposed by two of the authors, to engineer two-body interactions between ions in such crystals. We analyze for the first time the situation in which the cyclotron (w_c) and the crystal rotation (w_r) frequencies do not fulfill the condition w_c=2w_r. It is shown that even in the presence of the magnetic field in the rotating frame the many-body (classical) Hamiltonian describing small oscillations from the ion equilibrium positions can be recast in canonical form. As a consequence, we are able to demonstrate that fast and robust two-qubit gates are achievable within the current experimental limitations. Moreover, we describe a realization of the state-dependent sign-changing dipole forces needed to realize the investigated quantum computing scheme. }, doi = {10.1103/PhysRevA.83.042319}, url = {http://arxiv.org/abs/1011.5616v2}, author = {J. D. Baltrusch and A. Negretti and J. M. Taylor and T. Calarco} } @article {1183, title = {Resolved atomic interaction sidebands in an optical clock transition}, journal = {Physical Review Letters}, volume = {106}, year = {2011}, month = {2011/6/22}, abstract = { We report the observation of resolved atomic interaction sidebands (ISB) in the ${}^{87}$Sr optical clock transition when atoms at microkelvin temperatures are confined in a two-dimensional (2D) optical lattice. The ISB are a manifestation of the strong interactions that occur between atoms confined in a quasi-one-dimensional geometry and disappear when the confinement is relaxed along one dimension. The emergence of ISB is linked to the recently observed suppression of collisional frequency shifts in [1]. At the current temperatures, the ISB can be resolved but are broad. At lower temperatures, ISB are predicted to be substantially narrower and usable as powerful spectroscopic tools in strongly interacting alkaline-earth gases. }, doi = {10.1103/PhysRevLett.106.250801}, url = {http://arxiv.org/abs/1102.1016v2}, author = {Michael Bishof and Yige Lin and Matthew D. Swallows and Alexey V. Gorshkov and Jun Ye and Ana Maria Rey} } @article {1301, title = {Spatial separation in a thermal mixture of ultracold $^{174}$Yb and $^{87}$Rb atoms }, journal = {Physical Review A}, volume = {83}, year = {2011}, month = {2011/4/21}, abstract = { We report on the observation of unusually strong interactions in a thermal mixture of ultracold atoms which cause a significant modification of the spatial distribution. A mixture of $^{87}$Rb and $^{174}$Yb with a temperature of a few $\mu$K is prepared in a hybrid trap consisting of a bichromatic optical potential superimposed on a magnetic trap. For suitable trap parameters and temperatures, a spatial separation of the two species is observed. We infer that the separation is driven by a large interaction strength between $^{174}$Yb and $^{87}$Rb accompanied by a large three-body recombination rate. Based on this assumption we have developed a diffusion model which reproduces our observations. }, doi = {10.1103/PhysRevA.83.040702}, url = {http://arxiv.org/abs/1104.1722v1}, author = {Florian Baumer and Frank M{\"u}nchow and Axel G{\"o}rlitz and Stephen E. Maxwell and Paul S. Julienne and Eite Tiesinga} } @article {1278, title = {Superradiance of cold atoms coupled to a superconducting circuit}, journal = {Physical Review A}, volume = {83}, year = {2011}, month = {2011/6/6}, abstract = { We investigate superradiance of an ensemble of atoms coupled to an integrated superconducting LC-circuit. Particular attention is paid to the effect of inhomogeneous coupling constants. Combining perturbation theory in the inhomogeneity and numerical simulations we show that inhomogeneous coupling constants can significantly affect the superradiant relaxation process. Incomplete relaxation terminating in "dark states" can occur, from which the only escape is through individual spontaneous emission on a much longer time scale. The relaxation dynamics can be significantly accelerated or retarded, depending on the distribution of the coupling constants. On the technical side, we also generalize the previously known propagator of superradiance for identical couplings in the completely symmetric sector to the full exponentially large Hilbert space. }, doi = {10.1103/PhysRevA.83.062305}, url = {http://arxiv.org/abs/1101.5300v1}, author = {Daniel Braun and Jonathan Hoffman and Eite Tiesinga} } @article {1325, title = {Contextuality in Quantum Mechanics: Testing the Klyachko Inequality}, year = {2010}, month = {2010/06/02}, abstract = { The Klyachko inequality is an inequality for the probabiities of the values of five observables of a spin-1 particle, which is satisfied by any noncontextual assignment of values to this set of observables, but is violated by the probabilities defined by a certain quantum state. We describe an experiment between two entangled spin-1 particles to test contextuality via a related inequality. We point out that a test of contextuality by measurements on a single particle to confirm the Klyachko inequality requires an assumption of non-disturbance by the measuring instrument, which is avoided in the two-particle experiment. }, url = {http://arxiv.org/abs/1006.0500v2}, author = {Jeffrey Bub and Allen Stairs} } @article {1353, title = {Dynamic Nuclear Polarization in Double Quantum Dots}, journal = {Physical Review Letters}, volume = {104}, year = {2010}, month = {2010/6/4}, abstract = {We theoretically investigate the controlled dynamic polarization of lattice nuclear spins in GaAs double quantum dots containing two electrons. Three regimes of long-term dynamics are identified, including the build up of a large difference in the Overhauser fields across the dots, the saturation of the nuclear polarization process associated with formation of so-called "dark states," and the elimination of the difference field. We show that in the case of unequal dots, build up of difference fields generally accompanies the nuclear polarization process, whereas for nearly identical dots, build up of difference fields competes with polarization saturation in dark states. The elimination of the difference field does not, in general, correspond to a stable steady state of the polarization process. }, doi = {10.1103/PhysRevLett.104.226807}, url = {http://arxiv.org/abs/1003.4508v2}, author = {Michael Gullans and J. J. Krich and J. M. Taylor and H. Bluhm and B. I. Halperin and C. M. Marcus and M. Stopa and A. Yacoby and M. D. Lukin} } @article {1436, title = {Efficient quantum state tomography}, journal = {Nature Communications}, volume = {1}, year = {2010}, month = {2010/12/21}, pages = {149}, abstract = { 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. }, doi = {10.1038/ncomms1147}, url = {http://arxiv.org/abs/1101.4366v1}, author = {Marcus Cramer and Martin B. Plenio and Steven T. Flammia and David Gross and Stephen D. Bartlett and Rolando Somma and Olivier Landon-Cardinal and Yi-Kai Liu and David Poulin} } @article {1182, title = {Fast Entanglement Distribution with Atomic Ensembles and Fluorescent Detection }, journal = {Physical Review A}, volume = {81}, year = {2010}, month = {2010/2/12}, abstract = { Quantum repeaters based on atomic ensemble quantum memories are promising candidates for achieving scalable distribution of entanglement over long distances. Recently, important experimental progress has been made towards their implementation. However, the entanglement rates and scalability of current approaches are limited by relatively low retrieval and single-photon detector efficiencies. We propose a scheme, which makes use of fluorescent detection of stored excitations to significantly increase the efficiency of connection and hence the rate. Practical performance and possible experimental realizations of the new protocol are discussed. }, doi = {10.1103/PhysRevA.81.020303}, url = {http://arxiv.org/abs/0907.3839v2}, author = {Jonatan B. Brask and Liang Jiang and Alexey V. Gorshkov and Vladan Vuletic and Anders S. Sorensen and Mikhail D. Lukin} } @article {1316, title = {Quantum computation and pseudo-telepathic games}, journal = {Philosophy of Science}, volume = {75}, year = {2010}, month = {2010/05/14}, pages = {458-472}, abstract = { A quantum algorithm succeeds not because the superposition principle allows {\textquoteright}the computation of all values of a function at once{\textquoteright} via {\textquoteright}quantum parallelism,{\textquoteright} but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of {\textquoteright}pseudo-telepathic{\textquoteright} games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players{\textquoteright} correlated responses in a game). }, url = {http://arxiv.org/abs/1005.2449v1}, author = {Jeffrey Bub} } @article {1315, title = {Quantum probabilities: an information-theoretic interpretation}, year = {2010}, month = {2010/05/14}, abstract = { This Chapter develops a realist information-theoretic interpretation of the nonclassical features of quantum probabilities. On this view, what is fundamental in the transition from classical to quantum physics is the recognition that \emph{information in the physical sense has new structural features}, just as the transition from classical to relativistic physics rests on the recognition that space-time is structurally different than we thought. Hilbert space, the event space of quantum systems, is interpreted as a kinematic (i.e., pre-dynamic) framework for an indeterministic physics, in the sense that the geometric structure of Hilbert space imposes objective probabilistic or information-theoretic constraints on correlations between events, just as the geometric structure of Minkowski space in special relativity imposes spatio-temporal kinematic constraints on events. The interpretation of quantum probabilities is more subjectivist in spirit than other discussions in this book (e.g., the chapter by Timpson), insofar as the quantum state is interpreted as a credence function---a bookkeeping device for keeping track of probabilities---but it is also objective (or intersubjective), insofar as the credences specified by the quantum state are understood as uniquely determined, via Gleason{\textquoteright}s theorem, by objective correlational constraints on events in the nonclassical quantum event space defined by the subspace structure of Hilbert space. }, url = {http://arxiv.org/abs/1005.2448v1}, author = {Jeffrey Bub} } @article {1432, title = {Quantum state tomography via compressed sensing}, journal = {Physical Review Letters}, volume = {105}, year = {2010}, month = {2010/10/4}, abstract = { 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. }, doi = {10.1103/PhysRevLett.105.150401}, url = {http://arxiv.org/abs/0909.3304v4}, author = {David Gross and Yi-Kai Liu and Steven T. Flammia and Stephen Becker and Jens Eisert} } @article {1317, title = {Von Neumann{\textquoteright}s {\textquoteright}No Hidden Variables{\textquoteright} Proof: A Re-Appraisal}, journal = {Foundations of Physics}, volume = {40}, year = {2010}, month = {2010/6/11}, pages = {1333 - 1340}, abstract = { Since the analysis by John Bell in 1965, the consensus in the literature is that von Neumann{\textquoteright}s {\textquoteright}no hidden variables{\textquoteright} proof fails to exclude any significant class of hidden variables. Bell raised the question whether it could be shown that any hidden variable theory would have to be nonlocal, and in this sense {\textquoteright}like Bohm{\textquoteright}s theory.{\textquoteright} His seminal result provides a positive answer to the question. I argue that Bell{\textquoteright}s analysis misconstrues von Neumann{\textquoteright}s argument. What von Neumann proved was the impossibility of recovering the quantum probabilities from a hidden variable theory of dispersion free (deterministic) states in which the quantum observables are represented as the {\textquoteright}beables{\textquoteright} of the theory, to use Bell{\textquoteright}s term. That is, the quantum probabilities could not reflect the distribution of pre-measurement values of beables, but would have to be derived in some other way, e.g., as in Bohm{\textquoteright}s theory, where the probabilities are an artefact of a dynamical process that is not in fact a measurement of any beable of the system. }, doi = {10.1007/s10701-010-9480-9}, url = {http://arxiv.org/abs/1006.0499v1}, author = {Jeffrey Bub} } @article {1193, title = {Alkaline-Earth-Metal Atoms as Few-Qubit Quantum Registers}, journal = {Physical Review Letters}, volume = {102}, year = {2009}, month = {2009/3/18}, abstract = { We propose and analyze a novel approach to quantum information processing, in which multiple qubits can be encoded and manipulated using electronic and nuclear degrees of freedom associated with individual alkaline-earth atoms trapped in an optical lattice. Specifically, we describe how the qubits within each register can be individually manipulated and measured with sub-wavelength optical resolution. We also show how such few-qubit registers can be coupled to each other in optical superlattices via conditional tunneling to form a scalable quantum network. Finally, potential applications to quantum computation and precision measurements are discussed. }, doi = {10.1103/PhysRevLett.102.110503}, url = {http://arxiv.org/abs/0812.3660v2}, author = {Alexey V. Gorshkov and Ana Maria Rey and Andrew J. Daley and Martin M. Boyd and Jun Ye and Peter Zoller and Mikhail D. Lukin} } @article {1220, title = {Black-box Hamiltonian simulation and unitary implementation}, year = {2009}, month = {2009/10/22}, abstract = { We present general methods for simulating black-box Hamiltonians using quantum walks. These techniques have two main applications: simulating sparse Hamiltonians and implementing black-box unitary operations. In particular, we give the best known simulation of sparse Hamiltonians with constant precision. Our method has complexity linear in both the sparseness D (the maximum number of nonzero elements in a column) and the evolution time t, whereas previous methods had complexity scaling as D^4 and were superlinear in t. We also consider the task of implementing an arbitrary unitary operation given a black-box description of its matrix elements. Whereas standard methods for performing an explicitly specified N x N unitary operation use O(N^2) elementary gates, we show that a black-box unitary can be performed with bounded error using O(N^{2/3} (log log N)^{4/3}) queries to its matrix elements. In fact, except for pathological cases, it appears that most unitaries can be performed with only O(sqrt{N}) queries, which is optimal. }, url = {http://arxiv.org/abs/0910.4157v4}, author = {Dominic W. Berry and Andrew M. Childs} } @article {1324, title = {Contextuality and nonlocality in {\textquoteright}no signaling{\textquoteright} theories}, journal = {Foundations of Physics}, volume = {39}, year = {2009}, month = {2009/4/21}, pages = {690 - 711}, abstract = { We define a family of {\textquoteright}no signaling{\textquoteright} bipartite boxes with arbitrary inputs and binary outputs, and with a range of marginal probabilities. The defining correlations are motivated by the Klyachko version of the Kochen-Specker theorem, so we call these boxes Kochen-Specker-Klyachko boxes or, briefly, KS-boxes. The marginals cover a variety of cases, from those that can be simulated classically to the superquantum correlations that saturate the Clauser-Horne-Shimony-Holt inequality, when the KS-box is a generalized PR-box (hence a vertex of the {\textquoteleft}no signaling{\textquoteright} polytope). We show that for certain marginal probabilities a KS-box is classical with respect to nonlocality as measured by the Clauser-Horne-Shimony-Holt correlation, i.e., no better than shared randomness as a resource in simulating a PR-box, even though such KS-boxes cannot be perfectly simulated by classical or quantum resources for all inputs. We comment on the significance of these results for contextuality and nonlocality in {\textquoteright}no signaling{\textquoteright} theories. }, doi = {10.1007/s10701-009-9307-8}, url = {http://arxiv.org/abs/0903.1462v2}, author = {Jeffrey Bub and Allen Stairs} } @article {1400, title = {Efficient quantum processing of ideals in finite rings}, year = {2009}, month = {2009/07/31}, abstract = { Suppose we are given black-box access to a finite ring R, and a list of generators for an ideal I in R. We show how to find an additive basis representation for I in poly(log |R|) time. This generalizes a recent quantum algorithm of Arvind et al. which finds a basis representation for R itself. We then show that our algorithm is a useful primitive allowing quantum computers to rapidly solve a wide variety of problems regarding finite rings. In particular we show how to test whether two ideals are identical, find their intersection, find their quotient, prove whether a given ring element belongs to a given ideal, prove whether a given element is a unit, and if so find its inverse, find the additive and multiplicative identities, compute the order of an ideal, solve linear equations over rings, decide whether an ideal is maximal, find annihilators, and test the injectivity and surjectivity of ring homomorphisms. These problems appear to be hard classically. }, url = {http://arxiv.org/abs/0908.0022v1}, author = {Pawel M. Wocjan and Stephen P. Jordan and Hamed Ahmadi and Joseph P. Brennan} } @article {1511, title = {Entanglement Cost of Nonlocal Measurements}, journal = {Physical Review A}, volume = {80}, year = {2009}, month = {2009/7/15}, abstract = { For certain joint measurements on a pair of spatially separated particles, we ask how much entanglement is needed to carry out the measurement exactly. For a class of orthogonal measurements on two qubits with partially entangled eigenstates, we present upper and lower bounds on the entanglement cost. The upper bound is based on a recent result by D. Berry [Phys. Rev. A 75, 032349 (2007)]. The lower bound, based on the entanglement production capacity of the measurement, implies that for almost all measurements in the class we consider, the entanglement required to perform the measurement is strictly greater than the average entanglement of its eigenstates. On the other hand, we show that for any complete measurement in d x d dimensions that is invariant under all local Pauli operations, the cost of the measurement is exactly equal to the average entanglement of the states associated with the outcomes. }, doi = {10.1103/PhysRevA.80.012313}, url = {http://arxiv.org/abs/0809.2264v4}, author = {Somshubhro Bandyopadhyay and Gilles Brassard and Shelby Kimmel and William K. Wootters} } @article {1568, title = {Locality Bounds on Hamiltonians for Stabilizer Codes}, journal = {Quantum Information and Computation}, volume = {9}, year = {2009}, month = {2009/09/22}, abstract = {In this paper, we study the complexity of Hamiltonians whose groundstate is a stabilizer code. We introduce various notions of k-locality of a stabilizer code, inherited from the associated stabilizer group. A choice of generators leads to a Hamiltonian with the code in its groundspace. We establish bounds on the locality of any other Hamiltonian whose groundspace contains such a code, whether or not its Pauli tensor summands commute. Our results provide insight into the cost of creating an energy gap for passive error correction and for adiabatic quantum computing. The results simplify in the cases of XZ-split codes such as Calderbank-Shor-Steane stabilizer codes and topologically-ordered stabilizer codes arising from surface cellulations. }, url = {http://www.cs.umd.edu/~oleary/reprints/j91.pdf}, author = {Stephen S. Bullock and Dianne P. O{\textquoteright}Leary} } @article {1192, title = {Anyonic interferometry and protected memories in atomic spin lattices}, journal = {Nature Physics}, volume = {4}, year = {2008}, month = {2008/4/20}, pages = {482 - 488}, abstract = { Strongly correlated quantum systems can exhibit exotic behavior called topological order which is characterized by non-local correlations that depend on the system topology. Such systems can exhibit remarkable phenomena such as quasi-particles with anyonic statistics and have been proposed as candidates for naturally fault-tolerant quantum computation. Despite these remarkable properties, anyons have never been observed in nature directly. Here we describe how to unambiguously detect and characterize such states in recently proposed spin lattice realizations using ultra-cold atoms or molecules trapped in an optical lattice. We propose an experimentally feasible technique to access non-local degrees of freedom by performing global operations on trapped spins mediated by an optical cavity mode. We show how to reliably read and write topologically protected quantum memory using an atomic or photonic qubit. Furthermore, our technique can be used to probe statistics and dynamics of anyonic excitations. }, doi = {10.1038/nphys943}, url = {http://arxiv.org/abs/0711.1365v1}, author = {Liang Jiang and Gavin K. Brennen and Alexey V. Gorshkov and Klemens Hammerer and Mohammad Hafezi and Eugene Demler and Mikhail D. Lukin and Peter Zoller} } @article {1354, title = {High-sensitivity diamond magnetometer with nanoscale resolution}, journal = {Nature Physics}, volume = {4}, year = {2008}, month = {2008/9/14}, pages = {810 - 816}, abstract = {We present a novel approach to the detection of weak magnetic fields that takes advantage of recently developed techniques for the coherent control of solid-state electron spin quantum bits. Specifically, we investigate a magnetic sensor based on Nitrogen-Vacancy centers in room-temperature diamond. We discuss two important applications of this technique: a nanoscale magnetometer that could potentially detect precession of single nuclear spins and an optical magnetic field imager combining spatial resolution ranging from micrometers to millimeters with a sensitivity approaching few femtotesla/Hz$^{1/2}$. }, doi = {10.1038/nphys1075}, url = {http://arxiv.org/abs/0805.1367v1}, author = {J. M. Taylor and P. Cappellaro and L. Childress and L. Jiang and D. Budker and P. R. Hemmer and A. Yacoby and R. Walsworth and M. D. Lukin} } @article {1854, title = {Optimizing Slow and Stored Light for Multidisciplinary Applications}, journal = {Proc. SPIE}, volume = {6904}, year = {2008}, pages = {69040C}, url = {http://spie.org/x648.xml?product_id=772216\&Search_Origin=QuickSearch\&Search_Results_URL=http://spie.org/x1636.xml\&Alternate_URL=http://spie.org/x18509.xml\&Alternate_URL_Name=timeframe\&Alternate_URL_Value=Exhibitors\&UseJavascript=1\&Please_Wait_URL=http://s}, author = {Klein, M and Xiao, Y and Alexey V. Gorshkov and M Hohensee and C D Leung and M R Browning and Phillips, D F and Novikova, I and Walsworth, R L} } @article {1465, title = {The Power of Unentanglement}, year = {2008}, month = {2008/04/04}, abstract = { 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. }, url = {http://arxiv.org/abs/0804.0802v2}, author = {Scott Aaronson and Salman Beigi and Andrew Drucker and Bill Fefferman and Peter Shor} } @article {1855, title = {Suppression of Inelastic Collisions Between Polar Molecules With a Repulsive Shield}, journal = {Phys. Rev. Lett.}, volume = {101}, year = {2008}, pages = {073201}, url = {http://link.aps.org/abstract/PRL/v101/e073201/}, author = {Alexey V. Gorshkov and Rabl, P and Pupillo, G and Micheli, A and Zoller, P and Lukin, M D and B{\"u}chler, H P} } @article {1194, title = {Signatures of incoherence in a quantum information processor}, year = {2007}, month = {2007/05/24}, abstract = { Incoherent noise is manifest in measurements of expectation values when the underlying ensemble evolves under a classical distribution of unitary processes. While many incoherent processes appear decoherent, there are important differences. The distribution functions underlying incoherent processes are either static or slowly varying with respect to control operations and so the errors introduced by these distributions are refocusable. The observation and control of incoherence in small Hilbert spaces is well known. Here we explore incoherence during an entangling operation, such as is relevant in quantum information processing. As expected, it is more difficult to separate incoherence and decoherence over such processes. However, by studying the fidelity decay under a cyclic entangling map we are able to identify distinctive experimental signatures of incoherence. This result is demonstrated both through numerical simulations and experimentally in a three qubit nuclear magnetic resonance implementation. }, url = {http://arxiv.org/abs/0705.3666v2}, author = {Michael K. Henry and Alexey V. Gorshkov and Yaakov S. Weinstein and Paola Cappellaro and Joseph Emerson and Nicolas Boulant and Jonathan S. Hodges and Chandrasekhar Ramanathan and Timothy F. Havel and Rudy Martinez and David G. Cory} } @article {1323, title = {Two dogmas about quantum mechanics}, year = {2007}, month = {2007/12/27}, abstract = { We argue that the intractable part of the measurement problem -- the {\textquoteright}big{\textquoteright} measurement problem -- is a pseudo-problem that depends for its legitimacy on the acceptance of two dogmas. The first dogma is John Bell{\textquoteright}s assertion that measurement should never be introduced as a primitive process in a fundamental mechanical theory like classical or quantum mechanics, but should always be open to a complete analysis, in principle, of how the individual outcomes come about dynamically. The second dogma is the view that the quantum state has an ontological significance analogous to the significance of the classical state as the {\textquoteright}truthmaker{\textquoteright} for propositions about the occurrence and non-occurrence of events, i.e., that the quantum state is a representation of physical reality. We show how both dogmas can be rejected in a realist information-theoretic interpretation of quantum mechanics as an alternative to the Everett interpretation. The Everettian, too, regards the {\textquoteright}big{\textquoteright} measurement problem as a pseudo-problem, because the Everettian rejects the assumption that measurements have definite outcomes, in the sense that one particular outcome, as opposed to other possible outcomes, actually occurs in a quantum measurement process. By contrast with the Everettians, we accept that measurements have definite outcomes. By contrast with the Bohmians and the GRW {\textquoteright}collapse{\textquoteright} theorists who add structure to the theory and propose dynamical solutions to the {\textquoteright}big{\textquoteright} measurement problem, we take the problem to arise from the failure to see the significance of Hilbert space as a new kinematic framework for the physics of an indeterministic universe, in the sense that Hilbert space imposes kinematic (i.e., pre-dynamic) objective probabilistic constraints on correlations between events. }, url = {http://arxiv.org/abs/0712.4258v2}, author = {Jeffrey Bub and Itamar Pitowsky} } @article {1375, title = {Parallelism for Quantum Computation with Qudits}, journal = {Physical Review A}, volume = {74}, year = {2006}, month = {2006/9/28}, abstract = { Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth of the parallel gate sequence is equal to the height of an associated tree. The implementation of a given unitary can then optimize the tradeoff between gate time and resources used. These ideas are illustrated for qudits encoded in the ground hyperfine states of the atomic alkalies $^{87}$Rb and $^{133}$Cs. Second, we provide a protocol for implementing parallelized non-local two-qudit gates using the assistance of entangled qubit pairs. Because the entangled qubits can be prepared non-deterministically, this offers the possibility of high fidelity two-qudit gates. }, doi = {10.1103/PhysRevA.74.032334}, url = {http://arxiv.org/abs/quant-ph/0603081v1}, author = {Dianne P. O{\textquoteright}Leary and Gavin K. Brennen and Stephen S. Bullock} } @article {1314, title = {Quantum computation from a quantum logical perspective}, year = {2006}, month = {2006/05/29}, abstract = { It is well-known that Shor{\textquoteright}s factorization algorithm, Simon{\textquoteright}s period-finding algorithm, and Deutsch{\textquoteright}s original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the information-processing in the three algorithms are presented from a different perspective, in terms of the way in which the algorithms exploit the non-Boolean quantum logic represented by the projective geometry of Hilbert space. From this quantum logical perspective, the XOR algorithm appears directly as a special case of Simon{\textquoteright}s algorithm, and all three algorithms can be seen as exploiting the non-Boolean logic represented by the subspace structure of Hilbert space in a similar way. Essentially, a global property of a function (such as a period, or a disjunctive property) is encoded as a subspace in Hilbert space representing a quantum proposition, which can then be efficiently distinguished from alternative propositions, corresponding to alternative global properties, by a measurement (or sequence of measurements) that identifies the target proposition as the proposition represented by the subspace containing the final state produced by the algorithm. }, url = {http://arxiv.org/abs/quant-ph/0605243v2}, author = {Jeffrey Bub} } @article {1373, title = {Asymptotically Optimal Quantum Circuits for d-level Systems}, journal = {Physical Review Letters}, volume = {94}, year = {2005}, month = {2005/6/14}, abstract = { As a qubit is a two-level quantum system whose state space is spanned by |0>, |1>, so a qudit is a d-level quantum system whose state space is spanned by |0>,...,|d-1>. Quantum computation has stimulated much recent interest in algorithms factoring unitary evolutions of an n-qubit state space into component two-particle unitary evolutions. In the absence of symmetry, Shende, Markov and Bullock use Sard{\textquoteright}s theorem to prove that at least C 4^n two-qubit unitary evolutions are required, while Vartiainen, Moettoenen, and Salomaa (VMS) use the QR matrix factorization and Gray codes in an optimal order construction involving two-particle evolutions. In this work, we note that Sard{\textquoteright}s theorem demands C d^{2n} two-qudit unitary evolutions to construct a generic (symmetry-less) n-qudit evolution. However, the VMS result applied to virtual-qubits only recovers optimal order in the case that d is a power of two. We further construct a QR decomposition for d-multi-level quantum logics, proving a sharp asymptotic of Theta(d^{2n}) two-qudit gates and thus closing the complexity question for all d-level systems (d finite.) Gray codes are not required, and the optimal Theta(d^{2n}) asymptotic also applies to gate libraries where two-qudit interactions are restricted by a choice of certain architectures. }, doi = {10.1103/PhysRevLett.94.230502}, url = {http://arxiv.org/abs/quant-ph/0410116v2}, author = {Stephen S. Bullock and Dianne P. O{\textquoteright}Leary and Gavin K. Brennen} } @article {1415, title = {Bragg Spectroscopy of ultracold atoms loaded in an optical lattice}, journal = {Physical Review A}, volume = {72}, year = {2005}, month = {2005/8/12}, abstract = { We study Bragg spectroscopy of ultra-cold atoms in one-dimensional optical lattices as a method for probing the excitation spectrum in the Mott insulator phase, in particular the one particle-hole excitation band. Within the framework of perturbation theory we obtain an analytical expression for the dynamic structure factor $S(q,\omega)$ and use it to calculate the imparted energy which has shown to be a relevant observable in recent experiments. We test the accuracy of our approximations by comparing them with numerically exact solutions of the Bose-Hubbard model in restricted cases and establish the limits of validity of our linear response analysis. Finally we show that when the system is deep in the Mott insulator regime, its response to the Bragg perturbation is temperature dependent. We suggest that this dependence might be used as a tool to probe temperatures of order of the Mott gap. }, doi = {10.1103/PhysRevA.72.023407}, url = {http://arxiv.org/abs/cond-mat/0406552v2}, author = {Ana Maria Rey and P. Blair Blakie and Guido Pupillo and Carl J. Williams and Charles W. Clark} } @article {1322, title = {Conditionalizing and commutativity: a note on Malley}, year = {2005}, month = {2005/06/19}, abstract = { This paper has been withdrawn. }, url = {http://arxiv.org/abs/quant-ph/0506159v2}, author = {Allen Stairs and Jeffrey Bub} } @article {1372, title = {Criteria for Exact Qudit Universality}, journal = {Physical Review A}, volume = {71}, year = {2005}, month = {2005/5/16}, abstract = { We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d-1 parameter family of single qudit and two qudit gates. Their technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The technique is related to the QR-matrix decomposition of numerical linear algebra. We consider a generic physical system in which the single qudit Hamiltonians are a small collection of H_{jk}^x=\hbar\Omega (|k>k iff H_{jk}^{x,y} are allowed Hamiltonians. One qudit exact universality follows iff this graph is connected, and complete universality results if the two-qudit Hamiltonian H=-\hbar\Omega |d-1,d-1>