@article {3486, title = {Average R{\'e}nyi Entanglement Entropy in Gaussian Boson Sampling}, year = {2024}, month = {3/27/2024}, abstract = {

Recently, many experiments have been conducted with the goal of demonstrating a quantum advantage over classical computation. One popular framework for these experiments is Gaussian Boson Sampling, where quadratic photonic input states are interfered via a linear optical unitary and subsequently measured in the Fock basis. In this work, we study the modal entanglement of the output states in this framework just before the measurement stage. Specifically, we compute Page curves as measured by various R{\'e}nyi-α entropies, where the Page curve describes the entanglement between two partitioned groups of output modes averaged over all linear optical unitaries. We derive these formulas for α=1 (i.e. the von Neumann entropy), and, more generally, for all positive integer α, in the asymptotic limit of infinite number of modes and for input states that are composed of single-mode-squeezed-vacuum state with equal squeezing strength. We then analyze the limiting behaviors when the squeezing is small and large. Having determined the averages, we then explicitly calculate the R{\'e}nyi-α variance for integers α\>1, and we are able to show that these entropies are weakly typical.

}, url = {https://arxiv.org/abs/2403.18890}, author = {Jason Youm and Joseph T. Iosue and Adam Ehrenberg and Yu-Xin Wang and Alexey V. Gorshkov} } @article {3492, title = {Complexity-constrained quantum thermodynamics}, year = {2024}, month = {3/7/2024}, abstract = {

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

}, url = {https://arxiv.org/abs/2403.04828}, author = {Anthony Munson and Naga Bhavya Teja Kothakonda and Jonas Haferkamp and Nicole Yunger Halpern and Jens Eisert and Philippe Faist} } @article {3460, title = {Complexity-constrained quantum thermodynamics}, year = {2024}, month = {3/7/2024}, abstract = {

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

}, url = {https://arxiv.org/abs/2403.04828}, author = {Anthony Munson and Naga Bhavya Teja Kothakonda and Jonas Haferkamp and Nicole Yunger Halpern and Jens Eisert and Philippe Faist} } @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 {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 {3488, title = {The Second Moment of Hafnians in Gaussian Boson Sampling}, year = {2024}, month = {3/20/2024}, abstract = {

Gaussian Boson Sampling is a popular method for experimental demonstrations of quantum advantage, but many subtleties remain in fully understanding its theoretical underpinnings. An important component in the theoretical arguments for approximate average-case hardness of sampling is anticoncentration, which is a second-moment property of the output probabilities. In Gaussian Boson Sampling these are given by hafnians of generalized circular orthogonal ensemble matrices. In a companion work [arXiv:2312.08433], we develop a graph-theoretic method to study these moments and use it to identify a transition in anticoncentration. In this work, we find a recursive expression for the second moment using these graph-theoretic techniques. While we have not been able to solve this recursion by hand, we are able to solve it numerically exactly, which we do up to Fock sector 2n=80. We further derive new analytical results about the second moment. These results allow us to pinpoint the transition in anticoncentration and furthermore yield the expected linear cross-entropy benchmarking score for an ideal (error-free) device.

}, url = {https://arxiv.org/abs/2403.13878}, author = {Adam Ehrenberg and Joseph T. Iosue and Abhinav Deshpande and Dominik Hangleiter 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 {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 {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 {3318, title = {DiVincenzo-like criteria for autonomous quantum machines}, year = {2023}, month = {7/17/2023}, abstract = {

Controlled quantum machines have matured significantly. A natural next step is to grant them autonomy, freeing them from timed external control. For example, autonomy could unfetter quantum computers from classical control wires that heat and decohere them; and an autonomous quantum refrigerator recently reset superconducting qubits to near their ground states, as is necessary before a computation. What conditions are necessary for realizing useful autonomous quantum machines? Inspired by recent quantum thermodynamics and chemistry, we posit conditions analogous to DiVincenzo\&$\#$39;s criteria for quantum computing. Our criteria are intended to foment and guide the development of useful autonomous quantum machines.

}, url = {https://arxiv.org/abs/2307.08739}, author = {Jos{\'e} Antonio Mar{\'\i}n Guzm{\'a}n and Paul Erker and Simone Gasparinetti and Marcus Huber and Nicole Yunger Halpern} } @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 {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 {3315, title = {Page curves and typical entanglement in linear optics}, journal = {Quantum}, volume = {7}, year = {2023}, month = {5/18/2023}, pages = {1017}, abstract = {

Bosonic Gaussian states are a special class of quantum states in an infinite dimensional Hilbert space that are relevant to universal continuous-variable quantum computation as well as to near-term quantum sampling tasks such as Gaussian Boson Sampling. In this work, we study entanglement within a set of squeezed modes that have been evolved by a random linear optical unitary. We first derive formulas that are asymptotically exact in the number of modes for the R{\'e}nyi-2 Page curve (the average R{\'e}nyi-2 entropy of a subsystem of a pure bosonic Gaussian state) and the corresponding Page correction (the average information of the subsystem) in certain squeezing regimes. We then prove various results on the typicality of entanglement as measured by the R{\'e}nyi-2 entropy by studying its variance. Using the aforementioned results for the R{\'e}nyi-2 entropy, we upper and lower bound the von Neumann entropy Page curve and prove certain regimes of entanglement typicality as measured by the von Neumann entropy. Our main proofs make use of a symmetry property obeyed by the average and the variance of the entropy that dramatically simplifies the averaging over unitaries. In this light, we propose future research directions where this symmetry might also be exploited. We conclude by discussing potential applications of our results and their generalizations to Gaussian Boson Sampling and to illuminating the relationship between entanglement and computational complexity.

}, doi = {10.22331/q-2023-05-23-1017}, url = {https://arxiv.org/abs/2209.06838}, author = {Joseph T. Iosue and Adam Ehrenberg and Dominik Hangleiter and Abhinav Deshpande and Alexey V. Gorshkov} } @article {3405, title = {Projective toric designs, difference sets, and quantum state designs}, year = {2023}, month = {11/22/2023}, abstract = {

Trigonometric cubature rules of degree t are sets of points on the torus over which sums reproduce integrals of degree t monomials over the full torus. They can be thought of as t-designs on the torus. Motivated by the projective structure of quantum mechanics, we develop the notion of t-designs on the projective torus, which, surprisingly, have a much more restricted structure than their counterparts on full tori. We provide various constructions of these projective toric designs and prove some bounds on their size and characterizations of their structure. We draw connections between projective toric designs and a diverse set of mathematical objects, including difference and Sidon sets from the field of additive combinatorics, symmetric, informationally complete positive operator valued measures (SIC-POVMs) and complete sets of mutually unbiased bases (MUBs) (which are conjectured to relate to finite projective geometry) from quantum information theory, and crystal ball sequences of certain root lattices. Using these connections, we prove bounds on the maximal size of dense Btmodm sets. We also use projective toric designs to construct families of quantum state designs. Finally, we discuss many open questions about the properties of these projective toric designs and how they relate to other questions in number theory, geometry, and quantum information.

}, url = {https://arxiv.org/abs/2311.13479}, author = {Joseph T. Iosue and T. C. Mooney and Adam Ehrenberg and Alexey V. Gorshkov} } @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 {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 {3254, title = {Symphony: Expressive Secure Multiparty Computation with Coordination}, journal = {The Art, Science, and Engineering of Programming}, volume = {7}, year = {2023}, month = {2/20/2023}, type = {14}, abstract = {

Context: Secure Multiparty Computation (MPC) refers to a family of cryptographic techniques where mutually untrusting parties may compute functions of their private inputs while revealing only the function output. Inquiry: It can be hard to program MPCs correctly and efficiently using existing languages and frameworks, especially when they require coordinating disparate computational roles. How can we make this easier? Approach: We present Symphony, a new functional programming language for MPCs among two or more parties. Symphony starts from the single-instruction, multiple-data (SIMD) semantics of prior MPC languages, in which each party carries out symmetric responsibilities, and generalizes it using constructs that can coordinate many parties. Symphony introduces **first-class shares** and **first-class party sets** to provide unmatched language-level expressive power with high efficiency. Knowledge: Developing a core formal language called λ-Symphony, we prove that the intuitive, generalized SIMD view of a program coincides with its actual distributed semantics. Thus the programmer can reason about her programs by reading them from top to bottom, even though in reality the program runs in a coordinated fashion, distributed across many machines. We implemented a prototype interpreter for Symphony leveraging multiple cryptographic backends. With it we wrote a variety of MPC programs, finding that Symphony can express optimized protocols that other languages cannot, and that in general Symphony programs operate efficiently. [ full abstract at https://doi.org/10.22152/programming-journal.org/2023/7/14 ]\ 

}, doi = {10.22152/programming-journal.org/2023/7/14}, url = {https://arxiv.org/abs/2302.10076}, author = {Ian Sweet and David Darais and David Heath and William Harris and Ryan Estes and Michael Hicks} } @article {3288, title = {Thermally driven quantum refrigerator autonomously resets superconducting qubit}, year = {2023}, month = {5/26/2023}, abstract = {

The first thermal machines steered the industrial revolution, but their quantum analogs have yet to prove useful. Here, we demonstrate a useful quantum absorption refrigerator formed from superconducting circuits. We use it to reset a transmon qubit to a temperature lower than that achievable with any one available bath. The process is driven by a thermal gradient and is autonomous -- requires no external control. The refrigerator exploits an engineered three-body interaction between the target qubit and two auxiliary qudits coupled to thermal environments. The environments consist of microwave waveguides populated with synthesized thermal photons. The target qubit, if initially fully excited, reaches a steady-state excited-level population of 5\×10\−4\±5\×10\−4 (an effective temperature of 23.5~mK) in about 1.6~μs. Our results epitomize how quantum thermal machines can be leveraged for quantum information-processing tasks. They also initiate a path toward experimental studies of quantum thermodynamics with superconducting circuits coupled to propagating thermal microwave fields.

}, url = {https://arxiv.org/abs/2305.16710}, author = {Mohammed Ali Aamir and Paul Jamet Suria and Jos{\'e} Antonio Mar{\'\i}n Guzm{\'a}n and Claudia Castillo-Moreno and Jeffrey M. Epstein and Nicole Yunger Halpern and Simone Gasparinetti} } @article {3206, title = {Time-energy uncertainty relation for noisy quantum metrology}, journal = {PRX Quantum}, volume = {4(4)}, year = {2023}, month = {12/5/2023}, abstract = {

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

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph)}, doi = {https://journals.aps.org/prxquantum/pdf/10.1103/PRXQuantum.4.040336}, url = {https://arxiv.org/abs/2207.13707}, author = {Faist, Philippe and Woods, Mischa P. and Victor V. Albert and Renes, Joseph M. and Eisert, Jens and Preskill, John} } @article {3399, title = {Transition of Anticoncentration in Gaussian Boson Sampling}, year = {2023}, month = {12/13/2023}, abstract = {

Gaussian Boson Sampling is a promising method for experimental demonstrations of quantum advantage because it is easier to implement than other comparable schemes. While most of the properties of Gaussian Boson Sampling are understood to the same degree as for these other schemes, we understand relatively little about the statistical properties of its output distribution. The most relevant statistical property, from the perspective of demonstrating quantum advantage, is the anticoncentration of the output distribution as measured by its second moment. The degree of anticoncentration features in arguments for the complexity-theoretic hardness of Gaussian Boson Sampling, and it is also important to know when using cross-entropy benchmarking to verify experimental performance. In this work, we develop a graph-theoretic framework for analyzing the moments of the Gaussian Boson Sampling distribution. Using this framework, we show that Gaussian Boson Sampling undergoes a transition in anticoncentration as a function of the number of modes that are initially squeezed compared to the number of photons measured at the end of the circuit. When the number of initially squeezed modes scales sufficiently slowly with the number of photons, there is a lack of anticoncentration. However, if the number of initially squeezed modes scales quickly enough, the output probabilities anticoncentrate weakly.

}, url = {https://arxiv.org/abs/2312.08433}, author = {Adam Ehrenberg and Joseph T. Iosue and Abhinav Deshpande and Dominik Hangleiter and Alexey V. Gorshkov} } @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 {3066, title = {Computational advantage of quantum random sampling}, year = {2022}, month = {6/8/2022}, abstract = {

Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the boundary of what can be simulated on existing classical hardware. In this article, we comprehensively review the theoretical underpinning of quantum random sampling in terms of computational complexity and verifiability, as well as the practical aspects of its experimental implementation using superconducting and photonic devices and its classical simulation. We discuss in detail open questions in the field and provide perspectives for the road ahead, including potential applications of quantum random sampling.

}, url = {https://arxiv.org/abs/2206.04079}, author = {Dominik Hangleiter and Jens Eisert} } @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 {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 {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 {3027, title = {Linear growth of quantum circuit complexity}, journal = {Nat. Phys.}, year = {2022}, month = {3/28/2022}, abstract = {

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

}, doi = {https://doi.org/10.1038/s41567-022-01539-6}, author = {Jonas Haferkamp and Philippe Faist and Naga B. T. Kothakonda and Jens Eisert 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 {3015, title = {Pauli Stabilizer Models of Twisted Quantum Doubles}, journal = {PRX Quantum}, volume = {3}, year = {2022}, month = {3/30/2022}, abstract = {

We construct a Pauli stabilizer model for every two-dimensional Abelian topological order that admits a gapped boundary. Our primary example is a Pauli stabilizer model on four-dimensional qudits that belongs to the double semion (DS) phase of matter. The DS stabilizer Hamiltonian is constructed by condensing an emergent boson in a Z4 toric code, where the condensation is implemented by making certain two-body measurements. We rigorously verify the topological order of the DS stabilizer model by identifying an explicit finite-depth quantum circuit (with ancillary qubits) that maps its ground state subspace to that of a DS string-net model. We show that the construction of the DS stabilizer Hamiltonian generalizes to all twisted quantum doubles (TQDs) with Abelian anyons. This yields a Pauli stabilizer code on composite-dimensional qudits for each such TQD, implying that the classification of topological Pauli stabilizer codes extends well beyond stacks of toric codes - in fact, exhausting all Abelian anyon theories that admit a gapped boundary. We also demonstrate that symmetry-protected topological phases of matter characterized by type I and type II cocycles can be modeled by Pauli stabilizer Hamiltonians by gauging certain 1-form symmetries of the TQD stabilizer models.

}, doi = {https://doi.org/10.1103\%2Fprxquantum.3.010353}, url = {https://arxiv.org/abs/2112.11394}, author = {Tyler D. Ellison and Yu-An Chen and Arpit Dua and Wilbur Shirley and Nathanan Tantivasadakarn and Dominic J. Williamson} } @article {3193, title = {Pauli topological subsystem codes from Abelian anyon theories}, year = {2022}, month = {11/7/2022}, abstract = {

We construct Pauli topological subsystem codes characterized by arbitrary two-dimensional Abelian anyon theories--this includes anyon theories with degenerate braiding relations and those without a gapped boundary to the vacuum. Our work both extends the classification of two-dimensional Pauli topological subsystem codes to systems of composite-dimensional qudits and establishes that the classification is at least as rich as that of Abelian anyon theories. We exemplify the construction with topological subsystem codes defined on four-dimensional qudits based on the Z(1)4 anyon theory with degenerate braiding relations and the chiral semion theory--both of which cannot be captured by topological stabilizer codes. The construction proceeds by \"gauging out\" certain anyon types of a topological stabilizer code. This amounts to defining a gauge group generated by the stabilizer group of the topological stabilizer code and a set of anyonic string operators for the anyon types that are gauged out. The resulting topological subsystem code is characterized by an anyon theory containing a proper subset of the anyons of the topological stabilizer code. We thereby show that every Abelian anyon theory is a subtheory of a stack of toric codes and a certain family of twisted quantum doubles that generalize the double semion anyon theory. We further prove a number of general statements about the logical operators of translation invariant topological subsystem codes and define their associated anyon theories in terms of higher-form symmetries.

}, keywords = {FOS: Physical sciences, Quantum Physics (quant-ph), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {10.48550/ARXIV.2211.03798}, url = {https://arxiv.org/abs/2211.03798}, author = {Ellison, Tyler D. and Chen, Yu-An and Dua, Arpit and Shirley, Wilbur and Tantivasadakarn, Nathanan and Williamson, Dominic J.} } @article {2983, title = {Quantum computational advantage via high-dimensional Gaussian boson sampling}, journal = {Science Advances}, volume = {8}, year = {2022}, month = {1/5/2022}, pages = {eabi7894}, abstract = {

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

}, doi = {10.1126/sciadv.abi7894}, url = {https://www.science.org/doi/abs/10.1126/sciadv.abi7894}, author = {Abhinav Deshpande and Arthur Mehta and Trevor Vincent and Nicolas Quesada and Marcel Hinsche and Marios Ioannou and Lars Madsen and Jonathan Lavoie and Haoyu Qi and Jens Eisert and Dominik Hangleiter and Bill Fefferman and Ish Dhand} } @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 {3200, title = {Resource theory of quantum uncomplexity}, journal = {Physical Review A}, volume = {106}, year = {2022}, month = {12/19/2022}, abstract = {

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

}, doi = {10.1103/physreva.106.062417}, url = {https://arxiv.org/abs/2110.11371}, author = {Nicole Yunger Halpern and Naga B. T. Kothakonda and Jonas Haferkamp and Anthony Munson and Jens Eisert and Philippe Faist} } @article {3136, title = {Scalably learning quantum many-body Hamiltonians from dynamical data}, year = {2022}, month = {9/28/2022}, abstract = {

The physics of a closed quantum mechanical system is governed by its Hamiltonian. However, in most practical situations, this Hamiltonian is not precisely known, and ultimately all there is are data obtained from measurements on the system. In this work, we introduce a highly scalable, data-driven approach to learning families of interacting many-body Hamiltonians from dynamical data, by bringing together techniques from gradient-based optimization from machine learning with efficient quantum state representations in terms of tensor networks. Our approach is highly practical, experimentally friendly, and intrinsically scalable to allow for system sizes of above 100 spins. In particular, we demonstrate on synthetic data that the algorithm works even if one is restricted to one simple initial state, a small number of single-qubit observables, and time evolution up to relatively short times. For the concrete example of the one-dimensional Heisenberg model our algorithm exhibits an error constant in the system size and scaling as the inverse square root of the size of the data set.

}, keywords = {FOS: Computer and information sciences, FOS: Physical sciences, Machine Learning (cs.LG), Quantum Gases (cond-mat.quant-gas), Quantum Physics (quant-ph), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {10.48550/ARXIV.2209.14328}, url = {https://arxiv.org/abs/2209.14328}, author = {Wilde, Frederik and Kshetrimayum, Augustine and Roth, Ingo and Dominik Hangleiter and Sweke, Ryan and Eisert, Jens} } @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 {3065, title = {A single T-gate makes distribution learning hard}, year = {2022}, month = {7/7/2022}, abstract = {

The task of learning a probability distribution from samples is ubiquitous across the natural sciences. The output distributions of local quantum circuits form a particularly interesting class of distributions, of key importance both to quantum advantage proposals and a variety of quantum machine learning algorithms. In this work, we provide an extensive characterization of the learnability of the output distributions of local quantum circuits. Our first result yields insight into the relationship between the efficient learnability and the efficient simulatability of these distributions. Specifically, we prove that the density modelling problem associated with Clifford circuits can be efficiently solved, while for depth d=nΩ(1) circuits the injection of a single T-gate into the circuit renders this problem hard. This result shows that efficient simulatability does not imply efficient learnability. Our second set of results provides insight into the potential and limitations of quantum generative modelling algorithms. We first show that the generative modelling problem associated with depth d=nΩ(1) local quantum circuits is hard for any learning algorithm, classical or quantum. As a consequence, one cannot use a quantum algorithm to gain a practical advantage for this task. We then show that, for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth d=ω(log(n)) Clifford circuits is hard. This result places limitations on the applicability of near-term hybrid quantum-classical generative modelling algorithms.

}, url = {https://arxiv.org/abs/2207.03140}, author = {Marcel Hinsche and Marios Ioannou and Alexander Nietner and Jonas Haferkamp and Yihui Quek and Dominik Hangleiter and Jean-Pierre Seifert and Jens Eisert and Ryan Sweke} } @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 {3012, title = {Three-dimensional quantum cellular automata from chiral semion surface topological order and beyond}, year = {2022}, month = {2/10/2022}, abstract = {

We construct a novel three-dimensional quantum cellular automaton (QCA) based on a system with short-range entangled bulk and chiral semion boundary topological order. We argue that either the QCA is nontrivial, i.e. not a finite-depth circuit of local quantum gates, or there exists a two-dimensional commuting projector Hamiltonian realizing the chiral semion topological order (characterized by U(1)2 Chern-Simons theory). Our QCA is obtained by first constructing the Walker-Wang Hamiltonian of a certain premodular tensor category of order four, then condensing the deconfined bulk boson at the level of lattice operators. We show that the resulting Hamiltonian hosts chiral semion surface topological order in the presence of a boundary and can be realized as a non-Pauli stabilizer code on qubits, from which the QCA is defined. The construction is then generalized to a class of QCAs defined by non-Pauli stabilizer codes on 2n-dimensional qudits that feature surface anyons described by U(1)2n Chern-Simons theory. Our results support the conjecture that the group of nontrivial three-dimensional QCAs is isomorphic to the Witt group of non-degenerate braided fusion categories.

}, keywords = {FOS: Physical sciences, Mathematical Physics (math-ph), Quantum Physics (quant-ph), Strongly Correlated Electrons (cond-mat.str-el)}, doi = {10.48550/ARXIV.2202.05442}, url = {https://arxiv.org/abs/2202.05442}, author = {Shirley, Wilbur and Chen, Yu-An and Dua, Arpit and Ellison, Tyler D. and Tantivasadakarn, Nathanan and Williamson, Dominic J.} } @article {3005, title = {Toward Robust Autotuning of Noisy Quantum dot Devices}, journal = {Physical Review Applied}, volume = {17}, year = {2022}, month = {02/26/2022}, abstract = {

The current autotuning approaches for quantum dot (QD) devices, while showing some success, lack an assessment of data reliability. This leads to unexpected failures when noisy or otherwise low-quality data is processed by an autonomous system. In this work, we propose a framework for robust autotuning of QD devices that combines a machine learning (ML) state classifier with a data quality control module. The data quality control module acts as a \"gatekeeper\" system, ensuring that only reliable data are processed by the state classifier. Lower data quality results in either device recalibration or termination. To train both ML systems, we enhance the QD simulation by incorporating synthetic noise typical of QD experiments. We confirm that the inclusion of synthetic noise in the training of the state classifier significantly improves the performance, resulting in an accuracy of 95.0(9) \% when tested on experimental data. We then validate the functionality of the data quality control module by showing that the state classifier performance deteriorates with decreasing data quality, as expected. Our results establish a robust and flexible ML framework for autonomous tuning of noisy QD devices.

}, doi = {https://doi.org/10.1103/PhysRevApplied.17.024069}, url = {https://arxiv.org/abs/2108.00043}, author = {Joshua Ziegler and Thomas McJunkin and E.S. Joseph and Sandesh S. Kalantre and Benjamin Harpt and D.E. Savage and M.G. Lagally and M.A. Eriksson and Jacob M. Taylor and Justyna P. Zwolak} } @article {3004, title = {Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice}, journal = {Science}, volume = {377}, year = {2022}, month = {8/18/2022}, pages = {885-889}, abstract = {

Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a walker traverses while maintaining coherence. Here, we do this by combining the fast, programmable control provided by optical tweezer arrays with the scalable, homogeneous environment of an optical lattice. Using this new combination of tools we study continuous-time quantum walks of single atoms on a 2D square lattice, and perform proof-of-principle demonstrations of spatial search using these walks. When scaled to more particles, the capabilities demonstrated here can be extended to study a variety of problems in quantum information science and quantum simulation, including the deterministic assembly of ground and excited states in Hubbard models with tunable interactions, and performing versions of spatial search in a larger graph with increased connectivity, where search by quantum walk can be more effective.

}, keywords = {Atomic Physics (physics.atom-ph), FOS: Physical sciences, Quantum Gases (cond-mat.quant-gas), Quantum Physics (quant-ph)}, doi = {https://doi.org/10.1126/science.abo0608}, url = {https://arxiv.org/abs/2202.01204}, author = {Young, Aaron W. and Eckner, William J. and Schine, Nathan and Andrew M. Childs and Kaufman, Adam M.} } @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 {2924, title = {How to engineer a quantum wavefunction}, year = {2021}, month = {12/2/2021}, abstract = {

In a conventional experiment, inductive inferences between source and target systems are typically justified with reference to a uniformity principle between systems of the same material type. In an analogue quantum simulation, by contrast, scientists aim to learn about target quantum systems of one material type via an experiment on a source quantum system of a different material type. In this paper, we argue that such an inference can be justified by reference to the two quantum systems being of the same empirical type. We illustrate this novel experimental practice of wavefunction engineering with reference to the example of Bose-Hubbard systems.\ 

}, url = {https://arxiv.org/abs/2112.01105}, author = {Peter W. Evans and Dominik Hangleiter and Karim P. Y. Th{\'e}bault} } @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 {2869, title = {Learnability of the output distributions of local quantum circuits}, year = {2021}, month = {10/11/2021}, abstract = {

There is currently a large interest in understanding the potential advantages quantum devices can offer for probabilistic modelling. In this work we investigate, within two different oracle models, the probably approximately correct (PAC) learnability of quantum circuit Born machines, i.e., the output distributions of local quantum circuits. We first show a negative result, namely, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable in the statistical query model, i.e., when given query access to empirical expectation values of bounded functions over the sample space. This immediately implies the hardness, for both quantum and classical algorithms, of learning from statistical queries the output distributions of local quantum circuits using any gate set which includes the Clifford group. As many practical generative modelling algorithms use statistical queries -- including those for training quantum circuit Born machines -- our result is broadly applicable and strongly limits the possibility of a meaningful quantum advantage for learning the output distributions of local quantum circuits. As a positive result, we show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable by a classical learner. Our results are equally applicable to the problems of learning an algorithm for generating samples from the target distribution (generative modelling) and learning an algorithm for evaluating its probabilities (density modelling). They provide the first rigorous insights into the learnability of output distributions of local quantum circuits from the probabilistic modelling perspective.\ 

}, url = {https://arxiv.org/abs/2110.05517}, author = {Marcel Hinsche and Marios Ioannou and Alexander Nietner and Jonas Haferkamp and Yihui Quek and Dominik Hangleiter and Jean-Pierre Seifert and Jens Eisert and Ryan Sweke} } @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 {2923, title = {Machine learning outperforms thermodynamics in measuring how well a many-body system learns a drive}, journal = {Scientific Reports}, volume = {11}, year = {2021}, month = {10/22/2021}, abstract = {

Diverse many-body systems, from soap bubbles to suspensions to polymers, learn and remember patterns in the drives that push them far from equilibrium. This learning may be leveraged for computation, memory, and engineering. Until now, many-body learning has been detected with thermodynamic properties, such as work absorption and strain. We progress beyond these macroscopic properties first defined for equilibrium contexts: We quantify statistical mechanical learning using representation learning, a machine-learning model in which information squeezes through a bottleneck. By calculating properties of the bottleneck, we measure four facets of many-body systems\&$\#$39; learning: classification ability, memory capacity, discrimination ability, and novelty detection. Numerical simulations of a classical spin glass illustrate our technique. This toolkit exposes self-organization that eludes detection by thermodynamic measures: Our toolkit more reliably and more precisely detects and quantifies learning by matter while providing a unifying framework for many-body learning.\ 

}, issn = {2045-2322}, doi = {https://doi.org/10.1038/s41598-021-88311-7}, url = {https://arxiv.org/abs/2004.03604}, author = {Zhong, Weishun and Gold, Jacob M. and Marzen, Sarah and England, Jeremy L. and Nicole Yunger Halpern} } @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 {2827, title = {Precise Hamiltonian identification of a superconducting quantum processor}, year = {2021}, month = {8/18/2021}, abstract = {

The required precision to perform quantum simulations beyond the capabilities of classical computers imposes major experimental and theoretical challenges. Here, we develop a characterization technique to benchmark the implementation precision of a specific quantum simulation task. We infer all parameters of the bosonic Hamiltonian that governs the dynamics of excitations in a two-dimensional grid of nearest-neighbour coupled superconducting qubits. We devise a robust algorithm for identification of Hamiltonian parameters from measured times series of the expectation values of single-mode canonical coordinates. Using super-resolution and denoising methods, we first extract eigenfrequencies of the governing Hamiltonian from the complex time domain measurement; next, we recover the eigenvectors of the Hamiltonian via constrained manifold optimization over the orthogonal group. For five and six coupled qubits, we identify Hamiltonian parameters with sub-MHz precision and construct a spatial implementation error map for a grid of 27 qubits. Our approach enables us to distinguish and quantify the effects of state preparation and measurement errors and show that they are the dominant sources of errors in the implementation. Our results quantify the implementation accuracy of analog dynamics and introduce a diagnostic toolkit for understanding, calibrating, and improving analog quantum processors.

}, url = {https://arxiv.org/abs/2108.08319}, author = {Dominik Hangleiter and Ingo Roth and Jens Eisert and Pedram Roushan} } @article {2773, title = {Quantum Computational Supremacy via High-Dimensional Gaussian Boson Sampling}, year = {2021}, month = {2/24/2021}, abstract = {

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

}, url = {https://arxiv.org/abs/2102.12474}, author = {Abhinav Deshpande and Arthur Mehta and Trevor Vincent and Nicolas Quesada and Marcel Hinsche and Marios Ioannou and Lars Madsen and Jonathan Lavoie and Haoyu Qi and Jens Eisert and Dominik Hangleiter and Bill Fefferman and Ish Dhand} } @article {2766, title = {Ray-based framework for state identification in quantum dot devices}, journal = {PRX Quantum}, volume = {2}, year = {2021}, month = {06/17/2021}, abstract = {

Quantum dots (QDs) defined with electrostatic gates are a leading platform for a scalable quantum computing implementation. However, with increasing numbers of qubits, the complexity of the control parameter space also grows. Traditional measurement techniques, relying on complete or near-complete exploration via two-parameter scans (images) of the device response, quickly become impractical with increasing numbers of gates. Here, we propose to circumvent this challenge by introducing a measurement technique relying on one-dimensional projections of the device response in the multi-dimensional parameter space. Dubbed as the ray-based classification (RBC) framework, we use this machine learning (ML) approach to implement a classifier for QD states, enabling automated recognition of qubit-relevant parameter regimes. We show that RBC surpasses the 82 \% accuracy benchmark from the experimental implementation of image-based classification techniques from prior work while cutting down the number of measurement points needed by up to 70 \%. The reduction in measurement cost is a significant gain for time-intensive QD measurements and is a step forward towards the scalability of these devices. We also discuss how the RBC-based optimizer, which tunes the device to a multi-qubit regime, performs when tuning in the two- and three-dimensional parameter spaces defined by plunger and barrier gates that control the dots. This work provides experimental validation of both efficient state identification and optimization with ML techniques for non-traditional measurements in quantum systems with high-dimensional parameter spaces and time-intensive measurements.

}, doi = {https://journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.2.020335}, url = {https://arxiv.org/abs/2102.11784}, author = {Justyna P. Zwolak and Thomas McJunkin and Sandesh S. Kalantre and Samuel F. Neyens and E. R. MacQuarrie and Mark A. Eriksson and J. M. Taylor} } @article {2921, title = {Resource theory of quantum uncomplexity}, year = {2021}, month = {10/21/2021}, abstract = {

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

}, url = {https://arxiv.org/abs/2110.11371}, author = {Nicole Yunger Halpern and Naga B. T. Kothakonda and Jonas Haferkamp and Anthony Munson and Jens Eisert and Philippe Faist} } @article {2449, title = {Auto-tuning of double dot devices in situ with machine learning}, journal = {Phys. Rev. Applied }, volume = {13}, year = {2020}, month = {4/1/2020}, abstract = {

There are myriad quantum computing approaches, each having its own set of challenges to understand and effectively control their operation. Electrons confined in arrays of semiconductor nanostructures, called quantum dots (QDs), is one such approach. The easy access to control parameters, fast measurements, long qubit lifetimes, and the potential for scalability make QDs especially attractive. However, as the size of the QD array grows, so does the number of parameters needed for control and thus the tuning complexity. The current practice of manually tuning the qubits is a relatively time-consuming procedure and is inherently impractical for scaling up and applications. In this work, we report on the in situ implementation of an auto-tuning protocol proposed by Kalantre et al. [arXiv:1712.04914]. In particular, we discuss how to establish a seamless communication protocol between a machine learning (ML)-based auto-tuner and the experimental apparatus. We then show that a ML algorithm trained exclusively on synthetic data coming from a physical model to quantitatively classify the state of the QD device, combined with an optimization routine, can be used to replace manual tuning of gate voltages in devices. A success rate of over 85 \% is determined for tuning to a double quantum dot regime when at least one of the plunger gates is initiated sufficiently close to the desired state. Modifications to the training network, fitness function, and optimizer are discussed as a path towards further improvement in the success rate when starting both near and far detuned from the target double dot range.

}, doi = {https://doi.org/10.1103/PhysRevApplied.13.034075}, url = {https://arxiv.org/abs/1909.08030}, author = {Justyna P. Zwolak and Thomas McJunkin and Sandesh S. Kalantre and J. P. Dodson and E. R. MacQuarrie and D. E. Savage and M. G. Lagally and S. N. Coppersmith and Mark A. Eriksson and J. M. Taylor} } @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 {2411, title = {Discrete Time Crystals}, journal = {Annual Review of Condensed Matter Physics }, volume = {11}, year = {2020}, month = {3/10/2020}, pages = {467-499}, abstract = {

Experimental advances have allowed for the exploration of nearly isolated quantum many-body systems whose coupling to an external bath is very weak. A particularly interesting class of such systems is those which do not thermalize under their own isolated quantum dynamics. In this review, we highlight the possibility for such systems to exhibit new non-equilibrium phases of matter. In particular, we focus on \"discrete time crystals\", which are many-body phases of matter characterized by a spontaneously broken discrete time translation symmetry. We give a definition of discrete time crystals from several points of view, emphasizing that they are a non-equilibrium phenomenon, which is stabilized by many-body interactions, with no analog in non-interacting systems. We explain the theory behind several proposed models of discrete time crystals, and compare a number of recent realizations, in different experimental contexts.\ 

}, doi = {https://doi.org/10.1146/annurev-conmatphys-031119-050658}, url = {https://arxiv.org/abs/1905.13232}, author = {Dominic V. Else and Christopher Monroe and Chetan Nayak and Norman Y. Yao} } @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 {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 {2577, title = {Hierarchy of linear light cones with long-range interactions}, journal = {Physical Review X}, volume = {10}, year = {2020}, month = {5/29/2020}, abstract = {

In quantum many-body systems with local interactions, quantum information and entanglement cannot spread outside of a \"linear light cone,\" which expands at an emergent velocity analogous to the speed of light. Yet most non-relativistic physical systems realized in nature have long-range interactions: two degrees of freedom separated by a distance r interact with potential energy V(r)\∝1/rα. In systems with long-range interactions, we rigorously establish a hierarchy of linear light cones: at the same α, some quantum information processing tasks are constrained by a linear light cone while others are not. In one spatial dimension, commutators of local operators \⟨ψ|[Ox(t),Oy]|ψ\⟩ are negligible in every state |ψ\⟩ when |x\−y|≳vt, where v is finite when α\>3 (Lieb-Robinson light cone); in a typical state |ψ\⟩ drawn from the infinite temperature ensemble, v is finite when α\>52 (Frobenius light cone); in non-interacting systems, v is finite in every state when α\>2 (free light cone). These bounds apply to time-dependent systems and are optimal up to subalgebraic improvements. Our theorems regarding the Lieb-Robinson and free light cones, and their tightness, also generalize to arbitrary dimensions. We discuss the implications of our bounds on the growth of connected correlators and of topological order, the clustering of correlations in gapped systems, and the digital simulation of systems with long-range interactions. In addition, we show that quantum state transfer and many-body quantum chaos are bounded by the Frobenius light cone, and therefore are poorly constrained by all Lieb-Robinson bounds.

}, doi = {https://doi.org/10.1103/PhysRevX.10.031009}, url = {https://arxiv.org/abs/2001.11509}, author = {Minh C. Tran and Chi-Fang Chen and Adam Ehrenberg and Andrew Y. Guo and Abhinav Deshpande and Yifan Hong and Zhe-Xuan Gong and Alexey V. Gorshkov and Andrew Lucas} } @article {2406, title = {Complexity phase diagram for interacting and long-range bosonic Hamiltonians}, year = {2019}, month = {06/10/2019}, abstract = {

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

}, url = {https://arxiv.org/abs/1906.04178}, author = {Nishad Maskara and Abhinav Deshpande and Minh C. Tran and Adam Ehrenberg and Bill Fefferman and Alexey V. Gorshkov} } @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 {2365, title = {Heisenberg-Scaling Measurement Protocol for Analytic Functions with Quantum Sensor Networks}, journal = {Phys. Rev. A}, volume = {100}, year = {2019}, month = {10/7/2019}, abstract = {

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

}, doi = {https://doi.org/10.1103/PhysRevA.100.042304}, url = {https://arxiv.org/abs/1901.09042}, author = {Kevin Qian and Zachary Eldredge and Wenchao Ge and Guido Pagano and Christopher Monroe and James V. Porto and Alexey V. Gorshkov} } @article {2195, title = {Locality and digital quantum simulation of power-law interactions}, journal = {Phys. Rev. X 9, 031006}, volume = {9}, year = {2019}, month = {07/10/2019}, abstract = {

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

}, doi = {https://doi.org/10.1103/PhysRevX.9.031006}, url = {https://arxiv.org/abs/1808.05225}, author = {Minh C. Tran and Andrew Y. Guo and Yuan Su and James R. Garrison and Zachary Eldredge and Michael Foss-Feig and Andrew M. Childs and Alexey V. Gorshkov} } @article {2458, title = {Locality and Heating in Periodically Driven, Power-law Interacting Systems}, journal = {Phys. Rev. A }, volume = {100}, year = {2019}, month = {2019/11/12}, abstract = {

We study the heating time in periodically driven D-dimensional systems with interactions that decay with the distance r as a power-law 1/rα. Using linear response theory, we show that the heating time is exponentially long as a function of the drive frequency for α\>D. For systems that may not obey linear response theory, we use a more general Magnus-like expansion to show the existence of quasi-conserved observables, which imply exponentially long heating time, for α\>2D. We also generalize a number of recent state-of-the-art Lieb-Robinson bounds for power-law systems from two-body interactions to k-body interactions and thereby obtain a longer heating time than previously established in the literature. Additionally, we conjecture that the gap between the results from the linear response theory and the Magnus-like expansion does not have physical implications, but is, rather, due to the lack of tight Lieb-Robinson bounds for power-law interactions. We show that the gap vanishes in the presence of a hypothetical, tight bound.\ 

}, doi = {https://doi.org/10.1103/PhysRevA.100.052103}, url = {https://arxiv.org/abs/1908.02773}, author = {Minh C. Tran and Adam Ehrenberg and Andrew Y. Guo and Paraj Titum and Dmitry A. Abanin and Alexey V. Gorshkov} } @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 {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 {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 {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 {2425, title = {The Speed of Quantum Information Spreading in Chaotic Systems}, year = {2019}, month = {08/19/2019}, abstract = {

We present a general theory of quantum information propagation in chaotic quantum many-body systems. The generic expectation in such systems is that quantum information does not propagate in localized form; instead, it tends to spread out and scramble into a form that is inaccessible to local measurements. To characterize this spreading, we define an information speed via a quench-type experiment and derive a general formula for it as a function of the entanglement density of the initial state. As the entanglement density varies from zero to one, the information speed varies from the entanglement speed to the butterfly speed. We verify that the formula holds both for a quantum chaotic spin chain and in field theories with an AdS/CFT gravity dual. For the second case, we study in detail the dynamics of entanglement in two-sided Vaidya-AdS-Reissner-Nordstrom black branes. We also show that, with an appropriate decoding process, quantum information can be construed as moving at the information speed, and, in the case of AdS/CFT, we show that a locally detectable signal propagates at the information speed in a spatially local variant of the traversable wormhole setup.

}, url = {https://arxiv.org/abs/1908.06993}, author = {Josiah Couch and Stefan Eccles and Phuc Nguyen and Brian Swingle and Shenglong Xu} } @article {2278, title = {Distributed Quantum Metrology and the Entangling Power of Linear Networks}, journal = {Phys. Rev. Lett. 121, 043604}, year = {2018}, month = {2018/07/25}, abstract = {

We derive a bound on the ability of a linear optical network to estimate a linear combination of independent phase shifts by using an arbitrary non-classical but unentangled input state, thereby elucidating the quantum resources required to obtain the Heisenberg limit with a multi-port interferometer. Our bound reveals that while linear networks can generate highly entangled states, they cannot effectively combine quantum resources that are well distributed across multiple modes for the purposes of metrology: in this sense linear networks endowed with well-distributed quantum resources behave classically. Conversely, our bound shows that linear networks can achieve the Heisenberg limit for distributed metrology when the input photons are hoarded in a small number of input modes, and we present an explicit scheme for doing so. Our results also have implications for measures of non-classicality.\ 

}, doi = {https://doi.org/10.1103/PhysRevLett.121.043604}, url = {https://arxiv.org/abs/1707.06655}, author = {Wenchao Ge and Kurt Jacobs and Zachary Eldredge and Alexey V. Gorshkov and Michael Foss-Feig} } @article {2137, title = {Distributed Quantum Metrology and the Entangling Power of Linear Networks}, year = {2018}, month = {2018/07/25}, abstract = {

We derive a bound on the ability of a linear optical network to estimate a linear combination of independent phase shifts by using an arbitrary non-classical but unentangled input state, thereby elucidating the quantum resources required to obtain the Heisenberg limit with a multi-port interferometer. Our bound reveals that while linear networks can generate highly entangled states, they cannot effectively combine quantum resources that are well distributed across multiple modes for the purposes of metrology: in this sense linear networks endowed with well-distributed quantum resources behave classically. Conversely, our bound shows that linear networks can achieve the Heisenberg limit for distributed metrology when the input photons are hoarded in a small number of input modes, and we present an explicit scheme for doing so. Our results also have implications for measures of non-classicality.

}, doi = {https://doi.org/10.1103/PhysRevLett.121.043604}, url = {https://arxiv.org/abs/1707.06655}, author = {Wenchao Ge and Kurt Jacobs and Zachary Eldredge and Alexey V. Gorshkov and Michael Foss-Feig} } @article {1836, title = {Optimal and Secure Measurement Protocols for Quantum Sensor Networks}, year = {2018}, month = {2018/03/23}, abstract = {

Studies of quantum metrology have shown that the use of many-body entangled states can lead to an enhancement in sensitivity when compared to product states. In this paper, we quantify the metrological advantage of entanglement in a setting where the quantity to be measured is a linear function of parameters coupled to each qubit individually. We first generalize the Heisenberg limit to the measurement of non-local observables in a quantum network, deriving a bound based on the multi-parameter quantum Fisher information. We then propose a protocol that can make use of GHZ states or spin-squeezed states, and show that in the case of GHZ states the procedure is optimal, i.e., it saturates our bound.

}, doi = {https://doi.org/10.1103/PhysRevA.97.042337}, url = {http://arxiv.org/abs/1607.04646}, author = {Zachary Eldredge and Michael Foss-Feig and Steven L. Rolston and Alexey V. Gorshkov} } @article {2138, title = {Recovering quantum gates from few average gate fidelities}, journal = {Phys. Rev. Lett. }, volume = {121}, year = {2018}, month = {2018/03/01}, pages = {170502}, abstract = {

Characterising quantum processes is a key task in and constitutes a challenge for the development of quantum technologies, especially at the noisy intermediate scale of today\&$\#$39;s devices. One method for characterising processes is randomised benchmarking, which is robust against state preparation and measurement (SPAM) errors, and can be used to benchmark Clifford gates. A complementing approach asks for full tomographic knowledge. Compressed sensing techniques achieve full tomography of quantum channels essentially at optimal resource efficiency. So far, guarantees for compressed sensing protocols rely on unstructured random measurements and can not be applied to the data acquired from randomised benchmarking experiments. It has been an open question whether or not the favourable features of both worlds can be combined. In this work, we give a positive answer to this question. For the important case of characterising multi-qubit unitary gates, we provide a rigorously guaranteed and practical reconstruction method that works with an essentially optimal number of average gate fidelities measured respect to random Clifford unitaries. Moreover, for general unital quantum channels we provide an explicit expansion into a unitary 2-design, allowing for a practical and guaranteed reconstruction also in that case. As a side result, we obtain a new statistical interpretation of the unitarity -- a figure of merit that characterises the coherence of a process. In our proofs we exploit recent representation theoretic insights on the Clifford group, develop a version of Collins\&$\#$39; calculus with Weingarten functions for integration over the Clifford group, and combine this with proof techniques from compressed sensing.

}, doi = {https://doi.org/10.1103/PhysRevLett.121.170502}, url = {https://arxiv.org/abs/1803.00572}, author = {Ingo Roth and Richard Kueng and Shelby Kimmel and Yi-Kai Liu and David Gross and Jens Eisert and Martin Kliesch} } @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} } @article {2507, title = {Thermal management and non-reciprocal control of phonon flow via optomechanics}, journal = {Nat. Commun.}, volume = {9(1)}, year = {2018}, month = {2018/3/23}, abstract = {

Engineering phonon transport in physical systems is a subject of interest in the study of materials and plays a crucial role in controlling energy and heat transfer. Of particular interest are non-reciprocal phononic systems, which in direct analogy to electric diodes, provide a directional flow of energy. Here, we propose an engineered nanostructured material, in which tunable non-reciprocal phonon transport is achieved through optomechanical coupling. Our scheme relies on breaking time-reversal symmetry by a spatially varying laser drive, which manipulates low-energy acoustic phonons. Furthermore, we take advantage of recent developments in the manipulation of high-energy phonons through controlled scattering mechanisms, such as using alloys and introducing disorder. These combined approaches allow us to design an acoustic isolator and a thermal diode. Our proposed device will have potential impact in phonon-based information processing, and heat management in low temperatures.\ 

}, doi = {https://doi.org/10.1038/s41467-018-03624-y}, url = {https://arxiv.org/abs/1710.08967}, author = {Alireza Seif and Wade DeGottardi and Keivan Esfarjani and Mohammad Hafezi} } @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 {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 {1908, title = {Fast State Transfer and Entanglement Renormalization Using Long-Range Interactions}, journal = {Physical Review Letters}, volume = {119}, year = {2017}, month = {2017/10/25}, pages = {170503}, abstract = {

In short-range interacting systems, the speed at which entanglement can be established between two separated points is limited by a constant Lieb-Robinson velocity. Long-range interacting systems are capable of faster entanglement generation, but the degree of the speed-up possible is an open question. In this paper, we present a protocol capable of transferring a quantum state across a distance\ L\ in\ d\ dimensions using long-range interactions with strength bounded by\ 1/rα. If\ α\<d, the state transfer time is asymptotically independent of\ L; if\ α=d, the time is logarithmic in distance\ L; if\ d\<α\<d+1, transfer occurs in time proportional to\ Lα\−d; and if\ α\≥d+1, it occurs in time proportional to\ L. We then use this protocol to upper bound the time required to create a state specified by a MERA (multiscale entanglement renormalization ansatz) tensor network, and show that, if the linear size of the MERA state is\ L, then it can be created in time that scales with\ L\ identically to state transfer up to multiplicative logarithmic corrections.

}, doi = {10.1103/PhysRevLett.119.170503}, url = {https://arxiv.org/abs/1612.02442}, author = {Zachary Eldredge and Zhe-Xuan Gong and Ali Hamed Moosavian and Michael Foss-Feig and Alexey V. Gorshkov} } @article {2136, title = {Simultaneous, Full Characterization of a Single-Photon State}, journal = {Physical Review X}, volume = {7}, year = {2017}, month = {2017/11/15}, pages = {041036}, abstract = {

As single-photon sources become more mature and are used more often in quantum information, communications, and measurement applications, their characterization becomes more important. Singlephoton-like light is often characterized by its brightness, as well as two quantum properties: the suppression of multiphoton content and the photon indistinguishability. While it is desirable to obtain these quantities from a single measurement, currently two or more measurements are required. Here, we show that using two-photon (n \¼ 2) number-resolving detectors, one can completely characterize single-photon-like states in a single measurement, where previously two or more measurements were necessary. We simultaneously determine the brightness, the suppression of multiphoton states, the indistinguishability, and the statistical distribution of Fock states to third order for a quantum light source. We find n \≥ 3 number-resolving detectors provide no additional advantage in the single-photon characterization. The new method extracts more information per experimental trial than a conventional measurement for all input states and is particularly more efficient for statistical mixtures of photon states. Thus, using this n \¼ 2, number-resolving detector scheme will provide advantages in a variety of quantum optics measurements and systems.

}, doi = {10.1103/PhysRevX.7.041036}, url = {https://link.aps.org/doi/10.1103/PhysRevX.7.041036}, author = {Thomay, Tim and Polyakov, Sergey V. and Gazzano, Olivier and Goldschmidt, Elizabeth and Eldredge, Zachary D. and Huber, Tobias and Loo, Vivien and Solomon, Glenn S.} } @article {2152, title = {Threshold Dynamics of a Semiconductor Single Atom Maser}, journal = {Physical Review Letters}, volume = {119}, year = {2017}, month = {2017/08/31}, pages = {097702}, abstract = {

We demonstrate a single atom maser consisting of a semiconductor double quantum dot (DQD) that is embedded in a high-quality-factor microwave cavity. A finite bias drives the DQD out of equilibrium, resulting in sequential single electron tunneling and masing. We develop a dynamic tuning protocol that allows us to controllably increase the time-averaged repumping rate of the DQD at a fixed level detuning, and quantitatively study the transition through the masing threshold. We further examine the crossover from incoherent to coherent emission by measuring the photon statistics across the masing transition. The observed threshold behavior is in agreement with an existing single atom maser theory when small corrections from lead emission are taken into account.

}, doi = {10.1103/PhysRevLett.119.097702}, url = {https://link.aps.org/doi/10.1103/PhysRevLett.119.097702}, author = {Liu, Y.-Y. and Stehlik, J. and Eichler, C. and Mi, X. and Hartke, T. R. and Michael Gullans and J. M. Taylor and Petta, J. R.} } @article {1815, title = {Double Quantum Dot Floquet Gain Medium}, journal = {Physical Review X}, volume = {6}, year = {2016}, month = {2016/11/07}, pages = {041027}, abstract = {

Strongly driving a two-level quantum system with light leads to a ladder of Floquet states separated by the photon energy. Nanoscale quantum devices allow the interplay of confined electrons, phonons, and photons to be studied under strong driving conditions. Here we show that a single electron in a periodically driven DQD functions as a \"Floquet gain medium,\" where population imbalances in the DQD Floquet quasi-energy levels lead to an intricate pattern of gain and loss features in the cavity response. We further measure a large intra-cavity photon number n_c in the absence of a cavity drive field, due to equilibration in the Floquet picture. Our device operates in the absence of a dc current -- one and the same electron is repeatedly driven to the excited state to generate population inversion. These results pave the way to future studies of non-classical light and thermalization of driven quantum systems.

}, doi = {10.1103/PhysRevX.6.041027}, url = {http://journals.aps.org/prx/abstract/10.1103/PhysRevX.6.041027}, author = {J. Stehlik and Y.-Y. Liu and C. Eichler and T. R. Hartke and X. Mi and Michael Gullans and J. M. Taylor and J. R. Petta} } @article {1772, title = {Self-organization of atoms coupled to a chiral reservoir}, journal = {Physical Review A}, volume = {94}, year = {2016}, month = {2016/11/29}, pages = {053855}, abstract = {

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

}, doi = {10.1103/PhysRevA.94.053855}, url = {http://journals.aps.org/pra/abstract/10.1103/PhysRevA.94.053855}, author = {Zachary Eldredge and Pablo Solano and Darrick Chang and Alexey V. Gorshkov} } @article {2006, title = {Subwavelength-width optical tunnel junctions for ultracold atoms}, journal = {Physical Review A}, volume = {94}, year = {2016}, month = {2016/12/27}, pages = {063422}, abstract = {

We propose a method for creating far-field optical barrier potentials for ultracold atoms with widths that are narrower than the diffraction limit and can approach tens of nanometers. The reduced widths stem from the nonlinear atomic response to control fields that create spatially varying dark resonances. The subwavelength barrier is the result of the geometric scalar potential experienced by an atom prepared in such a spatially varying dark state. The performance of this technique, as well as its applications to the study of many-body physics and to the implementation of quantum-information protocols with ultracold atoms, are discussed, with a focus on the implementation of tunnel junctions.

}, doi = {10.1103/PhysRevA.94.063422}, url = {http://link.aps.org/doi/10.1103/PhysRevA.94.063422}, author = {Jendrzejewski, F. and Eckel, S. and Tiecke, T. G. and G. Juzeliunas and Campbell, G. K. and Jiang, Liang and Alexey V. Gorshkov} } @article {1304, title = {Self-heterodyne detection of the {\it in-situ} phase of an atomic-SQUID}, journal = {Physical Review A}, volume = {92}, year = {2015}, month = {2015/09/03}, pages = {033602}, abstract = { We present theoretical and experimental analysis of an interferometric measurement of the {\it in-situ} phase drop across and current flow through a rotating barrier in a toroidal Bose-Einstein condensate (BEC). This experiment is the atomic analog of the rf-superconducting quantum interference device (SQUID). The phase drop is extracted from a spiral-shaped density profile created by the spatial interference of the expanding toroidal BEC and a reference BEC after release from all trapping potentials. We characterize the interferometer when it contains a single particle, which is initially in a coherent superposition of a torus and reference state, as well as when it contains a many-body state in the mean-field approximation. The single-particle picture is sufficient to explain the origin of the spirals, to relate the phase-drop across the barrier to the geometry of a spiral, and to bound the expansion times for which the {\it in-situ} phase can be accurately determined. Mean-field estimates and numerical simulations show that the inter-atomic interactions shorten the expansion time scales compared to the single-particle case. Finally, we compare the mean-field simulations with our experimental data and confirm that the interferometer indeed accurately measures the {\it in-situ} phase drop. }, doi = {10.1103/PhysRevA.92.033602}, url = {http://arxiv.org/abs/1506.09149v2}, author = {Ranchu Mathew and Avinash Kumar and Stephen Eckel and Fred Jendrzejewski and Gretchen K. Campbell and Mark Edwards and Eite Tiesinga} } @article {1499, title = {Semiconductor double quantum dot micromaser}, journal = {Science}, volume = {347}, year = {2015}, month = {2015/01/15}, pages = {285 - 287}, abstract = { The coherent generation of light, from masers to lasers, relies upon the specific structure of the individual emitters that lead to gain. Devices operating as lasers in the few-emitter limit provide opportunities for understanding quantum coherent phenomena, from THz sources to quantum communication. Here we demonstrate a maser that is driven by single electron tunneling events. Semiconductor double quantum dots (DQDs) serve as a gain medium and are placed inside of a high quality factor microwave cavity. We verify maser action by comparing the statistics of the emitted microwave field above and below the maser threshold. }, doi = {10.1126/science.aaa2501}, url = {http://arxiv.org/abs/1507.06359v1}, author = {Y. -Y. Liu and J. Stehlik and C. Eichler and Michael Gullans and J. M. Taylor and J. R. Petta} } @article {1177, title = {Kitaev chains with long-range pairing}, journal = {Physical Review Letters}, volume = {113}, year = {2014}, month = {2014/10/9}, abstract = { We propose and analyze a generalization of the Kitaev chain for fermions with long-range $p$-wave pairing, which decays with distance as a power-law with exponent $\alpha$. Using the integrability of the model, we demonstrate the existence of two types of gapped regimes, where correlation functions decay exponentially at short range and algebraically at long range ($\alpha > 1$) or purely algebraically ($\alpha < 1$). Most interestingly, along the critical lines, long-range pairing is found to break conformal symmetry for sufficiently small $\alpha$. This is accompanied by a violation of the area law for the entanglement entropy in large parts of the phase diagram in the presence of a gap, and can be detected via the dynamics of entanglement following a quench. Some of these features may be relevant for current experiments with cold atomic ions. }, doi = {10.1103/PhysRevLett.113.156402}, url = {http://arxiv.org/abs/1405.5440v2}, author = {Davide Vodola and Luca Lepori and Elisa Ercolessi and Alexey V. Gorshkov and Guido Pupillo} } @article {1492, title = {Quantum Simulation of Spin Models on an Arbitrary Lattice with Trapped Ions }, journal = {New Journal of Physics}, volume = {14}, year = {2012}, month = {2012/09/27}, pages = {095024}, abstract = { A collection of trapped atomic ions represents one of the most attractive platforms for the quantum simulation of interacting spin networks and quantum magnetism. Spin-dependent optical dipole forces applied to an ion crystal create long-range effective spin-spin interactions and allow the simulation of spin Hamiltonians that possess nontrivial phases and dynamics. Here we show how appropriate design of laser fields can provide for arbitrary multidimensional spin-spin interaction graphs even for the case of a linear spatial array of ions. This scheme uses currently existing trap technology and is scalable to levels where classical methods of simulation are intractable. }, doi = {10.1088/1367-2630/14/9/095024}, url = {http://arxiv.org/abs/1201.0776v1}, author = {Simcha Korenblit and Dvir Kafri and Wess C. Campbell and Rajibul Islam and Emily E. Edwards and Zhe-Xuan Gong and Guin-Dar Lin and Luming Duan and Jungsang Kim and Kihwan Kim and Christopher Monroe} } @article {1434, title = {Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators }, journal = {New Journal of Physics}, volume = {14}, year = {2012}, month = {2012/09/27}, pages = {095022}, abstract = { Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition. First, we show that a low-rank density matrix can be estimated using fewer copies of the state, i.e., the sample complexity of tomography decreases with the rank. Second, we show that unknown low-rank states can be reconstructed from an incomplete set of measurements, using techniques from compressed sensing and matrix completion. These techniques use simple Pauli measurements, and their output can be certified without making any assumptions about the unknown state. We give a new theoretical analysis of compressed tomography, based on the restricted isometry property (RIP) for low-rank matrices. Using these tools, we obtain near-optimal error bounds, for the realistic situation where the data contains noise due to finite statistics, and the density matrix is full-rank with decaying eigenvalues. We also obtain upper-bounds on the sample complexity of compressed tomography, and almost-matching lower bounds on the sample complexity of any procedure using adaptive sequences of Pauli measurements. Using numerical simulations, we compare the performance of two compressed sensing estimators with standard maximum-likelihood estimation (MLE). We find that, given comparable experimental resources, the compressed sensing estimators consistently produce higher-fidelity state reconstructions than MLE. In addition, the use of an incomplete set of measurements leads to faster classical processing with no loss of accuracy. Finally, we show how to certify the accuracy of a low rank estimate using direct fidelity estimation and we describe a method for compressed quantum process tomography that works for processes with small Kraus rank. }, doi = {10.1088/1367-2630/14/9/095022}, url = {http://arxiv.org/abs/1205.2300v2}, author = {Steven T. Flammia and David Gross and Yi-Kai Liu and Jens Eisert} } @article {1531, title = {Casimir force between sharp-shaped conductors}, journal = {Proceedings of the National Academy of Sciences}, volume = {108}, year = {2011}, month = {2011/04/11}, pages = {6867 - 6871}, abstract = { Casimir forces between conductors at the sub-micron scale cannot be ignored in the design and operation of micro-electromechanical (MEM) devices. However, these forces depend non-trivially on geometry, and existing formulae and approximations cannot deal with realistic micro-machinery components with sharp edges and tips. Here, we employ a novel approach to electromagnetic scattering, appropriate to perfect conductors with sharp edges and tips, specifically to wedges and cones. The interaction of these objects with a metal plate (and among themselves) is then computed systematically by a multiple-scattering series. For the wedge, we obtain analytical expressions for the interaction with a plate, as functions of opening angle and tilt, which should provide a particularly useful tool for the design of MEMs. Our result for the Casimir interactions between conducting cones and plates applies directly to the force on the tip of a scanning tunneling probe; the unexpectedly large temperature dependence of the force in these configurations should attract immediate experimental interest. }, doi = {10.1073/pnas.1018079108}, url = {http://arxiv.org/abs/1010.3223v1}, author = {Mohammad F. Maghrebi and Sahand Jamal Rahi and Thorsten Emig and Noah Graham and Robert L. Jaffe and Mehran Kardar} } @article {1433, title = {Continuous-variable quantum compressed sensing}, year = {2011}, month = {2011/11/03}, abstract = { We significantly extend recently developed methods to faithfully reconstruct unknown quantum states that are approximately low-rank, using only a few measurement settings. Our new method is general enough to allow for measurements from a continuous family, and is also applicable to continuous-variable states. As a technical result, this work generalizes quantum compressed sensing to the situation where the measured observables are taken from a so-called tight frame (rather than an orthonormal basis) --- hence covering most realistic measurement scenarios. As an application, we discuss the reconstruction of quantum states of light from homodyne detection and other types of measurements, and we present simulations that show the advantage of the proposed compressed sensing technique over present methods. Finally, we introduce a method to construct a certificate which guarantees the success of the reconstruction with no assumption on the state, and we show how slightly more measurements give rise to "universal" state reconstruction that is highly robust to noise. }, url = {http://arxiv.org/abs/1111.0853v3}, author = {Matthias Ohliger and Vincent Nesme and David Gross and Yi-Kai Liu and Jens Eisert} } @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 {1292, title = {Tunneling phase gate for neutral atoms in a double-well lattice}, journal = {Physical Review A}, volume = {77}, year = {2008}, month = {2008/5/12}, abstract = { We propose a new two--qubit phase gate for ultra--cold atoms confined in an experimentally realized tilted double--well optical lattice [Sebby--Strabley et al., Phys. Rev. A {\bf 73} 033605 (2006)]. Such a lattice is capable of confining pairs of atoms in a two--dimensional array of double--well potentials where control can be exercised over the barrier height and the energy difference of the minima of the two wells (known as the {\textquoteleft}{\textquoteleft}tilt{\textquoteright}{\textquoteright}). The four lowest single--particle motional states consist of two pairs of motional states in which each pair is localized on one side of the central barrier, allowing for two atoms confined in such a lattice to be spatially separated qubits. We present a time--dependent scheme to manipulate the tilt to induce tunneling oscillations which produce a collisional phase gate. Numerical simulations demonstrate that this gate can be performed with high fidelity. }, doi = {10.1103/PhysRevA.77.050304}, url = {http://arxiv.org/abs/0712.1856v1}, author = {Frederick W. Strauch and Mark Edwards and Eite Tiesinga and Carl J. Williams and Charles W. Clark} } @article {1856, title = {Multi-photon Entanglement: From Quantum Curiosity to Quantum Computing and Quantum Repeaters}, journal = {Proc. SPIE}, volume = {6664}, year = {2007}, pages = {66640G}, url = {http://spiedigitallibrary.aip.org/getabs/servlet/GetabsServlet?prog=normal\&id=PSISDG00666400000166640G000001\&idtype=cvips\&gifs=Yes\&bproc=volrange\&scode=6600\%20-\%206699}, author = {Walther, P and Eisaman, M D and Nemiroski, A and Alexey V. Gorshkov and Zibrov, A S and Zeilinger, A and Lukin, M D} } @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 {1414, title = {Bogoliubov approach to superfluidity of atoms in an optical lattice}, journal = {Journal of Physics B: Atomic, Molecular and Optical Physics}, volume = {36}, year = {2003}, month = {2003/03/14}, pages = {825 - 841}, abstract = { We use the Bogoliubov theory of atoms in an optical lattice to study the approach to the Mott-insulator transition. We derive an explicit expression for the superfluid density based on the rigidity of the system under phase variations. This enables us to explore the connection between the quantum depletion of the condensate and the quasi-momentum distribution on the one hand and the superfluid fraction on the other. The approach to the insulator phase may be characterized through the filling of the band by quantum depletion, which should be directly observable via the matter wave interference patterns. We complement these findings by self-consistent Hartree-Fock-Bogoliubov-Popov calculations for one-dimensional lattices including the effects of a parabolic trapping potential. }, doi = {10.1088/0953-4075/36/5/304}, url = {http://arxiv.org/abs/cond-mat/0210550v2}, author = {Ana Maria Rey and Keith Burnett and Robert Roth and Mark Edwards and Carl J. Williams and Charles W. Clark} } @article {1212, title = {Quantum algorithms for subset finding}, year = {2003}, month = {2003/11/06}, abstract = { Recently, Ambainis gave an O(N^(2/3))-query quantum walk algorithm for element distinctness, and more generally, an O(N^(L/(L+1)))-query algorithm for finding L equal numbers. We point out that this algorithm actually solves a much more general problem, the problem of finding a subset of size L that satisfies any given property. We review the algorithm and give a considerably simplified analysis of its query complexity. We present several applications, including two algorithms for the problem of finding an L-clique in an N-vertex graph. One of these algorithms uses O(N^(2L/(L+1))) edge queries, and the other uses \tilde{O}(N^((5L-2)/(2L+4))), which is an improvement for L <= 5. The latter algorithm generalizes a recent result of Magniez, Santha, and Szegedy, who considered the case L=3 (finding a triangle). We also pose two open problems regarding continuous time quantum walk and lower bounds. }, url = {http://arxiv.org/abs/quant-ph/0311038v2}, author = {Andrew M. Childs and Jason M. Eisenberg} }