02177nas a2200181 4500008004100000022001400041245009400055210006900149260001500218300001600233490000600249520163700255100001801892700001701910700001601927700001501943856003701958 2024 eng d a2475-142100aSimuQ: A Framework for Programming Quantum Hamiltonian Simulation with Analog Compilation0 aSimuQ A Framework for Programming Quantum Hamiltonian Simulation c11/19/2023 a2425–24550 v83 a
Quantum Hamiltonian simulation, which simulates the evolution of quantum systems and probes quantum phenomena, is one of the most promising applications of quantum computing. Recent experimental results suggest that Hamiltonian-oriented analog quantum simulation would be advantageous over circuit-oriented digital quantum simulation in the Noisy Intermediate-Scale Quantum (NISQ) machine era. However, programming analog quantum simulators is much more challenging due to the lack of a unified interface between hardware and software. In this paper, we design and implement SimuQ, the first framework for quantum Hamiltonian simulation that supports Hamiltonian programming and pulse-level compilation to heterogeneous analog quantum simulators. Specifically, in SimuQ, front-end users specify the target quantum system with Hamiltonian Modeling Language, and the Hamiltonian-level programmability of analog quantum simulators is specified through a new abstraction called the abstract analog instruction set (AAIS) and programmed in AAIS Specification Language by hardware providers. Through a solver-based compilation, SimuQ generates executable pulse schedules for real devices to simulate the evolution of desired quantum systems, which is demonstrated on superconducting (IBM), neutral-atom (QuEra), and trapped-ion (IonQ) quantum devices. Moreover, we demonstrate the advantages of exposing the Hamiltonian-level programmability of devices with native operations or interaction-based gates and establish a small benchmark of quantum simulation to evaluate SimuQ's compiler with the above analog quantum simulators.
1 aPeng, Yuxiang1 aYoung, Jacob1 aLiu, Pengyu1 aWu, Xiaodi uhttps://arxiv.org/abs/2303.0277502465nas a2200517 4500008004100000245011600041210006900157260001400226520098200240100001701222700001701239700002501256700002001281700002401301700002201325700001601347700001901363700001901382700001801401700001901419700002001438700001901458700002101477700003101498700001801529700001901547700001601566700001601582700001601598700002001614700001901634700002101653700001901674700002201693700001801715700002401733700002301757700001801780700002001798700001801818700002301836700001901859700002001878700001201898856003701910 2023 eng d00aAccelerating Progress Towards Practical Quantum Advantage: The Quantum Technology Demonstration Project Roadmap0 aAccelerating Progress Towards Practical Quantum Advantage The Qu c3/20/20233 aQuantum information science and technology (QIST) is a critical and emerging technology with the potential for enormous world impact and is currently invested in by over 40 nations. To bring these large-scale investments to fruition and bridge the lower technology readiness levels (TRLs) of fundamental research at universities to the high TRLs necessary to realize the promise of practical quantum advantage accessible to industry and the public, we present a roadmap for Quantum Technology Demonstration Projects (QTDPs). Such QTDPs, focused on intermediate TRLs, are large-scale public-private partnerships with a high probability of translation from laboratory to practice. They create technology demonstrating a clear 'quantum advantage' for science breakthroughs that are user-motivated and will provide access to a broad and diverse community of scientific users. Successful implementation of a program of QTDPs will have large positive economic impacts.
1 aAlsing, Paul1 aBattle, Phil1 aBienfang, Joshua, C.1 aBorders, Tammie1 aBrower-Thomas, Tina1 aCarr, Lincoln, D.1 aChong, Fred1 aDadras, Siamak1 aDeMarco, Brian1 aDeutsch, Ivan1 aFigueroa, Eden1 aFreedman, Danna1 aEveritt, Henry1 aGauthier, Daniel1 aJohnston-Halperin, Ezekiel1 aKim, Jungsang1 aKira, Mackillo1 aKumar, Prem1 aKwiat, Paul1 aLekki, John1 aLoiacono, Anjul1 aLončar, Marko1 aLowell, John, R.1 aLukin, Mikhail1 aMerzbacher, Celia1 aMiller, Aaron1 aMonroe, Christopher1 aPollanen, Johannes1 aPappas, David1 aRaymer, Michael1 aReano, Ronald1 aRodenburg, Brandon1 aSavage, Martin1 aSearles, Thomas1 aYe, Jun uhttps://arxiv.org/abs/2210.1475701560nas a2200157 4500008004100000245005000041210005000091260001400141520111200155100001801267700001601285700001601301700002501317700002301342856003701365 2023 eng d00aBounds on Autonomous Quantum Error Correction0 aBounds on Autonomous Quantum Error Correction c8/30/20233 aAutonomous quantum memories are a way to passively protect quantum information using engineered dissipation that creates an "always-on'' decoder. We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes, and derive several upper bounds and a lower bound on the logical error rate in terms of correction and noise rates. For many-body quantum codes, we show that, to achieve error suppression comparable to active error correction, autonomous decoders generally require correction rates that grow with code size. For codes with a threshold, we show that it is possible to achieve faster-than-polynomial decay of the logical error rate with code size by using superlogarithmic scaling of the correction rate. We illustrate our results with several examples. One example is an exactly solvable global dissipative toric code model that can achieve an effective logical error rate that decreases exponentially with the linear lattice size, provided that the recovery rate grows proportionally with the linear lattice size.
1 aShtanko, Oles1 aLiu, Yu-Jie1 aLieu, Simon1 aGorshkov, Alexey, V.1 aAlbert, Victor, V. uhttps://arxiv.org/abs/2308.1623301489nas a2200133 4500008004100000245007300041210006900114260001300183520106500196100001601261700001601277700002501293856003701318 2023 eng d00aCandidate for a passively protected quantum memory in two dimensions0 aCandidate for a passively protected quantum memory in two dimens c3/2/20233 aAn interesting problem in the field of quantum error correction involves finding a physical system that hosts a ``passively protected quantum memory,'' defined as an encoded qubit coupled to an environment that naturally wants to correct errors. To date, a quantum memory stable against finite-temperature effects is only known in four spatial dimensions or higher. Here, we take a different approach to realize a stable quantum memory by relying on a driven-dissipative environment. We propose a new model, the photonic-Ising model, which appears to passively correct against both bit-flip and phase-flip errors in two dimensions: A square lattice composed of photonic ``cat qubits'' coupled via dissipative terms which tend to fix errors locally. Inspired by the presence of two distinct Z2-symmetry-broken phases, our scheme relies on Ising-like dissipators to protect against bit flips and on a driven-dissipative photonic environment to protect against phase flips. We also discuss possible ways to realize the photonic-Ising model.
1 aLieu, Simon1 aLiu, Yu-Jie1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2205.0976701210nas a2200157 4500008004100000245004000041210003900081260001400120520077300134100002300907700001900930700002300949700002100972700002200993856003701015 2023 eng d00aCollision-resolved pressure sensing0 aCollisionresolved pressure sensing c3/17/20233 aHeat and pressure are ultimately transmitted via quantized degrees of freedom, like gas particles and phonons. While a continuous Brownian description of these noise sources is adequate to model measurements with relatively long integration times, sufficiently precise measurements can resolve the detailed time dependence coming from individual bath-system interactions. We propose the use of nanomechanical devices operated with impulse readout sensitivity around the ``standard quantum limit'' to sense ultra-low gas pressures by directly counting the individual collisions of gas particles on a sensor. We illustrate this in two paradigmatic model systems: an optically levitated nanobead and a tethered membrane system in a phononic bandgap shield.
1 aBarker, Daniel, S.1 aCarney, Daniel1 aLeBrun, Thomas, W.1 aMoore, David, C.1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2303.0992201851nas a2200169 4500008004100000245006100041210006000102260001400162520134300176100002501519700001901544700002401563700001801587700001901605700002001624856003701644 2023 eng d00aColloquium: Quantum and Classical Discrete Time Crystals0 aColloquium Quantum and Classical Discrete Time Crystals c5/15/20233 aThe spontaneous breaking of time translation symmetry has led to the discovery of a new phase of matter - the discrete time crystal. Discrete time crystals exhibit rigid subharmonic oscillations, which result from a combination of many-body interactions, collective synchronization, and ergodicity breaking. This Colloquium reviews recent theoretical and experimental advances in the study of quantum and classical discrete time crystals. We focus on the breaking of ergodicity as the key to discrete time crystals and the delaying of ergodicity as the source of numerous phenomena that share many of the properties of discrete time crystals, including the AC Josephson effect, coupled map lattices, and Faraday waves. Theoretically, there exists a diverse array of strategies to stabilize time crystalline order in both closed and open systems, ranging from localization and prethermalization to dissipation and error correction. Experimentally, many-body quantum simulators provide a natural platform for investigating signatures of time crystalline order; recent work utilizing trapped ions, solid-state spin systems, and superconducting qubits will be reviewed. Finally, this Colloquium concludes by describing outstanding challenges in the field and a vision for new directions on both the experimental and theoretical fronts.
1 aZaletel, Michael, P.1 aLukin, Mikhail1 aMonroe, Christopher1 aNayak, Chetan1 aWilczek, Frank1 aYao, Norman, Y. uhttps://arxiv.org/abs/2305.0890401689nas a2200145 4500008004100000245007100041210006900112260001400181520124100195100001501436700001701451700002201468700001601490856003701506 2023 eng d00aComplexity and order in approximate quantum error-correcting codes0 aComplexity and order in approximate quantum errorcorrecting code c10/7/20233 aWe establish rigorous connections between quantum circuit complexity and approximate quantum error correction (AQEC) properties, covering both all-to-all and geometric scenarios including lattice systems. To this end, we introduce a type of code parameter that we call subsystem variance, which is closely related to the optimal AQEC precision. Our key finding is that if the subsystem variance is below an O(k/n) threshold then any state in the code subspace must obey certain circuit complexity lower bounds, which identify nontrivial ``phases'' of codes. Based on our results, we propose O(k/n) as a boundary between subspaces that should and should not count as AQEC codes. This theory of AQEC provides a versatile framework for understanding the quantum complexity and order of many-body quantum systems, offering new insights for wide-ranging physical scenarios, in particular topological order and critical quantum systems which are of outstanding importance in many-body and high energy physics. We observe from various different perspectives that roughly O(1/n) represents a common, physically significant ``scaling threshold'' of subsystem variance for features associated with nontrivial quantum order.
1 aYi, Jinmin1 aYe, Weicheng1 aGottesman, Daniel1 aLiu, Zi-Wen uhttps://arxiv.org/abs/2310.0471001229nas a2200157 4500008004100000245007900041210006900120260001300189520074400202100001900946700001700965700001300982700002100995700001801016856003701034 2023 eng d00aEver more optimized simulations of fermionic systems on a quantum computer0 aEver more optimized simulations of fermionic systems on a quantu c3/6/20233 aDespite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation and optimization techniques that massively reduce the entangling-gate counts. We exploit the well-studied non-quantum optimization algorithms to achieve up to 24\% savings over the state of the art for several small-molecule simulations, with no loss of accuracy or hidden costs. Our methodologies straightforwardly generalize to wider classes of near-term simulations of the ground state of a fermionic system or real-time simulations probing dynamical properties of a fermionic system.
1 aWang, Qingfeng1 aCian, Ze-Pei1 aLi, Ming1 aMarkov, Igor, L.1 aNam, Yunseong uhttps://arxiv.org/abs/2303.0346001881nas a2200193 4500008004100000245007300041210006900114260001400183490000600197520129800203100002001501700002201521700002101543700001601564700001801580700002401598700002801622856003701650 2023 eng d00aExperimental Observation of Thermalization with Noncommuting Charges0 aExperimental Observation of Thermalization with Noncommuting Cha c4/28/20230 v43 aQuantum simulators have recently enabled experimental observations of quantum many-body systems' internal thermalization. Often, the global energy and particle number are conserved, and the system is prepared with a well-defined particle number - in a microcanonical subspace. However, quantum evolution can also conserve quantities, or charges, that fail to commute with each other. Noncommuting charges have recently emerged as a subfield at the intersection of quantum thermodynamics and quantum information. Until now, this subfield has remained theoretical. We initiate the experimental testing of its predictions, with a trapped-ion simulator. We prepare 6-21 spins in an approximate microcanonical subspace, a generalization of the microcanonical subspace for accommodating noncommuting charges, which cannot necessarily have well-defined nontrivial values simultaneously. We simulate a Heisenberg evolution using laser-induced entangling interactions and collective spin rotations. The noncommuting charges are the three spin components. We find that small subsystems equilibrate to near a recently predicted non-Abelian thermal state. This work bridges quantum many-body simulators to the quantum thermodynamics of noncommuting charges, whose predictions can now be tested.
1 aKranzl, Florian1 aLasek, Aleksander1 aJoshi, Manoj, K.1 aKalev, Amir1 aBlatt, Rainer1 aRoos, Christian, F.1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2202.0465201923nas a2200253 4500008004100000020002200041245008700063210006900150260004800219520105800267100002001325700001901345700002301364700001501387700001601402700002401418700002001442700002201462700001201484700001501496700002201511700002201533856011401555 2023 eng d a978-3-031-38554-400aFixing and Mechanizing the Security Proof of Fiat-Shamir with Aborts and Dilithium0 aFixing and Mechanizing the Security Proof of FiatShamir with Abo aChambSpringer Nature Switzerlandc8/9/20233 aWe extend and consolidate the security justification for the Dilithium signature scheme. In particular, we identify a subtle but crucial gap that appears in several ROM and QROM security proofs for signature schemes that are based on the Fiat-Shamir with aborts paradigm, including Dilithium. The gap lies in the CMA-to-NMA reduction and was uncovered when trying to formalize a variant of the QROM security proof by Kiltz, Lyubashevsky, and Schaffner (Eurocrypt 2018). The gap was confirmed by the authors, and there seems to be no simple patch for it. We provide new, fixed proofs for the affected CMA-to-NMA reduction, both for the ROM and the QROM, and we perform a concrete security analysis for the case of Dilithium to show that the claimed security level is still valid after addressing the gap. Furthermore, we offer a fully mechanized ROM proof for the CMA-security of Dilithium in the EasyCrypt proof assistant. Our formalization includes several new tools and techniques of independent interest for future formal verification results.
1 aBarbosa, Manuel1 aBarthe, Gilles1 aDoczkal, Christian1 aDon, Jelle1 aFehr, Serge1 aGrégoire, Benjamin1 aHuang, Yu-Hsuan1 aHülsing, Andreas1 aLee, Yi1 aWu, Xiaodi1 aHandschuh, Helena1 aLysyanskaya, Anna uhttps://www.quics.umd.edu/publications/fixing-and-mechanizing-security-proof-fiat-shamir-aborts-and-dilithium02007nas a2200181 4500008004100000245010800041210006900149260001500218520141700233100002201650700001901672700001901691700002001710700001901730700001701749700002201766856003701788 2023 eng d00aA general approach to backaction-evading receivers with magnetomechanical and electromechanical sensors0 ageneral approach to backactionevading receivers with magnetomech c11/16/20233 aToday's mechanical sensors are capable of detecting extremely weak perturbations while operating near the standard quantum limit. However, further improvements can be made in both sensitivity and bandwidth when we reduce the noise originating from the process of measurement itself -- the quantum-mechanical backaction of measurement -- and go below this 'standard' limit, possibly approaching the Heisenberg limit. One of the ways to eliminate this noise is by measuring a quantum nondemolition variable such as the momentum in a free-particle system. Here, we propose and characterize theoretical models for direct velocity measurement that utilize traditional electric and magnetic transducer designs to generate a signal while enabling this backaction evasion. We consider the general readout of this signal via electric or magnetic field sensing by creating toy models analogous to the standard optomechanical position-sensing problem, thereby facilitating the assessment of measurement-added noise. Using simple models that characterize a wide range of transducers, we find that the choice of readout scheme -- voltage or current -- for each mechanical detector configuration implies access to either the position or velocity of the mechanical sub-system. This in turn suggests a path forward for key fundamental physics experiments such as the direct detection of dark matter particles.
1 aRichman, Brittany1 aGhosh, Sohitri1 aCarney, Daniel1 aHiggins, Gerard1 aShawhan, Peter1 aLobb, C., J.1 aTaylor, Jacob, M. uhttps://arxiv.org/abs/2311.0958701182nas a2200145 4500008004100000245011000041210006900151260001500220490000800235520071200243100001300955700001800968700001300986856003700999 2023 eng d00aLinear combination of Hamiltonian simulation for non-unitary dynamics with optimal state preparation cost0 aLinear combination of Hamiltonian simulation for nonunitary dyna c10/13/20230 v1313 aWe propose a simple method for simulating a general class of non-unitary dynamics as a linear combination of Hamiltonian simulation (LCHS) problems. LCHS does not rely on converting the problem into a dilated linear system problem, or on the spectral mapping theorem. The latter is the mathematical foundation of many quantum algorithms for solving a wide variety of tasks involving non-unitary processes, such as the quantum singular value transformation (QSVT). The LCHS method can achieve optimal cost in terms of state preparation. We also demonstrate an application for open quantum dynamics simulation using the complex absorbing potential method with near-optimal dependence on all parameters.
1 aAn, Dong1 aLiu, Jin-Peng1 aLin, Lin uhttps://arxiv.org/abs/2303.0102901030nas a2200349 4500008004100000022001400041245006600055210006600121260001400187100002100201700002200222700002400244700001900268700001800287700001800305700001800323700001800341700002300359700002400382700002800406700002000434700001500454700001300469700002800482700002300510700002200533700002500555700002000580700002000600700002300620856003700643 2023 eng d a1476-468700aLogical quantum processor based on reconfigurable atom arrays0 aLogical quantum processor based on reconfigurable atom arrays c12/7/20231 aBluvstein, Dolev1 aEvered, Simon, J.1 aGeim, Alexandra, A.1 aLi, Sophie, H.1 aZhou, Hengyun1 aManovitz, Tom1 aEbadi, Sepehr1 aCain, Madelyn1 aKalinowski, Marcin1 aHangleiter, Dominik1 aAtaides, Pablo, Bonilla1 aMaskara, Nishad1 aCong, Iris1 aGao, Xun1 aRodriguez, Pedro, Sales1 aKarolyshyn, Thomas1 aSemeghini, Giulia1 aGullans, Michael, J.1 aGreiner, Markus1 aVuletic, Vladan1 aLukin, Mikhail, D. uhttps://arxiv.org/abs/2312.0398201350nas a2200181 4500008004100000245004400041210004400085260001300129490000800142520083200150653002700982653003101009100003201040700002101072700002201093700001601115856003701131 2023 eng d00aLower Bounds on Quantum Annealing Times0 aLower Bounds on Quantum Annealing Times c4/5/20230 v1303 aThe adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.
10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aGarcía-Pintos, Luis, Pedro1 aBrady, Lucas, T.1 aBringewatt, Jacob1 aLiu, Yi-Kai uhttps://arxiv.org/abs/2210.1568701491nas a2200157 4500008004100000245005900041210005800100260001300158490000800171520102800179100001901207700002201226700002001248700002801268856003701296 2023 eng d00aNon-Abelian symmetry can increase entanglement entropy0 aNonAbelian symmetry can increase entanglement entropy c1/3/20230 v1073 aThe pillars of quantum theory include entanglement and operators' failure to commute. The Page curve quantifies the bipartite entanglement of a many-body system in a random pure state. This entanglement is known to decrease if one constrains extensive observables that commute with each other (Abelian ``charges''). Non-Abelian charges, which fail to commute with each other, are of current interest in quantum thermodynamics. For example, noncommuting charges were shown to reduce entropy-production rates and may enhance finite-size deviations from eigenstate thermalization. Bridging quantum thermodynamics to many-body physics, we quantify the effects of charges' noncommutation -- of a symmetry's non-Abelian nature -- on Page curves. First, we construct two models that are closely analogous but differ in whether their charges commute. We show analytically and numerically that the noncommuting-charge case has more entanglement. Hence charges' noncommutation can promote entanglement.
1 aMajidy, Shayan1 aLasek, Aleksander1 aHuse, David, A.1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2209.1430301518nas a2200169 4500008004100000245007200041210006900113260001300182520098500195100001901180700002501199700002201224700002101246700001601267700002801283856003701311 2023 eng d00aNoncommuting conserved charges in quantum thermodynamics and beyond0 aNoncommuting conserved charges in quantum thermodynamics and bey c9/7/20233 aThermodynamic systems typically conserve quantities ("charges") such as energy and particle number. The charges are often assumed implicitly to commute with each other. Yet quantum phenomena such as uncertainty relations rely on observables' failure to commute. How do noncommuting charges affect thermodynamic phenomena? This question, upon arising at the intersection of quantum information theory and thermodynamics, spread recently across many-body physics. Charges' noncommutation has been found to invalidate derivations of the thermal state's form, decrease entropy production, conflict with the eigenstate thermalization hypothesis, and more. This Perspective surveys key results in, opportunities for, and work adjacent to the quantum thermodynamics of noncommuting charges. Open problems include a conceptual puzzle: Evidence suggests that noncommuting charges may hinder thermalization in some ways while enhancing thermalization in others.
1 aMajidy, Shayan1 aBraasch, William, F.1 aLasek, Aleksander1 aUpadhyaya, Twesh1 aKalev, Amir1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2306.0005401569nas a2200169 4500008004100000245008700041210006900128260001400197520105800211100001301269700001701282700002201299700001201321700001401333700001501347856003701362 2023 eng d00aQafny: Quantum Program Verification Through Type-guided Classical Separation Logic0 aQafny Quantum Program Verification Through Typeguided Classical c7/12/20233 aFormal verification has been proven instrumental to ensure that quantum programs implement their specifications but often requires a significant investment of time and labor. To address this challenge, we present Qafny, an automated proof system designed for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. By modeling these operations as proof rules within a classical separation logic framework, Qafny provides automated support for the reasoning process that would otherwise be tedious and time-consuming. We prove the soundness and completeness of our proof system and implement a prototype compiler that transforms Qafny programs both into the Dafny programming language and into executable quantum circuits. Using Qafny, we demonstrate how to efficiently verify prominent quantum algorithms, including quantum-walk algorithms, Grover's search algorithm, and Shor's factoring algorithm, with significantly reduced human efforts.
1 aLi, Liyi1 aZhu, Mingwei1 aCleaveland, Rance1 aLee, Yi1 aChang, Le1 aWu, Xiaodi uhttps://arxiv.org/abs/2211.0641101581nas a2200181 4500008004100000245006200041210006200103260001100165490000600176520106100182100002701243700002301270700001901293700001701312700001801329700001501347856003701362 2023 eng d00aQuantum algorithm for estimating volumes of convex bodies0 aQuantum algorithm for estimating volumes of convex bodies c4/20230 v43 aEstimating the volume of a convex body is a central problem in convex geometry and can be viewed as a continuous version of counting. We present a quantum algorithm that estimates the volume of an n-dimensional convex body within multiplicative error ε using O~(n3.5+n2.5/ε) queries to a membership oracle and O~(n5.5+n4.5/ε) additional arithmetic operations. For comparison, the best known classical algorithm uses O~(n4+n3/ε2) queries and O~(n6+n5/ε2) additional arithmetic operations. To the best of our knowledge, this is the first quantum speedup for volume estimation. Our algorithm is based on a refined framework for speeding up simulated annealing algorithms that might be of independent interest. This framework applies in the setting of "Chebyshev cooling", where the solution is expressed as a telescoping product of ratios, each having bounded variance. We develop several novel techniques when implementing our framework, including a theory of continuous-space quantum walks with rigorous bounds on discretization error.
1 aChakrabarti, Shouvanik1 aChilds, Andrew, M.1 aHung, Shih-Han1 aLi, Tongyang1 aWang, Chunhao1 aWu, Xiaodi uhttps://arxiv.org/abs/1908.0390301051nas a2200133 4500008004100000245010100041210006900142260001400211520060600225100001300831700002300844700001300867856003700880 2023 eng d00aQuantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters0 aQuantum algorithm for linear nonunitary dynamics with nearoptima c12/6/20233 aWe introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.
1 aAn, Dong1 aChilds, Andrew, M.1 aLin, Lin uhttps://arxiv.org/abs/2312.0391601354nas a2200157 4500008004100000245006100041210005900102260001400161520088700175100002301062700001601085700002301101700002001124700001501144856003701159 2023 eng d00aA quantum central path algorithm for linear optimization0 aquantum central path algorithm for linear optimization c11/7/20233 aWe propose a novel quantum algorithm for solving linear optimization problems by quantum-mechanical simulation of the central path. While interior point methods follow the central path with an iterative algorithm that works with successive linearizations of the perturbed KKT conditions, we perform a single simulation working directly with the nonlinear complementarity equations. Combining our approach with iterative refinement techniques, we obtain an exact solution to a linear optimization problem involving m constraints and n variables using at most O((m+n)nnz(A)κ(M)L⋅polylog(m,n,κ(M))) elementary gates and O(nnz(A)L) classical arithmetic operations, where nnz(A) is the total number of non-zero elements found in the constraint matrix, L denotes binary input length of the problem data, and κ(M) is a condition number that depends only on the problem data.
1 aAugustino, Brandon1 aLeng, Jiaqi1 aNannicini, Giacomo1 aTerlaky, Tamás1 aWu, Xiaodi uhttps://arxiv.org/abs/2311.0397701891nas a2200145 4500008004100000245003200041210003200073260001300105520152500118100001601643700001901659700001501678700001501693856003701708 2023 eng d00aQuantum Hamiltonian Descent0 aQuantum Hamiltonian Descent c3/2/20233 aGradient descent is a fundamental algorithm in both theory and practice for continuous optimization. Identifying its quantum counterpart would be appealing to both theoretical and practical quantum applications. A conventional approach to quantum speedups in optimization relies on the quantum acceleration of intermediate steps of classical algorithms, while keeping the overall algorithmic trajectory and solution quality unchanged. We propose Quantum Hamiltonian Descent (QHD), which is derived from the path integral of dynamical systems referring to the continuous-time limit of classical gradient descent algorithms, as a truly quantum counterpart of classical gradient methods where the contribution from classically-prohibited trajectories can significantly boost QHD's performance for non-convex optimization. Moreover, QHD is described as a Hamiltonian evolution efficiently simulatable on both digital and analog quantum computers. By embedding the dynamics of QHD into the evolution of the so-called Quantum Ising Machine (including D-Wave and others), we empirically observe that the D-Wave-implemented QHD outperforms a selection of state-of-the-art gradient-based classical solvers and the standard quantum adiabatic algorithm, based on the time-to-solution metric, on non-convex constrained quadratic programming instances up to 75 dimensions. Finally, we propose a "three-phase picture" to explain the behavior of QHD, especially its difference from the quantum adiabatic algorithm.
1 aLeng, Jiaqi1 aHickman, Ethan1 aLi, Joseph1 aWu, Xiaodi uhttps://arxiv.org/abs/2303.0147101522nas a2200145 4500008004100000245006600041210006500107260001300172520107900185100001701264700002501281700001701306700001601323856003701339 2023 eng d00aQuantum Lego Expansion Pack: Enumerators from Tensor Networks0 aQuantum Lego Expansion Pack Enumerators from Tensor Networks c8/9/20233 aWe provide the first tensor network method for computing quantum weight enumerator polynomials in the most general form. As a corollary, if a quantum code has a known tensor network construction of its encoding map, our method produces an algorithm that computes its distance. For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance. For degenerate stabilizer codes, it can provide up to an exponential speed up compared to the current methods. We also introduce a few novel applications of different weight enumerators. In particular, for any code built from the quantum lego method, we use enumerators to construct its (optimal) decoders under any i.i.d. single qubit or qudit error channels and discuss their applications for computing logical error rates. As a proof of principle, we perform exact analyses of the deformed surface codes, the holographic pentagon code, and the 2d Bacon-Shor code under (biased) Pauli noise and limited instances of coherent error at sizes that are inaccessible by brute force.
1 aCao, ChunJun1 aGullans, Michael, J.1 aLackey, Brad1 aWang, Zitao uhttps://arxiv.org/abs/2308.0515205435nas a2201621 4500008004100000245010800041210006900149260001500218520094500233100001801178700002301196700001601219700002801235700002001263700002001283700001601303700002001319700002101339700002401360700001901384700001901403700002601422700001801448700002301466700002101489700001601510700001701526700002101543700002301564700002101587700001601608700001701624700003101641700003401672700001801706700001801724700002101742700001801763700002401781700001801805700002001823700003501843700002201878700001601900700002001916700001901936700001701955700001901972700002301991700001802014700002402032700002302056700002302079700001802102700001702120700001902137700002602156700002002182700001902202700001902221700002302240700001802263700002202281700001802303700001902321700002802340700002402368700001902392700002002411700002002431700002702451700001202478700001702490700001502507700002102522700001802543700001902561700003202580700002402612700002202636700003102658700001702689700002302706700002402729700002002753700001902773700001902792700001602811700001702827700001802844700001802862700002002880700001902900700002302919700001902942700001702961700002602978700001603004700002003020700001603040700001803056700002803074700002103102700001803123700002403141700001403165700002303179700002003202700002103222700002003243700001803263700001803281700002103299700002103320700002303341700001803364700001803382700001403400700001903414700001603433700001503449700002003464700002103484700002103505700001703526700002803543700002203571700002303593700002603616700001503642700001703657700002303674700002403697700001803721700001703739700002003756856003703776 2023 eng d00aQuantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions0 aQuantumcentric Supercomputing for Materials Science A Perspectiv c12/14/20233 aComputational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.
1 aAlexeev, Yuri1 aAmsler, Maximilian1 aBaity, Paul1 aBarroca, Marco, Antonio1 aBassini, Sanzio1 aBattelle, Torey1 aCamps, Daan1 aCasanova, David1 aChoi, Young, jai1 aChong, Frederic, T.1 aChung, Charles1 aCodella, Chris1 aCorcoles, Antonio, D.1 aCruise, James1 aDi Meglio, Alberto1 aDubois, Jonathan1 aDuran, Ivan1 aEckl, Thomas1 aEconomou, Sophia1 aEidenbenz, Stephan1 aElmegreen, Bruce1 aFare, Clyde1 aFaro, Ismael1 aFernández, Cristina, Sanz1 aFerreira, Rodrigo, Neumann Ba1 aFuji, Keisuke1 aFuller, Bryce1 aGagliardi, Laura1 aGalli, Giulia1 aGlick, Jennifer, R.1 aGobbi, Isacco1 aGokhale, Pranav1 aGonzalez, Salvador, de la Puen1 aGreiner, Johannes1 aGropp, Bill1 aGrossi, Michele1 aGull, Emmanuel1 aHealy, Burns1 aHuang, Benchen1 aHumble, Travis, S.1 aIto, Nobuyasu1 aIzmaylov, Artur, F.1 aJavadi-Abhari, Ali1 aJennewein, Douglas1 aJha, Shantenu1 aJiang, Liang1 aJones, Barbara1 ade Jong, Wibe, Albert1 aJurcevic, Petar1 aKirby, William1 aKister, Stefan1 aKitagawa, Masahiro1 aKlassen, Joel1 aKlymko, Katherine1 aKoh, Kwangwon1 aKondo, Masaaki1 aKurkcuoglu, Doga, Murat1 aKurowski, Krzysztof1 aLaino, Teodoro1 aLandfield, Ryan1 aLeininger, Matt1 aLeyton-Ortega, Vicente1 aLi, Ang1 aLin, Meifeng1 aLiu, Junyu1 aLorente, Nicolas1 aLuckow, Andre1 aMartiel, Simon1 aMartin-Fernandez, Francisco1 aMartonosi, Margaret1 aMarvinney, Claire1 aMedina, Arcesio, Castaneda1 aMerten, Dirk1 aMezzacapo, Antonio1 aMichielsen, Kristel1 aMitra, Abhishek1 aMittal, Tushar1 aMoon, Kyungsun1 aMoore, Joel1 aMotta, Mario1 aNa, Young-Hye1 aNam, Yunseong1 aNarang, Prineha1 aOhnishi, Yu-ya1 aOttaviani, Daniele1 aOtten, Matthew1 aPakin, Scott1 aPascuzzi, Vincent, R.1 aPenault, Ed1 aPiontek, Tomasz1 aPitera, Jed1 aRall, Patrick1 aRavi, Gokul, Subramania1 aRobertson, Niall1 aRossi, Matteo1 aRydlichowski, Piotr1 aRyu, Hoon1 aSamsonidze, Georgy1 aSato, Mitsuhisa1 aSaurabh, Nishant1 aSharma, Vidushi1 aSharma, Kunal1 aShin, Soyoung1 aSlessman, George1 aSteiner, Mathias1 aSitdikov, Iskandar1 aSuh, In-Saeng1 aSwitzer, Eric1 aTang, Wei1 aThompson, Joel1 aTodo, Synge1 aTran, Minh1 aTrenev, Dimitar1 aTrott, Christian1 aTseng, Huan-Hsin1 aTureci, Esin1 aValinas, David, García1 aVallecorsa, Sofia1 aWever, Christopher1 aWojciechowski, Konrad1 aWu, Xiaodi1 aYoo, Shinjae1 aYoshioka, Nobuyuki1 aYu, Victor, Wen-zhe1 aYunoki, Seiji1 aZhuk, Sergiy1 aZubarev, Dmitry uhttps://arxiv.org/abs/2312.0973301172nas a2200133 4500008004100000245007300041210006900114260001400183520075600197100001600953700001700969700001500986856003701001 2023 eng d00aA quantum-classical performance separation in nonconvex optimization0 aquantumclassical performance separation in nonconvex optimizatio c11/1/20233 aIn this paper, we identify a family of nonconvex continuous optimization instances, each d-dimensional instance with 2d local minima, to demonstrate a quantum-classical performance separation. Specifically, we prove that the recently proposed Quantum Hamiltonian Descent (QHD) algorithm [Leng et al., arXiv:2303.01471] is able to solve any d-dimensional instance from this family using O˜(d3) quantum queries to the function value and O˜(d4) additional 1-qubit and 2-qubit elementary quantum gates. On the other side, a comprehensive empirical study suggests that representative state-of-the-art classical optimization algorithms/solvers (including Gurobi) would require a super-polynomial time to solve such optimization instances.
1 aLeng, Jiaqi1 aZheng, Yufan1 aWu, Xiaodi uhttps://arxiv.org/abs/2311.0081101429nas a2200157 4500008004100000245005600041210005600097260001300153520097200166100001801138700002301156700001801179700002101197700001601218856003701234 2023 eng d00aRandom Pulse Sequences for Qubit Noise Spectroscopy0 aRandom Pulse Sequences for Qubit Noise Spectroscopy c3/2/20233 aQubit noise spectroscopy is an important tool for the experimental investigation of open quantum systems. However, conventional techniques for implementing noise spectroscopy are time-consuming, because they require multiple measurements of the noise spectral density at different frequencies. Here we describe an alternative method for quickly characterizing the spectral density. Our method utilizes random pulse sequences, with carefully-controlled correlations among the pulses, to measure arbitrary linear functionals of the noise spectrum. Such measurements allow us to estimate k'th-order moments of the noise spectrum, as well as to reconstruct sparse noise spectra via compressed sensing. Our simulations of the performance of the random pulse sequences on a realistic physical system, self-assembled quantum dots, reveal a speedup of an order of magnitude in extracting the noise spectrum compared to conventional dynamical decoupling approaches.
1 aHuang, Kaixin1 aFarfurnik, Demitry1 aSeif, Alireza1 aHafezi, Mohammad1 aLiu, Yi-Kai uhttps://arxiv.org/abs/2303.0090901441nas a2200193 4500008004100000245006200041210006200103260001300165520087300178100001601051700001901067700001501086700001701101700002501118700002001143700002701163700002001190856003701210 2023 eng d00aRealization of 1D Anyons with Arbitrary Statistical Phase0 aRealization of 1D Anyons with Arbitrary Statistical Phase c6/2/20233 aLow-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.
1 aKwan, Joyce1 aSegura, Perrin1 aLi, Yanfei1 aKim, Sooshin1 aGorshkov, Alexey, V.1 aEckardt, André1 aBakkali-Hassani, Brice1 aGreiner, Markus uhttps://arxiv.org/abs/2306.0173702012nas a2200145 4500008004100000245008500041210006900126260001300195520155500208100001801763700001701781700001601798700001501814856003701829 2023 eng d00aSimuQ: A Domain-Specific Language For Quantum Simulation With Analog Compilation0 aSimuQ A DomainSpecific Language For Quantum Simulation With Anal c3/5/20233 aHamiltonian simulation is one of the most promising applications of quantum computing. Recent experimental results suggest that continuous-time analog quantum simulation would be advantageous over gate-based digital quantum simulation in the Noisy Intermediate-Size Quantum (NISQ) machine era. However, programming such analog quantum simulators is much more challenging due to the lack of a unified interface between hardware and software, and the only few known examples are all hardware-specific. In this paper, we design and implement SimuQ, the first domain-specific language for Hamiltonian simulation that supports pulse-level compilation to heterogeneous analog quantum simulators. Specifically, in SimuQ, front-end users will specify the target Hamiltonian evolution with a Hamiltonian modeling language, and the programmability of analog simulators is specified through a new abstraction called the abstract analog instruction set by hardware providers. Through a solver-based compilation, SimuQ will generate the pulse-level instruction schedule on the target analog simulator for the desired Hamiltonian evolution, which has been demonstrated on pulse-controlled superconducting (Qiskit Pulse) and neutral-atom (QuEra Bloqade) quantum systems, as well as on normal circuit-based digital quantum machines. Moreover, we also demonstrate the advantage of analog compilation over digital compilation on IBM machines, the use of SimuQ for resource estimation for hypothetical machines, and a scalability test of SimuQ's compilation.
1 aPeng, Yuxiang1 aYoung, Jacob1 aLiu, Pengyu1 aWu, Xiaodi uhttps://arxiv.org/abs/2303.0277501289nas a2200169 4500008004100000245004100041210004100082260001400123520084200137100002300979700001601002700001801018700001201036700001701048700001701065856003701082 2023 eng d00aStreaming quantum state purification0 aStreaming quantum state purification c9/28/20233 aQuantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.
1 aChilds, Andrew, M.1 aFu, Honghao1 aLeung, Debbie1 aLi, Zhi1 aOzols, Maris1 aVyas, Vedang uhttps://arxiv.org/abs/2309.1638701519nas a2200133 4500008004100000245008200041210006900123260001500192520106200207100002601269700003001295700002301325856003701348 2023 eng d00aSubsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat's Lemma0 aSubsystem CSS codes a tighter stabilizertoCSS mapping and Goursa c11/29/20233 aThe CSS code construction is a powerful framework used to express features of a quantum code in terms of a pair of underlying classical codes. Its subsystem extension allows for similar expressions, but the general case has not been fully explored. Extending previous work of Aly et. al. [quant-ph/0610153], we determine subsystem CSS code parameters, express codewords, and develop a Steane-type decoder using only data from the two underlying classical codes. We show that any subsystem stabilizer code can be ``doubled'' to yield a subsystem CSS code with twice the number of physical, logical, and gauge qudits and up to twice the code distance. This mapping preserves locality and is tighter than the Majorana-based mapping of Bravyi, Leemhuis, and Terhal [New J. Phys. 12 083039 (2010)]. Using Goursat's Lemma, we show that every subsystem stabilizer code can be constructed from two nested subsystem CSS codes satisfying certain constraints, and we characterize subsystem stabilizer codes based on the nested codes' properties.
1 aLiu, Michael, Liaofan1 aTantivasadakarn, Nathanan1 aAlbert, Victor, V. uhttps://arxiv.org/abs/2311.1800302278nas a2200145 4500008004100000245008700041210006900128260001300197520182300210100001302033700001802046700001802064700001302082856003702095 2023 eng d00aA theory of quantum differential equation solvers: limitations and fast-forwarding0 atheory of quantum differential equation solvers limitations and c3/2/20233 aWe study the limitations and fast-forwarding of quantum algorithms for linear ordinary differential equation (ODE) systems with a particular focus on non-quantum dynamics, where the coefficient matrix in the ODE is not anti-Hermitian or the ODE is inhomogeneous. On the one hand, for generic homogeneous linear ODEs, by proving worst-case lower bounds, we show that quantum algorithms suffer from computational overheads due to two types of ``non-quantumness'': real part gap and non-normality of the coefficient matrix. We then show that homogeneous ODEs in the absence of both types of ``non-quantumness'' are equivalent to quantum dynamics, and reach the conclusion that quantum algorithms for quantum dynamics work best. We generalize our results to the inhomogeneous case and find that existing generic quantum ODE solvers cannot be substantially improved. To obtain these lower bounds, we propose a general framework for proving lower bounds on quantum algorithms that are amplifiers, meaning that they amplify the difference between a pair of input quantum states. On the other hand, we show how to fast-forward quantum algorithms for solving special classes of ODEs which leads to improved efficiency. More specifically, we obtain quadratic improvements in the evolution time T for inhomogeneous ODEs with a negative semi-definite coefficient matrix, and exponential improvements in both T and the spectral norm of the coefficient matrix for inhomogeneous ODEs with efficiently implementable eigensystems, including various spatially discretized linear evolutionary partial differential equations. We give fast-forwarding algorithms that are conceptually different from existing ones in the sense that they neither require time discretization nor solving high-dimensional linear systems.
1 aAn, Dong1 aLiu, Jin-Peng1 aWang, Daochen1 aZhao, Qi uhttps://arxiv.org/abs/2211.0524601629nas a2200109 4500008004100000245013500041210006900176260001400245520120700259100001601466856003701482 2023 eng d00aAn Uncertainty Principle for the Curvelet Transform, and the Infeasibility of Quantum Algorithms for Finding Short Lattice Vectors0 aUncertainty Principle for the Curvelet Transform and the Infeasi c11/7/20233 aThe curvelet transform is a special type of wavelet transform, which is useful for estimating the locations and orientations of waves propagating in Euclidean space. We prove an uncertainty principle that lower-bounds the variance of these estimates, for radial wave functions in n dimensions. As an application of this uncertainty principle, we show the infeasibility of one approach to constructing quantum algorithms for solving lattice problems, such as the approximate shortest vector problem (approximate-SVP), and bounded distance decoding (BDD). This gives insight into the computational intractability of approximate-SVP, which plays an important role in algorithms for integer programming, and in post-quantum cryptosystems.
In this approach to solving lattice problems, one prepares quantum superpositions of Gaussian-like wave functions centered at lattice points. A key step in this procedure requires finding the center of each Gaussian-like wave function, using the quantum curvelet transform. We show that, for any choice of the Gaussian-like wave function, the error in this step will be above the threshold required to solve BDD and approximate-SVP.
The curvelet transform is a special type of wavelet transform, which is useful for estimating the locations and orientations of waves propagating in Euclidean space. We prove an uncertainty principle that lower-bounds the variance of these estimates, for radial wave functions in n dimensions.
As an application of this uncertainty principle, we show the infeasibility of one approach to constructing quantum algorithms for solving lattice problems, such as the approximate shortest vector problem (approximate-SVP), and bounded distance decoding (BDD). This gives insight into the computational intractability of approximate-SVP, which plays an important role in algorithms for integer programming, and in post-quantum cryptosystems.
In this approach to solving lattice problems, one prepares quantum superpositions of Gaussian-like wave functions centered at lattice points. A key step in this procedure requires finding the center of each Gaussian-like wave function, using the quantum curvelet transform. We show that, for any choice of the Gaussian-like wave function, the error in this step will be above the threshold required to solve BDD and approximate-SVP.
We extend entropy production to a deeply quantum regime involving noncommuting conserved quantities. Consider a unitary transporting conserved quantities ("charges") between two systems initialized in thermal states. Three common formulae model the entropy produced. They respectively cast entropy as an extensive thermodynamic variable, as an information-theoretic uncertainty measure, and as a quantifier of irreversibility. Often, the charges are assumed to commute with each other (e.g., energy and particle number). Yet quantum charges can fail to commute. Noncommutation invites generalizations, which we posit and justify, of the three formulae. Charges' noncommutation, we find, breaks the formulae's equivalence. Furthermore, different formulae quantify different physical effects of charges' noncommutation on entropy production. For instance, entropy production can signal contextuality - true nonclassicality - by becoming nonreal. This work opens up stochastic thermodynamics to noncommuting - and so particularly quantum - charges.
1 aUpadhyaya, Twesh1 aBraasch, William, F.1 aLandi, Gabriel, T.1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2305.1548001388nas a2200133 4500008004100000245006900041210006800110260001400178520096800192100001601160700001601176700002501192856003701217 2022 eng d00aCandidate for a self-correcting quantum memory in two dimensions0 aCandidate for a selfcorrecting quantum memory in two dimensions c5/19/20223 aAn interesting problem in the field of quantum error correction involves finding a physical system that hosts a "self-correcting quantum memory," defined as an encoded qubit coupled to an environment that naturally wants to correct errors. To date, a quantum memory stable against finite-temperature effects is only known in four spatial dimensions or higher. Here, we take a different approach to realize a stable quantum memory by relying on a driven-dissipative environment. We propose a new model which appears to self correct against both bit-flip and phase-flip errors in two dimensions: A square lattice composed of photonic "cat qubits" coupled via dissipative terms which tend to fix errors locally. Inspired by the presence of two distinct Z2-symmetry-broken phases, our scheme relies on Ising-like dissipators to protect against bit flips and on a driven-dissipative photonic environment to protect against phase flips.
1 aLieu, Simon1 aLiu, Yu-Jie1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2205.0976702045nas a2200337 4500008004100000245009200041210006900133260001500202300001100217490000800228520091000236100001301146700001301159700001401172700001701186700002001203700001401223700001401237700001601251700001901267700001801286700001701304700002101321700001501342700002001357700001701377700001701394700001801411700001801429856026001447 2022 eng d00aClosing the Locality and Detection Loopholes in Multiparticle Entanglement Self-Testing0 aClosing the Locality and Detection Loopholes in Multiparticle En c06/23/2022 a2504010 v1283 aFirst proposed by Mayers and Yao, self-testing provides a certification method to infer the underlying physics of quantum experiments in a black-box scenario. Numerous demonstrations have been reported to self-test various types of entangled states. However, all the multiparticle self-testing experiments reported so far suffer from both detection and locality loopholes. Here, we report the first experimental realization of multiparticle entanglement self-testing closing the locality loophole in a photonic system, and the detection loophole in a superconducting system, respectively. We certify three-party and four-party GHZ states with at least 0.84 (1) and 0.86 (3) fidelities in a device-independent way. These results can be viewed as a meaningful advance in multiparticle loophole-free self-testing, and also significant progress on the foundations of quantum entanglement certification.
1 aWu, Dian1 aZhao, Qi1 aWang, Can1 aHuang, Liang1 aJiang, Yang-Fan1 aBai, Bing1 aZhou, You1 aGu, Xue-Mei1 aLiu, Feng-Ming1 aMao, Ying-Qiu1 aSun, Qi-Chao1 aChen, Ming-Cheng1 aZhang, Jun1 aPeng, Cheng-Zhi1 aZhu, Xiao-Bo1 aZhang, Qiang1 aLu, Chao-Yang1 aPan, Jian-Wei uhttps://www.researchgate.net/profile/Dian-Wu/publication/361497881_Closing_the_Locality_and_Detection_Loopholes_in_Multiparticle_Entanglement_Self-Testing/links/62b55a8c1010dc02cc57530c/Closing-the-Locality-and-Detection-Loopholes-in-Multiparticle-Entangl01282nas a2200181 4500008004100000245008800041210006900129260001300198520068100211653002700892653003100919100002900950700002000979700001900999700002201018700002301040856003701063 2022 eng d00aConvex optimization for non-equilibrium steady states on a hybrid quantum processor0 aConvex optimization for nonequilibrium steady states on a hybrid c4/7/20223 aFinding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semi-definite program, we bypass several well known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries.
10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aLau, Jonathan, Wei Zhong1 aLim, Kian, Hwee1 aBharti, Kishor1 aKwek, Leong-Chuan1 aVinjanampathy, Sai uhttps://arxiv.org/abs/2204.0320302428nas a2200217 4500008004100000245010600041210006900147260001400216520171900230653004301949653002701992653002902019653003102048100001702079700001502096700001302111700001702124700001602141700001602157856003702173 2022 eng d00aEfficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning0 aEfficient and practical quantum compiler towards multiqubit syst c4/14/20223 aEfficient quantum compiling tactics greatly enhance the capability of quantum computers to execute complicated quantum algorithms. Due to its fundamental importance, a plethora of quantum compilers has been designed in past years. However, there are several caveats to current protocols, which are low optimality, high inference time, limited scalability, and lack of universality. To compensate for these defects, here we devise an efficient and practical quantum compiler assisted by advanced deep reinforcement learning (RL) techniques, i.e., data generation, deep Q-learning, and AQ* search. In this way, our protocol is compatible with various quantum machines and can be used to compile multi-qubit operators. We systematically evaluate the performance of our proposal in compiling quantum operators with both inverse-closed and inverse-free universal basis sets. In the task of single-qubit operator compiling, our proposal outperforms other RL-based quantum compilers in the measure of compiling sequence length and inference time. Meanwhile, the output solution is near-optimal, guaranteed by the Solovay-Kitaev theorem. Notably, for the inverse-free universal basis set, the achieved sequence length complexity is comparable with the inverse-based setting and dramatically advances previous methods. These empirical results contribute to improving the inverse-free Solovay-Kitaev theorem. In addition, for the first time, we demonstrate how to leverage RL-based quantum compilers to accomplish two-qubit operator compiling. The achieved results open an avenue for integrating RL with quantum compiling to unify efficiency and practicality and thus facilitate the exploration of quantum advantages.
10aFOS: Computer and information sciences10aFOS: Physical sciences10aMachine Learning (cs.LG)10aQuantum Physics (quant-ph)1 aChen, Qiuhao1 aDu, Yuxuan1 aZhao, Qi1 aJiao, Yuling1 aLu, Xiliang1 aWu, Xingyao uhttps://arxiv.org/abs/2204.0690401837nas a2200169 4500008004100000245009700041210006900138260001300207520131000220100001301530700001301543700002001556700001801576700002001594700001601614856003701630 2022 eng d00aEfficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation0 aEfficient quantum algorithm for nonlinear reactiondiffusion equa c5/2/20223 aNonlinear differential equations exhibit rich phenomena in many fields but are notoriously challenging to solve. Recently, Liu et al. [1] demonstrated the first efficient quantum algorithm for dissipative quadratic differential equations under the condition R<1, where R measures the ratio of nonlinearity to dissipation using the ℓ2 norm. Here we develop an efficient quantum algorithm based on [1] for reaction-diffusion equations, a class of nonlinear partial differential equations (PDEs). To achieve this, we improve upon the Carleman linearization approach introduced in [1] to obtain a faster convergence rate under the condition RD<1, where RD measures the ratio of nonlinearity to dissipation using the ℓ∞ norm. Since RD is independent of the number of spatial grid points n while R increases with n, the criterion RD<1 is significantly milder than R<1 for high-dimensional systems and can stay convergent under grid refinement for approximating PDEs. As applications of our quantum algorithm we consider the Fisher-KPP and Allen-Cahn equations, which have interpretations in classical physics. In particular, we show how to estimate the mean square kinetic energy in the solution by postprocessing the quantum state that encodes it to extract derivative information.
1 aAn, Dong1 aFang, Di1 aJordan, Stephen1 aLiu, Jin-Peng1 aLow, Guang, Hao1 aWang, Jiasu uhttps://arxiv.org/abs/2205.0114101498nas a2200301 4500008004100000245006800041210006800109260001400177520060600191653002700797653004400824653003100868100001700899700001600916700002500932700001800957700001300975700001800988700001901006700002101025700001401046700002201060700001601082700001901098700001801117700002401135856003701159 2022 eng d00aExperimental Implementation of an Efficient Test of Quantumness0 aExperimental Implementation of an Efficient Test of Quantumness c9/28/20223 aA test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification, or non-interactive challenges with inefficient (exponential time) verification. In this paper, we execute an efficient non-interactive test of quantumness on an ion-trap quantum computer. Our results significantly exceed the bound for a classical device's success.
10aFOS: Physical sciences10aOther Condensed Matter (cond-mat.other)10aQuantum Physics (quant-ph)1 aLewis, Laura1 aZhu, Daiwei1 aGheorghiu, Alexandru1 aNoel, Crystal1 aKatz, Or1 aHarraz, Bahaa1 aWang, Qingfeng1 aRisinger, Andrew1 aFeng, Lei1 aBiswas, Debopriyo1 aEgan, Laird1 aVidick, Thomas1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2209.1431602003nas a2200217 4500008004100000245007300041210006900114260001300183520129800196653002701494653003101521653004701552100002001599700002201619700002101641700001601662700001801678700002401696700002801720856003701748 2022 eng d00aExperimental observation of thermalisation with noncommuting charges0 aExperimental observation of thermalisation with noncommuting cha c2/9/20223 aQuantum simulators have recently enabled experimental observations of quantum many-body systems' internal thermalisation. Often, the global energy and particle number are conserved, and the system is prepared with a well-defined particle number - in a microcanonical subspace. However, quantum evolution can also conserve quantities, or charges, that fail to commute with each other. Noncommuting charges have recently emerged as a subfield at the intersection of quantum thermodynamics and quantum information. Until now, this subfield has remained theoretical. We initiate the experimental testing of its predictions, with a trapped-ion simulator. We prepare 6-15 spins in an approximate microcanonical subspace, a generalisation of the microcanonical subspace for accommodating noncommuting charges, which cannot necessarily have well-defined nontrivial values simultaneously. We simulate a Heisenberg evolution using laser-induced entangling interactions and collective spin rotations. The noncommuting charges are the three spin components. We find that small subsystems equilibrate to near a recently predicted non-Abelian thermal state. This work bridges quantum many-body simulators to the quantum thermodynamics of noncommuting charges, whose predictions can now be tested.
10aFOS: Physical sciences10aQuantum Physics (quant-ph)10aStatistical Mechanics (cond-mat.stat-mech)1 aKranzl, Florian1 aLasek, Aleksander1 aJoshi, Manoj, K.1 aKalev, Amir1 aBlatt, Rainer1 aRoos, Christian, F.1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2202.0465201745nas a2200181 4500008004100000245009400041210006900135260001500204300001100219490000800230520117000238100002401408700001901432700002801451700002601479700002101505856003701526 2022 eng d00aExperimentally Measuring Rolling and Sliding in Three-Dimensional Dense Granular Packings0 aExperimentally Measuring Rolling and Sliding in ThreeDimensional c06/18/2022 a0480010 v1293 aWe experimentally measure a three-dimensional (3D) granular system’s reversibility under cyclic compression. We image the grains using a refractive-index-matched fluid, then analyze the images using the artificial intelligence of variational autoencoders. These techniques allow us to track all the grains’ translations and 3D rotations with accuracy sufficient to infer sliding and rolling displacements. Our observations reveal unique roles played by 3D rotational motions in granular flows. We find that rotations and contact-point motion dominate the dynamics in the bulk, far from the perturbation’s source. Furthermore, we determine that 3D rotations are irreversible under cyclic compression. Consequently, contact-point sliding, which is dissipative, accumulates throughout the cycle. Using numerical simulations whose accuracy our experiment supports, we discover that much of the dissipation occurs in the bulk, where grains rotate more than they translate. Our observations suggest that the analysis of 3D rotations is needed for understanding granular materials’ unique and powerful ability to absorb and dissipate energy.
1 aBenson, Zackery, A.1 aPeshkov, Anton1 aHalpern, Nicole, Yunger1 aRichardson, Derek, C.1 aLosert, Wolfgang uhttps://arxiv.org/abs/2108.1197502469nas a2200241 4500008004100000245007800041210006900119260001500188520171200203653003801915653004301953653002701996653003102023100001302054700001402067700001402081700001802095700002002113700001602133700002502149700001602174856003702190 2022 eng d00aFIPS Compliant Quantum Secure Communication using Quantum Permutation Pad0 aFIPS Compliant Quantum Secure Communication using Quantum Permut c12/30/20223 aQuantum computing has entered fast development track since Shor's algorithm was proposed in 1994. Multi-cloud services of quantum computing farms are currently available. One of which, IBM quantum computing, presented a road map showing their Kookaburra system with over 4158 qubits will be available in 2025. For the standardization of Post-Quantum Cryptography or PQC, the National Institute of Standards and Technology or NIST recently announced the first candidates for standardization with one algorithm for key encapsulation mechanism (KEM), Kyber, and three algorithms for digital signatures. NIST has also issued a new call for quantum-safe digital signature algorithms due June 1, 2023. This timeline shows that FIPS-certified quantum-safe TLS protocol would take a predictably long time. However, "steal now, crack later" tactic requires protecting data against future quantum threat actors today. NIST recommended the use of a hybrid mode of TLS 1.3 with its extensions to support PQC. The hybrid mode works for certain cases but FIPS certification for the hybridized cryptomodule might still be required. This paper proposes to take a nested mode to enable TLS 1.3 protocol with quantum-safe data, which can be made available today and is FIPS compliant. We discussed the performance impacts of the handshaking phase of the nested TLS 1.3 with PQC and the symmetric encryption phase. The major impact on performance using the nested mode is in the data symmetric encryption with AES. To overcome this performance reduction, we suggest using quantum encryption with a quantum permutation pad for the data encryption with a minor performance reduction of less than 10 percent.
10aCryptography and Security (cs.CR)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHe, Alex1 aLou, Dafu1 aShe, Eric1 aGuo, Shangjie1 aWatson, Hareesh1 aWeng, Sibyl1 aPerepechaenko, Maria1 aKuang, Rand uhttps://arxiv.org/abs/2301.0006201557nas a2200169 4500008004100000245004600041210004600087260001500133490000800148520110300156100001301259700001401272700002401286700001701310700002301327856003701350 2022 eng d00aHamiltonian simulation with random inputs0 aHamiltonian simulation with random inputs c12/30/20220 v1293 aThe algorithmic error of digital quantum simulations is usually explored in terms of the spectral norm distance between the actual and ideal evolution operators. In practice, this worst-case error analysis may be unnecessarily pessimistic. To address this, we develop a theory of average-case performance of Hamiltonian simulation with random initial states. We relate the average-case error to the Frobenius norm of the multiplicative error and give upper bounds for the product formula (PF) and truncated Taylor series methods. As applications, we estimate average-case error for digital Hamiltonian simulation of general lattice Hamiltonians and k-local Hamiltonians. In particular, for the nearest-neighbor Heisenberg chain with n spins, the error is quadratically reduced from O(n) in the worst case to O(n−−√) on average for both the PF method and the Taylor series method. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models. We also apply our results to error analysis in the simulation of quantum scrambling.
1 aZhao, Qi1 aZhou, You1 aShaw, Alexander, F.1 aLi, Tongyang1 aChilds, Andrew, M. uhttps://arxiv.org/abs/2111.0477301220nas a2200157 4500008004100000245008300041210006900124260001400193300001100207490000800218520072400226100001800950700002200968700001500990856005701005 2022 eng d00aIsolation and manipulation of a single-donor detector in a silicon quantum dot0 aIsolation and manipulation of a singledonor detector in a silico c9/27/2022 a1254230 v1063 aWe demonstrate the isolation and electrostatic control of a single phosphorus donor in a silicon quantum dot by making use of source-drain bias during cooldown and biases applied to capacitively coupled gates. Characterization of the device at low temperatures and in magnetic fields shows single donors can be electrostatically isolated near one of the quantum dot's tunnel barriers with either single or double occupancy. This model is well supported by capacitance-based simulations. The ability to use the D 0 state of such isolated donors as a charge detector is demonstrated by observing the charge stability diagram of a nearby and capacitively coupled semiconnected double quantum dot.
1 aLasek, A., A.1 aBarnes, C., H. W.1 aFerrus, T. uhttps://link.aps.org/doi/10.1103/PhysRevB.106.12542300508nas a2200169 4500008004100000245006400041210006300105260001400168300001200182490000800194100001600202700001800218700001800236700002200254700002500276856003700301 2022 eng d00aKramers' degeneracy for open systems in thermal equilibrium0 aKramers degeneracy for open systems in thermal equilibrium c3/10/2022 aL1211040 v1051 aLieu, Simon1 aMcGinley, Max1 aShtanko, Oles1 aCooper, Nigel, R.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2105.0288802540nas a2200229 4500008004100000245009600041210006900137260001300206490000700219520184300226100002102069700001802090700001402108700001502122700002802137700002302165700002302188700002402211700001802235700002002253856003702273 2022 eng d00aMany-Body Quantum Teleportation via Operator Spreading in the Traversable Wormhole Protocol0 aManyBody Quantum Teleportation via Operator Spreading in the Tra c8/5/20220 v123 aBy leveraging shared entanglement between a pair of qubits, one can teleport a quantum state from one particle to another. Recent advances have uncovered an intrinsically many-body generalization of quantum teleportation, with an elegant and surprising connection to gravity. In particular, the teleportation of quantum information relies on many-body dynamics, which originate from strongly-interacting systems that are holographically dual to gravity; from the gravitational perspective, such quantum teleportation can be understood as the transmission of information through a traversable wormhole. Here, we propose and analyze a new mechanism for many-body quantum teleportation -- dubbed peaked-size teleportation. Intriguingly, peaked-size teleportation utilizes precisely the same type of quantum circuit as traversable wormhole teleportation, yet has a completely distinct microscopic origin: it relies upon the spreading of local operators under generic thermalizing dynamics and not gravitational physics. We demonstrate the ubiquity of peaked-size teleportation, both analytically and numerically, across a diverse landscape of physical systems, including random unitary circuits, the Sachdev-Ye-Kitaev model (at high temperatures), one-dimensional spin chains and a bulk theory of gravity with stringy corrections. Our results pave the way towards using many-body quantum teleportation as a powerful experimental tool for: (i) characterizing the size distributions of operators in strongly-correlated systems and (ii) distinguishing between generic and intrinsically gravitational scrambling dynamics. To this end, we provide a detailed experimental blueprint for realizing many-body quantum teleportation in both trapped ions and Rydberg atom arrays; effects of decoherence and experimental imperfections are analyzed.
1 aSchuster, Thomas1 aKobrin, Bryce1 aGao, Ping1 aCong, Iris1 aKhabiboulline, Emil, T.1 aLinke, Norbert, M.1 aLukin, Mikhail, D.1 aMonroe, Christopher1 aYoshida, Beni1 aYao, Norman, Y. uhttps://arxiv.org/abs/2102.0001001919nas a2200193 4500008004100000245005700041210005600098260001400154520133700168653002701505653003101532100001601563700002101579700002201600700002701622700001901649700002001668856003701688 2022 eng d00aMulti-Angle QAOA Does Not Always Need All Its Angles0 aMultiAngle QAOA Does Not Always Need All Its Angles c9/23/20223 aIntroducing additional tunable parameters to quantum circuits is a powerful way of improving performance without increasing hardware requirements. A recently introduced multi-angle extension of the quantum approximate optimization algorithm (ma-QAOA) significantly improves the solution from QAOA by allowing the parameters for each term in the Hamiltonian to vary independently. However, prior results suggest that there is considerable redundancy in parameters, the removal of which would reduce the cost of parameter optimization. In this work, we show numerically that problem symmetries can be used to reduce the number of parameters used by ma-QAOA without decreasing the solution quality. We study MaxCut on all 7,565 connected, non-isomorphic 8-node graphs with a non-trivial symmetry group and show numerically that in 67.4\% of these graphs, symmetry can be used to reduce the number of parameters with no decrease in the objective, with the average ratio of parameters reduced by 28.1\%. Moreover, we show that in 35.9\% of the graphs this can be achieved by simply using the largest symmetry. For the graphs where reducing the number of parameters leads to a decrease in the objective, the largest symmetry can be used to reduce the parameter count by 37.1\% at the cost of only a 6.1\% decrease in the objective.
10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aShi, Kaiyan1 aHerrman, Rebekah1 aShaydulin, Ruslan1 aChakrabarti, Shouvanik1 aPistoia, Marco1 aLarson, Jeffrey uhttps://arxiv.org/abs/2209.1183902003nas a2200205 4500008004100000245008600041210006900127260001300196300001100209490000800220520132800228100002501556700002001581700003501601700002101636700002401657700002801681700002801709856006001737 2022 eng d00aNegative Quasiprobabilities Enhance Phase Estimation in Quantum-Optics Experiment0 aNegative Quasiprobabilities Enhance Phase Estimation in QuantumO c6/2/2022 a2205040 v1283 aOperator noncommutation, a hallmark of quantum theory, limits measurement precision, according to uncertainty principles. Wielded correctly, though, noncommutation can boost precision. A recent foundational result relates a metrological advantage with negative quasiprobabilities—quantum extensions of probabilities—engendered by noncommuting operators. We crystallize the relationship in an equation that we prove theoretically and observe experimentally. Our proof-of-principle optical experiment features a filtering technique that we term partially postselected amplification (PPA). Using PPA, we measure a wave plate’s birefringent phase. PPA amplifies, by over two orders of magnitude, the information obtained about the phase per detected photon. In principle, PPA can boost the information obtained from the average filtered photon by an arbitrarily large factor. The filter’s amplification of systematic errors, we find, bounds the theoretically unlimited advantage in practice. PPA can facilitate any phase measurement and mitigates challenges that scale with trial number, such as proportional noise and detector saturation. By quantifying PPA’s metrological advantage with quasiprobabilities, we reveal deep connections between quantum foundations and precision measurement.
1 aLupu-Gladstein, Noah1 aYilmaz, Batuhan1 aArvidsson-Shukur, David, R. M.1 aBrodutch, Aharon1 aPang, Arthur, O. T.1 aSteinberg, Aephraim, M.1 aHalpern, Nicole, Yunger uhttps://link.aps.org/doi/10.1103/PhysRevLett.128.22050401727nas a2200205 4500008004100000245008700041210006900128260001400197490000800211520109000219100001801309700002101327700002301348700002001371700002701391700002701418700002001445700001901465856003701484 2022 eng d00aOperator Scaling Dimensions and Multifractality at Measurement-Induced Transitions0 aOperator Scaling Dimensions and Multifractality at MeasurementIn c2/11/20220 v1283 aRepeated local measurements of quantum many body systems can induce a phase transition in their entanglement structure. These measurement-induced phase transitions (MIPTs) have been studied for various types of dynamics, yet most cases yield quantitatively similar values of the critical exponents, making it unclear if there is only one underlying universality class. Here, we directly probe the properties of the conformal field theories governing these MIPTs using a numerical transfer-matrix method, which allows us to extract the effective central charge, as well as the first few low-lying scaling dimensions of operators at these critical points. Our results provide convincing evidence that the generic and Clifford MIPTs for qubits lie in different universality classes and that both are distinct from the percolation transition for qudits in the limit of large onsite Hilbert space dimension. For the generic case, we find strong evidence of multifractal scaling of correlation functions at the critical point, reflected in a continuous spectrum of scaling dimensions.
1 aZabalo, Aidan1 aGullans, Michael1 aWilson, Justin, H.1 aVasseur, Romain1 aLudwig, Andreas, W. W.1 aGopalakrishnan, Sarang1 aHuse, David, A.1 aPixley, J., H. uhttps://arxiv.org/abs/2107.0339300782nas a2200229 4500008004100000245009900041210006900140260001500209490000700224653004300231653002100274653002700295653002900322653003900351653003100390100002300421700001700444700001800461700001800479700001800497856003700515 2022 eng d00aQuantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants0 aQuantum Algorithms for Sampling LogConcave Distributions and Est c10/12/20220 v3510aFOS: Computer and information sciences10aFOS: Mathematics10aFOS: Physical sciences10aMachine Learning (cs.LG)10aOptimization and Control (math.OC)10aQuantum Physics (quant-ph)1 aChilds, Andrew, M.1 aLi, Tongyang1 aLiu, Jin-Peng1 aWang, Chunhao1 aZhang, Ruizhe uhttps://arxiv.org/abs/2210.0653902013nas a2200277 4500008004100000245008100041210006900122260001300191300001300204490000600217520120300223100002301426700001801449700002001467700002101487700002001508700002001528700001701548700002101565700001401586700001701600700002401617700002001641700001501661856005901676 2022 eng d00aQuantum computational advantage via high-dimensional Gaussian boson sampling0 aQuantum computational advantage via highdimensional Gaussian bos c1/5/2022 aeabi78940 v83 aA programmable quantum computer based on fiber optics outperforms classical computers with a high level of confidence. Photonics is a promising platform for demonstrating a quantum computational advantage (QCA) by outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing proposals and demonstrations face challenges. Experimentally, current implementations of Gaussian boson sampling (GBS) lack programmability or have prohibitive loss rates. Theoretically, there is a comparative lack of rigorous evidence for the classical hardness of GBS. In this work, we make progress in improving both the theoretical evidence and experimental prospects. We provide evidence for the hardness of GBS, comparable to the strongest theoretical proposals for QCA. We also propose a QCA architecture we call high-dimensional GBS, which is programmable and can be implemented with low loss using few optical components. We show that particular algorithms for simulating GBS are outperformed by high-dimensional GBS experiments at modest system sizes. This work thus opens the path to demonstrating QCA with programmable photonic processors.
1 aDeshpande, Abhinav1 aMehta, Arthur1 aVincent, Trevor1 aQuesada, Nicolas1 aHinsche, Marcel1 aIoannou, Marios1 aMadsen, Lars1 aLavoie, Jonathan1 aQi, Haoyu1 aEisert, Jens1 aHangleiter, Dominik1 aFefferman, Bill1 aDhand, Ish uhttps://www.science.org/doi/abs/10.1126/sciadv.abi789401774nas a2200145 4500008004100000245007900041210006900120260001500189300001100204490000600215520133600221100001701557700001701574856003701591 2022 eng d00aQuantum Lego: Building Quantum Error Correction Codes from Tensor Networks0 aQuantum Lego Building Quantum Error Correction Codes from Tensor c05/11/2022 a0203320 v33 aWe introduce a flexible and graphically intuitive framework that constructs complex quantum error correction codes from simple codes or states, generalizing code concatenation. More specifically, we represent the complex code constructions as tensor networks built from the tensors of simple codes or states in a modular fashion. Using a set of local moves known as operator pushing, one can derive properties of the more complex codes, such as transversal non-Clifford gates, by tracing the flow of operators in the network. The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes as well as non-stabilizer codes over qubits and qudits. For a contractible tensor network, the sequence of contractions also constructs a decoding/encoding circuit. To highlight the framework's range of capabilities and to provide a tutorial, we lay out some examples where we glue together simple stabilizer codes to construct non-trivial codes. These examples include the toric code and its variants, a holographic code with transversal non-Clifford operators, a 3d stabilizer code, and other stabilizer codes with interesting properties. Surprisingly, we find that the surface code is equivalent to the 2d Bacon-Shor code after "dualizing" its tensor network encoding map.
1 aCao, ChunJun1 aLackey, Brad uhttps://arxiv.org/abs/2109.0815801622nas a2200193 4500008004100000245008300041210006900124260001400193520097000207653002701177653005201204100002101256700003001277700002001307700002501327700002101352700001801373856003701391 2022 eng d00aQuantum Many-Body Scars from Einstein-Podolsky-Rosen States in Bilayer Systems0 aQuantum ManyBody Scars from EinsteinPodolskyRosen States in Bila c9/12/20223 aQuantum many-body scar states are special eigenstates of nonintegrable models with distinctive entanglement features that give rise to infinitely long-lived coherent dynamics under quantum quenches from certain initial states. We elaborate on a construction of quantum many-body scar states in which they emerge from Einstein-Podolsky-Rosen (EPR) states in systems with two layers, wherein the two layers are maximally entangled. We apply this construction to spin systems as well as systems of itinerant fermions and bosons and demonstrate how symmetries can be harnessed to enhance its versatility. We show that several well-known examples of quantum many-body scars, including the tower of states in the spin-1 XY model and the η-pairing states in the Fermi-Hubbard model, can be understood within this formalism. We also demonstrate how an {\it infinite} tower of many-body scar states can emerge in bilayer Bose-Hubbard models with charge conservation.
10aFOS: Physical sciences10aStrongly Correlated Electrons (cond-mat.str-el)1 aWildeboer, Julia1 aLanglett, Christopher, M.1 aYang, Zhi-Cheng1 aGorshkov, Alexey, V.1 aIadecola, Thomas1 aXu, Shenglong uhttps://arxiv.org/abs/2209.0552701921nas a2200205 4500008004100000245009400041210006900135260001500204520125300219653004301472653002701515653003401542653003101576100001301607700001701620700001201637700001401649700001501663856003701678 2022 eng d00aQuantum Natural Proof: A New Perspective of Hybrid Quantum-Classical Program Verification0 aQuantum Natural Proof A New Perspective of Hybrid QuantumClassic c11/11/20223 aMany quantum programs are assured by formal verification, but such verification is usually laborious and time-consuming. This paper proposes quantum natural proof (QNP), an automated proof system for verifying hybrid quantum-classical algorithms. Natural proofs are a subclass of proofs that are amenable to completely automated reasoning, provide sound but incomplete procedures, and capture common reasoning tactics in program verification. The core of QNP is a type-guided quantum proof system, named Qafny, which views quantum operations as some classical array operations that can be modeled as proof rules in a classical separation logic framework, suitable for automated reasoning. We proved the soundness and completeness of the Qafny proof system as well as the soundness of the proof system compilation from Qafny to Dafny. By using the QNP implementation in Dafny, automated verification can be efficiently perform for many hybrid quantum-classical algorithms, including GHZ, Shor's, Grover's, and quantum walk algorithms, which saves a great amount of human efforts. In addition, quantum programs written in Qafny can be compiled to quantum circuits so that every verified quantum program can be run on a quantum machine.
10aFOS: Computer and information sciences10aFOS: Physical sciences10aProgramming Languages (cs.PL)10aQuantum Physics (quant-ph)1 aLi, Liyi1 aZhu, Mingwei1 aLee, Yi1 aChang, Le1 aWu, Xiaodi uhttps://arxiv.org/abs/2211.0641102845nas a2200541 4500008004100000245004700041210004700088260001300135520125300148653002701401653004401428653004901472653004201521653002901563653003101592100002501623700002001648700002101668700002501689700002001714700002201734700002001756700002001776700001801796700002101814700002101835700001601856700001801872700001501890700001901905700002101924700002401945700002201969700001801991700001902009700002002028700002402048700002402072700002302096700001902119700002002138700002202158700001802180700002102198700002602219700002102245856003702266 2022 eng d00aQuantum Simulation for High Energy Physics0 aQuantum Simulation for High Energy Physics c4/7/20223 aIt 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.
10aFOS: Physical sciences10aHigh Energy Physics - Lattice (hep-lat)10aHigh Energy Physics - Phenomenology (hep-ph)10aHigh Energy Physics - Theory (hep-th)10aNuclear Theory (nucl-th)10aQuantum Physics (quant-ph)1 aBauer, Christian, W.1 aDavoudi, Zohreh1 aBalantekin, Baha1 aBhattacharya, Tanmoy1 aCarena, Marcela1 ade Jong, Wibe, A.1 aDraper, Patrick1 aEl-Khadra, Aida1 aGemelke, Nate1 aHanada, Masanori1 aKharzeev, Dmitri1 aLamm, Henry1 aLi, Ying-Ying1 aLiu, Junyu1 aLukin, Mikhail1 aMeurice, Yannick1 aMonroe, Christopher1 aNachman, Benjamin1 aPagano, Guido1 aPreskill, John1 aRinaldi, Enrico1 aRoggero, Alessandro1 aSantiago, David, I.1 aSavage, Martin, J.1 aSiddiqi, Irfan1 aSiopsis, George1 aVan Zanten, David1 aWiebe, Nathan1 aYamauchi, Yukari1 aYeter-Aydeniz, Kübra1 aZorzetti, Silvia uhttps://arxiv.org/abs/2204.0338102005nas a2200181 4500008004100000245004600041210004500087260001400132300000800146490000600154520152300160100002301683700001601706700001701722700001801739700001801757856004801775 2022 eng d00aQuantum simulation of real-space dynamics0 aQuantum simulation of realspace dynamics c11/8/2022 a8600 v63 aQuantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d-dimensional Schrödinger equation with η particles can be simulated with gate complexity O~(ηdFpoly(log(g′/ϵ))), where ϵ is the discretization error, g′ controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g′ from poly(g′/ϵ) to poly(log(g′/ϵ)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η3(d+η)Tpoly(log(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates, and another using η3(4d)d/2Tpoly(log(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.
1 aChilds, Andrew, M.1 aLeng, Jiaqi1 aLi, Tongyang1 aLiu, Jin-Peng1 aZhang, Chenyi uhttps://doi.org/10.22331%2Fq-2022-11-17-86001906nas a2200205 4500008004100000245008600041210006900127260001400196520121200210653004301422653002701465653003801492653003401530653003101564100001901595700001301614700001701627700001901644856003701663 2022 eng d00aQunity: A Unified Language for Quantum and Classical Computing (Extended Version)0 aQunity A Unified Language for Quantum and Classical Computing Ex c4/26/20223 aWe introduce Qunity, a new quantum programming language designed to treat quantum computing as a natural generalization of classical computing. Qunity presents a unified syntax where familiar programming constructs can have both quantum and classical effects. For example, one can use sum types to implement the direct sum of linear operators, exception-handling syntax to implement projective measurements, and aliasing to induce entanglement. Further, Qunity takes advantage of the overlooked BQP subroutine theorem, allowing one to construct reversible subroutines from irreversible quantum algorithms through the uncomputation of "garbage" outputs. Unlike existing languages that enable quantum aspects with separate add-ons (like a classical language with quantum gates bolted on), Qunity provides a unified syntax and a novel denotational semantics that guarantees that programs are quantum mechanically valid. We present Qunity's syntax, type system, and denotational semantics, showing how it can cleanly express several quantum algorithms. We also detail how Qunity can be compiled into a low-level qubit circuit language like OpenQASM, proving the realizability of our design.
10aFOS: Computer and information sciences10aFOS: Physical sciences10aLogic in Computer Science (cs.LO)10aProgramming Languages (cs.PL)10aQuantum Physics (quant-ph)1 aVoichick, Finn1 aLi, Liyi1 aRand, Robert1 aHicks, Michael uhttps://arxiv.org/abs/2204.1238402029nas a2200325 4500008004100000245006700041210006500108260001400173520109100187653003701278653002701315653003101342100001701373700001201390700002301402700001901425700001901444700001501463700001201478700002001490700001801510700001701528700002001545700001901565700001901584700002201603700001901625700002201644856003701666 2022 eng d00aSelf-Testing of a Single Quantum System: Theory and Experiment0 aSelfTesting of a Single Quantum System Theory and Experiment c3/17/20223 aCertifying individual quantum devices with minimal assumptions is crucial for the development of quantum technologies. Here, we investigate how to leverage single-system contextuality to realize self-testing. We develop a robust self-testing protocol based on the simplest contextuality witness for the simplest contextual quantum system, the Klyachko-Can-Binicioğlu-Shumovsky (KCBS) inequality for the qutrit. We establish a lower bound on the fidelity of the state and the measurements (to an ideal configuration) as a function of the value of the witness under a pragmatic assumption on the measurements we call the KCBS orthogonality condition. We apply the method in an experiment with randomly chosen measurements on a single trapped 40Ca+ and near-perfect detection efficiency. The observed statistics allow us to self-test the system and provide the first experimental demonstration of quantum self-testing of a single system. Further, we quantify and report that deviations from our assumptions are minimal, an aspect previously overlooked by contextuality experiments.
10aAtomic Physics (physics.atom-ph)10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHu, Xiao-Min1 aXie, Yi1 aArora, Atul, Singh1 aAi, Ming-Zhong1 aBharti, Kishor1 aZhang, Jie1 aWu, Wei1 aChen, Ping-Xing1 aCui, Jin-Ming1 aLiu, Bi-Heng1 aHuang, Yun-Feng1 aLi, Chuan-Feng1 aGuo, Guang-Can1 aRoland, Jérémie1 aCabello, Adán1 aKwek, Leong-Chuan uhttps://arxiv.org/abs/2203.0900302149nas a2200457 4500008004100000245005300041210005200094260001400146520077300160653005700933653002700990653004601017653004901063100003401112700002201146700002101168700001901189700001901208700002201227700001901249700002201268700002501290700001901315700001701334700001901351700002101370700002101391700001801412700001401430700002701444700002201471700002201493700001601515700002001531700001701551700002501568700002201593700001401615700002501629856003701654 2022 eng d00aSnowmass 2021 White Paper: The Windchime Project0 aSnowmass 2021 White Paper The Windchime Project c3/14/20223 aThe absence of clear signals from particle dark matter in direct detection experiments motivates new approaches in disparate regions of viable parameter space. In this Snowmass white paper, we outline the Windchime project, a program to build a large array of quantum-enhanced mechanical sensors. The ultimate aim is to build a detector capable of searching for Planck mass-scale dark matter purely through its gravitational coupling to ordinary matter. In the shorter term, we aim to search for a number of other physics targets, especially some ultralight dark matter candidates. Here, we discuss the basic design, open R&D challenges and opportunities, current experimental efforts, and both short- and long-term physics targets of the Windchime project.
10aCosmology and Nongalactic Astrophysics (astro-ph.CO)10aFOS: Physical sciences10aHigh Energy Physics - Experiment (hep-ex)10aHigh Energy Physics - Phenomenology (hep-ph)1 aCollaboration, The, Windchime1 aAttanasio, Alaina1 aBhave, Sunil, A.1 aBlanco, Carlos1 aCarney, Daniel1 aDemarteau, Marcel1 aElshimy, Bahaa1 aFebbraro, Michael1 aFeldman, Matthew, A.1 aGhosh, Sohitri1 aHickin, Abby1 aHong, Seongjin1 aLang, Rafael, F.1 aLawrie, Benjamin1 aLi, Shengchao1 aLiu, Zhen1 aMaldonado, Juan, P. A.1 aMarvinney, Claire1 aOo, Hein, Zay Yar1 aPai, Yun-Yi1 aPooser, Raphael1 aQin, Juehang1 aSparmann, Tobias, J.1 aTaylor, Jacob, M.1 aTian, Hao1 aTunnell, Christopher uhttps://arxiv.org/abs/2203.0724202778nas a2200241 4500008004100000245009900041210006900140260001100209520197600220100001902196700001702215700001802232700001602250700001602266700001702282700002202299700001702321700001802338700001802356700001702374700002102391856012402412 2022 eng d00aStatus Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process0 aStatus Report on the Third Round of the NIST PostQuantum Cryptog c7/20223 aThe National Institute of Standards and Technology is in the process of selecting publickey cryptographic algorithms through a public, competition-like process. The new publickey cryptography standards will specify additional digital signature, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers.
This report describes the evaluation and selection process of the NIST Post-Quantum Cryptography Standardization process third-round candidates based on public feedback and internal review. The report summarizes each of the 15 third-round candidate algorithms and identifies those selected for standardization, as well as those that will continue to be evaluated in a fourth round of analysis. The public-key encryption and key-establishment algorithm that will be standardized is CRYSTALS–KYBER. The digital signatures that will be standardized are CRYSTALS–Dilithium, FALCON, and SPHINCS+. While there are multiple signature algorithms selected, NIST recommends CRYSTALS–Dilithium as the primary algorithm to be implemented. In addition, four of the alternate key-establishment candidate algorithms will advance to a fourth round of evaluation: BIKE, Classic McEliece, HQC, and SIKE. These candidates are still being considered for future standardization. NIST will also issue a new Call for Proposals for public-key digital signature algorithms to augment and diversify its signature portfolio.
1 aAlagic, Gorjan1 aApon, Daniel1 aCooper, David1 aDang, Quynh1 aDang, Thinh1 aKelsey, John1 aLichtinger, Jacob1 aMiller, Carl1 aMoody, Dustin1 aPeralta, Rene1 aPerlner, Ray1 aRobinson, Angela uhttps://www.quics.umd.edu/publications/status-report-third-round-nist-post-quantum-cryptography-standardization-process02559nas a2200193 4500008004100000245008700041210006900128260001400197520194300211653002102154653002702175653003302202653003102235100001302266700001802279700001802297700001302315856003702328 2022 eng d00aA theory of quantum differential equation solvers: limitations and fast-forwarding0 atheory of quantum differential equation solvers limitations and c11/9/20223 aWe study the limitations and fast-forwarding of quantum algorithms for solving linear ordinary differential equation (ODE) systems with particular focus on non-quantum dynamics, where the coefficient matrix in the ODE is not anti-Hermitian or the ODE is inhomogeneous. On the one hand, for generic homogeneous linear ODEs, by proving worst-case lower bounds, we show that quantum algorithms suffer from computational overheads due to two types of ``non-quantumness'': real part gap and non-normality of the coefficient matrix. We then show that ODEs in the absence of both types of ``non-quantumness'' are equivalent to quantum dynamics, and reach the conclusion that quantum algorithms for quantum dynamics work best. We generalize our results to the inhomogeneous case and find that existing generic quantum ODE solvers cannot be substantially improved. To obtain these lower bounds, we propose a general framework for proving lower bounds on quantum algorithms that are amplifiers, meaning that they amplify the difference between a pair of input quantum states. On the other hand, we show how to fast-forward quantum algorithms for solving special classes of ODEs which leads to improved efficiency. More specifically, we obtain quadratic to exponential improvements in terms of the evolution time T and the spectral norm of the coefficient matrix for the following classes of ODEs: inhomogeneous ODEs with a negative definite coefficient matrix, inhomogeneous ODEs with a coefficient matrix having an eigenbasis that can be efficiently prepared on a quantum computer and eigenvalues that can be efficiently computed classically, and the spatially discretized inhomogeneous heat equation and advection-diffusion equation. We give fast-forwarding algorithms that are conceptually different from existing ones in the sense that they neither require time discretization nor solving high-dimensional linear systems.
10aFOS: Mathematics10aFOS: Physical sciences10aNumerical Analysis (math.NA)10aQuantum Physics (quant-ph)1 aAn, Dong1 aLiu, Jin-Peng1 aWang, Daochen1 aZhao, Qi uhttps://arxiv.org/abs/2211.0524601292nas a2200157 4500008004100000245012000041210006900161260000800230300000800238490000600246520080400252100001301056700001301069700001301082856003901095 2022 eng d00aTime-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation0 aTimedependent Hamiltonian Simulation of Highly Oscillatory Dynam capr a6900 v63 aWe propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling. Our method can be used for efficient Hamiltonian simulation in the interaction picture. In particular, we demonstrate that for the simulation of the Schrödinger equation, our method exhibits superconvergence and achieves a surprising second order convergence rate, of which the proof rests on a careful application of pseudo-differential calculus. Numerical results verify the effectiveness and the superconvergence property of our method.
1 aAn, Dong1 aFang, Di1 aLin, Lin uhttps://arxiv.org/abs/2111.03103v201880nas a2200229 4500008004100000245005800041210005800099260001500157490000700172520123000179100002001409700002101429700001701450700002601467700002001493700001701513700001801530700001901548700002201567700002401589856003701613 2022 eng d00aToward Robust Autotuning of Noisy Quantum dot Devices0 aToward Robust Autotuning of Noisy Quantum dot Devices c02/26/20220 v173 aThe 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.
1 aZiegler, Joshua1 aMcJunkin, Thomas1 aJoseph, E.S.1 aKalantre, Sandesh, S.1 aHarpt, Benjamin1 aSavage, D.E.1 aLagally, M.G.1 aEriksson, M.A.1 aTaylor, Jacob, M.1 aZwolak, Justyna, P. uhttps://arxiv.org/abs/2108.0004301963nas a2200205 4500008004100000245006300041210006200104260001400166520131600180653002701496653003901523653003101562100002401593700001901617700001801636700001901654700002501673700002201698856003701720 2022 eng d00aUltrastrong light-matter interaction in a photonic crystal0 aUltrastrong lightmatter interaction in a photonic crystal c9/29/20223 aHarnessing the interaction between light and matter at the quantum level has been a central theme in the fields of atomic physics and quantum optics, with applications from quantum computation to quantum metrology. Combining complex interactions with photonic synthetic materials provides an opportunity to investigate novel quantum phases and phenomena, establishing interesting connections to condensed matter physics. Here we explore many-body phenomena with a single artificial atom coupled to the many discrete modes of a photonic crystal. This experiment reaches the ultrastrong light-matter coupling regime using the circuit QED paradigm, by galvanically coupling a highly nonlinear fluxonium qubit to a tight-binding lattice of microwave resonators. In this regime, the transport of a single photon is strongly modified by the presence of multi-photon bound states, owing to interactions that break particle number conservation. Exploiting the effective photon-photon interactions mediated by the qubit, the driven system can be configured as a continuous reservoir of strongly-correlated photons, a resource of interest for quantum networks. This work opens exciting prospects for exploring nonlinear quantum optics at the single-photon level and stabilizing entangled many-body phases of light.
10aFOS: Physical sciences10aQuantum Gases (cond-mat.quant-gas)10aQuantum Physics (quant-ph)1 aVrajitoarea, Andrei1 aBelyansky, Ron1 aLundgren, Rex1 aWhitsitt, Seth1 aGorshkov, Alexey, V.1 aHouck, Andrew, A. uhttps://arxiv.org/abs/2209.1497202234nas a2200133 4500008004100000245004700041210004600088260001400134490000900148520187200157100001702029700001702046856003702063 2021 eng d00aApproximate Bacon-Shor Code and Holography0 aApproximate BaconShor Code and Holography c5/14/20210 v20213 aWe construct an explicit and solvable toy model for the AdS/CFT correspondence in the form of an approximate quantum error correction code with a non-trivial center in the code subalgebra. Specifically, we use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing), which we call the holographic hybrid code. This code admits a local log-depth encoding/decoding circuit, and can be represented as a holographic tensor network which satisfies an analog of the Ryu-Takayanagi formula and reproduces features of the sub-region duality. We then construct approximate versions of the holographic hybrid codes by "skewing" the code subspace, where the size of skewing is analogous to the size of the gravitational constant in holography. These approximate hybrid codes are not necessarily stabilizer codes, but they can be expressed as the superposition of holographic tensor networks that are stabilizer codes. For such constructions, different logical states, representing different bulk matter content, can "back-react" on the emergent geometry, resembling a key feature of gravity. The locality of the bulk degrees of freedom becomes subspace-dependent and approximate. Such subspace-dependence is manifest in the form of bulk operator reconstruction from the boundary. Exact complementary error correction breaks down for certain bipartition of the boundary degrees of freedom; however, a limited, state-dependent form is preserved for particular subspaces. We also construct an example where the connected two-point correlation functions can have a power-law decay. Coupled with known constraints from holography, a weakly back-reacting bulk also forces these skewed tensor network models to the "large N limit" where they are built by concatenating a large N number of copies.
1 aCao, ChunJun1 aLackey, Brad uhttps://arxiv.org/abs/2010.0596001670nas a2200145 4500008004100000245008900041210006900130260001500199520119300214100002001407700001601427700001901443700002501462856003701487 2021 eng d00aClustering of steady-state correlations in open systems with long-range interactions0 aClustering of steadystate correlations in open systems with long c10/28/20213 aLieb-Robinson bounds are powerful analytical tools for constraining the dynamic and static properties of non-relativistic quantum systems. Recently, a complete picture for closed systems that evolve unitarily in time has been achieved. In experimental systems, however, interactions with the environment cannot generally be ignored, and the extension of Lieb-Robinson bounds to dissipative systems which evolve non-unitarily in time remains an open challenge. In this work, we prove two Lieb-Robinson bounds that constrain the dynamics of open quantum systems with long-range interactions that decay as a power-law in the distance between particles. Using a combination of these Lieb-Robinson bounds and mixing bounds which arise from "reversibility" -- naturally satisfied for thermal environments -- we prove the clustering of correlations in the steady states of open quantum systems with long-range interactions. Our work provides an initial step towards constraining the steady-state entanglement structure for a broad class of experimental platforms, and we highlight several open directions regarding the application of Lieb-Robinson bounds to dissipative systems.
1 aGuo, Andrew, Y.1 aLieu, Simon1 aTran, Minh, C.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2110.1536802086nas a2200133 4500008004100000245006600041210006500107260001400172520167400186100001801860700002101878700001601899856003701915 2021 eng d00aCompressed Sensing Measurement of Long-Range Correlated Noise0 aCompressed Sensing Measurement of LongRange Correlated Noise c5/26/20213 aLong-range correlated errors can severely impact the performance of NISQ (noisy intermediate-scale quantum) devices, and fault-tolerant quantum computation. Characterizing these errors is important for improving the performance of these devices, via calibration and error correction, and to ensure correct interpretation of the results. We propose a compressed sensing method for detecting two-qubit correlated dephasing errors, assuming only that the correlations are sparse (i.e., at most s pairs of qubits have correlated errors, where s << n(n-1)/2, and n is the total number of qubits). In particular, our method can detect long-range correlations between any two qubits in the system (i.e., the correlations are not restricted to be geometrically local).
Our method is highly scalable: it requires as few as m = O(s log n) measurement settings, and efficient classical postprocessing based on convex optimization. In addition, when m = O(s log^4(n)), our method is highly robust to noise, and has sample complexity O(max(n,s)^2 log^4(n)), which can be compared to conventional methods that have sample complexity O(n^3). Thus, our method is advantageous when the correlations are sufficiently sparse, that is, when s < O(n^(3/2) / log^2(n)). Our method also performs well in numerical simulations on small system sizes, and has some resistance to state-preparation-and-measurement (SPAM) errors. The key ingredient in our method is a new type of compressed sensing measurement, which works by preparing entangled Greenberger-Horne-Zeilinger states (GHZ states) on random subsets of qubits, and measuring their decay rates with high precision.
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.
1 aZhu, Daiwei1 aCian, Ze-Pei1 aNoel, Crystal1 aRisinger, Andrew1 aBiswas, Debopriyo1 aEgan, Laird1 aZhu, Yingyue1 aGreen, Alaina, M.1 aAlderete, Cinthia, Huerta1 aNguyen, Nhung, H.1 aWang, Qingfeng1 aMaksymov, Andrii1 aNam, Yunseong1 aCetina, Marko1 aLinke, Norbert, M.1 aHafezi, Mohammad1 aMonroe, Christopher uhttps://arxiv.org/abs/2107.1138701900nas a2200157 4500008004100000245008000041210006900121260001400190520140900204100001601613700001801629700001801647700001901665700002101684856003701705 2021 eng d00aDecoding conformal field theories: from supervised to unsupervised learning0 aDecoding conformal field theories from supervised to unsupervise c7/10/20213 aWe use machine learning to classify rational two-dimensional conformal field theories. We first use the energy spectra of these minimal models to train a supervised learning algorithm. We find that the machine is able to correctly predict the nature and the value of critical points of several strongly correlated spin models using only their energy spectra. This is in contrast to previous works that use machine learning to classify different phases of matter, but do not reveal the nature of the critical point between phases. Given that the ground-state entanglement Hamiltonian of certain topological phases of matter is also described by conformal field theories, we use supervised learning on Réyni entropies and find that the machine is able to identify which conformal field theory describes the entanglement Hamiltonian with only the lowest few Réyni entropies to a high degree of accuracy. Finally, using autoencoders, an unsupervised learning algorithm, we find a hidden variable that has a direct correlation with the central charge and discuss prospects for using machine learning to investigate other conformal field theories, including higher-dimensional ones. Our results highlight that machine learning can be used to find and characterize critical points and also hint at the intriguing possibility to use machine learning to learn about more complex conformal field theories.
1 aKuo, En-Jui1 aSeif, Alireza1 aLundgren, Rex1 aWhitsitt, Seth1 aHafezi, Mohammad uhttps://arxiv.org/abs/2106.1348502034nas a2200181 4500008004100000245008100041210006900122260001300191490000800204520146900212100001801681700002501699700002001724700002301744700002501767700002301792856003701815 2021 eng d00aEfficient quantum algorithm for dissipative nonlinear differential equations0 aEfficient quantum algorithm for dissipative nonlinear differenti c3/1/20210 v1183 aWhile there has been extensive previous work on efficient quantum algorithms for linear differential equations, analogous progress for nonlinear differential equations has been severely limited due to the linearity of quantum mechanics. Despite this obstacle, we develop a quantum algorithm for initial value problems described by dissipative quadratic n-dimensional ordinary differential equations. Assuming R<1, where R is a parameter characterizing the ratio of the nonlinearity to the linear dissipation, this algorithm has complexity T2poly(logT,logn)/ϵ, where T is the evolution time and ϵ is the allowed error in the output quantum state. This is an exponential improvement over the best previous quantum algorithms, whose complexity is exponential in T. We achieve this improvement using the method of Carleman linearization, for which we give an improved convergence theorem. This method maps a system of nonlinear differential equations to an infinite-dimensional system of linear differential equations, which we discretize, truncate, and solve using the forward Euler method and the quantum linear system algorithm. We also provide a lower bound on the worst-case complexity of quantum algorithms for general quadratic differential equations, showing that the problem is intractable for R≥2–√. Finally, we discuss potential applications of this approach to problems arising in biology as well as in fluid and plasma dynamics.
1 aLiu, Jin-Peng1 aKolden, Herman, Øie1 aKrovi, Hari, K.1 aLoureiro, Nuno, F.1 aTrivisa, Konstantina1 aChilds, Andrew, M. uhttps://arxiv.org/abs/2011.0318502180nas a2200181 4500008004100000245003100041210003100072260001200103520171100115100001901826700001301845700001701858700001701875700001701892700001501909700001901924856005501943 2021 eng d00aExpanding the VOQC Toolkit0 aExpanding the VOQC Toolkit c06/20213 avoqc [Hietala et al. 2021b] (pronounced “vox”) is a compiler for quantum circuits, in the style of
tools like Qiskit [Aleksandrowicz et al. 2019], tket [Cambridge Quantum Computing Ltd 2019],
Quilc [Rigetti Computing 2019], and Cirq [Developers 2021]. What makes voqc different from these
tools is that it has been formally verified in the Coq proof assistant [Coq Development Team 2019].
voqc source programs are expressed in sqir, a simple quantum intermediate representation, which
has a precise mathematical semantics. We use Gallina, Coq’s programming language, to implement
voqc transformations over sqir programs, and use Coq to prove the source program’s semantics
are preserved. We then extract these Gallina definitions to OCaml, and compile the OCaml code to
a library that can operate on standard-formatted circuits.
voqc, and sqir, were built to be general-purpose. For example, while we originally designed sqir
for use in verified optimizations, we subsequently found sqir could also be suitable for writing, and
proving correct, source programs [Hietala et al. 2021a]. We have continued to develop the voqc
codebase to expand its reach and utility.
In this abstract, we present new extensions to voqc as an illustration of its flexibility. These
include support for calling voqc transformations from Python, added support for new gate sets
and optimizations, and the extension of our notion of correctness to include mapping-preservation,
which allows us to apply optimizations after mapping, reducing the cost introduced by making a
program conform to hardware constraints.
We study the propagation of photons in a one-dimensional environment consisting of two non-interacting species of photons frustratingly coupled to a single spin-1/2. The ultrastrong frustrated coupling leads to an extreme mixing of the light and matter degrees of freedom, resulting in the disintegration of the spin and a breakdown of the "dressed-spin", or polaron, description. Using a combination of numerical and analytical methods, we show that the elastic response becomes increasingly weak at the effective spin frequency, showing instead an increasingly strong and broadband response at higher energies. We also show that the photons can decay into multiple photons of smaller energies. The total probability of these inelastic processes can be as large as the total elastic scattering rate, or half of the total scattering rate, which is as large as it can be. The frustrated spin induces strong anisotropic photon-photon interactions that are dominated by inter-species interactions. Our results are relevant to state-of-the-art circuit and cavity quantum electrodynamics experiments.
1 aBelyansky, Ron1 aWhitsitt, Seth1 aLundgren, Rex1 aWang, Yidan1 aVrajitoarea, Andrei1 aHouck, Andrew, A.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2007.0369001295nas a2200145 4500008004100000245008500041210006900126260001500195520080400210653002701014653003101041100002301072700001701095856003701112 2021 eng d00aFully device-independent quantum key distribution using synchronous correlations0 aFully deviceindependent quantum key distribution using synchrono c10/27/20213 aWe derive a device-independent quantum key distribution protocol based on synchronous correlations and their Bell inequalities. This protocol offers several advantages over other device-independent schemes including symmetry between the two users and no need for preshared randomness. We close a "synchronicity" loophole by showing that an almost synchronous correlation inherits the self-testing property of the associated synchronous correlation. We also pose a new security assumption that closes the "locality" (or "causality") loophole: an unbounded adversary with even a small uncertainty about the users' choice of measurement bases cannot produce any almost synchronous correlation that approximately maximally violates a synchronous Bell inequality.
10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aRodrigues, Nishant1 aLackey, Brad uhttps://arxiv.org/abs/2110.1453001422nas a2200145 4500008004100000245007300041210006900114260001400183490000600197520097400203100002301177700001801200700002101218856003701239 2021 eng d00aHigh-precision quantum algorithms for partial differential equations0 aHighprecision quantum algorithms for partial differential equati c11/4/20210 v53 aQuantum computers can produce a quantum encoding of the solution of a system of differential equations exponentially faster than a classical algorithm can produce an explicit description. However, while high-precision quantum algorithms for linear ordinary differential equations are well established, the best previous quantum algorithms for linear partial differential equations (PDEs) have complexity poly(1/ε), where ε is the error tolerance. By developing quantum algorithms based on adaptive-order finite difference methods and spectral methods, we improve the complexity of quantum algorithms for linear PDEs to be poly(d,log(1/ε)), where d is the spatial dimension. Our algorithms apply high-precision quantum linear system algorithms to systems whose condition numbers and approximation errors we bound. We develop a finite difference algorithm for the Poisson equation and a spectral algorithm for more general second-order elliptic equations.
1 aChilds, Andrew, M.1 aLiu, Jin-Peng1 aOstrander, Aaron uhttps://arxiv.org/abs/2002.0786801365nas a2200145 4500008004100000245008500041210006900126260001400195520089800209100001801107700001901125700001601144700002201160856003701182 2021 eng d00aOn the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Rounds0 aImpossibility of PostQuantum BlackBox ZeroKnowledge in Constant c3/20/20213 aWe investigate the existence of constant-round post-quantum black-box zero-knowledge protocols for NP. As a main result, we show that there is no constant-round post-quantum black-box zero-knowledge argument for NP unless NP⊆BQP. As constant-round black-box zero-knowledge arguments for NP exist in the classical setting, our main result points out a fundamental difference between post-quantum and classical zero-knowledge protocols. Combining previous results, we conclude that unless NP⊆BQP, constant-round post-quantum zero-knowledge protocols for NP exist if and only if we use non-black-box techniques or relax certain security requirements such as relaxing standard zero-knowledge to ϵ-zero-knowledge. Additionally, we also prove that three-round and public-coin constant-round post-quantum black-box ϵ-zero-knowledge arguments for NP do not exist unless NP⊆BQP.
1 aChia, Nai-Hui1 aChung, Kai-Min1 aLiu, Qipeng1 aYamakawa, Takashi uhttps://arxiv.org/abs/2103.1124402349nas a2200313 4500008004100000245007100041210006900112260001400181520145100195100001601646700003401662700001701696700001801713700001301731700001801744700001901762700002101781700001401802700002201816700001601838700002501854700001801879700001901897700002001916700002001936700001801956700002401974856003701998 2021 eng d00aInteractive Protocols for Classically-Verifiable Quantum Advantage0 aInteractive Protocols for ClassicallyVerifiable Quantum Advantag c12/9/20213 aAchieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output is itself classically intractable. On the other hand, certain quantum algorithms (e.g. prime factorization via Shor's algorithm) are efficiently verifiable, but require more resources than what is available on near-term devices. One way to bridge the gap between verifiability and implementation is to use "interactions" between a prover and a verifier. By leveraging cryptographic functions, such protocols enable the classical verifier to enforce consistency in a quantum prover's responses across multiple rounds of interaction. In this work, we demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer. We execute two complementary protocols -- one based upon the learning with errors problem and another where the cryptographic construction implements a computational Bell test. To perform multiple rounds of interaction, we implement mid-circuit measurements on a subset of trapped ion qubits, with subsequent coherent evolution. For both protocols, the performance exceeds the asymptotic bound for classical behavior; maintaining this fidelity at scale would conclusively demonstrate verifiable quantum advantage.
1 aZhu, Daiwei1 aKahanamoku-Meyer, Gregory, D.1 aLewis, Laura1 aNoel, Crystal1 aKatz, Or1 aHarraz, Bahaa1 aWang, Qingfeng1 aRisinger, Andrew1 aFeng, Lei1 aBiswas, Debopriyo1 aEgan, Laird1 aGheorghiu, Alexandru1 aNam, Yunseong1 aVidick, Thomas1 aVazirani, Umesh1 aYao, Norman, Y.1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2112.0515601198nas a2200169 4500008004100000245006000041210005400101260001400155520069100169100001900860700002000879700002900899700002000928700002500948700001800973856003700991 2021 eng d00aThe Lieb-Robinson light cone for power-law interactions0 aLiebRobinson light cone for powerlaw interactions c3/29/20213 aThe 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.
1 aTran, Minh, C.1 aGuo, Andrew, Y.1 aBaldwin, Christopher, L.1 aEhrenberg, Adam1 aGorshkov, Alexey, V.1 aLucas, Andrew uhttps://arxiv.org/abs/2103.1582802060nas a2200217 4500008004100000245006500041210006400106260001400170520145900184100001501643700001201658700001501670700002001685700001301705700002001718700001501738700001201753700002501765700001501790856003701805 2021 eng d00aObservation of Stark many-body localization without disorder0 aObservation of Stark manybody localization without disorder c2/14/20213 aThermalization is a ubiquitous process of statistical physics, in which details of few-body observables are washed out in favor of a featureless steady state. Even in isolated quantum many-body systems, limited to reversible dynamics, thermalization typically prevails. However, in these systems, there is another possibility: many-body localization (MBL) can result in preservation of a non-thermal state. While disorder has long been considered an essential ingredient for this phenomenon, recent theoretical work has suggested that a quantum many-body system with a uniformly increasing field -- but no disorder -- can also exhibit MBL, resulting in `Stark MBL.' Here we realize Stark MBL in a trapped-ion quantum simulator and demonstrate its key properties: halting of thermalization and slow propagation of correlations. Tailoring the interactions between ionic spins in an effective field gradient, we directly observe their microscopic equilibration for a variety of initial states, and we apply single-site control to measure correlations between separate regions of the spin chain. Further, by engineering a varying gradient, we create a disorder-free system with coexisting long-lived thermalized and nonthermal regions. The results demonstrate the unexpected generality of MBL, with implications about the fundamental requirements for thermalization and with potential uses in engineering long-lived non-equilibrium quantum matter.
1 aMorong, W.1 aLiu, F.1 aBecker, P.1 aCollins, K., S.1 aFeng, L.1 aKyprianidis, A.1 aPagano, G.1 aYou, T.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/2102.0725001481nas a2200193 4500008004100000245004300041210004200084260001400126300001100140490000800151520095100159100001501110700002001125700002301145700001801168700002001186700001701206856006401223 2021 eng d00aPhase-engineered bosonic quantum codes0 aPhaseengineered bosonic quantum codes c6/29/2021 a0624270 v1033 aContinuous-variable systems protected by bosonic quantum codes have emerged as a promising platform for quantum information. To date, the design of code words has centered on optimizing the state occupation in the relevant basis to generate the distance needed for error correction. Here, we show tuning the phase degree of freedom in the design of code words can affect, and potentially enhance, the protection against Markovian errors that involve excitation exchange with the environment. As illustrations, we first consider phase engineering bosonic codes with uniform spacing in the Fock basis that correct excitation loss with a Kerr unitary and show that these modified codes feature destructive interference between error code words and, with an adapted “two-level” recovery, the error protection is significantly enhanced. We then study protection against energy decay with the presence of mode nonlinearities …
1 aLi, Linshu1 aYoung, Dylan, J1 aAlbert, Victor, V.1 aNoh, Kyungjoo1 aZou, Chang-Ling1 aJiang, Liang uhttps://authors.library.caltech.edu/109764/2/1901.05358.pdf01160nas a2200157 4500008004100000245003700041210003700078260001400115520074900129100001900878700001700897700001900914700001300933700001900946856003700965 2021 eng d00aProving Quantum Programs Correct0 aProving Quantum Programs Correct c7/13/20213 aAs quantum computing steadily progresses from theory to practice, programmers are faced with a common problem: How can they be sure that their code does what they intend it to do? This paper presents encouraging results in the application of mechanized proof to the domain of quantum programming in the context of the SQIR development. It verifies the correctness of a range of a quantum algorithms including Simon's algorithm, Grover's algorithm, and quantum phase estimation, a key component of Shor's algorithm. In doing so, it aims to highlight both the successes and challenges of formal verification in the quantum context and motivate the theorem proving community to target quantum computing as an application domain.
1 aHietala, Kesha1 aRand, Robert1 aHung, Shih-Han1 aLi, Liyi1 aHicks, Michael uhttps://arxiv.org/abs/2010.0124001360nas a2200229 4500008004100000020002200041022001400063245003700077210003700114260001200151300001700163490000800180520076100188100001900949700001700968700001900985700001301004700001901017700001701036700002101053856005601074 2021 eng d a978-3-95977-188-7 a1868-896900aProving Quantum Programs Correct0 aProving Quantum Programs Correct c06/2021 a21:1–21:190 v1933 aAs quantum computing progresses steadily from theory into practice, programmers will face
a common problem: How can they be sure that their code does what they intend it to do? This
paper presents encouraging results in the application of mechanized proof to the domain of quantum
programming in the context of the sqir development. It verifies the correctness of a range of a
quantum algorithms including Grover’s algorithm and quantum phase estimation, a key component
of Shor’s algorithm. In doing so, it aims to highlight both the successes and challenges of formal
verification in the quantum context and motivate the theorem proving community to target quantum
computing as an application domain.
We initiate the study of quantum algorithms for escaping from saddle points with provable guarantee. Given a function f:Rn→R, our quantum algorithm outputs an ϵ-approximate second-order stationary point using O~(log2n/ϵ1.75) queries to the quantum evaluation oracle (i.e., the zeroth-order oracle). Compared to the classical state-of-the-art algorithm by Jin et al. with O~(log6n/ϵ1.75) queries to the gradient oracle (i.e., the first-order oracle), our quantum algorithm is polynomially better in terms of n and matches its complexity in terms of 1/ϵ. Our quantum algorithm is built upon two techniques: First, we replace the classical perturbations in gradient descent methods by simulating quantum wave equations, which constitutes the polynomial speedup in n for escaping from saddle points. Second, we show how to use a quantum gradient computation algorithm due to Jordan to replace the classical gradient queries by quantum evaluation queries with the same complexity. Finally, we also perform numerical experiments that support our quantum speedup.
1 aZhang, Chenyi1 aLeng, Jiaqi1 aLi, Tongyang uhttps://arxiv.org/abs/2007.1025301362nas a2200193 4500008004100000022001400041245013800055210006900193260001400262490000800276520071000284100001900994700002101013700002401034700002401058700002301082700002601105856003701131 2021 eng d a2469-993400aQuantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware0 aQuantum circuits for the realization of equivalent forms of oned c12/8/20210 v1043 aQuantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves to the multiqubit states of a quantum processor, we present different configurations of quantum circuits for the implementation of DTQWs in one-dimensional position space. We provide example circuits for a five-qubit processor and address scalability to higher dimensions as well as larger quantum processors.
1 aSingh, Shivani1 aAlderete, Huerta1 aBalu, Radhakrishnan1 aMonroe, Christopher1 aLinke, Norbert, M.1 aChandrashekar, C., M. uhttps://arxiv.org/abs/2001.1119702003nas a2200253 4500008004100000245008100041210006900122260001400191520125700205100002301462700001801485700002001503700002101523700002001544700002001564700001701584700002101601700001401622700001701636700002401653700002001677700001501697856003701712 2021 eng d00aQuantum Computational Supremacy via High-Dimensional Gaussian Boson Sampling0 aQuantum Computational Supremacy via HighDimensional Gaussian Bos c2/24/20213 aPhotonics is a promising platform for demonstrating quantum computational supremacy (QCS) by convincingly outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing photonics proposals and demonstrations face significant hurdles. Experimentally, current implementations of Gaussian boson sampling lack programmability or have prohibitive loss rates. Theoretically, there is a comparative lack of rigorous evidence for the classical hardness of GBS. In this work, we make significant progress in improving both the theoretical evidence and experimental prospects. On the theory side, we provide strong evidence for the hardness of Gaussian boson sampling, placing it on par with the strongest theoretical proposals for QCS. On the experimental side, we propose a new QCS architecture, high-dimensional Gaussian boson sampling, which is programmable and can be implemented with low loss rates using few optical components. We show that particular classical algorithms for simulating GBS are vastly outperformed by high-dimensional Gaussian boson sampling experiments at modest system sizes. This work thus opens the path to demonstrating QCS with programmable photonic processors.
1 aDeshpande, Abhinav1 aMehta, Arthur1 aVincent, Trevor1 aQuesada, Nicolas1 aHinsche, Marcel1 aIoannou, Marios1 aMadsen, Lars1 aLavoie, Jonathan1 aQi, Haoyu1 aEisert, Jens1 aHangleiter, Dominik1 aFefferman, Bill1 aDhand, Ish uhttps://arxiv.org/abs/2102.1247401283nas a2200169 4500008004100000245005900041210005800100260000900158300001600167490000700183520079000190100001800980700001600998700001701014700002301031856005901054 2021 eng d00aQuantum exploration algorithms for multi-armed bandits0 aQuantum exploration algorithms for multiarmed bandits c2021 a10102-101100 v353 aIdentifying the best arm of a multi-armed bandit is a central problem in bandit optimization. We study a quantum computational version of this problem with coherent oracle access to states encoding the reward probabilities of each arm as quantum amplitudes. Specifically, we show that we can find the best arm with fixed confidence using O~(∑ni=2Δ−2i−−−−−−−−√) quantum queries, where Δi represents the difference between the mean reward of the best arm and the ith-best arm. This algorithm, based on variable-time amplitude amplification and estimation, gives a quadratic speedup compared to the best possible classical result. We also prove a matching quantum lower bound (up to poly-logarithmic factors).
1 aWang, Daochen1 aYou, Xuchen1 aLi, Tongyang1 aChilds, Andrew, M. uhttps://ojs.aaai.org/index.php/AAAI/article/view/1721201239nas a2200121 4500008004100000245002800041210002800069260001500097520092800112100002301040700001701063856003701080 2021 eng d00aQuantum Lattice Sieving0 aQuantum Lattice Sieving c10/26/20213 aLattices are very important objects in the effort to construct cryptographic primitives that are secure against quantum attacks. A central problem in the study of lattices is that of finding the shortest non-zero vector in the lattice. Asymptotically, sieving is the best known technique for solving the shortest vector problem, however, sieving requires memory exponential in the dimension of the lattice. As a consequence, enumeration algorithms are often used in place of sieving due to their linear memory complexity, despite their super-exponential runtime. In this work, we present a heuristic quantum sieving algorithm that has memory complexity polynomial in the size of the length of the sampled vectors at the initial step of the sieve. In other words, unlike most sieving algorithms, the memory complexity of our algorithm does not depend on the number of sampled vectors at the initial step of the sieve.
1 aRodrigues, Nishant1 aLackey, Brad uhttps://arxiv.org/abs/2110.1335201245nas a2200157 4500008004100000245005700041210005600098260001400154300001500168490000800183520080000191100002300991700001901014700001701033856003701050 2021 eng d00aQuantum query complexity with matrix-vector products0 aQuantum query complexity with matrixvector products c3/14/2021 a55:1-55:190 v1983 aWe study quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. We show that for various problems, including computing the trace, determinant, or rank of a matrix or solving a linear system that it specifies, quantum computers do not provide an asymptotic speedup over classical computation. On the other hand, we show that for some problems, such as computing the parities of rows or columns or deciding if there are two identical rows or columns, quantum computers provide exponential speedup. We demonstrate this by showing equivalence between models that provide matrix-vector products, vector-matrix products, and vector-matrix-vector products, whereas the power of these models can vary significantly for classical computation.
1 aChilds, Andrew, M.1 aHung, Shih-Han1 aLi, Tongyang uhttps://arxiv.org/abs/2102.1134901323nas a2200145 4500008004100000020002200041245005700063210005600120260008600176520080000262100002301062700001901085700001701104856005601121 2021 eng d a978-3-95977-195-500aQuantum Query Complexity with Matrix-Vector Products0 aQuantum Query Complexity with MatrixVector Products aDagstuhl, GermanybSchloss Dagstuhl – Leibniz-Zentrum für Informatikc2/7/20213 aWe study quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. We show that for various problems, including computing the trace, determinant, or rank of a matrix or solving a linear system that it specifies, quantum computers do not provide an asymptotic speedup over classical computation. On the other hand, we show that for some problems, such as computing the parities of rows or columns or deciding if there are two identical rows or columns, quantum computers provide exponential speedup. We demonstrate this by showing equivalence between models that provide matrix-vector products, vector-matrix products, and vector-matrix-vector products, whereas the power of these models can vary significantly for classical computation.
1 aChilds, Andrew, M.1 aHung, Shih-Han1 aLi, Tongyang uhttps://drops.dagstuhl.de/opus/volltexte/2021/1412401535nas a2200181 4500008004100000022001400041245005100055210005100106260001400157490000800171520104700179100001501226700001701241700001501258700001301273700001401286856005301300 2021 eng d a1079-711400aQuantum Simulation with Hybrid Tensor Networks0 aQuantum Simulation with Hybrid Tensor Networks c8/31/20210 v1273 aTensor network theory and quantum simulation are respectively the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors, inheriting both their distinct features in efficient representation of many-body wave functions. With the example of hybrid tree tensor networks, we demonstrate efficient quantum simulation using a quantum computer whose size is significantly smaller than the one of the target system. We numerically benchmark our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 9×8 qubits with operations only acting on 8+1 and 9+1 qubits,~respectively. Our approach sheds light on simulation of large practical problems with intermediate-scale quantum computers, with potential applications in chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.
1 aYuan, Xiao1 aSun, Jinzhao1 aLiu, Junyu1 aZhao, Qi1 aZhou, You uhttp://dx.doi.org/10.1103/PhysRevLett.127.04050101351nas a2200193 4500008004100000245011700041210006900158260001400227300000800241490000600249520075900255100001301014700001701027700001801044700002201062700002001084700001601104856003701120 2021 eng d00aQuantum-accelerated multilevel Monte Carlo methods for stochastic differential equations in mathematical finance0 aQuantumaccelerated multilevel Monte Carlo methods for stochastic c6/22/2021 a4810 v53 aInspired by recent progress in quantum algorithms for ordinary and partial differential equations, we study quantum algorithms for stochastic differential equations (SDEs). Firstly we provide a quantum algorithm that gives a quadratic speed-up for multilevel Monte Carlo methods in a general setting. As applications, we apply it to compute expection values determined by classical solutions of SDEs, with improved dependence on precision. We demonstrate the use of this algorithm in a variety of applications arising in mathematical finance, such as the Black-Scholes and Local Volatility models, and Greeks. We also provide a quantum algorithm based on sublinear binomial sampling for the binomial option pricing model with the same improvement.
1 aAn, Dong1 aLinden, Noah1 aLiu, Jin-Peng1 aMontanaro, Ashley1 aShao, Changpeng1 aWang, Jiasu uhttps://arxiv.org/abs/2012.0628301565nas a2200169 4500008004100000245004300041210004200084260001400126520108300140100003001223700002001253700002101273700002501294700002101319700001801340856003701358 2021 eng d00aRainbow Scars: From Area to Volume Law0 aRainbow Scars From Area to Volume Law c7/12/20213 aQuantum many-body scars (QMBS) constitute a new quantum dynamical regime in which rare "scarred" eigenstates mediate weak ergodicity breaking. One open question is to understand the most general setting in which these states arise. In this work, we develop a generic construction that embeds a new class of QMBS, rainbow scars, into the spectrum of an arbitrary Hamiltonian. Unlike other examples of QMBS, rainbow scars display extensive bipartite entanglement entropy while retaining a simple entanglement structure. Specifically, the entanglement scaling is volume-law for a random bipartition, while scaling for a fine-tuned bipartition is sub-extensive. When internal symmetries are present, the construction leads to multiple, and even towers of rainbow scars revealed through distinctive non-thermal dynamics. To this end, we provide an experimental road map for realizing rainbow scar states in a Rydberg-atom quantum simulator, leading to coherent oscillations distinct from the strictly sub-volume-law QMBS previously realized in the same system.
1 aLanglett, Christopher, M.1 aYang, Zhi-Cheng1 aWildeboer, Julia1 aGorshkov, Alexey, V.1 aIadecola, Thomas1 aXu, Shenglong uhttps://arxiv.org/abs/2107.0341602193nas a2200157 4500008004100000245010400041210006900145260001400214490000600228520169000234100001901924700001301943700002401956700001801980856003701998 2021 eng d00aResource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry0 aResourceOptimized Fermionic LocalHamiltonian Simulation on Quant c7/21/20210 v53 aThe ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing the power of quantum computers. Here, we address this problem in two aspects. In the fault-tolerant regime, we optimize the $\rzgate$ and $\tgate$ gate counts along with the ancilla qubit counts required, assuming the use of a product-formula algorithm for implementation. We obtain a savings ratio of two in the gate counts and a savings ratio of eleven in the number of ancilla qubits required over the state of the art. In the pre-fault tolerant regime, we optimize the two-qubit gate counts, assuming the use of the variational quantum eigensolver (VQE) approach. Specific to the latter, we present a framework that enables bootstrapping the VQE progression towards the convergence of the ground-state energy of the fermionic system. This framework, based on perturbation theory, is capable of improving the energy estimate at each cycle of the VQE progression, by about a factor of three closer to the known ground-state energy compared to the standard VQE approach in the test-bed, classically-accessible system of the water molecule. The improved energy estimate in turn results in a commensurate level of savings of quantum resources, such as the number of qubits and quantum gates, required to be within a pre-specified tolerance from the known ground-state energy. We also explore a suite of generalized transformations of fermion to qubit operators and show that resource-requirement savings of up to more than 20% is possible.
1 aWang, Qingfeng1 aLi, Ming1 aMonroe, Christopher1 aNam, Yunseong uhttps://arxiv.org/abs/2004.0415101478nas a2200277 4500008004100000245005400041210005300095260001400148300001100162490000800173520078100181100001300962700001300975700001600988700001901004700001401023700001801037700001401055700001601069700001401085700001101099700001701110700001801127700001801145856003701163 2021 eng d00aRobust Self-Testing of Multiparticle Entanglement0 aRobust SelfTesting of Multiparticle Entanglement c12/7/2021 a2305030 v1273 aQuantum self-testing is a device-independent way to certify quantum states and measurements using only the input-output statistics, with minimal assumptions about the quantum devices. Due to the high demand on tolerable noise, however, experimental self-testing was limited to two-photon systems. Here, we demonstrate the first robust self-testing for multi-particle quantum entanglement. We prepare two examples of four-photon graph states, the Greenberger-Horne-Zeilinger (GHZ) states with a fidelity of 0.957(2) and the linear cluster states with a fidelity of 0.945(2). Based on the observed input-output statistics, we certify the genuine four-photon entanglement and further estimate their qualities with respect to realistic noise in a device-independent manner.
1 aWu, Dian1 aZhao, Qi1 aGu, Xue-Mei1 aZhong, Han-Sen1 aZhou, You1 aPeng, Li-Chao1 aQin, Jian1 aLuo, Yi-Han1 aChen, Kai1 aLi, Li1 aLe Liu, Nai-1 aLu, Chao-Yang1 aPan, Jian-Wei uhttps://arxiv.org/abs/2105.1029801423nas a2200145 4500008004100000245005800041210005300099260001400152520098400166100001801150700003701168700001601205700001901221856003701240 2021 eng d00aRPPLNS: Pay-per-last-N-shares with a Randomised Twist0 aRPPLNS PayperlastNshares with a Randomised Twist c2/15/20213 a"Pay-per-last-N-shares" (PPLNS) is one of the most common payout strategies used by mining pools in Proof-of-Work (PoW) cryptocurrencies. As with any payment scheme, it is imperative to study issues of incentive compatibility of miners within the pool. For PPLNS this question has only been partially answered; we know that reasonably-sized miners within a PPLNS pool prefer following the pool protocol over employing specific deviations. In this paper, we present a novel modification to PPLNS where we randomise the protocol in a natural way. We call our protocol "Randomised pay-per-last-N-shares" (RPPLNS), and note that the randomised structure of the protocol greatly simplifies the study of its incentive compatibility. We show that RPPLNS maintains the strengths of PPLNS (i.e., fairness, variance reduction, and resistance to pool hopping), while also being robust against a richer class of strategic mining than what has been shown for PPLNS.
1 aLazos, Philip1 aMarmolejo-Cossío, Francisco, J.1 aZhou, Xinyu1 aKatz, Jonathan uhttps://arxiv.org/abs/2102.0768102435nas a2200193 4500008004100000245011400041210006900155260001400224300001100238490000800249520181700257100002102074700002402095700001902119700002102138700001902159700002602178856003702204 2021 eng d00aTorus Spectroscopy of the Gross-Neveu-Yukawa Quantum Field Theory: Free Dirac versus Chiral Ising Fixed Point0 aTorus Spectroscopy of the GrossNeveuYukawa Quantum Field Theory c3/15/2021 a1251280 v1033 aWe establish the universal torus low-energy spectra at the free Dirac fixed point and at the strongly coupled chiral Ising fixed point and their subtle crossover behaviour in the Gross-Neuveu-Yukawa field theory with nD=4 component Dirac spinors in D=(2+1) dimensions. These fixed points and the field theories are directly relevant for the long-wavelength physics of certain interacting Dirac systems, such as repulsive spinless fermions on the honeycomb lattice or π-flux square lattice. The torus energy spectrum has been shown previously to serve as a characteristic fingerprint of relativistic fixed points and is a powerful tool to discriminate quantum critical behaviour in numerical simulations. Here, we use a combination of exact diagonalization and quantum Monte Carlo simulations of strongly interacting fermionic lattice models, to compute the critical torus energy spectrum on finite-size clusters with periodic boundaries and extrapolate them to the thermodynamic limit. Additionally, we compute the torus energy spectrum analytically using the perturbative expansion in ε=4−D, which is in good agreement with the numerical results, thereby validating the presence of the chiral Ising fixed point in the lattice models at hand. We show that the strong interaction between the spinor field and the scalar order-parameter field strongly influences the critical torus energy spectrum and we observe prominent multiplicity features related to an emergent symmetry predicted from the quantum field theory. Building on these results we are able to address the subtle crossover physics of the low-energy spectrum flowing from the chiral Ising fixed point to the Dirac fixed point, and analyze earlier flawed attempts to extract Fermi velocity renormalizations from the low-energy spectrum.
1 aSchuler, Michael1 aHesselmann, Stephan1 aWhitsitt, Seth1 aLang, Thomas, C.1 aWessel, Stefan1 aLäuchli, Andreas, M. uhttps://arxiv.org/abs/1907.0537301587nas a2200217 4500008004100000245005800041210005700099260001400156520092600170100003001096700002401126700002801150700002101178700002401199700002301223700001901246700002501265700002401290700001801314856003701332 2021 eng d00aTunable three-body loss in a nonlinear Rydberg medium0 aTunable threebody loss in a nonlinear Rydberg medium c9/28/20203 aLong-range Rydberg interactions, in combination with electromagnetically induced transparency (EIT), give rise to strongly interacting photons where the strength, sign, and form of the interactions are widely tunable and controllable. Such control can be applied to both coherent and dissipative interactions, which provides the potential to generate novel few-photon states. Recently it has been shown that Rydberg-EIT is a rare system in which three-body interactions can be as strong or stronger than two-body interactions. In this work, we study a three-body scattering loss for Rydberg-EIT in a wide regime of single and two-photon detunings. Our numerical simulations of the full three-body wavefunction and analytical estimates based on Fermi's Golden Rule strongly suggest that the observed features in the outgoing photonic correlations are caused by the resonant enhancement of the three-body losses.
1 aHuerta, Dalia, P. Ornelas1 aBienias, Przemyslaw1 aCraddock, Alexander, N.1 aGullans, Michael1 aHachtel, Andrew, J.1 aKalinowski, Marcin1 aLyon, Mary, E.1 aGorshkov, Alexey, V.1 aRolston, Steven, L.1 aPorto, J., V. uhttps://arxiv.org/abs/2009.1359901048nas a2200193 4500008004100000022001400041245006900055210006900124260001400193300001100207490000700218520051000225100001900735700001600754700001400770700001900784700001400803856003700817 2021 eng d a1367-263000aUltralight dark matter detection with mechanical quantum sensors0 aUltralight dark matter detection with mechanical quantum sensors c3/10/2021 a0230410 v233 aWe consider the use of quantum-limited mechanical force sensors to detect ultralight (sub-meV) dark matter candidates which are weakly coupled to the standard model. We show that mechanical sensors with masses around or below the milligram scale, operating around the standard quantum limit, would enable novel searches for dark matter with natural frequencies around the kHz scale. This would complement existing strategies based on torsion balances, atom interferometers, and atomic clock systems
1 aCarney, Daniel1 aHook, Anson1 aLiu, Zhen1 aTaylor, J., M.1 aZhao, Yue uhttps://arxiv.org/abs/1908.0479701742nas a2200169 4500008004100000245004400041210004400085260001500129520128400144100001301428700002301441700001901464700001801483700001501501700001901516856003701535 2021 eng d00aVerified Compilation of Quantum Oracles0 aVerified Compilation of Quantum Oracles c12/13/20213 aQuantum algorithms often apply classical operations, such as arithmetic or predicate checks, over a quantum superposition of classical data; these so-called oracles are often the largest components of a quantum algorithm. To ease the construction of efficient, correct oracle functions, this paper presents VQO, a high-assurance framework implemented with the Coq proof assistant. The core of VQO is OQASM, the oracle quantum assembly language. OQASM operations move qubits among three different bases via the Quantum Fourier Transform and Hadamard operations, thus admitting important optimizations, but without inducing entanglement and the exponential blowup that comes with it. OQASM's design enabled us to prove correct VQO's compilers -- from a simple imperative language called OQIMP to OQASM, and from OQASM to SQIR, a general-purpose quantum assembly language -- and allowed us to efficiently test properties of OQASM programs using the QuickChick property-based testing framework. We have used VQO to implement oracles used in Shor's and Grover's algorithms, as well as several common arithmetic operators. VQO's oracles have performance comparable to those produced by Quipper, a state-of-the-art but unverified quantum programming platform.
1 aLi, Liyi1 aVoichick, Finnegan1 aHietala, Kesha1 aPeng, Yuxiang1 aWu, Xiaodi1 aHicks, Michael uhttps://arxiv.org/abs/2112.0670002481nas a2200229 4500008004100000245006800041210006700109260001300176490000700189520180000196100002401996700002102020700002602041700001902067700002302086700001902109700002002128700002402148700002302172700001902195856003702214 2020 eng d00aAuto-tuning of double dot devices in situ with machine learning0 aAutotuning of double dot devices in situ with machine learning c4/1/20200 v133 aThere 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.
1 aZwolak, Justyna, P.1 aMcJunkin, Thomas1 aKalantre, Sandesh, S.1 aDodson, J., P.1 aMacQuarrie, E., R.1 aSavage, D., E.1 aLagally, M., G.1 aCoppersmith, S., N.1 aEriksson, Mark, A.1 aTaylor, J., M. uhttps://arxiv.org/abs/1909.0803001525nas a2200181 4500008004100000245006100041210006100102260001500163300001100178490000600189520101100195100001601206700001801222700001701240700002401257700002501281856003701306 2020 eng d00aCircuit Complexity across a Topological Phase Transition0 aCircuit Complexity across a Topological Phase Transition c03/16/2020 a0133230 v23 aWe use Nielsen's approach to quantify the circuit complexity in the one-dimensional Kitaev model. In equilibrium, we find that the circuit complexity of ground states exhibits a divergent derivative at the critical point, signaling the presence of a topological phase transition. Out of equilibrium, we study the complexity dynamics after a sudden quench, and find that the steady-state complexity exhibits nonanalytical behavior when quenched across critical points. We generalize our results to the long-range interacting case, and demonstrate that the circuit complexity correctly predicts the critical point between regions with different semi-integer topological numbers. Our results establish a connection between circuit complexity and quantum phase transitions both in and out of equilibrium, and can be easily generalized to topological phase transitions in higher dimensions. Our study opens a new avenue to using circuit complexity as a novel quantity to understand many-body systems.
1 aLiu, Fangli1 aLundgren, Rex1 aTitum, Paraj1 aGarrison, James, R.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1902.1072002263nas a2200145 4500008004100000245006800041210006700109260001400176520182500190100001902015700001202034700001902046700001502065856003702080 2020 eng d00aConstant-round Blind Classical Verification of Quantum Sampling0 aConstantround Blind Classical Verification of Quantum Sampling c12/8/20203 aIn a recent breakthrough, Mahadev constructed a classical verification of quantum computation (CVQC) protocol for a classical client to delegate decision problems in BQP to an untrusted quantum prover under computational assumptions. In this work, we explore further the feasibility of CVQC with the more general sampling problems in BQP and with the desirable blindness property. We contribute affirmative solutions to both as follows. (1) Motivated by the sampling nature of many quantum applications (e.g., quantum algorithms for machine learning and quantum supremacy tasks), we initiate the study of CVQC for quantum sampling problems (denoted by SampBQP). More precisely, in a CVQC protocol for a SampBQP problem, the prover and the verifier are given an input x∈{0,1}n and a quantum circuit C, and the goal of the classical client is to learn a sample from the output z←C(x) up to a small error, from its interaction with an untrusted prover. We demonstrate its feasibility by constructing a four-message CVQC protocol for SampBQP based on the quantum Learning With Error assumption. (2) The blindness of CVQC protocols refers to a property of the protocol where the prover learns nothing, and hence is blind, about the client's input. It is a highly desirable property that has been intensively studied for the delegation of quantum computation. We provide a simple yet powerful generic compiler that transforms any CVQC protocol to a blind one while preserving its completeness and soundness errors as well as the number of rounds. Applying our compiler to (a parallel repetition of) Mahadev's CVQC protocol for BQP and our CVQC protocol for SampBQP yields the first constant-round blind CVQC protocol for BQP and SampBQP respectively, with negligible completeness and soundness errors.
1 aChung, Kai-Min1 aLee, Yi1 aLin, Han-Hsuan1 aWu, Xiaodi uhttps://arxiv.org/abs/2012.0484801482nas a2200145 4500008004100000245005500041210005500096260001500151300000900166490000700175520108100182100001901263700001701282856003701299 2020 eng d00aDistributional property testing in a quantum world0 aDistributional property testing in a quantum world c02/02/2019 a1-250 v253 aA fundamental problem in statistics and learning theory is to test properties of distributions. We show that quantum computers can solve such problems with significant speed-ups. In particular, we give fast quantum algorithms for testing closeness between unknown distributions, testing independence between two distributions, and estimating the Shannon / von Neumann entropy of distributions. The distributions can be either classical or quantum, however our quantum algorithms require coherent quantum access to a process preparing the samples. Our results build on the recent technique of quantum singular value transformation, combined with more standard tricks such as divide-and-conquer. The presented approach is a natural fit for distributional property testing both in the classical and the quantum case, demonstrating the first speed-ups for testing properties of density operators that can be accessed coherently rather than only via sampling; for classical distributions our algorithms significantly improve the precision dependence of some earlier results.
1 aGilyen, Andras1 aLi, Tongyang uhttps://arxiv.org/abs/1902.0081402128nas a2200229 4500008004100000245006400041210006200105260001400167520146400181100001601645700002301661700001801684700002101702700001601723700002201739700002001761700001501781700002301796700001801819700002401837856003701861 2020 eng d00aFault-Tolerant Operation of a Quantum Error-Correction Code0 aFaultTolerant Operation of a Quantum ErrorCorrection Code c9/24/20203 aQuantum 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.
1 aEgan, Laird1 aDebroy, Dripto, M.1 aNoel, Crystal1 aRisinger, Andrew1 aZhu, Daiwei1 aBiswas, Debopriyo1 aNewman, Michael1 aLi, Muyuan1 aBrown, Kenneth, R.1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2009.1148202312nas a2200217 4500008004100000245006500041210006400106260001400170490000700184520168700191100001901878700001901897700002001916700002001936700002301956700001601979700001901995700002502014700001802039856003702057 2020 eng d00aHierarchy of linear light cones with long-range interactions0 aHierarchy of linear light cones with longrange interactions c5/29/20200 v103 aIn 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.
1 aTran, Minh, C.1 aChen, Chi-Fang1 aEhrenberg, Adam1 aGuo, Andrew, Y.1 aDeshpande, Abhinav1 aHong, Yifan1 aGong, Zhe-Xuan1 aGorshkov, Alexey, V.1 aLucas, Andrew uhttps://arxiv.org/abs/2001.1150901383nas a2200157 4500008004100000245005600041210005500097260001400152490000800166520093200174100002001106700001601126700002501142700002101167856003701188 2020 eng d00aHilbert-Space Fragmentation from Strict Confinement0 aHilbertSpace Fragmentation from Strict Confinement c5/22/20200 v1243 aWe study one-dimensional spin-1/2 models in which strict confinement of Ising domain walls leads to the fragmentation of Hilbert space into exponentially many disconnected subspaces. Whereas most of the previous works emphasize dipole moment conservation as an essential ingredient for such fragmentation, we instead require two commuting U(1) conserved quantities associated with the total domain-wall number and the total magnetization. The latter arises naturally from the confinement of domain walls. Remarkably, while some connected components of the Hilbert space thermalize, others are integrable by Bethe ansatz. We further demonstrate how this Hilbert-space fragmentation pattern arises perturbatively in the confining limit of Z2 gauge theory coupled to fermionic matter, leading to a hierarchy of time scales for motion of the fermions. This model can be realized experimentally in two complementary settings.
1 aYang, Zhi-Cheng1 aLiu, Fangli1 aGorshkov, Alexey, V.1 aIadecola, Thomas uhttps://arxiv.org/abs/1912.0430001427nas a2200157 4500008004100000245007300041210006900114260001400183520092900197100001601126700002001142700002401162700002101186700002501207856003701232 2020 eng d00aLocalization and criticality in antiblockaded 2D Rydberg atom arrays0 aLocalization and criticality in antiblockaded 2D Rydberg atom ar c12/7/20203 aControllable Rydberg atom arrays have provided new insights into fundamental properties of quantum matter both in and out of equilibrium. In this work, we study the effect of experimentally relevant positional disorder on Rydberg atoms trapped in a 2D square lattice under anti-blockade (facilitation) conditions. We show that the facilitation conditions lead the connectivity graph of a particular subspace of the full Hilbert space to form a 2D Lieb lattice, which features a singular flat band. Remarkably, we find three distinct regimes as the disorder strength is varied: a critical regime, a delocalized but nonergodic regime, and a regime with a disorder-induced flat band. The critical regime's existence depends crucially upon the singular flat band in our model, and is absent in any 1D array or ladder system. We propose to use quench dynamics to probe the three different regimes experimentally.
1 aLiu, Fangli1 aYang, Zhi-Cheng1 aBienias, Przemyslaw1 aIadecola, Thomas1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2012.0394602026nas a2200517 4500008004100000245006100041210006100102260001400163520075200177100001500929700001600944700001800960700001800978700001300996700001401009700001701023700001601040700001401056700001701070700001501087700001401102700002201116700001301138700001701151700001801168700001701186700001101203700001201214700001201226700001501238700001601253700001501269700001801284700001401302700001701316700001401333700001901347700001401366700001401380700001401394700001901408700001201427700001901439700001301458856003701471 2020 eng d00aMechanical Quantum Sensing in the Search for Dark Matter0 aMechanical Quantum Sensing in the Search for Dark Matter c8/13/20203 aNumerous astrophysical and cosmological observations are best explained by the existence of dark matter, a mass density which interacts only very weakly with visible, baryonic matter. Searching for the extremely weak signals produced by this dark matter strongly motivate the development of new, ultra-sensitive detector technologies. Paradigmatic advances in the control and readout of massive mechanical systems, in both the classical and quantum regimes, have enabled unprecedented levels of sensitivity. In this white paper, we outline recent ideas in the potential use of a range of solid-state mechanical sensing technologies to aid in the search for dark matter in a number of energy scales and with a variety of coupling mechanisms.
1 aCarney, D.1 aKrnjaic, G.1 aMoore, D., C.1 aRegal, C., A.1 aAfek, G.1 aBhave, S.1 aBrubaker, B.1 aCorbitt, T.1 aCripe, J.1 aCrisosto, N.1 a.Geraci, A1 aGhosh, S.1 aHarris, J., G. E.1 aHook, A.1 aKolb, E., W.1 aKunjummen, J.1 aLang, R., F.1 aLi, T.1 aLin, T.1 aLiu, Z.1 aLykken, J.1 aMagrini, L.1 aManley, J.1 aMatsumoto, N.1 aMonte, A.1 aMonteiro, F.1 aPurdy, T.1 aRiedel, C., J.1 aSingh, R.1 aSingh, S.1 aSinha, K.1 aTaylor, J., M.1 aQin, J.1 aWilson, D., J.1 aZhao, Y. uhttps://arxiv.org/abs/2008.0607401744nas a2200133 4500008004100000245008400041210006900125260001400194520131100208100001801519700001701537700001901554856003701573 2020 eng d00aNon-equilibrium steady state phases of the interacting Aubry-Andre-Harper model0 aNonequilibrium steady state phases of the interacting AubryAndre c5/21/20203 aHere we study the phase diagram of the Aubry-Andre-Harper model in the presence of strong interactions as the strength of the quasiperiodic potential is varied. Previous work has established the existence of many-body localized phase at large potential strength; here, we find a rich phase diagram in the delocalized regime characterized by spin transport and unusual correlations. We calculate the non-equilibrium steady states of a boundary-driven strongly interacting Aubry-Andre-Harper model by employing the time-evolving block decimation algorithm on matrix product density operators. From these steady states, we extract spin transport as a function of system size and quasiperiodic potential strength. This data shows spin transport going from superdiffusive to subdiffusive well before the localization transition; comparing to previous results, we also find that the transport transition is distinct from a transition observed in the speed of operator growth in the model. We also investigate the correlation structure of the steady state and find an unusual oscillation pattern for intermediate values of the potential strength. The unusual spin transport and quantum correlation structure suggest multiple dynamical phases between the much-studied thermal and many-body-localized phases.
1 aYoo, Yongchan1 aLee, Junhyun1 aSwingle, Brian uhttps://arxiv.org/abs/2005.1083501333nas a2200157 4500008004100000245008800041210006900129260001400198520082100212100001901033700002301052700002001075700001801095700002501113856003701138 2020 eng d00aOptimal state transfer and entanglement generation in power-law interacting systems0 aOptimal state transfer and entanglement generation in powerlaw i c10/6/20203 aWe present an optimal protocol for encoding an unknown qubit state into a multiqubit Greenberger-Horne-Zeilinger-like state and, consequently, transferring quantum information in large systems exhibiting power-law (1/rα) interactions. For all power-law exponents α between d and 2d+1, where d is the dimension of the system, the protocol yields a polynomial speedup for α>2d and a superpolynomial speedup for α≤2d, compared to the state of the art. For all α>d, the protocol saturates the Lieb-Robinson bounds (up to subpolynomial corrections), thereby establishing the optimality of the protocol and the tightness of the bounds in this regime. The protocol has a wide range of applications, including in quantum sensing, quantum computing, and preparation of topologically ordered states.
1 aTran, Minh, C.1 aDeshpande, Abhinav1 aGuo, Andrew, Y.1 aLucas, Andrew1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2010.0293001620nas a2200193 4500008004100000245006300041210006200104260001400166520106800180100001201248700001401260700001901274700002101293700002101314700001801335700001501353700002101368856003701389 2020 eng d00aProbing many-body localization on a noisy quantum computer0 aProbing manybody localization on a noisy quantum computer c6/22/20203 aA disordered system of interacting particles exhibits localized behavior when the disorder is large compared to the interaction strength. Studying this phenomenon on a quantum computer without error correction is challenging because even weak coupling to a thermal environment destroys most signatures of localization. Fortunately, spectral functions of local operators are known to contain features that can survive the presence of noise. In these spectra, discrete peaks and a soft gap at low frequencies compared to the thermal phase indicate localization. Here, we present the computation of spectral functions on a trapped-ion quantum computer for a one-dimensional Heisenberg model with disorder. Further, we design an error-mitigation technique which is effective at removing the noise from the measurement allowing clear signatures of localization to emerge as the disorder increases. Thus, we show that spectral functions can serve as a robust and scalable diagnostic of many-body localization on the current generation of quantum computers.
1 aZhu, D.1 aJohri, S.1 aNguyen, N., H.1 aAlderete, Huerta1 aLandsman, K., A.1 aLinke, N., M.1 aMonroe, C.1 aMatsuura, A., Y. uhttps://arxiv.org/abs/2006.1235502048nas a2200145 4500008004100000245005900041210005900100260001500159520160200174100001801776700002201794700002601816700002301842856003701865 2020 eng d00aProgrammable Quantum Annealers as Noisy Gibbs Samplers0 aProgrammable Quantum Annealers as Noisy Gibbs Samplers c12/16/20203 aDrawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning frameworks such as deep learning. The quest for discovering larger families of distributions for which sampling can be efficiently realized has inspired an exploration beyond established computing methods and turning to novel physical devices that leverage the principles of quantum computation. Quantum annealing embodies a promising computational paradigm that is intimately related to the complexity of energy landscapes in Gibbs distributions, which relate the probabilities of system states to the energies of these states. Here, we study the sampling properties of physical realizations of quantum annealers which are implemented through programmable lattices of superconducting flux qubits. Comprehensive statistical analysis of the data produced by these quantum machines shows that quantum annealers behave as samplers that generate independent configurations from low-temperature noisy Gibbs distributions. We show that the structure of the output distribution probes the intrinsic physical properties of the quantum device such as effective temperature of individual qubits and magnitude of local qubit noise, which result in a non-linear response function and spurious interactions that are absent in the hardware implementation. We anticipate that our methodology will find widespread use in characterization of future generations of quantum annealers and other emerging analog computing devices.
1 aVuffray, Marc1 aCoffrin, Carleton1 aKharkov, Yaroslav, A.1 aLokhov, Andrey, Y. uhttps://arxiv.org/abs/2012.0882701173nas a2200157 4500008004100000245006400041210006400105260001500169490000600184520070600190100002700896700002300923700001700946700001500963856003700978 2020 eng d00aQuantum algorithms and lower bounds for convex optimization0 aQuantum algorithms and lower bounds for convex optimization c12/18/20190 v43 aWhile recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a convex function over an n-dimensional convex body using O~(n) queries to oracles that evaluate the objective function and determine membership in the convex body. This represents a quadratic improvement over the best-known classical algorithm. We also study limitations on the power of quantum computers for general convex optimization, showing that it requires Ω~(n−−√) evaluation queries and Ω(n−−√) membership queries.
1 aChakrabarti, Shouvanik1 aChilds, Andrew, M.1 aLi, Tongyang1 aWu, Xiaodi uhttps://arxiv.org/abs/1809.0173101946nas a2200157 4500008004100000245006600041210006600107260001300173490000600186520147300192100002401665700002101689700002301710700001801733856003701751 2020 eng d00aQuantum Algorithms for Simulating the Lattice Schwinger Model0 aQuantum Algorithms for Simulating the Lattice Schwinger Model c8/5/20200 v43 aThe Schwinger model (quantum electrodynamics in 1+1 dimensions) is a testbed for the study of quantum gauge field theories. We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In particular, we perform a tight analysis of low-order Trotter formula simulations of the Schwinger model, using recently derived commutator bounds, and give upper bounds on the resources needed for simulations in both scenarios. In lattice units, we find a Schwinger model on N/2 physical sites with coupling constant x−1/2 and electric field cutoff x−1/2Λ can be simulated on a quantum computer for time 2xT using a number of T-gates or CNOTs in O˜(N3/2T3/2x−−√Λ) for fixed operator error. This scaling with the truncation Λ is better than that expected from algorithms such as qubitization or QDRIFT. Furthermore, we give scalable measurement schemes and algorithms to estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density. Finally, we bound the root-mean-square error in estimating this observable via simulation as a function of the diamond distance between the ideal and actual CNOT channels. This work provides a rigorous analysis of simulating the Schwinger model, while also providing benchmarks against which subsequent simulation algorithms can be tested.
1 aShaw, Alexander, F.1 aLougovski, Pavel1 aStryker, Jesse, R.1 aWiebe, Nathan uhttps://arxiv.org/abs/2002.1114601928nas a2200121 4500008004100000245006200041210006200103260001500165520155100180100002001731700001801751856003701769 2020 eng d00aQuantum algorithms for the polynomial eigenvalue problems0 aQuantum algorithms for the polynomial eigenvalue problems c10/28/20203 aPolynomial eigenvalue problems (PEPs) arise in a variety of science and engineering applications, and many breakthroughs in the development of classical algorithms to solve PEPs have been made in the past decades. Here we attempt to solve PEPs in a quantum computer. Firstly, for generalized eigenvalue problems (GEPs) $A\x = \lambda B\x$ with A,B symmetric, and B positive definite, we give a quantum algorithm based on block-encoding and quantum phase estimation. In a more general case when B is invertible, B−1A is diagonalizable and all the eigenvalues are real, we propose a quantum algorithm based on the Fourier spectral method to solve ordinary differential equations (ODEs). The inputs of our algorithms can be any desired states, and the outputs are superpositions of the eigenpairs. The complexities are polylog in the matrix size and linear in the precision. The dependence on precision is optimal. Secondly, we show that when B is singular, any quantum algorithm uses at least Ω(n−−√) queries to compute the eigenvalues, where n is the matrix size. Thirdly, based on the linearization method and the connection between PEPs and higher-order ODEs, we provide two quantum algorithms to solve PEPs by extending the quantum algorithm for GEPs. We also give detailed complexity analysis of the algorithm for two special types of quadratic eigenvalue problems that are important in practice. Finally, under an extra assumption, we propose a quantum algorithm to solve PEPs when the eigenvalues are complex.
1 aShao, Changpeng1 aLiu, Jin-Peng uhttps://arxiv.org/abs/2010.1502701566nas a2200157 4500008004100000245005100041210005100092260001300143520114100156100001501297700001701312700001501329700001301344700001401357856003701371 2020 eng d00aQuantum simulation with hybrid tensor networks0 aQuantum simulation with hybrid tensor networks c7/2/20203 aTensor network theory and quantum simulation are respectively the key classical and quantum methods in understanding many-body quantum physics. Here we show hybridization of these two seemingly independent methods, inheriting both their distinct advantageous features of efficient representations of many-body wave functions. We introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors. As an example, we demonstrate efficient quantum simulation with hybrid tree tensor networks that use quantum hardware whose size is significantly smaller than the one of the target system. We numerically test our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 4×3 qubits with operations only acting on 8+1 and 4+1 qubits, respectively. Our approach paves the way to the near-term quantum simulation of large practical problems with intermediate size quantum hardware, with potential applications in quantum chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.
1 aYuan, Xiao1 aSun, Jinzhao1 aLiu, Junyu1 aZhao, Qi1 aZhou, You uhttps://arxiv.org/abs/2007.0095801292nas a2200145 4500008004100000245005600041210005600097260001400153300001400167490000800181520087900189100002301068700001801091856003701109 2020 eng d00aQuantum spectral methods for differential equations0 aQuantum spectral methods for differential equations c2/18/2020 a1427-14570 v3753 aRecently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a d-dimensional system of linear equations or linear differential equations with complexity poly(logd). While several of these algorithms approximate the solution to within ε with complexity poly(log(1/ε)), no such algorithm was previously known for differential equations with time-dependent coefficients. Here we develop a quantum algorithm for linear ordinary differential equations based on so-called spectral methods, an alternative to finite difference methods that approximates the solution globally. Using this approach, we give a quantum algorithm for time-dependent initial and boundary value problems with complexity poly(logd,log(1/ε)).
1 aChilds, Andrew, M.1 aLiu, Jin-Peng uhttps://arxiv.org/abs/1901.0096101551nas a2200193 4500008004100000245009300041210006900134260001300203520092900216100002101145700001901166700002201185700001601207700002401223700002401247700002601271700002301297856003701320 2020 eng d00aQuantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer0 aQuantum walks and Dirac cellular automata on a programmable trap c2/6/20203 aThe quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.
1 aAlderete, Huerta1 aSingh, Shivani1 aNguyen, Nhung, H.1 aZhu, Daiwei1 aBalu, Radhakrishnan1 aMonroe, Christopher1 aChandrashekar, C., M.1 aLinke, Norbert, M. uhttps://arxiv.org/abs/2002.0253701689nas a2200145 4500008004100000245002500041210002500066260001400091520132300105100002101428700001601449700002001465700002101485856003701506 2020 eng d00aRaw Image Deblurring0 aRaw Image Deblurring c12/8/20203 aDeep learning-based blind image deblurring plays an essential role in solving image blur since all existing kernels are limited in modeling the real world blur. Thus far, researchers focus on powerful models to handle the deblurring problem and achieve decent results. For this work, in a new aspect, we discover the great opportunity for image enhancement (e.g., deblurring) directly from RAW images and investigate novel neural network structures benefiting RAW-based learning. However, to the best of our knowledge, there is no available RAW image deblurring dataset. Therefore, we built a new dataset containing both RAW images and processed sRGB images and design a new model to utilize the unique characteristics of RAW images. The proposed deblurring model, trained solely from RAW images, achieves the state-of-art performance and outweighs those trained on processed sRGB images. Furthermore, with fine-tuning, the proposed model, trained on our new dataset, can generalize to other sensors. Additionally, by a series of experiments, we demonstrate that existing deblurring models can also be improved by training on the RAW images in our new dataset. Ultimately, we show a new venue for further opportunities based on the devised novel raw-based deblurring method and the brand-new Deblur-RAW dataset.
1 aLiang, Chih-Hung1 aChen, Yu-An1 aLiu, Yueh-Cheng1 aHsu, Winston, H. uhttps://arxiv.org/abs/2012.0426401634nas a2200157 4500008004100000245007000041210006900111260001400180520114300194100001601337700001901353700002401372700001801396700002501414856003701439 2020 eng d00aRealizing and Probing Baryonic Excitations in Rydberg Atom Arrays0 aRealizing and Probing Baryonic Excitations in Rydberg Atom Array c7/14/20203 aWe propose a realization of mesonic and baryonic quasiparticle excitations in Rydberg atom arrays with programmable interactions. Recent experiments have shown that such systems possess a Z3-ordered crystalline phase whose low-energy quasiparticles are defects in the crystalline order. By engineering a Z3-translational-symmetry breaking field on top of the Rydberg-blockaded Hamiltonian, we show that different types of defects experience confinement, and as a consequence form mesonic or baryonic quasiparticle excitations. We illustrate the formation of these quasiparticles by studying a quantum chiral clock model related to the Rydberg Hamiltonian. We then propose an experimental protocol involving out-of-equilibrium dynamics to directly probe the spectrum of the confined excitations. We show that the confined quasiparticle spectrum can limit quantum information spreading in this system. This proposal is readily applicable to current Rydberg experiments, and the method can be easily generalized to more complex confined excitations (e.g. `tetraquarks', `pentaquarks') in phases with Zq order for q>3.
1 aLiu, Fangli1 aWhitsitt, Seth1 aBienias, Przemyslaw1 aLundgren, Rex1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2007.0725802222nas a2200169 4500008004100000245010800041210006900149260001400218520167700232100001801909700001901927700001701946700001901963700001501982700001801997856003702015 2020 eng d00aSampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning0 aSamplingbased sublinear lowrank matrix arithmetic framework for c6/18/20203 aWe present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang's breakthrough quantum-inspired algorithm for recommendation systems [STOC'19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC'19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all recent results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ2-norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.
1 aChia, Nai-Hui1 aGilyen, Andras1 aLi, Tongyang1 aLin, Han-Hsuan1 aTang, Ewin1 aWang, Chunhao uhttps://arxiv.org/abs/1910.0615102441nas a2200181 4500008004100000245007300041210006900114260001300183520187800196100002702074700002402101700001902125700001902144700002202163700001702185700002002202856003702222 2020 eng d00aSecurity Limitations of Classical-Client Delegated Quantum Computing0 aSecurity Limitations of ClassicalClient Delegated Quantum Comput c7/3/20203 aSecure delegated quantum computing allows a computationally weak client to outsource an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. One of the promising candidates to achieve classical delegation of quantum computation is classical-client remote state preparation (RSPCC), where a client remotely prepares a quantum state using a classical channel. However, the privacy loss incurred by employing RSPCC as a sub-module is unclear.
In this work, we investigate this question using the Constructive Cryptography framework by Maurer and Renner (ICS'11). We first identify the goal of RSPCC as the construction of ideal RSP resources from classical channels and then reveal the security limitations of using RSPCC. First, we uncover a fundamental relationship between constructing ideal RSP resources (from classical channels) and the task of cloning quantum states. Any classically constructed ideal RSP resource must leak to the server the full classical description (possibly in an encoded form) of the generated quantum state, even if we target computational security only. As a consequence, we find that the realization of common RSP resources, without weakening their guarantees drastically, is impossible due to the no-cloning theorem. Second, the above result does not rule out that a specific RSPCC protocol can replace the quantum channel at least in some contexts, such as the Universal Blind Quantum Computing (UBQC) protocol of Broadbent et al. (FOCS '09). However, we show that the resulting UBQC protocol cannot maintain its proven composable security as soon as RSPCC is used as a subroutine. Third, we show that replacing the quantum channel of the above UBQC protocol by the RSPCC protocol QFactory of Cojocaru et al. (Asiacrypt '19), preserves the weaker, game-based, security of UBQC.
The National Institute of Standards and Technology is in the process of selecting one or more public-key cryptographic algorithms through a public, competition-like process. The new public-key cryptography standards will specify one or more additional digital signatures, public-key encryption, and key-establishment algorithms to augment Federal Information Processing Standard (FIPS) 186-4, Digital Signature Standard (DSS), as well as NIST Special Publication (SP) 800-56A Revision 3, Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B Revision 2, Recommendation for Pair-Wise Key Establishment Using Integer Factorization Cryptography. It is intended that these algorithms will be capable of protecting sensitive information well into the foreseeable future, including after the advent of quantum computers.
The NIST Post-Quantum Cryptography Standardization Process began in 2017 with 69 candidate algorithms that met both the minimum acceptance criteria and submission requirements. The first round lasted until January 2019, during which candidate algorithms were evaluated based on their security, performance, and other characteristics. NIST selected 26 algorithms to advance to the second round for more analysis. This report describes the evaluation and selection process, based on public feedback and internal review, of the second-round candidates. The report summarizes the 26 second-round candidate algorithms and identifies those selected to move forward to the third round of the competition. The third-round finalist public-key encryption and key-establishment algorithms are Classic McEliece, CRYSTALS-KYBER, NTRU, and SABER. The third-round finalists for digital signatures are CRYSTALS-DILITHIUM, FALCON, and Rainbow. These finalists will be considered for standardization at the end of the third round. In addition, eight alternate candidate algorithms will also advance to the third round: BIKE, FrodoKEM, HQC, NTRU Prime, SIKE, GeMSS, Picnic, and SPHINCS+. These additional candidates are still being considered for standardization, although this is unlikely to occur at the end of the third round. NIST hopes that the announcement of these finalists and additional candidates will serve to focus the cryptographic community’s attention during the next round.
1 aAlagic, Gorjan1 aAlperin-Sheriff, Jacob1 aApon, Daniel1 aCooper, David1 aDang, Quynh1 aKelsey, John1 aLiu, Yi-Kai1 aMiller, Carl1 aMoody, Dustin1 aPeralta, Rene1 aPerlner, Ray1 aRobinson, Angela1 aSmith-Tone, Daniel uhttps://www.quics.umd.edu/publications/status-report-second-round-nist-post-quantum-cryptography-standardization-process01601nas a2200145 4500008004100000245007200041210006900113260001500182520114400197100001701341700001801358700002701376700001501403856003701418 2020 eng d00aSublinear classical and quantum algorithms for general matrix games0 aSublinear classical and quantum algorithms for general matrix ga c12/11/20203 aWe investigate sublinear classical and quantum algorithms for matrix games, a fundamental problem in optimization and machine learning, with provable guarantees. Given a matrix A∈Rn×d, sublinear algorithms for the matrix game minx∈Xmaxy∈Yy⊤Ax were previously known only for two special cases: (1) Y being the ℓ1-norm unit ball, and (2) X being either the ℓ1- or the ℓ2-norm unit ball. We give a sublinear classical algorithm that can interpolate smoothly between these two cases: for any fixed q∈(1,2], we solve the matrix game where X is a ℓq-norm unit ball within additive error ε in time O~((n+d)/ε2). We also provide a corresponding sublinear quantum algorithm that solves the same task in time O~((n−−√+d−−√)poly(1/ε)) with a quadratic improvement in both n and d. Both our classical and quantum algorithms are optimal in the dimension parameters n and d up to poly-logarithmic factors. Finally, we propose sublinear classical and quantum algorithms for the approximate Carathéodory problem and the ℓq-margin support vector machines as applications.
1 aLi, Tongyang1 aWang, Chunhao1 aChakrabarti, Shouvanik1 aWu, Xiaodi uhttps://arxiv.org/abs/2012.0651901648nas a2200193 4500008004100000245006700041210006700108260001300175300001100188490000800199520108700207100001601294700001901310700002201329700001801351700002301369700002501392856003701417 2020 eng d00aSymmetry breaking and error correction in open quantum systems0 aSymmetry breaking and error correction in open quantum systems c8/6/2020 a2404050 v1253 aSymmetry-breaking transitions are a well-understood phenomenon of closed quantum systems in quantum optics, condensed matter, and high energy physics. However, symmetry breaking in open systems is less thoroughly understood, in part due to the richer steady-state and symmetry structure that such systems possess. For the prototypical open system---a Lindbladian---a unitary symmetry can be imposed in a "weak" or a "strong" way. We characterize the possible Zn symmetry breaking transitions for both cases. In the case of Z2, a weak-symmetry-broken phase guarantees at most a classical bit steady-state structure, while a strong-symmetry-broken phase admits a partially-protected steady-state qubit. Viewing photonic cat qubits through the lens of strong-symmetry breaking, we show how to dynamically recover the logical information after any gap-preserving strong-symmetric error; such recovery becomes perfect exponentially quickly in the number of photons. Our study forges a connection between driven-dissipative phase transitions and error correctio
1 aLieu, Simon1 aBelyansky, Ron1 aYoung, Jeremy, T.1 aLundgren, Rex1 aAlbert, Victor, V.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2008.0281602064nas a2200181 4500008004100000245007100041210006900112260001300181520150800194100001901702700001901721700001801740700001601758700002401774700002201798700002501820856003701845 2020 eng d00aTransport and dynamics in the frustrated two-bath spin-boson model0 aTransport and dynamics in the frustrated twobath spinboson model c7/7/20203 aWe study the strong coupling dynamics as well as transport properties of photons in the two-bath spin-boson model, in which a spin-1/2 particle is frustratingly coupled to two independent Ohmic bosonic baths. Using a combination of numerical and analytical methods, we show that the frustration in this model gives rise to rich physics in a very wide range of energies. This is in contrast to the one-bath spin-boson model, where the non-trivial physics occurs at an energy scale close to the renormalized spin frequency. The renormalized spin frequency in the two-bath spin-boson model is still important, featuring in different observables, including the non-equiblirum dynamics of both the spin and the baths along with the elastic transport properties of a photon. The latter however reveals a much more complex structure. The elastic scattering displays non-monotonic behavior at high frequencies, and is very different in the two channels: intra- and inter-bath scattering. The photon can also be inelastically scattered, a process in which it is split into several photons of smaller energies. We show that such inelastic processes are highly anisotropic, with the outgoing particles being preferentially emitted into only one of the baths. Moreover, the inelastic scattering rate is parameterically larger than in the one-bath case, and can even exceed the total elastic rate. Our results can be verified with state-of-the-art circuit and cavity quantum electrodynamics experiments.
1 aBelyansky, Ron1 aWhitsitt, Seth1 aLundgren, Rex1 aWang, Yidan1 aVrajitoarea, Andrei1 aHouck, Andrew, A.1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2007.0369001306nas a2200169 4500008004100000245011300041210006900154260001400223520072000237100001900957700002600976700002401002700002401026700002301050700002601073856003701099 2020 eng d00aUniversal one-dimensional discrete-time quantum walks and their implementation on near term quantum hardware0 aUniversal onedimensional discretetime quantum walks and their im c1/30/20203 aQuantum walks are a promising framework for developing quantum algorithms and quantum simulations. Quantum walks represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves onto the multi-qubit states in a quantum processor, we present different configurations of quantum circuits for the implementation of discrete-time quantum walks in one-dimensional position space. With example circuits for a five qubit machine we address scalability to higher dimensions and larger quantum processors.
1 aSingh, Shivani1 aAlderete, Cinthia, H.1 aBalu, Radhakrishnan1 aMonroe, Christopher1 aLinke, Norbert, M.1 aChandrashekar, C., M. uhttps://arxiv.org/abs/2001.1119701902nas a2200157 4500008004100000245011500041210006900156260001500225520137700240100001801617700001301635700001701648700001901665700002301684856003701707 2019 eng d00aButterfly effect in interacting Aubry-Andre model: thermalization, slow scrambling, and many-body localization0 aButterfly effect in interacting AubryAndre model thermalization c02/19/20193 aThe many-body localization transition in quasiperiodic systems has been extensively studied in recent ultracold atom experiments. At intermediate quasiperiodic potential strength, a surprising Griffiths-like regime with slow dynamics appears in the absence of random disorder and mobility edges. In this work, we study the interacting Aubry-Andre model, a prototype quasiperiodic system, as a function of incommensurate potential strength using a novel dynamical measure, information scrambling, in a large system of 200 lattice sites. Between the thermal phase and the many-body localized phase, we find an intermediate dynamical phase where the butterfly velocity is zero and information spreads in space as a power-law in time. This is in contrast to the ballistic spreading in the thermal phase and logarithmic spreading in the localized phase. We further investigate the entanglement structure of the many-body eigenstates in the intermediate phase and find strong fluctuations in eigenstate entanglement entropy within a given energy window, which is inconsistent with the eigenstate thermalization hypothesis. Machine-learning on the entanglement spectrum also reaches the same conclusion. Our large-scale simulations suggest that the intermediate phase with vanishing butterfly velocity could be responsible for the slow dynamics seen in recent experiments.
1 aXu, Shenglong1 aLi, Xiao1 aHsu, Yi-Ting1 aSwingle, Brian1 aSarma, Sankar, Das uhttps://arxiv.org/abs/1902.0719901696nas a2200145 4500008004100000245005800041210005700099260001400156520126100170100002501431700001601456700001701472700002401489856003701513 2019 eng d00aClassifying single-qubit noise using machine learning0 aClassifying singlequbit noise using machine learning c8/30/20193 aQuantum characterization, validation, and verification (QCVV) techniques are used to probe, characterize, diagnose, and detect errors in quantum information processors (QIPs). An important component of any QCVV protocol is a mapping from experimental data to an estimate of a property of a QIP. Machine learning (ML) algorithms can help automate the development of QCVV protocols, creating such maps by learning them from training data. We identify the critical components of "machine-learned" QCVV techniques, and present a rubric for developing them. To demonstrate this approach, we focus on the problem of determining whether noise affecting a single qubit is coherent or stochastic (incoherent) using the data sets originally proposed for gate set tomography. We leverage known ML algorithms to train a classifier distinguishing these two kinds of noise. The accuracy of the classifier depends on how well it can approximate the "natural" geometry of the training data. We find GST data sets generated by a noisy qubit can reliably be separated by linear surfaces, although feature engineering can be necessary. We also show the classifier learned by a support vector machine (SVM) is robust under finite-sample noise.
1 aScholten, Travis, L.1 aLiu, Yi-Kai1 aYoung, Kevin1 aBlume-Kohout, Robin uhttps://arxiv.org/abs/1908.1176201746nas a2200193 4500008004100000245006800041210006700109260001500176490000900191520117800200100001601378700001801394700001701412700001801429700001901447700002401466700002501490856003701515 2019 eng d00aConfined Dynamics in Long-Range Interacting Quantum Spin Chains0 aConfined Dynamics in LongRange Interacting Quantum Spin Chains c04/17/20190 v122 3 aWe study the quasiparticle excitation and quench dynamics of the one-dimensional transverse-field Ising model with power-law (1/rα) interactions. We find that long-range interactions give rise to a confining potential, which couples pairs of domain walls (kinks) into bound quasiparticles, analogous to mesonic bound states in high-energy physics. We show that these bound states have dramatic consequences for the non-equilibrium dynamics following a global quantum quench, such as suppressed spreading of quantum information and oscillations of order parameters. The masses of these bound states can be read out from the Fourier spectrum of these oscillating order parameters. We then use a two-kink model to qualitatively explain the phenomenon of long-range-interaction-induced confinement. The masses of the bound states predicted by this model are in good quantitative agreement with exact diagonalization results. Moreover, we illustrate that these bound states lead to weak thermalization of local observables for initial states with energy near the bottom of the many-body energy spectrum. Our work is readily applicable to current trapped-ion experiments.
1 aLiu, Fangli1 aLundgren, Rex1 aTitum, Paraj1 aPagano, Guido1 aZhang, Jiehang1 aMonroe, Christopher1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1810.0236502955nas a2200397 4500008004100000245008600041210006900127260001500196520181200211100002102023700002302044700002002067700001702087700002202104700001702126700002502143700001802168700001902186700001702205700001702222700002702239700001502266700001702281700001802298700001702316700001602333700002002349700001902369700002302388700002502411700002402436700001802460700002002478700002202498856003702520 2019 eng d00aDevelopment of Quantum InterConnects for Next-Generation Information Technologies0 aDevelopment of Quantum InterConnects for NextGeneration Informat c12/13/20193 aJust as classical information technology rests on a foundation built of interconnected information-processing systems, quantum information technology (QIT) must do the same. A critical component of such systems is the interconnect, a device or process that allows transfer of information between disparate physical media, for example, semiconductor electronics, individual atoms, light pulses in optical fiber, or microwave fields. While interconnects have been well engineered for decades in the realm of classical information technology, quantum interconnects (QuICs) present special challenges, as they must allow the transfer of fragile quantum states between different physical parts or degrees of freedom of the system. The diversity of QIT platforms (superconducting, atomic, solid-state color center, optical, etc.) that will form a quantum internet poses additional challenges. As quantum systems scale to larger size, the quantum interconnect bottleneck is imminent, and is emerging as a grand challenge for QIT. For these reasons, it is the position of the community represented by participants of the NSF workshop on Quantum Interconnects that accelerating QuIC research is crucial for sustained development of a national quantum science and technology program. Given the diversity of QIT platforms, materials used, applications, and infrastructure required, a convergent research program including partnership between academia, industry and national laboratories is required. This document is a summary from a U.S. National Science Foundation supported workshop held on 31 October - 1 November 2019 in Alexandria, VA. Attendees were charged to identify the scientific and community needs, opportunities, and significant challenges for quantum interconnects over the next 2-5 years.
1 aAwschalom, David1 aBerggren, Karl, K.1 aBernien, Hannes1 aBhave, Sunil1 aCarr, Lincoln, D.1 aDavids, Paul1 aEconomou, Sophia, E.1 aEnglund, Dirk1 aFaraon, Andrei1 aFejer, Marty1 aGuha, Saikat1 aGustafsson, Martin, V.1 aHu, Evelyn1 aJiang, Liang1 aKim, Jungsang1 aKorzh, Boris1 aKumar, Prem1 aKwiat, Paul, G.1 aLončar, Marko1 aLukin, Mikhail, D.1 aMiller, David, A. B.1 aMonroe, Christopher1 aNam, Sae, Woo1 aNarang, Prineha1 aOrcutt, Jason, S. uhttps://arxiv.org/abs/1912.0664201739nas a2200205 4500008004100000245013400041210006900175260001500244520106400259100001801323700001201341700002201353700001701375700002501392700001301417700001901430700002601449700002101475856003701496 2019 eng d00aFeshbach resonances in p-wave three-body recombination within Fermi-Fermi mixtures of open-shell 6Li and closed-shell 173Yb atoms0 aFeshbach resonances in pwave threebody recombination within Ferm c12/10/20193 aWe report on observations and modeling of interspecies magnetic Feshbach resonances in dilute ultracold mixtures of open-shell alkali-metal 6Li and closed-shell 173Yb atoms with temperatures just above quantum degeneracy for both fermionic species. Resonances are located by detecting magnetic-field-dependent atom loss due to three-body recombination. We resolve closely-located resonances that originate from a weak separation-dependent hyperfine coupling between the electronic spin of 6Li and the nuclear spin of 173Yb, and confirm their magnetic field spacing by ab initio electronic-structure calculations. Through quantitative comparisons of theoretical atom-loss profiles and experimental data at various temperatures between 1 μK and 20 μK, we show that three-body recombination in fermionic mixtures has a p-wave Wigner threshold behavior leading to characteristic asymmetric loss profiles. Such resonances can be applied towards the formation of ultracold doublet ground-state molecules and quantum simulation of superfluid p-wave pairing.
1 aGreen, Alaina1 aLi, Hui1 aToh, Jun, Hui See1 aTang, Xinxin1 aMcCormick, Katherine1 aLi, Ming1 aTiesinga, Eite1 aKotochigova, Svetlana1 aGupta, Subhadeep uhttps://arxiv.org/abs/1912.0487401878nas a2200169 4500008004100000245007200041210006900113260001500182490000800197520135800205100002801563700001801591700001601609700002501625700002201650856003601672 2019 eng d00aInteracting Qubit-Photon Bound States with Superconducting Circuits0 aInteracting QubitPhoton Bound States with Superconducting Circui c2018/01/300 vX 93 aQubits strongly coupled to a photonic crystal give rise to many exotic physical scenarios, beginning with single and multi-excitation qubit-photon dressed bound states comprising induced spatially localized photonic modes, centered around the qubits, and the qubits themselves. The localization of these states changes with qubit detuning from the band-edge, offering an avenue of in situ control of bound state interaction. Here, we present experimental results from a device with two qubits coupled to a superconducting microwave photonic crystal and realize tunable on-site and inter-bound state interactions. We observe a fourth-order two photon virtual process between bound states indicating strong coupling between the photonic crystal and qubits. Due to their localization-dependent interaction, these states offer the ability to create one-dimensional chains of bound states with tunable and potentially long-range interactions that preserve the qubits' spatial organization, a key criterion for realization of certain quantum many-body models. The widely tunable, strong and robust interactions demonstrated with this system are promising benchmarks towards realizing larger, more complex systems of bound states.
1 aSundaresan, Neereja, M.1 aLundgren, Rex1 aZhu, Guanyu1 aGorshkov, Alexey, V.1 aHouck, Andrew, A. uhttp://arxiv.org/abs/1801.1016701470nas a2200145 4500008004100000245009500041210006900136260001400205520099100219100001801210700001601228700002001244700002301264856003701287 2019 eng d00aMomentum-space entanglement after a quench in one-dimensional disordered fermionic systems0 aMomentumspace entanglement after a quench in onedimensional diso c9/11/20193 aWe numerically investigate the momentum-space entanglement entropy and entanglement spectrum of the random-dimer model and its generalizations, which circumvent Anderson localization, after a quench in the Hamiltonian parameters. The type of dynamics that occurs depends on whether or not the Fermi level of the initial state is near the energy of the delocalized states present in these models. If the Fermi level of the initial state is near the energy of the delocalized states, we observe an interesting slow logarithmic-like growth of the momentum-space entanglement entropy followed by an eventual saturation. Otherwise, the momentum-space entanglement entropy is found to rapidly saturate. We also find that the momentum-space entanglement spectrum reveals the presence of delocalized states in these models for long times after the quench and the many-body entanglement gap decays logarithmically in time when the Fermi level is near the energy of the delocalized states.
1 aLundgren, Rex1 aLiu, Fangli1 aLaurell, Pontus1 aFiete, Gregory, A. uhttps://arxiv.org/abs/1909.0514002137nas a2200133 4500008004100000245009800041210006900139260001400208520167400222100001801896700002501914700002701939856003701966 2019 eng d00aOn the nature of the non-equilibrium phase transition in the non-Markovian driven Dicke model0 anature of the nonequilibrium phase transition in the nonMarkovia c2019/10/93 aThe Dicke model famously exhibits a phase transition to a superradiant phase with a macroscopic population of photons and is realized in multiple settings in open quantum systems. In this work, we study a variant of the Dicke model where the cavity mode is lossy due to the coupling to a Markovian environment while the atomic mode is coupled to a colored bath. We analytically investigate this model by inspecting its low-frequency behavior via the Schwinger-Keldysh field theory and carefully examine the nature of the corresponding superradiant phase transition. Integrating out the fast modes, we can identify a simple effective theory allowing us to derive analytical expressions for various critical exponents, including those, such as the dynamical critical exponent, that have not been previously considered. We find excellent agreement with previous numerical results when the non-Markovian bath is at zero temperature; however, contrary to these studies, our low-frequency approach reveals that the same exponents govern the critical behavior when the colored bath is at finite temperature unless the chemical potential is zero. Furthermore, we show that the superradiant phase transition is classical in nature, while it is genuinely non-equilibrium. We derive a fractional Langevin equation and conjecture the associated fractional Fokker-Planck equation that capture the system's long-time memory as well as its non-equilibrium behavior. Finally, we consider finite-size effects at the phase transition and identify the finite-size scaling exponents, unlocking a rich behavior in both statics and dynamics of the photonic and atomic observables.
1 aLundgren, Rex1 aGorshkov, Alexey, V.1 aMaghrebi, Mohammad, F. uhttps://arxiv.org/abs/1910.0431901198nas a2200121 4500008004100000245004200041210004200083260001400125520083200139100001400971700001800985856007301003 2019 eng d00aNew stepsizes for the gradient method0 aNew stepsizes for the gradient method c1/28/20193 aGradient methods are famous for their simplicity and low complexity, which attract more and more attention for large scale optimization problems. A good stepsize plays an important role to construct an efficient gradient method. This paper proposes a new framework to generate stepsizes for gradient methods applied to convex quadratic function minimization problems. By adopting different criterions, we propose four new gradient methods. For 2-dimensional unconstrained problems with convex quadratic objective functions, we prove that the new methods either terminate in finite iterations or converge R-superlinearly; for n-dimensional problems, we prove that all the new methods converge R-linearly. Numerical experiments show that the new methods enjoy lower complexity and outperform the existing gradient methods.
1 aSun, Cong1 aLiu, Jin-Peng uhttps://www.quics.umd.edu/publications/new-stepsizes-gradient-method01912nas a2200265 4500008004100000245007900041210006900120260001500189520117500204100001601379700001501395700001201410700001501422700002001437700001101457700001301468700001901481700002001500700001701520700001501537700001701552700002501569700001501594856003701609 2019 eng d00aObservation of Domain Wall Confinement and Dynamics in a Quantum Simulator0 aObservation of Domain Wall Confinement and Dynamics in a Quantum c12/23/20193 aConfinement is a ubiquitous mechanism in nature, whereby particles feel an attractive force that increases without bound as they separate. A prominent example is color confinement in particle physics, in which baryons and mesons are produced by quark confinement. Analogously, confinement can also occur in low-energy quantum many-body systems when elementary excitations are confined into bound quasiparticles. Here, we report the first observation of magnetic domain wall confinement in interacting spin chains with a trapped-ion quantum simulator. By measuring how correlations spread, we show that confinement can dramatically suppress information propagation and thermalization in such many-body systems. We are able to quantitatively determine the excitation energy of domain wall bound states from non-equilibrium quench dynamics. Furthermore, we study the number of domain wall excitations created for different quench parameters, in a regime that is difficult to model with classical computers. This work demonstrates the capability of quantum simulators for investigating exotic high-energy physics phenomena, such as quark collision and string breaking
1 aTan, W., L.1 aBecker, P.1 aLiu, F.1 aPagano, G.1 aCollins, K., S.1 aDe, A.1 aFeng, L.1 aKaplan, H., B.1 aKyprianidis, A.1 aLundgren, R.1 aMorong, W.1 aWhitsitt, S.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/1912.1111701764nas a2200289 4500008004100000245007400041210006900115260001500184520095900199100001501158700001401173700001501187700002001202700001101222700001701233700001901250700002001269700001601289700002901305700001801334700001801352700001201370700001501382700002501397700001501422856003701437 2019 eng d00aQuantum Approximate Optimization with a Trapped-Ion Quantum Simulator0 aQuantum Approximate Optimization with a TrappedIon Quantum Simul c06/06/20193 aQuantum computers and simulators may offer significant advantages over their classical counterparts, providing insights into quantum many-body systems and possibly solving exponentially hard problems, such as optimization and satisfiability. Here we report the first implementation of a shallow-depth Quantum Approximate Optimization Algorithm (QAOA) using an analog quantum simulator to estimate the ground state energy of the transverse field Ising model with tunable long-range interactions. First, we exhaustively search the variational control parameters to approximate the ground state energy with up to 40 trapped-ion qubits. We then interface the quantum simulator with a classical algorithm to more efficiently find the optimal set of parameters that minimizes the resulting energy of the system. We finally sample from the full probability distribution of the QAOA output with single-shot and efficient measurements of every qubit.
1 aPagano, G.1 aBapat, A.1 aBecker, P.1 aCollins, K., S.1 aDe, A.1 aHess, P., W.1 aKaplan, H., B.1 aKyprianidis, A.1 aTan, W., L.1 aBaldwin, Christopher, L.1 aBrady, L., T.1 aDeshpande, A.1 aLiu, F.1 aJordan, S.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/1906.0270001947nas a2200397 4500008004100000245005400041210005400095260001500149520085000164100001801014700001601032700002301048700002301071700002201094700002401116700001901140700001801159700001801177700002001195700002501215700001801240700001801258700001901276700001901295700001601314700002301330700001901353700001701372700002401389700001901413700002201432700001901454700001901473700002001492856003701512 2019 eng d00aQuantum Computer Systems for Scientific Discovery0 aQuantum Computer Systems for Scientific Discovery c12/16/20193 aThe great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considered together, by co-designing full stack quantum computer systems along with their applications in order to hasten their development and potential for scientific discovery. In this context, we identify scientific and community needs, opportunities, and significant challenges for the development of quantum computers for science over the next 2-10 years. This document is written by a community of university, national laboratory, and industrial researchers in the field of Quantum Information Science and Technology, and is based on a summary from a U.S. National Science Foundation workshop on Quantum Computing held on October 21-22, 2019 in Alexandria, VA.
1 aAlexeev, Yuri1 aBacon, Dave1 aBrown, Kenneth, R.1 aCalderbank, Robert1 aCarr, Lincoln, D.1 aChong, Frederic, T.1 aDeMarco, Brian1 aEnglund, Dirk1 aFarhi, Edward1 aFefferman, Bill1 aGorshkov, Alexey, V.1 aHouck, Andrew1 aKim, Jungsang1 aKimmel, Shelby1 aLange, Michael1 aLloyd, Seth1 aLukin, Mikhail, D.1 aMaslov, Dmitri1 aMaunz, Peter1 aMonroe, Christopher1 aPreskill, John1 aRoetteler, Martin1 aSavage, Martin1 aThompson, Jeff1 aVazirani, Umesh uhttps://arxiv.org/abs/1912.0757702574nas a2200313 4500008004100000245006200041210006200103260001500165520165200180100002401832700002201856700002001878700002201898700002001920700002701940700002201967700002401989700001802013700002102031700002102052700001702073700003102090700001902121700002002140700001902160700002302179700002102202856003702223 2019 eng d00aQuantum Computing at the Frontiers of Biological Sciences0 aQuantum Computing at the Frontiers of Biological Sciences c2019/11/163 aThe 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.
1 aEmani, Prashant, S.1 aWarrell, Jonathan1 aAnticevic, Alan1 aBekiranov, Stefan1 aGandal, Michael1 aMcConnell, Michael, J.1 aSapiro, Guillermo1 aAspuru-Guzik, Alán1 aBaker, Justin1 aBastiani, Matteo1 aMcClure, Patrick1 aMurray, John1 aSotiropoulos, Stamatios, N1 aTaylor, J., M.1 aSenthil, Geetha1 aLehner, Thomas1 aGerstein, Mark, B.1 aHarrow, Aram, W. uhttps://arxiv.org/abs/1911.0712702203nas a2200205 4500008004100000245008000041210006900121260001500190520157300205100002001778700002101798700002401819700001901843700001901862700001801881700002201899700001901921700002001940856003701960 2019 eng d00aQuantum Gravity in the Lab: Teleportation by Size and Traversable Wormholes0 aQuantum Gravity in the Lab Teleportation by Size and Traversable c2019/11/143 aWith the long-term goal of studying quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in recent traversable wormhole constructions: information that is scrambled into one half of an entangled system will, following a weak coupling between the two halves, unscramble into the other half. We introduce the concept of "teleportation by size" to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semi-classical holographic wormhole corresponds to a rather special property of the operator-size distribution we call "size winding". For more general setups (which may not have a clean emergent geometry), we argue that imperfect size winding is a generalization of the traversable wormhole phenomenon. For example, a form of signalling continues to function at high temperature and at large times for generic chaotic systems, even though it does not correspond to a signal going through a geometrical wormhole, but rather to an interference effect involving macroscopically different emergent geometries. Finally, we outline implementations feasible with current technology in two experimental platforms: Rydberg atom arrays and trapped ions.
1 aBrown, Adam, R.1 aGharibyan, Hrant1 aLeichenauer, Stefan1 aLin, Henry, W.1 aNezami, Sepehr1 aSalton, Grant1 aSusskind, Leonard1 aSwingle, Brian1 aWalter, Michael uhttps://arxiv.org/abs/1911.0631402812nas a2200145 4500008004100000245005100041210005100092260001500143300001400158490000700172520241800179100001702597700001502614856003702629 2019 eng d00aQuantum query complexity of entropy estimation0 aQuantum query complexity of entropy estimation c10/16/2017 a2899-29210 v653 aEstimation of Shannon and R´enyi entropies of unknown discrete distributions is a fundamental problem in statistical property testing and an active research topic in both theoretical computer science and information theory. Tight bounds on the number of samples to estimate these entropies have been established in the classical setting, while little is known about their quantum counterparts. In this paper, we give the first quantum algorithms for estimating α- R´enyi entropies (Shannon entropy being 1-Renyi entropy). In particular, we demonstrate a quadratic quantum speedup for Shannon entropy estimation and a generic quantum speedup for α-R´enyi entropy estimation for all α ≥ 0, including a tight bound for the collision-entropy (2-R´enyi entropy). We also provide quantum upper bounds for extreme cases such as the Hartley entropy (i.e., the logarithm of the support size of a distribution, corresponding to α = 0) and the min-entropy case (i.e., α = +∞), as well as the Kullback-Leibler divergence between two distributions. Moreover, we complement our results with quantum lower bounds on α-R´enyi entropy estimation for all α ≥ 0. Our approach is inspired by the pioneering work of Bravyi, Harrow, and Hassidim (BHH) [13] on quantum algorithms for distributional property testing, however, with many new technical ingredients. For Shannon entropy and 0-R´enyi entropy estimation, we improve the performance of the BHH framework, especially its error dependence, using Montanaro’s approach to estimating the expected output value of a quantum subroutine with bounded variance [41] and giving a fine-tuned error analysis. For general α-R´enyi entropy estimation, we further develop a procedure that recursively approximates α-R´enyi entropy for a sequence of αs, which is in spirit similar to a cooling schedule in simulated annealing. For special cases such as integer α ≥ 2 and α = +∞ (i.e., the min-entropy), we reduce the entropy estimation problem to the α-distinctness and the dlog ne-distinctness problems, respectively. We exploit various techniques to obtain our lower bounds for different ranges of α, including reductions to (variants of) existing lower bounds in quantum query complexity as well as the polynomial method inspired by the celebrated quantum lower bound for the collision problem.
1 aLi, Tongyang1 aWu, Xiaodi uhttps://arxiv.org/abs/1710.0602501711nas a2200181 4500008004100000245005600041210005600097260001500153490000700168520117600175100002301351700002701374700002101401700001701422700002401439700002901463856003701492 2019 eng d00aQuantum repeaters based on two species trapped ions0 aQuantum repeaters based on two species trapped ions c05/02/20190 v213 aWe examine the viability of quantum repeaters based on two-species trapped ion modules for long distance quantum key distribution. Repeater nodes comprised of ion-trap modules of co-trapped ions of distinct species are considered. The species used for communication qubits has excellent optical properties while the other longer lived species serves as a memory qubit in the modules. Each module interacts with the network only via single photons emitted by the communication ions. Coherent Coulomb interaction between ions is utilized to transfer quantum information between the communication and memory ions and to achieve entanglement swapping between two memory ions. We describe simple modular quantum repeater architectures realizable with the ion-trap modules and numerically study the dependence of the quantum key distribution rate on various experimental parameters, including coupling efficiency, gate infidelity, operation time and length of the elementary links. Our analysis suggests crucial improvements necessary in a physical implementation for co-trapped two-species ions to be a competitive platform in long-distance quantum communication.
1 aSantra, Siddhartha1 aMuralidharan, Sreraman1 aLichtman, Martin1 aJiang, Liang1 aMonroe, Christopher1 aMalinovsky, Vladimir, S. uhttps://arxiv.org/abs/1811.1072302892nas a2200397 4500008004100000245005600041210005500097260001500152520177700167100001701944700002301961700002101984700002202005700001902027700001602046700001902062700002502081700002302106700002002129700002002149700002602169700002302195700002402218700002202242700002302264700001602287700001302303700002002316700002402336700001702360700001902377700001802396700002302414700002002437856003702457 2019 eng d00aQuantum Simulators: Architectures and Opportunities0 aQuantum Simulators Architectures and Opportunities c12/14/20193 aQuantum simulators are a promising technology on the spectrum of quantum devices from specialized quantum experiments to universal quantum computers. These quantum devices utilize entanglement and many-particle behaviors to explore and solve hard scientific, engineering, and computational problems. Rapid development over the last two decades has produced more than 300 quantum simulators in operation worldwide using a wide variety of experimental platforms. Recent advances in several physical architectures promise a golden age of quantum simulators ranging from highly optimized special purpose simulators to flexible programmable devices. These developments have enabled a convergence of ideas drawn from fundamental physics, computer science, and device engineering. They have strong potential to address problems of societal importance, ranging from understanding vital chemical processes, to enabling the design of new materials with enhanced performance, to solving complex computational problems. It is the position of the community, as represented by participants of the NSF workshop on "Programmable Quantum Simulators," that investment in a national quantum simulator program is a high priority in order to accelerate the progress in this field and to result in the first practical applications of quantum machines. Such a program should address two areas of emphasis: (1) support for creating quantum simulator prototypes usable by the broader scientific community, complementary to the present universal quantum computer effort in industry; and (2) support for fundamental research carried out by a blend of multi-investigator, multi-disciplinary collaborations with resources for quantum simulator software, hardware, and education.
1 aAltman, Ehud1 aBrown, Kenneth, R.1 aCarleo, Giuseppe1 aCarr, Lincoln, D.1 aDemler, Eugene1 aChin, Cheng1 aDeMarco, Brian1 aEconomou, Sophia, E.1 aEriksson, Mark, A.1 aFu, Kai-Mei, C.1 aGreiner, Markus1 aHazzard, Kaden, R. A.1 aHulet, Randall, G.1 aKollár, Alicia, J.1 aLev, Benjamin, L.1 aLukin, Mikhail, D.1 aMa, Ruichao1 aMi, Xiao1 aMisra, Shashank1 aMonroe, Christopher1 aMurch, Kater1 aNazario, Zaira1 aNi, Kang-Kuen1 aPotter, Andrew, C.1 aRoushan, Pedram uhttps://arxiv.org/abs/1912.0693801810nas a2200169 4500008004100000245005600041210005600097260001500153490000700168520133300175100002701508700001801535700001701553700001801570700001501588856003701603 2019 eng d00aQuantum Wasserstein Generative Adversarial Networks0 aQuantum Wasserstein Generative Adversarial Networks c2019/10/310 v323 aThe study of quantum generative models is well-motivated, not only because of its importance in quantum machine learning and quantum chemistry but also because of the perspective of its implementation on near-term quantum machines. Inspired by previous studies on the adversarial training of classical and quantum generative models, we propose the first design of quantum Wasserstein Generative Adversarial Networks (WGANs), which has been shown to improve the robustness and the scalability of the adversarial training of quantum generative models even on noisy quantum hardware. Specifically, we propose a definition of the Wasserstein semimetric between quantum data, which inherits a few key theoretical merits of its classical counterpart. We also demonstrate how to turn the quantum Wasserstein semimetric into a concrete design of quantum WGANs that can be efficiently implemented on quantum machines. Our numerical study, via classical simulation of quantum systems, shows the more robust and scalable numerical performance of our quantum WGANs over other quantum GAN proposals. As a surprising application, our quantum WGAN has been used to generate a 3-qubit quantum circuit of ~50 gates that well approximates a 3-qubit 1-d Hamiltonian simulation circuit that requires over 10k gates using standard techniques.
1 aChakrabarti, Shouvanik1 aHuang, Yiming1 aLi, Tongyang1 aFeizi, Soheil1 aWu, Xiaodi uhttps://arxiv.org/abs/1911.0011102281nas a2200133 4500008004100000245012600041210006900167520180200236100001802038700001702056700001902073700001802092856003702110 2019 eng d00aQuantum-inspired classical sublinear-time algorithm for solving low-rank semidefinite programming via sampling approaches0 aQuantuminspired classical sublineartime algorithm for solving lo3 aSemidefinite programming (SDP) is a central topic in mathematical optimization with extensive studies on its efficient solvers. Recently, quantum algorithms with superpolynomial speedups for solving SDPs have been proposed assuming access to its constraint matrices in quantum superposition. Mutually inspired by both classical and quantum SDP solvers, in this paper we present a sublinear classical algorithm for solving low-rank SDPs which is asymptotically as good as existing quantum algorithms. Specifically, given an SDP with m constraint matrices, each of dimension n and rank poly(logn), our algorithm gives a succinct description and any entry of the solution matrix in time O(m⋅poly(logn,1/ε)) given access to a sample-based low-overhead data structure of the constraint matrices, where ε is the precision of the solution. In addition, we apply our algorithm to a quantum state learning task as an application. Technically, our approach aligns with both the SDP solvers based on the matrix multiplicative weight (MMW) framework and the recent studies of quantum-inspired machine learning algorithms. The cost of solving SDPs by MMW mainly comes from the exponentiation of Hermitian matrices, and we propose two new technical ingredients (compared to previous sample-based algorithms) for this task that may be of independent interest: ∙ Weighted sampling: assuming sampling access to each individual constraint matrix A1,…,Aτ, we propose a procedure that gives a good approximation of A=A1+⋯+Aτ. ∙ Symmetric approximation: we propose a sampling procedure that gives low-rank spectral decomposition of a Hermitian matrix A. This improves upon previous sampling procedures that only give low-rank singular value decompositions, losing the signs of eigenvalues.
1 aChia, Nai-Hui1 aLi, Tongyang1 aLin, Han-Hsuan1 aWang, Chunhao uhttps://arxiv.org/abs/1901.0325401837nas a2200157 4500008004100000245006500041210006400106260001500170520136000185100002001545700001601565700001901581700002501600700001701625856003701642 2019 eng d00aReal-time dynamics of string breaking in quantum spin chains0 aRealtime dynamics of string breaking in quantum spin chains c2019/11/263 aString breaking is a central dynamical process in theories featuring confinement, where a string connecting two charges decays at the expense of the creation of new particle-antiparticle pairs. Here, we show that this process can also be observed in quantum Ising chains where domain walls get confined either by a symmetry-breaking field or by long-range interactions. We find that string breaking occurs, in general, as a two-stage process: First, the initial charges remain essentially static and stable. The connecting string, however, can become a dynamical object. We develop an effective description of this motion, which we find is strongly constrained. In the second stage, which can be severely delayed due to these dynamical constraints, the string finally breaks. We observe that the associated time scale can depend crucially on the initial separation between domain walls and can grow by orders of magnitude by changing the distance by just a few lattice sites. We discuss how our results generalize to one-dimensional confining gauge theories and how they can be made accessible in quantum simulator experiments such as Rydberg atoms or trapped ions.
1 aVerdel, Roberto1 aLiu, Fangli1 aWhitsitt, Seth1 aGorshkov, Alexey, V.1 aHeyl, Markus uhttps://arxiv.org/abs/1911.1138201259nas a2200145 4500008004100000245005700041210005600098490000800154520083800162100001701000700002101017700001701038700002101055856003701076 2019 eng d00aReQWIRE: Reasoning about Reversible Quantum Circuits0 aReQWIRE Reasoning about Reversible Quantum Circuits0 v2873 aCommon quantum algorithms make heavy use of ancillae: scratch qubits that are initialized at some state and later returned to that state and discarded. Existing quantum circuit languages let programmers assert that a qubit has been returned to the |0> state before it is discarded, allowing for a range of optimizations. However, existing languages do not provide the tools to verify these assertions, introducing a potential source of errors. In this paper we present methods for verifying that ancillae are discarded in the desired state, and use these methods to implement a verified compiler from classical functions to quantum oracles.
1 aRand, Robert1 aPaykin, Jennifer1 aLee, Dong-Ho1 aZdancewic, Steve uhttps://arxiv.org/abs/1901.1011802754nas a2200229 4500008004100000245009900041210006900140520205300209100001902262700002402281700001302305700001502318700001302333700001702346700001402363700001602377700001602393700001702409700001902426700001602445856006302461 2019 eng d00aStatus Report on the First Round of the NIST Post-Quantum Cryptography Standardization Process0 aStatus Report on the First Round of the NIST PostQuantum Cryptog3 aThe National Institute of Standards and Technology is in the process of selecting one or more
public-key cryptographic algorithms through a public competition-like process. The new publickey cryptography standards will specify one or more additional digital signature, public-key
encryption, and key-establishment algorithms to augment FIPS 186-4, Digital Signature Standard
(DSS), as well as special publications SP 800-56A Revision 2, Recommendation for Pair-Wise
Key Establishment Schemes Using Discrete Logarithm Cryptography, and SP 800-56B,
Recommendation for Pair-Wise Key-Establishment Schemes Using Integer Factorization. It is
intended that these algorithms will be capable of protecting sensitive information well into the
foreseeable future, including after the advent of quantum computers.
In November 2017, 82 candidate algorithms were submitted to NIST for consideration. Among
these, 69 met both the minimum acceptance criteria and our submission requirements, and were
accepted as First-Round Candidates on Dec. 20, 2017, marking the beginning of the First Round
of the NIST Post-Quantum Cryptography Standardization Process. This report describes the
evaluation criteria and selection process, based on public feedback and internal review of the
first-round candidates, and summarizes the 26 candidate algorithms announced on January 30,
2019 for moving forward to the second round of the competition. The 17 Second-Round
Candidate public-key encryption and key-establishment algorithms are BIKE, Classic McEliece,
CRYSTALS-KYBER, FrodoKEM, HQC, LAC, LEDAcrypt (merger of LEDAkem/LEDApkc),
NewHope, NTRU (merger of NTRUEncrypt/NTRU-HRSS-KEM), NTRU Prime, NTS-KEM,
ROLLO (merger of LAKE/LOCKER/Ouroboros-R), Round5 (merger of Hila5/Round2), RQC,
SABER, SIKE, and Three Bears. The 9 Second-Round Candidates for digital signatures are
CRYSTALS-DILITHIUM, FALCON, GeMSS, LUOV, MQDSS, Picnic, qTESLA, Rainbow,
and SPHINCS+.
We investigate quantum algorithms for classification, a fundamental problem in machine learning, with provable guarantees. Given n d-dimensional data points, the state-of-the-art (and optimal) classical algorithm for training classifiers with constant margin runs in O~(n+d) time. We design sublinear quantum algorithms for the same task running in O~(n−−√+d−−√) time, a quadratic improvement in both n and d. Moreover, our algorithms use the standard quantization of the classical input and generate the same classical output, suggesting minimal overheads when used as subroutines for end-to-end applications. We also demonstrate a tight lower bound (up to poly-log factors) and discuss the possibility of implementation on near-term quantum machines. As a side result, we also give sublinear quantum algorithms for approximating the equilibria of n-dimensional matrix zero-sum games with optimal complexity Θ~(n−−√).
1 aLi, Tongyang1 aChakrabarti, Shouvanik1 aWu, Xiaodi uhttps://arxiv.org/abs/1904.0227601624nas a2200193 4500008004100000245009000041210006900131260001500200520100400215100001701219700002401236700001801260700001601278700002301294700002401317700002401341700002801365856003701393 2019 eng d00aToward convergence of effective field theory simulations on digital quantum computers0 aToward convergence of effective field theory simulations on digi c04/18/20193 aWe report results for simulating an effective field theory to compute the binding energy of the deuteron nucleus using a hybrid algorithm on a trapped-ion quantum computer. Two increasingly complex unitary coupled-cluster ansaetze have been used to compute the binding energy to within a few percent for successively more complex Hamiltonians. By increasing the complexity of the Hamiltonian, allowing more terms in the effective field theory expansion and calculating their expectation values, we present a benchmark for quantum computers based on their ability to scalably calculate the effective field theory with increasing accuracy. Our result of E4=−2.220±0.179MeV may be compared with the exact Deuteron ground-state energy −2.224MeV. We also demonstrate an error mitigation technique using Richardson extrapolation on ion traps for the first time. The error mitigation circuit represents a record for deepest quantum circuit on a trapped-ion quantum computer.
1 aShehab, Omar1 aLandsman, Kevin, A.1 aNam, Yunseong1 aZhu, Daiwei1 aLinke, Norbert, M.1 aKeesan, Matthew, J.1 aPooser, Raphael, C.1 aMonroe, Christopher, R. uhttps://arxiv.org/abs/1904.0433801499nas a2200193 4500008004100000245007800041210006900119260001500188520089900203100002401102700001401126700002101140700001601161700002301177700002301200700001701223700002801240856003701268 2019 eng d00aTwo-qubit entangling gates within arbitrarily long chains of trapped ions0 aTwoqubit entangling gates within arbitrarily long chains of trap c05/28/20193 aIon trap systems are a leading platform for large scale quantum computers. Trapped ion qubit crystals are fully-connected and reconfigurable, owing to their long range Coulomb interaction that can be modulated with external optical forces. However, the spectral crowding of collective motional modes could pose a challenge to the control of such interactions for large numbers of qubits. Here, we show that high-fidelity quantum gate operations are still possible with very large trapped ion crystals, simplifying the scaling of ion trap quantum computers. To this end, we present analytical work that determines how parallel entangling gates produce a crosstalk error that falls off as the inverse cube of the distance between the pairs. We also show experimental work demonstrating entangling gates on a fully-connected chain of seventeen 171Yb+ ions with fidelities as high as 97(1)%.
1 aLandsman, Kevin, A.1 aWu, Yukai1 aLeung, Pak, Hong1 aZhu, Daiwei1 aLinke, Norbert, M.1 aBrown, Kenneth, R.1 aDuan, Luming1 aMonroe, Christopher, R. uhttps://arxiv.org/abs/1905.1042101449nas a2200169 4500008004100000245008800041210006900129260001500198490000800213520091700221100001601138700002401154700002001178700001901198700002501217856003701242 2018 eng d00aAsymmetric Particle Transport and Light-Cone Dynamics Induced by Anyonic Statistics0 aAsymmetric Particle Transport and LightCone Dynamics Induced by c2018/12/200 v1213 aWe study the non-equilibrium dynamics of Abelian anyons in a one-dimensional system. We find that the interplay of anyonic statistics and interactions gives rise to spatially asymmetric particle transport together with a novel dynamical symmetry that depends on the anyonic statistical angle and the sign of interactions. Moreover, we show that anyonic statistics induces asymmetric spreading of quantum information, characterized by asymmetric light cones of out-of-time-ordered correlators. Such asymmetric dynamics is in sharp contrast with the dynamics of conventional fermions or bosons, where both the transport and information dynamics are spatially symmetric. We further discuss experiments with cold atoms where the predicted phenomena can be observed using state-of-the-art technologies. Our results pave the way toward experimentally probing anyonic statistics through non-equilibrium dynamics.
1 aLiu, Fangli1 aGarrison, James, R.1 aDeng, Dong-Ling1 aGong, Zhe-Xuan1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1809.0261401065nas a2200097 4500008004100000245006500041210006300106520074400169100001700913856003700930 2018 eng d00aA belief propagation algorithm based on domain decomposition0 abelief propagation algorithm based on domain decomposition3 aThis note provides a detailed description and derivation of the domain decomposition algorithm that appears in previous works by the author. Given a large re-estimation problem, domain decomposition provides an iterative method for assembling Boltzmann distributions associated to small subproblems into an approximation of the Bayesian posterior of the whole problem. The algorithm is amenable to using Boltzmann sampling to approximate these Boltzmann distributions. In previous work, we have shown the capability of heuristic versions of this algorithm to solve LDPC decoding and circuit fault diagnosis problems too large to fit on quantum annealing hardware used for sampling. Here, we rigorously prove soundness of the method.
1 aLackey, Brad uhttps://arxiv.org/abs/1810.1000501856nas a2200169 4500008004100000245006600041210006500107260001500172300000700187490000600194520134900200100002401549700001601573700002201589700001901611856005601630 2018 eng d00aBQP-completeness of Scattering in Scalar Quantum Field Theory0 aBQPcompleteness of Scattering in Scalar Quantum Field Theory c2018/01/08 a440 v23 aRecent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a closely related quantum field-theoretical problem: estimating the vacuum-to-vacuum transition amplitude, in the presence of spacetime-dependent classical sources, for a massive scalar field theory in (1+1) dimensions. We show that this problem is BQP-hard; in other words, its solution enables one to solve any problem that is solvable in polynomial time by a quantum computer. Hence, the vacuum-to-vacuum amplitude cannot be accurately estimated by any efficient classical algorithm, even if the field theory is very weakly coupled, unless BQP=BPP. Furthermore, the corresponding decision problem can be solved by a quantum computer in a time scaling polynomially with the number of bits needed to specify the classical source fields, and this problem is therefore BQP-complete. Our construction can be regarded as an idealized architecture for a universal quantum computer in a laboratory system described by massive phi^4 theory coupled to classical spacetime-dependent sources.
1 aJordan, Stephen, P.1 aKrovi, Hari1 aLee, Keith, S. M.1 aPreskill, John uhttps://quantum-journal.org/papers/q-2018-01-08-44/05095nas a2200169 4500008004100000245007900041210006900120260001500189520455700204100001804761700001804779700001804797700002004815700001704835700001604852856005704868 2018 eng d00aCapacity Approaching Codes for Low Noise Interactive Quantum Communication0 aCapacity Approaching Codes for Low Noise Interactive Quantum Com c2018/01/013 aSuperconductivity provides a canonical example of a quantum phase of matter. When superconducting islands are connected by Josephson junctions in a lattice, the low temperature state of the system can map to the celebrated XY model and its associated universality classes. This has been used to experimentally implement realizations of Mott insulator and Berezinskii--Kosterlitz--Thouless (BKT) transitions to vortex dynamics analogous to those in type-II superconductors. When an external magnetic field is added, the effective spins of the XY model become frustrated, leading to the formation of topological defects (vortices). Here we observe the many-body dynamics of such an array, including frustration, via its coupling to a superconducting microwave cavity. We take the design of the transmon qubit, but replace the single junction between two antenna pads with the complete array. This allows us to probe the system at 10 mK with minimal self-heating by using weak coherent states at the single (microwave) photon level to probe the resonance frequency of the cavity. We observe signatures of ordered vortex lattice at rational flux fillings of the array.
1 aCosmic, R.1 aIkegami, Hiroki1 aLin, Zhirong1 aInomata, Kunihiro1 aTaylor, J., M.1 aNakamura, Yasunobu uhttps://arxiv.org/abs/1803.0411304213nas a2200241 4500008004100000245006900041210006800110260001500178300001100193490000800204520348600212100001503698700002303713700002403736700001903760700001903779700002503798700002503823700001803848700002103866700002403887856006003911 2018 eng d00aDark state optical lattice with sub-wavelength spatial structure0 aDark state optical lattice with subwavelength spatial structure c2018/02/20 a0836010 v1203 aWe report on the experimental realization of a conservative optical lattice for cold atoms with a subwavelength spatial structure. The potential is based on the nonlinear optical response of three-level atoms in laser-dressed dark states, which is not constrained by the diffraction limit of the light generating the potential. The lattice consists of a one-dimensional array of ultranarrow barriers with widths less than 10 nm, well below the wavelength of the lattice light, physically realizing a Kronig-Penney potential. We study the band structure and dissipation of this lattice and find good agreement with theoretical predictions. Even on resonance, the observed lifetimes of atoms trapped in the lattice are as long as 44 ms, nearly 105times the excited state lifetime, and could be further improved with more laser intensity. The potential is readily generalizable to higher dimensions and different geometries, allowing, for example, nearly perfect box traps, narrow tunnel junctions for atomtronics applications, and dynamically generated lattices with subwavelength spacings.
1 aWang, Yang1 aSubhankar, Sarthak1 aBienias, Przemyslaw1 aLacki, Mateusz1 aTsui, Tsz-Chun1 aBaranov, Mikhail, A.1 aGorshkov, Alexey, V.1 aZoller, Peter1 aPorto, James, V.1 aRolston, Steven, L. uhttps://link.aps.org/doi/10.1103/PhysRevLett.120.08360101552nas a2200169 4500008004100000245007500041210006900116520100400185100001901189700002301208700002201231700002401253700002401277700002001301700002401321856003701345 2018 eng d00aDemonstration of Bayesian quantum game on an ion trap quantum computer0 aDemonstration of Bayesian quantum game on an ion trap quantum co3 aWe demonstrate a Bayesian quantum game on an ion trap quantum computer with five qubits. The players share an entangled pair of qubits and perform rotations on their qubit as the strategy choice. Two five-qubit circuits are sufficient to run all 16 possible strategy choice sets in a game with four possible strategies. The data are then parsed into player types randomly in order to combine them classically into a Bayesian framework. We exhaustively compute the possible strategies of the game so that the experimental data can be used to solve for the Nash equilibria of the game directly. Then we compare the payoff at the Nash equilibria and location of phase-change-like transitions obtained from the experimental data to the theory, and study how it changes as a function of the amount of entanglement.
1 aSolmeyer, Neal1 aLinke, Norbert, M.1 aFiggatt, Caroline1 aLandsman, Kevin, A.1 aBalu, Radhakrishnan1 aSiopsis, George1 aMonroe, Christopher uhttps://arxiv.org/abs/1802.0811602638nas a2200265 4500008004100000245009500041210006900136260001500205300001200220490000800232520186000240100002102100700001902121700001802140700001802158700001502176700002002191700001902211700001602230700002502246700001802271700002402289700002202313856003702335 2018 eng d00aExperimentally Generated Randomness Certified by the Impossibility of Superluminal Signals0 aExperimentally Generated Randomness Certified by the Impossibili c2018/04/11 a223-2260 v5563 aFrom dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A key challenge with random number generators is that it is hard to ensure that their outputs are unpredictable. For a random number generator based on a physical process, such as a noisy classical system or an elementary quantum measurement, a detailed model describing the underlying physics is required to assert unpredictability. Such a model must make a number of assumptions that may not be valid, thereby compromising the integrity of the device. However, it is possible to exploit the phenomenon of quantum nonlocality with a loophole-free Bell test to build a random number generator that can produce output that is unpredictable to any adversary limited only by general physical principles. With recent technological developments, it is now possible to carry out such a loophole-free Bell test. Here we present certified randomness obtained from a photonic Bell experiment and extract 1024 random bits uniform to within 10−12. These random bits could not have been predicted within any physical theory that prohibits superluminal signaling and allows one to make independent measurement choices. To certify and quantify the randomness, we describe a new protocol that is optimized for apparatuses characterized by a low per-trial violation of Bell inequalities. We thus enlisted an experimental result that fundamentally challenges the notion of determinism to build a system that can increase trust in random sources. In the future, random number generators based on loophole-free Bell tests may play a role in increasing the security and trust of our cryptographic systems and infrastructure.
1 aBierhorst, Peter1 aKnill, Emanuel1 aGlancy, Scott1 aZhang, Yanbao1 aMink, Alan1 aJordan, Stephen1 aRommal, Andrea1 aLiu, Yi-Kai1 aChristensen, Bradley1 aNam, Sae, Woo1 aStevens, Martin, J.1 aShalm, Lynden, K. uhttps://arxiv.org/abs/1803.0621901691nas a2200169 4500008004100000245007000041210006900111260001500180300001300195490000600208520118500214100002701399700001301426700001901439700002601458856003701484 2018 eng d00aFractal Universality in Near-Threshold Magnetic Lanthanide Dimers0 aFractal Universality in NearThreshold Magnetic Lanthanide Dimers c2018/02/16 aeaap83080 v43 aErgodic quantum systems are often quite alike, whereas nonergodic, fractal systems are unique and display characteristic properties. We explore one of these fractal systems, weakly bound dysprosium lanthanide molecules, in an external magnetic field. As recently shown, colliding ultracold magnetic dysprosium atoms display a soft chaotic behavior with a small degree of disorder. We broaden this classification by investigating the generalized inverse participation ratio and fractal dimensions for large sets of molecular wave functions. Our exact close-coupling simulations reveal a dynamic phase transition from partially localized states to totally delocalized states and universality in its distribution by increasing the magnetic field strength to only a hundred Gauss (or 10 mT). Finally, we prove the existence of nonergodic delocalized phase in the system and explain the violation of ergodicity by strong coupling between near-threshold molecular states and the nearby continuum.
1 aMakrides, Constantinos1 aLi, Ming1 aTiesinga, Eite1 aKotochigova, Svetlana uhttps://arxiv.org/abs/1802.0958601617nas a2200157 4500008004100000245012800041210006900169520105700238100001801295700002401313700002101337700001801358700002101376700002501397856003701422 2018 eng d00aFractional quantum Hall phases of bosons with tunable interactions: From the Laughlin liquid to a fractional Wigner crystal0 aFractional quantum Hall phases of bosons with tunable interactio3 aHighly tunable platforms for realizing topological phases of matter are emerging from atomic and photonic systems, and offer the prospect of designing interactions between particles. The shape of the potential, besides playing an important role in the competition between different fractional quantum Hall phases, can also trigger the transition to symmetry-broken phases, or even to phases where topological and symmetry-breaking order coexist. Here, we explore the phase diagram of an interacting bosonic model in the lowest Landau level at half-filling as two-body interactions are tuned. Apart from the well-known Laughlin liquid, Wigner crystal phase, stripe, and bubble phases, we also find evidence of a phase that exhibits crystalline order at fractional filling per crystal site. The Laughlin liquid transits into this phase when pairs of bosons strongly repel each other at relative angular momentum 4ℏ. We show that such interactions can be achieved by dressing ground-state cold atoms with multiple different-parity Rydberg states.
1 aGraß, Tobias1 aBienias, Przemyslaw1 aGullans, Michael1 aLundgren, Rex1 aMaciejko, Joseph1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/1809.0449301552nas a2200217 4500008004100000245004800041210004800089260001500137300001100152490000700163520094200170100002001112700002301132700001601155700002101171700001601192700001201208700002401220700002101244856006901265 2018 eng d00aGeometry of the quantum set of correlations0 aGeometry of the quantum set of correlations c2018/02/07 a0221040 v973 aIt is well known that correlations predicted by quantum mechanics cannot be explained by any classical (local-realistic) theory. The relative strength of quantum and classical correlations is usually studied in the context of Bell inequalities, but this tells us little about the geometry of the quantum set of correlations. In other words, we do not have good intuition about what the quantum set actually looks like. In this paper we study the geometry of the quantum set using standard tools from convex geometry. We find explicit examples of rather counter-intuitive features in the simplest non-trivial Bell scenario (two parties, two inputs and two outputs) and illustrate them using 2-dimensional slice plots. We also show that even more complex features appear in Bell scenarios with more inputs or more parties. Finally, we discuss the limitations that the geometry of the quantum set imposes on the task of self-testing.
1 aGoh, Koon, Tong1 aKaniewski, Jedrzej1 aWolfe, Elie1 aVértesi, Tamás1 aWu, Xingyao1 aCai, Yu1 aLiang, Yeong-Cherng1 aScarani, Valerio uhttps://journals.aps.org/pra/abstract/10.1103/PhysRevA.97.02210401264nas a2200157 4500008004100000245006300041210006300104520077600167100002100943700002100964700002000985700002001005700002001025700002401045856003701069 2018 eng d00aHigh Purity Single Photons Entangled with an Atomic Memory0 aHigh Purity Single Photons Entangled with an Atomic Memory3 aTrapped atomic ions are an ideal candidate for quantum network nodes, with long-lived identical qubit memories that can be locally entangled through their Coulomb interaction and remotely entangled through photonic channels. The integrity of this photonic interface is generally reliant on purity of single photons produced by the quantum memory. Here we demonstrate a single-photon source for quantum networking based on a trapped 138Ba+ ion with a single photon purity of g2(0)=(8.1±2.3)×10−5 without background subtraction. We further optimize the tradeoff between the photonic generation rate and the memory-photon entanglement fidelity for the case of polarization photonic qubits by tailoring the spatial mode of the collected light.
1 aCrocker, Clayton1 aLichtman, Martin1 aSosnova, Ksenia1 aCarter, Allison1 aScarano, Sophia1 aMonroe, Christopher uhttps://arxiv.org/abs/1812.0174901356nas a2200181 4500008004100000245006000041210005900101260001500160490000700175520083200182100001801014700002401032700002301056700002201079700001501101700002101116856003701137 2018 eng d00aMachine learning assisted readout of trapped-ion qubits0 aMachine learning assisted readout of trappedion qubits c2018/05/010 v513 aWe reduce measurement errors in a quantum computer using machine learning techniques. We exploit a simple yet versatile neural network to classify multi-qubit quantum states, which is trained using experimental data. This flexible approach allows the incorporation of any number of features of the data with minimal modifications to the underlying network architecture. We experimentally illustrate this approach in the readout of trapped-ion qubits using additional spatial and temporal features in the data. Using this neural network classifier, we efficiently treat qubit readout crosstalk, resulting in a 30\% improvement in detection error over the conventional threshold method. Our approach does not depend on the specific details of the system and can be readily generalized to other quantum computing platforms.
1 aSeif, Alireza1 aLandsman, Kevin, A.1 aLinke, Norbert, M.1 aFiggatt, Caroline1 aMonroe, C.1 aHafezi, Mohammad uhttps://arxiv.org/abs/1804.0771801529nas a2200109 4500008004100000245005800041210005700099520118800156100002101344700001701365856003701382 2018 eng d00aMathematical methods for resource-based type theories0 aMathematical methods for resourcebased type theories3 aWith the wide range of quantum programming languages on offer now, efficient program verification and type checking for these languages presents a challenge -- especially when classical debugging techniques may affect the states in a quantum program. In this work, we make progress towards a program verification approach using the formalism of operational quantum mechanics and resource theories. We present a logical framework that captures two mathematical approaches to resource theory based on monoids (algebraic) and monoidal categories (categorical). We develop the syntax of this framework as an intuitionistic sequent calculus, and prove soundness and completeness of an algebraic and categorical semantics that recover these approaches. We also provide a cut-elimination theorem, normal form, and analogue of Lambek's lifting theorem for polynomial systems over the logics. Using these approaches along with the Curry-Howard-Lambek correspondence for programs, proofs and categories, this work lays the mathematical groundwork for a type checker for some resource theory based frameworks, with the possibility of extending it other quantum programming languages.
1 aSundaram, Aarthi1 aLackey, Brad uhttps://arxiv.org/abs/1812.0872602049nas a2200145 4500008004100000245005200041210005100093260001500144300001100159490000700170520165600177100001701833700001601850856003701866 2018 eng d00aMeasurement Contextuality and Planck's Constant0 aMeasurement Contextuality and Plancks Constant c2018/07/12 a0730200 v203 aContextuality is a necessary resource for universal quantum computation and non-contextual quantum mechanics can be simulated efficiently by classical computers in many cases. Orders of Planck's constant, ℏ, can also be used to characterize the classical-quantum divide by expanding quantities of interest in powers of ℏ---all orders higher than ℏ0 can be interpreted as quantum corrections to the order ℏ0 term. We show that contextual measurements in finite-dimensional systems have formulations within the Wigner-Weyl-Moyal (WWM) formalism that require higher than order ℏ0 terms to be included in order to violate the classical bounds on their expectation values. As a result, we show that contextuality as a resource is equivalent to orders of ℏ as a resource within the WWM formalism. This explains why qubits can only exhibit state-independent contextuality under Pauli observables as in the Peres-Mermin square while odd-dimensional qudits can also exhibit state-dependent contextuality. In particular, we find that qubit Pauli observables lack an order ℏ0 contribution in their Weyl symbol and so exhibit contextuality regardless of the state being measured. On the other hand, odd-dimensional qudit observables generally possess non-zero order ℏ0 terms, and higher, in their WWM formulation, and so exhibit contextuality depending on the state measured: odd-dimensional qudit states that exhibit measurement contextuality have an order ℏ1 contribution that allows for the violation of classical bounds while states that do not exhibit measurement contextuality have insufficiently large order ℏ1 contributions.
1 aKocia, Lucas1 aLove, Peter uhttps://arxiv.org/abs/1711.0806600683nas a2200109 4500008004100000245004600041210004600087520036300133100001700496700002300513856003700536 2018 eng d00aMorphisms in categories of nonlocal games0 aMorphisms in categories of nonlocal games3 aSynchronous correlations provide a class of nonlocal games that behave like functions between finite sets. In this work we examine categories whose morphisms are games with synchronous classical, quantum, or general nonsignaling correlations. In particular, we characterize when morphisms in these categories are monic, epic, sections, or retractions.
1 aLackey, Brad1 aRodrigues, Nishant uhttps://arxiv.org/abs/1810.1007402361nas a2200109 4500008004100000245014200041210006900183520192900252100001702181700001602198856003702214 2018 eng d00aThe Non-Disjoint Ontic States of the Grassmann Ontological Model, Transformation Contextuality, and the Single Qubit Stabilizer Subtheory0 aNonDisjoint Ontic States of the Grassmann Ontological Model Tran3 aWe show that it is possible to construct a preparation non-contextual ontological model that does not exhibit "transformation contextuality" for single qubits in the stabilizer subtheory. In particular, we consider the "blowtorch" map and show that it does not exhibit transformation contextuality under the Grassmann Wigner-Weyl-Moyal (WWM) qubit formalism. Furthermore, the transformation in this formalism can be fully expressed at order ℏ0 and so does not qualify as a candidate quantum phenomenon. In particular, we find that the Grassmann WWM formalism at order ℏ0 corresponds to an ontological model governed by an additional set of constraints arising from the relations defining the Grassmann algebra. Due to this additional set of constraints, the allowed probability distributions in this model do not form a single convex set when expressed in terms of disjoint ontic states and so cannot be mapped to models whose states form a single convex set over disjoint ontic states. However, expressing the Grassmann WWM ontological model in terms of non-disjoint ontic states corresponding to the monomials of the Grassmann algebra results in a single convex set. We further show that a recent result by Lillystone et al. that proves a broad class of preparation and measurement non-contextual ontological models must exhibit transformation contextuality lacks the generality to include the ontological model considered here; Lillystone et al.'s result is appropriately limited to ontological models whose states produce a single convex set when expressed in terms of disjoint ontic states. Therefore, we prove that for the qubit stabilizer subtheory to be captured by a preparation, transformation and measurement non-contextual ontological theory, it must be expressed in terms of non-disjoint ontic states, unlike the case for the odd-dimensional single-qudit stabilizer subtheory.
1 aKocia, Lucas1 aLove, Peter uhttps://arxiv.org/abs/1805.0951402023nas a2200241 4500008004100000245007500041210006900116260001500185300001200200490000800212520128400220100001701504700002901521700002201550700002601572700002101598700002501619700002301644700001601667700002301683700002001706856005501726 2018 eng d00aObservation of three-photon bound states in a quantum nonlinear medium0 aObservation of threephoton bound states in a quantum nonlinear m c2018/02/16 a783-7860 v3593 aBound states of massive particles, such as nuclei, atoms or molecules, are ubiquitous in nature and constitute the bulk of the visible world around us. In contrast, photons typically only weakly influence each other due to their very weak interactions and vanishing mass. We report the observation of traveling three-photon bound states in a quantum nonlinear medium where the interactions between photons are mediated by atomic Rydberg states. In particular, photon correlation and conditional phase measurements reveal the distinct features associated with three-photon and two-photon bound states. Such photonic trimers and dimers can be viewed as quantum solitons with shape-preserving wavefunctions that depend on the constituent photon number. The observed bunching and strongly nonlinear optical phase are quantitatively described by an effective field theory (EFT) of Rydberg-induced photon-photon interactions, which demonstrates the presence of a substantial effective three-body force between the photons. These observations pave the way towards the realization, studies, and control of strongly interacting quantum many-body states of light.
1 aLiang, Qi-Yu1 aVenkatramani, Aditya, V.1 aCantu, Sergio, H.1 aNicholson, Travis, L.1 aGullans, Michael1 aGorshkov, Alexey, V.1 aThompson, Jeff, D.1 aChin, Cheng1 aLukin, Mikhail, D.1 aVuletic, Vladan uhttp://science.sciencemag.org/content/359/6377/78301661nas a2200121 4500008004100000245009700041210006900138520123700207100001301444700001901457700002601476856003701502 2018 eng d00aOrbital quantum magnetism in spin dynamics of strongly interacting magnetic lanthanide atoms0 aOrbital quantum magnetism in spin dynamics of strongly interacti3 aLaser cooled lanthanide atoms are ideal candidates with which to study strong and unconventional quantum magnetism with exotic phases. Here, we use state-of-the-art closed-coupling simulations to model quantum magnetism for pairs of ultracold spin-6 erbium lanthanide atoms placed in a deep optical lattice. In contrast to the widely used single-channel Hubbard model description of atoms and molecules in an optical lattice, we focus on the single-site multi-channel spin evolution due to spin-dependent contact, anisotropic van der Waals, and dipolar forces. This has allowed us to identify the leading mechanism, orbital anisotropy, that governs molecular spin dynamics among erbium atoms. The large magnetic moment and combined orbital angular momentum of the 4f-shell electrons are responsible for these strong anisotropic interactions and unconventional quantum magnetism. Multi-channel simulations of magnetic Cr atoms under similar trapping conditions show that their spin-evolution is controlled by spin-dependent contact interactions that are distinct in nature from the orbital anisotropy in Er. The role of an external magnetic field and the aspect ratio of the lattice site on spin dynamics is also investigated.
1 aLi, Ming1 aTiesinga, Eite1 aKotochigova, Svetlana uhttps://arxiv.org/abs/1804.1010201943nas a2200169 4500008004100000245007600041210006900117520143500186100001601621700001801637700001801655700002101673700001201694700001501706700001501721856003701736 2018 eng d00aParallel Entangling Operations on a Universal Ion Trap Quantum Computer0 aParallel Entangling Operations on a Universal Ion Trap Quantum C3 aThe circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear efficiency gains in numerous quantum circuits as well as for entire algorithms such as Shor's factoring algorithm and quantum simulations. In cases such as full adders and multiple-control Toffoli gates, parallelism can provide an exponential improvement in overall execution time. More importantly, quantum gate parallelism is essential for the practical fault-tolerant error correction of qubits that suffer from idle errors. The implementation of parallel quantum gates is complicated by potential crosstalk, especially between qubits fully connected by a common-mode bus, such as in Coulomb-coupled trapped atomic ions or cavity-coupled superconducting transmons. Here, we present the first experimental results for parallel 2-qubit entangling gates in an array of fully-connected trapped ion qubits. We demonstrate an application of this capability by performing a 1-bit full addition operation on a quantum computer using a depth-4 quantum circuit. These results exploit the power of highly connected qubit systems through classical control techniques, and provide an advance toward speeding up quantum circuits and achieving fault tolerance with trapped ion quantum computers.
1 aFiggatt, C.1 aOstrander, A.1 aLinke, N., M.1 aLandsman, K., A.1 aZhu, D.1 aMaslov, D.1 aMonroe, C. uhttps://arxiv.org/abs/1810.1194801770nas a2200145 4500008004100000245006300041210006200104260001500166300001200181490000700193520134000200100001901540700001601559856004901575 2018 eng d00aPhase Retrieval Without Small-Ball Probability Assumptions0 aPhase Retrieval Without SmallBall Probability Assumptions c2018/01/01 a485-5000 v643 aIn the context of the phase retrieval problem, it is known that certain natural classes of measurements, such as Fourier measurements and random Bernoulli measurements, do not lead to the unique reconstruction of all possible signals, even in combination with certain practically feasible random masks. To avoid this difficulty, the analysis is often restricted to measurement ensembles (or masks) that satisfy a small-ball probability condition, in order to ensure that the reconstruction is unique. This paper shows a complementary result: for random Bernoulli measurements, there is still a large class of signals that can be reconstructed uniquely, namely, those signals that are non-peaky. In fact, this result is much more general: it holds for random measurements sampled from any subgaussian distribution 2), without any small-ball conditions. This is demonstrated in two ways: 1) a proof of stability and uniqueness and 2) a uniform recovery guarantee for the PhaseLift algorithm. In all of these cases, the number of measurements m approaches the information-theoretic lower bound. Finally, for random Bernoulli measurements with erasures, it is shown that PhaseLift achieves uniform recovery of all signals (including peaky ones).
1 aKrahmer, Felix1 aLiu, Yi-Kai uhttp://ieeexplore.ieee.org/document/8052535/01127nas a2200145 4500008004100000245006400041210006200105260001500167490001000182520070300192100001800895700001600913700001500929856003700944 2018 eng d00aPseudorandom States, Non-Cloning Theorems and Quantum Money0 aPseudorandom States NonCloning Theorems and Quantum Money c2017/11/010 v109933 aWe propose the concept of pseudorandom states and study their constructions, properties, and applications. Under the assumption that quantum-secure one-way functions exist, we present concrete and efficient constructions of pseudorandom states. The non-cloning theorem plays a central role in our study—it motivates the proper definition and characterizes one of the important properties of pseudorandom quantum states. Namely, there is no efficient quantum algorithm that can create more copies of the state from a given number of pseudorandom states. As the main application, we prove that any family of pseudorandom states naturally gives rise to a private-key quantum money scheme.
1 aJi, Zhengfeng1 aLiu, Yi-Kai1 aSong, Fang uhttps://arxiv.org/abs/1711.0038502027nas a2200133 4500008004100000245005400041210005400095520164000149100002001789700001701809700001401826700001601840856003701856 2018 eng d00aQuantum adiabatic optimization without heuristics0 aQuantum adiabatic optimization without heuristics3 aQuantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian H(s) with spectral gap γ(s). Assuming the existence of an oracle Γ such that γ(s)=Θ(Γ(s)), we provide an algorithm that reliably performs QAO in time Oγ−1minlog(γ−1min) with Olog(γ−1min) oracle queries, where γmin=minsγ(s). Our strategy is not heuristic and does not require guessing time parameters or annealing paths. Rather, our algorithm naturally produces an annealing path such that dH/ds≈γ(s) and chooses its own runtime T to be as close as possible to optimal while promising convergence to the ground state. We then demonstrate the feasibility of this approach in practice by explicitly constructing a gap oracle Γ for the problem of finding a vertex m=argminuW(u) of the cost function W:V⟶[0,1], restricting ourselves to computational basis measurements and driving Hamiltonian H(0)=I−V−1∑u,v∈V|u〉〈v|, with V=|V|. Requiring only that W have a constant lower bound on its spectral gap and upper bound κ on its spectral ratio, our QAO algorithm returns m using Γ with probability (1−ε)(1−e−1/ε) in time O˜(ε−1[V−−√+(κ−1)2/3V2/3]). This achieves a quantum advantage for all κ, and when κ≈1, recovers Grover scaling up to logarithmic factors. We implement the algorithm as a subroutine in an optimization procedure that produces m with exponentially small failure probability and expected runtime O˜(ε−1[V−−√+(κ−1)2/3V2/3]), even when κ is not known beforehand.
1 aJarret, Michael1 aLackey, Brad1 aLiu, Aike1 aWan, Kianna uhttps://arxiv.org/abs/1810.0468600433nas a2200133 4500008004100000245005200041210004900093260001200142300001000154490000700164100002400171700001600195856008800211 2018 eng d00aQuantum Cryptanalysis: Shor, Grover, and Beyond0 aQuantum Cryptanalysis Shor Grover and Beyond c2018/09 a14-210 v161 aJordan, Stephen, P.1 aLiu, Yi-Kai uhttps://www.quics.umd.edu/publications/quantum-cryptanalysis-shor-grover-and-beyond02409nas a2200157 4500008004100000245009100041210006900132520188600201100003302087700001602120700001702136700002402153700002202177700001502199856003702214 2018 eng d00aQuantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning0 aQuantum SDP Solvers Large Speedups Optimality and Applications t3 aWe give two new quantum algorithms for solving semidefinite programs (SDPs) providing quantum speed-ups. We consider SDP instances with m constraint matrices, each of dimension n, rank r, and sparsity s. The first algorithm assumes an input model where one is given access to entries of the matrices at unit cost. We show that it has run time O~(s2(m−−√ε−10+n−−√ε−12)), where ε is the error. This gives an optimal dependence in terms of m,n and quadratic improvement over previous quantum algorithms when m≈n. The second algorithm assumes a fully quantum input model in which the matrices are given as quantum states. We show that its run time is O~(m−−√+poly(r))⋅poly(logm,logn,B,ε−1), with B an upper bound on the trace-norm of all input matrices. In particular the complexity depends only poly-logarithmically in n and polynomially in r. We apply the second SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and copies of an unknown state ρ, we show we can find in time m−−√⋅poly(logm,logn,r,ε−1) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements, up to error ε. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes' principle from statistical mechanics. As in previous work, we obtain our algorithm by "quantizing" classical SDP solvers based on the matrix multiplicative weight method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension, which could be of independent interest.
1 aBrandão, Fernando, G. S. L.1 aKalev, Amir1 aLi, Tongyang1 aLin, Cedric, Yen-Yu1 aSvore, Krysta, M.1 aWu, Xiaodi uhttps://arxiv.org/abs/1710.0258102587nas a2200157 4500008004100000245011000041210006900151260001500220300001200235520207500247100001902322700001302341700002002354700001802374856003702392 2018 eng d00aQuantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics0 aQuantum singular value transformation and beyond exponential imp c2018/06/05 a193-2043 aQuantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation" algorithm capable of harnessing this exponential advantage, that can apply polynomial transformations to the singular values of a block of a unitary, generalizing the optimal Hamiltonian simulation results of Low and Chuang. The proposed quantum circuits have a very simple structure, often give rise to optimal algorithms and have appealing constant factors, while usually only use a constant number of ancilla qubits. We show that singular value transformation leads to novel algorithms. We give an efficient solution to a certain "non-commutative" measurement problem and propose a new method for singular value estimation. We also show how to exponentially improve the complexity of implementing fractional queries to unitaries with a gapped spectrum. Finally, as a quantum machine learning application we show how to efficiently implement principal component regression. "Singular value transformation" is conceptually simple and efficient, and leads to a unified framework of quantum algorithms incorporating a variety of quantum speed-ups. We illustrate this by showing how it generalizes a number of prominent quantum algorithms, including: optimal Hamiltonian simulation, implementing the Moore-Penrose pseudoinverse with exponential precision, fixed-point amplitude amplification, robust oblivious amplitude amplification, fast QMA amplification, fast quantum OR lemma, certain quantum walk results and several quantum machine learning algorithms. In order to exploit the strengths of the presented method it is useful to know its limitations too, therefore we also prove a lower bound on the efficiency of singular value transformation, which often gives optimal bounds.
1 aGilyen, Andras1 aSu, Yuan1 aLow, Guang, Hao1 aWiebe, Nathan uhttps://arxiv.org/abs/1806.0183802434nas a2200205 4500008004100000245006200041210006200103260001500165300001100180490000800191520186900199100001502068700001902083700001902102700001602121700001702137700001702154700002002171856003702191 2018 eng d00aRecovering quantum gates from few average gate fidelities0 aRecovering quantum gates from few average gate fidelities c2018/03/01 a1705020 v1213 aCharacterising 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'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' calculus with Weingarten functions for integration over the Clifford group, and combine this with proof techniques from compressed sensing.
1 aRoth, Ingo1 aKueng, Richard1 aKimmel, Shelby1 aLiu, Yi-Kai1 aGross, David1 aEisert, Jens1 aKliesch, Martin uhttps://arxiv.org/abs/1803.0057201532nas a2200193 4500008004100000245009300041210006900134260001500203300001100218490000800229520089100237100002101128700002401149700002201173700002301195700002401218700002301242856007301265 2018 eng d00aRobust two-qubit gates in a linear ion crystal using a frequency-modulated driving force0 aRobust twoqubit gates in a linear ion crystal using a frequencym c2018/01/09 a0205010 v1203 aIn an ion trap quantum computer, collective motional modes are used to entangle two or more qubits in order to execute multi-qubit logical gates. Any residual entanglement between the internal and motional states of the ions will result in decoherence errors, especially when there are many spectator ions in the crystal. We propose using a frequency-modulated (FM) driving force to minimize such errors and implement it experimentally. In simulation, we obtained an optimized FM gate that can suppress decoherence to less than 10−4 and is robust against a frequency drift of more than ±1 kHz. The two-qubit gate was tested in a five-qubit trapped ion crystal, with 98.3(4)% fidelity for a Mølmer-Sørensen entangling gate and 98.6(7)% for a controlled-not (CNOT) gate. We also show an optimized FM two-qubit gate for 17 ions, proving the scalability of our method.
1 aLeung, Pak, Hong1 aLandsman, Kevin, A.1 aFiggatt, Caroline1 aLinke, Norbert, M.1 aMonroe, Christopher1 aBrown, Kenneth, R. uhttps://journals.aps.org/prl/abstract/10.1103/PhysRevLett.120.02050102029nas a2200205 4500008004100000245009100041210006900132490000900201520141200210100001901622700002001641700001801661700001701679700002001696700002001716700001601736700001701752700001701769856003701786 2018 eng d00aA spinor Bose-Einstein condensate phase-sensitive amplifier for SU(1,1) interferometry0 aspinor BoseEinstein condensate phasesensitive amplifier for SU110 vA 983 aThe SU(1,1) interferometer was originally conceived as a Mach-Zehnder interferometer with the beam-splitters replaced by parametric amplifiers. The parametric amplifiers produce states with correlations that result in enhanced phase sensitivity. F=1 spinor Bose-Einstein condensates (BECs) can serve as the parametric amplifiers for an atomic version of such an interferometer by collisionally producing entangled pairs of 〈F=1,m=±1| atoms. We simulate the effect of single and double-sided seeding of the inputs to the amplifier using the truncated-Wigner approximation. We find that single-sided seeding degrades the performance of the interferometer exactly at the phase the unseeded interferometer should operate the best. Double-sided seeding results in a phase-sensitive amplifier, where the maximal sensitivity is a function of the phase relationship between the input states of the amplifier. In both single and double-sided seeding we find there exists an optimal phase shift that achieves sensitivity beyond the standard quantum limit. Experimentally, we demonstrate a spinor phase-sensitive amplifier using a BEC of 23Na in an optical dipole trap. This configuration could be used as an input to such an interferometer. We are able to control the initial phase of the double-seeded amplifier, and demonstrate sensitivity to initial population fractions as small as 0.1\%.
1 aWrubel, J., P.1 aSchwettmann, A.1 aFahey, D., P.1 aGlassman, Z.1 aPechkis, H., K.1 aGriffin, P., F.1 aBarnett, R.1 aTiesinga, E.1 aLett, P., D. uhttps://arxiv.org/abs/1807.0667601897nas a2200109 4500008004100000245010200041210006900143520150500212100001701717700001601734856003701750 2018 eng d00aStationary Phase Method in Discrete Wigner Functions and Classical Simulation of Quantum Circuits0 aStationary Phase Method in Discrete Wigner Functions and Classic3 aWe apply the periodized stationary phase method to discrete Wigner functions of systems with odd prime dimension using results from p-adic number theory. We derive the Wigner-Weyl-Moyal (WWM) formalism with higher order ℏ corrections representing contextual corrections to non-contextual Clifford operations. We apply this formalism to a subset of unitaries that include diagonal gates such as the π8 gates. We characterize the stationary phase critical points as a quantum resource injecting contextuality and show that this resource allows for the replacement of the p2t points that represent t magic state Wigner functions on p-dimensional qudits by ≤pt points. We find that the π8 gate introduces the smallest higher order ℏ correction possible, requiring the lowest number of additional critical points compared to the Clifford gates. We then establish a relationship between the stabilizer rank of states and the number of critical points necessary to treat them in the WWM formalism. This allows us to exploit the stabilizer rank decomposition of two qutrit π8 gates to develop a classical strong simulation of a single qutrit marginal on t qutrit π8 gates that are followed by Clifford evolution, and show that this only requires calculating 3t2+1 critical points corresponding to Gauss sums. This outperforms the best alternative qutrit algorithm (based on Wigner negativity and scaling as ∼30.8t for 10−2 precision) for any number of π8 gates to full precision.
1 aKocia, Lucas1 aLove, Peter uhttps://arxiv.org/abs/1810.0362210586nas a2200301 4500008004100000245007200041210006900113520978200182100001609964700001609980700001909996700001810015700001610033700002210049700001510071700001310086700001210099700001610111700001210127700001410139700001510153700001710168700001610185700001610201700001310217700001710230856003710247 2018 eng d00aStudy of radon reduction in gases for rare event search experiments0 aStudy of radon reduction in gases for rare event search experime3 aThe 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 (
Quantum scrambling is the dispersal of local information into many-body quantum entanglements and correlations distributed throughout the entire system. This concept underlies the dynamics of thermalization in closed quantum systems, and more recently has emerged as a powerful tool for characterizing chaos in black holes. However, the direct experimental measurement of quantum scrambling is difficult, owing to the exponential complexity of ergodic many-body entangled states. One way to characterize quantum scrambling is to measure an out-of-time-ordered correlation function (OTOC); however, since scrambling leads to their decay, OTOCs do not generally discriminate between quantum scrambling and ordinary decoherence. Here, we implement a quantum circuit that provides a positive test for the scrambling features of a given unitary process. This approach conditionally teleports a quantum state through the circuit, providing an unambiguous litmus test for scrambling while projecting potential circuit errors into an ancillary observable. We engineer quantum scrambling processes through a tunable 3-qubit unitary operation as part of a 7-qubit circuit on an ion trap quantum computer. Measured teleportation fidelities are typically ∼80%, and enable us to experimentally bound the scrambling-induced decay of the corresponding OTOC measurement.
1 aLandsman, Kevin, A.1 aFiggatt, Caroline1 aSchuster, Thomas1 aLinke, Norbert, M.1 aYoshida, Beni1 aYao, Norman, Y.1 aMonroe, Christopher uhttps://arxiv.org/abs/1806.0280701312nas a2200133 4500008004100000245003600041210003500077300001300112490000700125520096100132100001901093700001101112856005501123 2017 eng d00a3-manifold diagrams and NP vs P0 a3manifold diagrams and NP vs P a125-141 0 v173 aThe computational complexity class #P captures the di_culty of counting the satisfying assignments to a boolean formula. In this work, we use basic tools from quantum computation to give a proof that the SO(3) Witten-Reshetikhin-Turaev (WRT) invariant of 3-manifolds is #P-hard to calculate. We then apply this result to a question about the combinatorics of Heegaard splittings, motivated by analogous work on link diagrams by M. Freedman. We show that, if #P ⊆ FPNP, then there exist infinitely many Heegaard splittings which cannot be made logarithmically thin by local WRT-preserving moves, except perhaps via a superpolynomial number of steps. We also outline two extensions of the above results. First, adapting a result of Kuperberg, we show that any presentation-independent approximation of WRT is also #P-hard. Second, we sketch out how all of our results can be translated to the setting of triangulations and Turaev-Viro invariants.
1 aAlagic, Gorjan1 aLo, C. uhttps://dl.acm.org/doi/abs/10.5555/3179483.317949102065nas a2200169 4500008004100000245007000041210006900111260001500180520154900195100001601744700001901760700002101779700001801800700001601818700002401834856003701858 2017 eng d00aComplete 3-Qubit Grover Search on a Programmable Quantum Computer0 aComplete 3Qubit Grover Search on a Programmable Quantum Computer c2017/03/303 aSearching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries over classical computers. It is an optimal search algorithm for a quantum computer, and has further applications as a subroutine for other quantum algorithms. Searches with two qubits have been demonstrated on a variety of platforms and proposed for others, but larger search spaces have only been demonstrated on a non-scalable NMR system. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state-marking scheme required to perform a classical search. All quantum solutions are shown to outperform their classical counterparts. We also report the first implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
1 aFiggatt, C.1 aMaslov, Dmitri1 aLandsman, K., A.1 aLinke, N., M.1 aDebnath, S.1 aMonroe, Christopher uhttps://arxiv.org/abs/1703.1053501895nas a2200157 4500008004100000245004900041210004800090260001500138520145500153100001801608700001901626700001801645700002201663700001501685856003701700 2017 eng d00aComputational Notions of Quantum Min-Entropy0 aComputational Notions of Quantum MinEntropy c2017/09/093 aWe initiate the study of computational entropy in the quantum setting. We investigate to what extent the classical notions of computational entropy generalize to the quantum setting, and whether quantum analogues of classical theorems hold. Our main results are as follows. (1) The classical Leakage Chain Rule for pseudoentropy can be extended to the case that the leakage information is quantum (while the source remains classical). Specifically, if the source has pseudoentropy at least k, then it has pseudoentropy at least k − ℓ conditioned on an ℓ- qubit leakage. (2) As an application of the Leakage Chain Rule, we construct the first quantum leakage-resilient stream-cipher in the bounded-quantum-storage model, assuming the existence of a quantum-secure pseudorandom generator. (3) We show that the general form of the classical Dense Model Theorem (interpreted as the equivalence between two definitions of pseudo-relativemin-entropy) does not extend to quantum states. Along the way, we develop quantum analogues of some classical techniques (e.g., the Leakage Simulation Lemma, which is proven by a Nonuniform Min-Max Theorem or Boosting). On the other hand, we also identify some classical techniques (e.g., Gap Amplification) that do not work in the quantum setting. Moreover, we introduce a variety of notions that combine quantum information and quantum complexity, and this raises several directions for future work.
1 aChen, Yi-Hsiu1 aChung, Kai-Min1 aLai, Ching-Yi1 aVadhan, Salil, P.1 aWu, Xiaodi uhttps://arxiv.org/abs/1704.0730901465nas a2200157 4500008004100000245008500041210006900126260001500195300001100210490000700221520098400228100001701212700002501229700001601254856003701270 2017 eng d00aDisorder induced transitions in resonantly driven Floquet Topological Insulators0 aDisorder induced transitions in resonantly driven Floquet Topolo c2017/08/16 a0542070 v963 aWe investigate the effects of disorder in Floquet topological insulators (FTIs) occurring in semiconductor quantum wells. Such FTIs are induced by resonantly driving a transition between the valence and conduction band. We show that when disorder is added, the topological nature of such FTIs persists as long as there is a mobility gap at the resonant quasi-energy. For strong enough disorder, this gap closes and all the states become localized as the system undergoes a transition to a trivial insulator. Interestingly, the effects of disorder are not necessarily adverse: we show that in the same quantum well, disorder can also induce a transition from a trivial to a topological system, thereby establishing a Floquet Topological Anderson Insulator (FTAI). We identify the conditions on the driving field necessary for observing such a transition.
1 aTitum, Paraj1 aLindner, Netanel, H.1 aRefael, Gil uhttps://arxiv.org/abs/1702.0295601386nas a2200145 4500008004100000245006200041210006200103260001500165300001200180490000700192520096400199100002301163700001701186856003701203 2017 eng d00aEfficient simulation of sparse Markovian quantum dynamics0 aEfficient simulation of sparse Markovian quantum dynamics c2017/09/01 a901-9470 v173 aQuantum algorithms for simulating Hamiltonian dynamics have been extensively developed, but there has been much less work on quantum algorithms for simulating the dynamics of open quantum systems. We give the first efficient quantum algorithms for simulating Markovian quantum dynamics generated by Lindbladians that are not necessarily local. We introduce two approaches to simulating sparse Lindbladians. First, we show how to simulate Lindbladians that act within small invariant subspaces using a quantum algorithm to implement sparse Stinespring isometries. Second, we develop a method for simulating sparse Lindblad operators by concatenating a sequence of short-time evolutions. We also show limitations on Lindbladian simulation by proving a no-fast-forwarding theorem for simulating sparse Lindbladians in a black-box model.
1 aChilds, Andrew, M.1 aLi, Tongyang uhttps://arxiv.org/abs/1611.0554301709nas a2200229 4500008004100000245006700041210006700108250000700175260001500182300001400197490000800211520106700219100001601286700001901302700002201321700001601343700001601359700002101375700001501396700002401411856004401435 2017 eng d00aExperimental Comparison of Two Quantum Computing Architectures0 aExperimental Comparison of Two Quantum Computing Architectures a13 c2017/03/21 a3305-33100 v1143 aWe run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device [1] with limited connectivity, and the other is a fully connected trapped-ion system [2]. Even though the two systems have different native quantum interactions, both can be programmed in a way that is blind to the underlying hardware, thus allowing the first comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that employ more connectivity clearly benefit from a better connected system of qubits. While the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that co-designing particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.
1 aLinke, N.M.1 aMaslov, Dmitri1 aRoetteler, Martin1 aDebnath, S.1 aFiggatt, C.1 aLandsman, K., A.1 aWright, K.1 aMonroe, Christopher uhttp://www.pnas.org/content/114/13/330501121nas a2200169 4500008004100000245007000041210006900111260001500180300001100195490000800206520058700214100002200801700001900823700001900842700001700861856007300878 2017 eng d00aExperimental demonstration of cheap and accurate phase estimation0 aExperimental demonstration of cheap and accurate phase estimatio c2017/05/12 a1905020 v1183 aWe demonstrate experimental implementation of robust phase estimation (RPE) to learn the phases of X and Y rotations on a trapped Yb+ ion qubit. We estimate these phases with uncertainties less than 4 · 10−4 radians using as few as 176 total experimental samples per phase, and our estimates exhibit Heisenberg scaling. Unlike standard phase estimation protocols, RPE neither assumes perfect state preparation and measurement, nor requires access to ancillae. We cross-validate the results of RPE with the more resource-intensive protocol of gate set tomography.
1 aRudinger, Kenneth1 aKimmel, Shelby1 aLobser, Daniel1 aMaunz, Peter uhttps://journals.aps.org/prl/abstract/10.1103/PhysRevLett.118.19050201341nas a2200193 4500008004100000245007600041210006900117260001500186300001100201490000800212520075400220100002200974700001800996700002001014700001401034700002001048700001901068856006001087 2017 eng d00aExperimental Study of Optimal Measurements for Quantum State Tomography0 aExperimental Study of Optimal Measurements for Quantum State Tom c2017/10/13 a1504010 v1193 aQuantum tomography is a critically important tool to evaluate quantum hardware, making it essential to develop optimized measurement strategies that are both accurate and efficient. We compare a variety of strategies using nearly pure test states. Those that are informationally complete for all states are found to be accurate and reliable even in the presence of errors in the measurements themselves, while those designed to be complete only for pure states are far more efficient but highly sensitive to such errors. Our results highlight the unavoidable trade-offs inherent in quantum tomography.
1 aSosa-Martinez, H.1 aLysne, N., K.1 aBaldwin, C., H.1 aKalev, A.1 aDeutsch, I., H.1 aJessen, P., S. uhttps://link.aps.org/doi/10.1103/PhysRevLett.119.15040101575nas a2200217 4500008004100000245010100041210006900142260001500211520089600226100002101122700001901143700001801162700001501180700002401195700001901219700001601238700002501254700001801279700002201297856003801319 2017 eng d00aExperimentally Generated Random Numbers Certified by the Impossibility of Superluminal Signaling0 aExperimentally Generated Random Numbers Certified by the Impossi c2017/02/163 aRandom numbers are an important resource for applications such as numerical simulation and secure communication. However, it is difficult to certify whether a physical random number generator is truly unpredictable. Here, we exploit the phenomenon of quantum nonlocality in a loophole-free photonic Bell test experiment for the generation of randomness that cannot be predicted within any physical theory that allows one to make independent measurement choices and prohibits superluminal signaling. To certify and quantify the randomness, we describe a new protocol that performs well in an experimental regime characterized by low violation of Bell inequalities. Applying an extractor function to our data, we obtained 256 new random bits, uniform to within 0.001.
1 aBierhorst, Peter1 aKnill, Emanuel1 aGlancy, Scott1 aMink, Alan1 aJordan, Stephen, P.1 aRommal, Andrea1 aLiu, Yi-Kai1 aChristensen, Bradley1 aNam, Sae, Woo1 aShalm, Lynden, K. uhttps://arxiv.org/abs/1702.05178#01775nas a2200133 4500008004100000245007500041210006900116520134900185100001901534700001601553700001601569700001901585856003701604 2017 eng d00aExponential improvements for quantum-accessible reinforcement learning0 aExponential improvements for quantumaccessible reinforcement lea3 aQuantum computers can offer dramatic improvements over classical devices for data analysis tasks such as prediction and classification. However, less is known about the advantages that quantum computers may bring in the setting of reinforcement learning, where learning is achieved via interaction with a task environment. Here, we consider a special case of reinforcement learning, where the task environment allows quantum access. In addition, we impose certain "naturalness" conditions on the task environment, which rule out the kinds of oracle problems that are studied in quantum query complexity (and for which quantum speedups are well-known). Within this framework of quantum-accessible reinforcement learning environments, we demonstrate that quantum agents can achieve exponential improvements in learning efficiency, surpassing previous results that showed only quadratic improvements. A key step in the proof is to construct task environments that encode well-known oracle problems, such as Simon's problem and Recursive Fourier Sampling, while satisfying the above "naturalness" conditions for reinforcement learning. Our results suggest that quantum agents may perform well in certain game-playing scenarios, where the game has recursive structure, and the agent can learn by playing against itself
1 aDunjko, Vedran1 aLiu, Yi-Kai1 aWu, Xingyao1 aTaylor, J., M. uhttps://arxiv.org/abs/1710.1116002582nas a2200169 4500008004100000245010100041210006900142260001500211520202200226100003302248700001602281700001702297700002402314700002202338700001502360856003702375 2017 eng d00aExponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum Learning0 aExponential Quantum Speedups for Semidefinite Programming with A c2017/10/063 aWe give semidefinite program (SDP) quantum solvers with an exponential speed-up over classical ones. Specifically, we consider SDP instances with m constraint matrices of dimension n, each of rank at most r, and assume that the input matrices of the SDP are given as quantum states (after a suitable normalization). Then we show there is a quantum algorithm that solves the SDP feasibility problem with accuracy ǫ by using √ m log m · poly(log n,r, ǫ −1 ) quantum gates. The dependence on n provides an exponential improvement over the work of Brand ˜ao and Svore [6] and the work of van Apeldoorn et al. [23], and demonstrates an exponential quantum speed-up when m and r are small. We apply the SDP solver to the problem of learning a good description of a quantum state with respect to a set of measurements: Given m measurements and a supply of copies of an unknown state ρ, we show we can find in time √ m log m · poly(log n,r, ǫ −1 ) a description of the state as a quantum circuit preparing a density matrix which has the same expectation values as ρ on the m measurements up to error ǫ. The density matrix obtained is an approximation to the maximum entropy state consistent with the measurement data considered in Jaynes’ principle. As in previous work, we obtain our algorithm by “quantizing” classical SDP solvers based on the matrix multiplicative weight update method. One of our main technical contributions is a quantum Gibbs state sampler for low-rank Hamiltonians with a poly-logarithmic dependence on its dimension based on the techniques developed in quantum principal component analysis, which could be of independent interest. Our quantum SDP solver is different from previous ones in the following two aspects: (1) it follows from a zero-sum game approach of Hazan [11] of solving SDPs rather than the primal-dual approach by Arora and Kale [5]; and (2) it does not rely on any sparsity assumption of the input matrices.
1 aBrandão, Fernando, G. S. L.1 aKalev, Amir1 aLi, Tongyang1 aLin, Cedric, Yen-Yu1 aSvore, Krysta, M.1 aWu, Xiaodi uhttps://arxiv.org/abs/1710.0258101360nas a2200181 4500008004100000022001400041245007000055210006900125260001500194520081800209100001801027700001901045700001801064700001301082700001901095700001601114856004801130 2017 eng d a1871-409900aExtreme learning machines for regression based on V-matrix method0 aExtreme learning machines for regression based on Vmatrix method c2017/06/103 aThis paper studies the joint effect of V-matrix, a recently proposed framework for statistical inferences, and extreme learning machine (ELM) on regression problems. First of all, a novel algorithm is proposed to efficiently evaluate the V-matrix. Secondly, a novel weighted ELM algorithm called V-ELM is proposed based on the explicit kernel mapping of ELM and the V-matrix method. Though V-matrix method could capture the geometrical structure of training data, it tends to assign a higher weight to instance with smaller input value. In order to avoid this bias, a novel method called VI-ELM is proposed by minimizing both the regression error and the V-matrix weighted error simultaneously. Finally, experiment results on 12 real world benchmark datasets show the effectiveness of our proposed methods.
1 aYang, Zhiyong1 aZhang, Taohong1 aLu, Jingcheng1 aSu, Yuan1 aZhang, Dezheng1 aDuan, Yaowu uhttp://dx.doi.org/10.1007/s11571-017-9444-201300nas a2200169 4500008004100000245006300041210006300104260001500167300001100182490000700193520081800200100001401018700002001032700002401052700001701076856003701093 2017 eng d00aFast optimization algorithms and the cosmological constant0 aFast optimization algorithms and the cosmological constant c2017/11/13 a1035120 v963 aDenef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of an NP-hard problem. The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable universe. Here we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10−120 in a randomly generated 109 -dimensional ADK landscape.
1 aBao, Ning1 aBousso, Raphael1 aJordan, Stephen, P.1 aLackey, Brad uhttps://arxiv.org/abs/1706.0850311923nas a2200205 45000080041000002450079000412100069001202600015001893000011002044900007002155201127900222100001911501700002511520700002011545700001711565700002311582700002011605700002311625856006911648 2017 eng d00aGenuine N -partite entanglement without N -partite correlation functions0 aGenuine N partite entanglement without N partite correlation fun c2017/06/26 a0623310 v953 aA genuinely N-partite entangled state may display vanishing N-partite correlations measured for arbitrary local observables. In such states the genuine entanglement is noticeable solely in correlations between subsets of particles. A straightforward way to obtain such states for odd N is to design an “antistate” in which all correlations between an odd number of observers are exactly opposite. Evenly mixing a state with its antistate then produces a mixed state with no N-partite correlations, with many of them genuinely multiparty entangled. Intriguingly, all known examples of “entanglement without correlations” involve an odd number of particles. Here we further develop the idea of antistates, thereby shedding light on the different properties of even and odd particle systems. We conjecture that there is no antistate to any pure even-N-party entangled state making the simple construction scheme unfeasible. However, as we prove by construction, higher-rank examples of entanglement without correlations for arbitrary even N indeed exist. These classes of states exhibit genuine entanglement and even violate an N-partite Bell inequality, clearly demonstrating the nonclassical features of these states as well as showing their applicability for quantum information processing.
1 aTran, Minh, C.1 aZuppardo, Margherita1 ade Rosier, Anna1 aKnips, Lukas1 aLaskowski, Wieslaw1 aPaterek, Tomasz1 aWeinfurter, Harald uhttps://journals.aps.org/pra/abstract/10.1103/PhysRevA.95.06233101826nas a2200169 4500008004100000245005800041210005800099260001500157490000700172520131900179100001901498700002401517700002001541700001701561700002401578856005401602 2017 eng d00aHamiltonian Simulation with Optimal Sample Complexity0 aHamiltonian Simulation with Optimal Sample Complexity c2017/03/310 v133 aWe investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating a coherent superposition of pure states, when given sample access to those states. We also show that this sample-based Hamiltonian simulation can be used as the basis of a universal model of quantum computation that requires only partial swap operations and simple single-qubit states.
A nonlocal game with a synchronous correlation is a natural generalization of a function between two finite sets, and has recently appeared in the context of quantum graph homomorphisms. In this work we examine analogues of Bell's inequalities for synchronous correlations. We show that, unlike general correlations and the CHSH inequality, there can be no quantum Bell violation among synchronous correlations with two measurement settings. However we exhibit explicit analogues of Bell's inequalities for synchronous correlations with three measurement settings and two outputs, provide an analogue of Tsirl'son's bound in this setting, and give explicit quantum correlations that saturate this bound.
1 aLackey, Brad1 aRodrigues, Nishant uhttps://arxiv.org/abs/1707.0620001001nas a2200109 4500008004100000245006100041210006100102260001500163520065900178100001700837856003700854 2017 eng d00aPenalty models for bitstrings of constant Hamming weight0 aPenalty models for bitstrings of constant Hamming weight c2017/04/243 aTo program a quantum annealer, one must construct objective functions whose minima encode hard constraints imposed by the underlying problem. For such "penalty models," one desires the additional property that the gap in the objective value between such minima and states that fail the constraints is maximized amongst the allowable objective functions. In this short note, we prove the standard penalty model for the constraint that a bitstring has given Hamming weight is optimal with respect to objective value gap.
1 aLackey, Brad uhttps://arxiv.org/abs/1704.0729017147nas a2200181 45000080041000002450100000412100069001412600015002103000011002254900007002365201657700243100001316820700002216833700002716855700001916882700002716901856003716928 2017 eng d00aPendular trapping conditions for ultracold polar molecules enforced by external electric fields0 aPendular trapping conditions for ultracold polar molecules enfor c2017/06/26 a0634220 v953 aWe theoretically investigate trapping conditions for ultracold polar molecules in optical lattices, when external magnetic and electric fields are simultaneously applied. Our results are based on an accurate electronic-structure calculation of the polar
We consider a variant of the phase retrieval problem, where vectors are replaced by unitary matrices, i.e., the unknown signal is a unitary matrix U, and the measurements consist of squared inner products |tr(C†U)|2 with unitary matrices C that are chosen by the observer. This problem has applications to quantum process tomography, when the unknown process is a unitary operation. We show that PhaseLift, a convex programming algorithm for phase retrieval, can be adapted to this matrix setting, using measurements that are sampled from unitary 4- and 2-designs. In the case of unitary 4-design measurements, we show that PhaseLift can reconstruct all unitary matrices, using a nearoptimal number of measurements. This extends previous work on PhaseLift using spherical 4-designs. In the case of unitary 2-design measurements, we show that PhaseLift still works pretty well on average: it recovers almost all signals, up to a constant additive error, using a near-optimal number of measurements. These 2-design measurements are convenient for quantum process tomography, as they can be implemented via randomized benchmarking techniques. This is the first positive result on PhaseLift using 2-designs.
1 aKimmel, Shelby1 aLiu, Yi-Kai uhttp://ieeexplore.ieee.org/document/8024414/01598nas a2200241 4500008004100000245005800041210005800099260001500157300001100172490000800183520093100191100001301122700001401135700001801149700001601167700001801183700001801201700001301219700001601232700001401248700002201262856007201284 2017 eng d00aQuantum state tomography via reduced density matrices0 aQuantum state tomography via reduced density matrices c2017/01/09 a0204010 v1183 aQuantum state tomography via local measurements is an efficient tool for characterizing quantum states. However it requires that the original global state be uniquely determined (UD) by its local reduced density matrices (RDMs). In this work we demonstrate for the first time a class of states that are UD by their RDMs under the assumption that the global state is pure, but fail to be UD in the absence of that assumption. This discovery allows us to classify quantum states according to their UD properties, with the requirement that each class be treated distinctly in the practice of simplifying quantum state tomography. Additionally we experimentally test the feasibility and stability of performing quantum state tomography via the measurement of local RDMs for each class. These theoretical and experimental results advance the project of performing efficient and accurate quantum state tomography in practice.
1 aXin, Tao1 aLu, Dawei1 aKlassen, Joel1 aYu, Nengkun1 aJi, Zhengfeng1 aChen, Jianxin1 aMa, Xian1 aLong, Guilu1 aZeng, Bei1 aLaflamme, Raymond uhttp://journals.aps.org/prl/abstract/10.1103/PhysRevLett.118.02040102646nas a2200241 4500008004100000245008200041210006900123260001500192520190700207100002902114700002302143700001802166700002302184700001502207700002002222700002702242700002402269700001902293700002002312700001702332700001802349856003702367 2017 eng d00aOn the readiness of quantum optimization machines for industrial applications0 areadiness of quantum optimization machines for industrial applic c2017/08/313 aThere have been multiple attempts to demonstrate that quantum annealing and, in particular, quantum annealing on quantum annealing machines, has the potential to outperform current classical optimization algorithms implemented on CMOS technologies. The benchmarking of these devices has been controversial. Initially, random spin-glass problems were used, however, these were quickly shown to be not well suited to detect any quantum speedup. Subsequently, benchmarking shifted to carefully crafted synthetic problems designed to highlight the quantum nature of the hardware while (often) ensuring that classical optimization techniques do not perform well on them. Even worse, to date a true sign of improved scaling with the number problem variables remains elusive when compared to classical optimization techniques. Here, we analyze the readiness of quantum annealing machines for real-world application problems. These are typically not random and have an underlying structure that is hard to capture in synthetic benchmarks, thus posing unexpected challenges for optimization techniques, both classical and quantum alike. We present a comprehensive computational scaling analysis of fault diagnosis in digital circuits, considering architectures beyond D-wave quantum annealers. We find that the instances generated from real data in multiplier circuits are harder than other representative random spin-glass benchmarks with a comparable number of variables. Although our results show that transverse-field quantum annealing is outperformed by state-of-the-art classical optimization algorithms, these benchmark instances are hard and small in the size of the input, therefore representing the first industrial application ideally suited for near-term quantum annealers.
1 aPerdomo-Ortiz, Alejandro1 aFeldman, Alexander1 aOzaeta, Asier1 aIsakov, Sergei, V.1 aZhu, Zheng1 aO'Gorman, Bryan1 aKatzgraber, Helmut, G.1 aDiedrich, Alexander1 aNeven, Hartmut1 ade Kleer, Johan1 aLackey, Brad1 aBiswas, Rupak uhttps://arxiv.org/abs/1708.0978002412nas a2200145 4500008004100000245006200041210006100103260001500164300001400179520194800193100002102141700002402162700002202186856005802208 2017 eng d00aSequential measurements, disturbance and property testing0 aSequential measurements disturbance and property testing c2017/01/01 a1598-16113 aWe describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the measurements accepts the state with high probability, and the case that all of the measurements have low probability of acceptance. The measurements cannot simply be tried in sequence, because early measurements may disturb the state being tested. One procedure is based on a variant of Marriott-Watrous amplification. The other procedure is based on the use of a test for this disturbance, which is applied with low probability. We find a number of applications. First, quantum query complexity separations in the property testing model for testing isomorphism of functions under group actions. We give quantum algorithms for testing isomorphism, linear isomorphism and affine isomorphism of boolean functions which use exponentially fewer queries than is possible classically, and a quantum algorithm for testing graph isomorphism which uses polynomially fewer queries than the best algorithm known. Second, testing properties of quantum states and operations. We show that any finite property of quantum states can be tested using a number of copies of the state which is logarithmic in the size of the property, and give a test for genuine multipartite entanglement of states of n qubits that uses O(n) copies of the state. Third, correcting an error in a result of Aaronson on de-Merlinizing quantum protocols. This result claimed that, in any one-way quantum communication protocol where two parties are assisted by an all-powerful but untrusted third party, the third party can be removed with only a modest increase in the communication cost. We give a corrected proof of a key technical lemma required for Aaronson's result.
1 aHarrow, Aram, W.1 aLin, Cedric, Yen-Yu1 aMontanaro, Ashley uhttp://epubs.siam.org/doi/10.1137/1.9781611974782.10502019nas a2200217 4500008004100000245006500041210006300106260001500169300001100184490000600195520137300201100001601574700002501590700002101615700002701636700002601663700001801689700001601707700002301723856005501746 2017 eng d00aSimultaneous, Full Characterization of a Single-Photon State0 aSimultaneous Full Characterization of a SinglePhoton State c2017/11/15 a0410360 v73 aAs 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.
1 aThomay, Tim1 aPolyakov, Sergey, V.1 aGazzano, Olivier1 aGoldschmidt, Elizabeth1 aEldredge, Zachary, D.1 aHuber, Tobias1 aLoo, Vivien1 aSolomon, Glenn, S. uhttps://link.aps.org/doi/10.1103/PhysRevX.7.04103603676nas a2200121 4500008004100000245004100041210004100082260001500123520334200138100002003480700001703500856003703517 2017 eng d00aSubstochastic Monte Carlo Algorithms0 aSubstochastic Monte Carlo Algorithms c2017/04/283 aIn this paper we introduce and formalize Substochastic Monte Carlo (SSMC) algorithms. These algorithms, originally intended to be a better classical foil to quantum annealing than simulated annealing, prove to be worthy optimization algorithms in their own right. In SSMC, a population of walkers is initialized according to a known distribution on an arbitrary search space and varied into the solution of some optimization problem of interest. The first argument of this paper shows how an existing classical algorithm, "Go-With-The-Winners" (GWW), is a limiting case of SSMC when restricted to binary search and particular driving dynamics.
Although limiting to GWW, SSMC is more general. We show that (1) GWW can be efficiently simulated within the SSMC framework, (2) SSMC can be exponentially faster than GWW, (3) by naturally incorporating structural information, SSMC can exponentially outperform the quantum algorithm that first inspired it, and (4) SSMC exhibits desirable search features in general spaces. Our approach combines ideas from genetic algorithms (GWW), theoretical probability (Fleming-Viot processes), and quantum computing. Not only do we demonstrate that SSMC is often more efficient than competing algorithms, but we also hope that our results connecting these disciplines will impact each independently. An implemented version of SSMC has previously enjoyed some success as a competitive optimization algorithm for Max-
Recent work on quantum machine learning has demonstrated that quantum computers can offer dramatic improvements over classical devices for data mining, prediction and classification. However, less is known about the advantages using quantum computers may bring in the more general setting of reinforcement learning, where learning is achieved via interaction with a task environment that provides occasional rewards. Reinforcement learning can incorporate data-analysis-oriented learning settings as special cases, but also includes more complex situations where, e.g., reinforcing feedback is delayed. In a few recent works, Grover-type amplification has been utilized to construct quantum agents that achieve up-to-quadratic improvements in learning efficiency. These encouraging results have left open the key question of whether super-polynomial improvements in learning times are possible for genuine reinforcement learning problems, that is problems that go beyond the other more restricted learning paradigms. In this work, we provide a family of such genuine reinforcement learning tasks. We construct quantum-enhanced learners which learn super-polynomially, and even exponentially faster than any classical reinforcement learning model, and we discuss the potential impact our results may have on future technologies.
1 aDunjko, Vedran1 aLiu, Yi-Kai1 aWu, Xingyao1 aTaylor, J., M. uhttps://arxiv.org/abs/1710.1116001290nas a2200121 4500008004100000245007000041210006900111260001500180520090300195100001701098700001601115856003701131 2017 eng d00aThermodynamic Analysis of Classical and Quantum Search Algorithms0 aThermodynamic Analysis of Classical and Quantum Search Algorithm c2017/09/293 aWe analyze the performance of classical and quantum search algorithms from a thermodynamic perspective, focusing on resources such as time, energy, and memory size. We consider two examples that are relevant to post-quantum cryptography: Grover’s search algorithm, and the quantum algorithm for collisionfinding. Using Bennett’s “Brownian” model of low-power reversible computation, we show classical algorithms that have the same asymptotic energy consumption as these quantum algorithms. Thus, the quantum advantage in query complexity does not imply a reduction in these thermodynamic resource costs. In addition, we present realistic estimates of the resource costs of quantum and classical search, for near-future computing technologies. We find that, if memory is cheap, classical exhaustive search can be surprisingly competitive with Grover’s algorithm.
1 aPerlner, Ray1 aLiu, Yi-Kai uhttps://arxiv.org/abs/1709.1051001333nas a2200169 4500008004100000245008100041210006900122260001500191300001100206490000700217520083100224100002001055700001501075700001701090700001901107856003701126 2017 eng d00aThermodynamic limits for optomechanical systems with conservative potentials0 aThermodynamic limits for optomechanical systems with conservativ c2017/11/13 a1841060 v963 aThe mechanical force from light – radiation pressure – provides an intrinsic nonlinear interaction. Consequently, optomechanical systems near their steady state, such as the canonical optical spring, can display non-analytic behavior as a function of external parameters. This non-analyticity, a key feature of thermodynamic phase transitions, suggests that there could be an effective thermodynamic description of optomechanical systems. Here we explicitly define the thermodynamic limit for optomechanical systems and derive a set of sufficient constraints on the system parameters as the mechanical system grows large. As an example, we show how these constraints can be satisfied in a system with Z2 symmetry and derive a free energy, allowing us to characterize this as an equilibrium phase transition.
1 aRagole, Stephen1 aXu, Haitan1 aLawall, John1 aTaylor, J., M. uhttps://arxiv.org/abs/1707.0577101530nas a2200217 4500008004100000245006000041210006000101260001500161300001100176490000800187520092200195100001501117700001601132700001601148700001101164700001901175700002101194700001901215700001801234856006001252 2017 eng d00aThreshold Dynamics of a Semiconductor Single Atom Maser0 aThreshold Dynamics of a Semiconductor Single Atom Maser c2017/08/31 a0977020 v1193 aWe 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.
1 aLiu, Y.-Y.1 aStehlik, J.1 aEichler, C.1 aMi, X.1 aHartke, T., R.1 aGullans, Michael1 aTaylor, J., M.1 aPetta, J., R. uhttps://link.aps.org/doi/10.1103/PhysRevLett.119.09770201455nas a2200157 4500008004100000245005600041210005600097260001500153300001100168490000700179520101300186100002001199700002401219700001701243856003701260 2016 eng d00aAdiabatic optimization versus diffusion Monte Carlo0 aAdiabatic optimization versus diffusion Monte Carlo c2016/07/12 a0423180 v943 aMost experimental and theoretical studies of adiabatic optimization use stoquastic Hamiltonians, whose ground states are expressible using only real nonnegative amplitudes. This raises a question as to whether classical Monte Carlo methods can simulate stoquastic adiabatic algorithms with polynomial overhead. Here, we analyze diffusion Monte Carlo algorithms. We argue that, based on differences between L1 and L2 normalized states, these algorithms suffer from certain obstructions preventing them from efficiently simulating stoquastic adiabatic evolution in generality. In practice however, we obtain good performance by introducing a method that we call Substochastic Monte Carlo. In fact, our simulations are good classical optimization algorithms in their own right, competitive with the best previously known heuristic solvers for MAX-k-SAT at k=2,3,4.
1 aJarret, Michael1 aJordan, Stephen, P.1 aLackey, Brad uhttps://arxiv.org/abs/1607.0338901705nas a2200121 4500008004100000245005700041210005500098260001500153520133500168100002001503700002401523856003601547 2016 eng d00aA Complete Characterization of Unitary Quantum Space0 aComplete Characterization of Unitary Quantum Space c2016/04/053 aWe give two complete characterizations of unitary quantum space-bounded classes. The first is based on the Matrix Inversion problem for well-conditioned matrices. We show that given the size-n efficient encoding of a 2O(k(n))×2O(k(n)) well-conditioned matrix H, approximating a particular entry of H−1 is complete for the class of problems solvable by a quantum algorithm that uses O(k(n)) space and performs all quantum measurements at the end of the computation. In particular, the problem of computing entries of H−1 for an explicit well-conditioned n×n matrix H is complete for unitary quantum logspace. We then show that the problem of approximating to high precision the least eigenvalue of a positive semidefinite matrix H, encoded as a circuit, gives a second characterization of unitary quantum space complexity. In the process we also establish an equivalence between unitary quantum space-bounded classes and certain QMA proof systems. As consequences, we establish that QMA with exponentially small completeness-soundness gap is equal to PSPACE, that determining whether a local Hamiltonian is frustration-free is PSPACE-complete, and give a provable setting in which the ability to prepare PEPS states gives less computational power than the ability to prepare the ground state of a generic local Hamiltonian.1 aFefferman, Bill1 aLin, Cedric, Yen-Yu uhttp://arxiv.org/abs/1604.0138402040nas a2200193 4500008004100000245007800041210006900119260001500188300001000203490000800213520145000221100001601671700001801687700001601705700002101721700001501742700001501757856007401772 2016 eng d00aDemonstration of a small programmable quantum computer with atomic qubits0 aDemonstration of a small programmable quantum computer with atom c2016/08/04 a63-660 v5363 aQuantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to implement a particular algorithm or execute a limited number of computational paths. Here, we demonstrate a five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates. We compile algorithms into a fully-connected set of gate operations that are native to the hardware and have a mean fidelity of 98 %. Reconfiguring these gate sequences provides the flexibility to implement a variety of algorithms without altering the hardware. As examples, we implement the Deutsch-Jozsa (DJ) and Bernstein-Vazirani (BV) algorithms with average success rates of 95 % and 90 %, respectively. We also perform a coherent quantum Fourier transform (QFT) on five trappedion qubits for phase estimation and period finding with average fidelities of 62 % and 84 %, respectively. This small quantum computer can be scaled to larger numbers of qubits within a single register, and can be further expanded by connecting several such modules through ion shuttling or photonic quantum channels.
1 aDebnath, S.1 aLinke, N., M.1 aFiggatt, C.1 aLandsman, K., A.1 aWright, K.1 aMonroe, C. uhttp://www.nature.com/nature/journal/v536/n7614/full/nature18648.html01662nas a2200217 4500008004100000245004300041210004300084260001500127300001100142490000600153520108300159100001601242700001501258700001601273700001901289700001101308700002101319700001901340700001801359856006701377 2016 eng d00aDouble Quantum Dot Floquet Gain Medium0 aDouble Quantum Dot Floquet Gain Medium c2016/11/07 a0410270 v63 aStrongly 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.
1 aStehlik, J.1 aLiu, Y.-Y.1 aEichler, C.1 aHartke, T., R.1 aMi, X.1 aGullans, Michael1 aTaylor, J., M.1 aPetta, J., R. uhttp://journals.aps.org/prx/abstract/10.1103/PhysRevX.6.04102701280nas a2200205 4500008004100000245005000041210005000091260001500141300001100156490000800167520073000175100002100905700002100926700001300947700001900960700001600979700001800995700002501013856003601038 2016 eng d00aEffective Field Theory for Rydberg Polaritons0 aEffective Field Theory for Rydberg Polaritons c2016/09/09 a1136010 v1173 aWe study non-perturbative effects in N-body scattering of Rydberg polaritons using effective field theory (EFT). We develop an EFT in one dimension and show how a suitably long medium can be used to prepare shallow N-body bound states. We then derive the effective N-body interaction potential for Rydberg polaritons and the associated N-body contact force that arises in the EFT. We use the contact force to find the leading order corrections to the binding energy of the N-body bound states and determine the photon number at which the EFT description breaks down. We find good agreement throughout between the predictions of EFT and numerical simulations of the exact two and three photon wavefunction transmission.
1 aGullans, Michael1 aThompson, J., D.1 aWang, Y.1 aLiang, Q., -Y.1 aVuletic, V.1 aLukin, M., D.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1605.0565101724nas a2200181 4500008004100000245005800041210005800099260001500157520121100172100001801383700001801401700002101419700001601440700001601456700001801472700001501490856003701505 2016 eng d00aExperimental demonstration of quantum fault tolerance0 aExperimental demonstration of quantum fault tolerance c2016/11/213 aQuantum computers will eventually reach a size at which quantum error correction (QEC) becomes imperative. In order to make quantum information robust to errors introduced by qubit imperfections and flawed control operations, QEC protocols encode a logical qubit in multiple physical qubits. This redundancy allows the extraction of error syndromes and the subsequent correction or detection of errors without destroying the logical state itself through direct measurement. While several experiments have shown a reduction of high intrinsic or artificially introduced errors in logical qubits, fault-tolerant encoding of a logical qubit has never been demonstrated. Here we show the encoding and syndrome measurement of a fault-tolerant logical qubit via an error detection protocol on four physical qubits, represented by trapped atomic ions. This demonstrates for the first time the robustness of a fault-tolerant qubit to imperfections in the very operations used to encode it. This advantage persists in the face of large added error rates and experimental calibration errors.
1 aLinke, N., M.1 aGutierrez, M.1 aLandsman, K., A.1 aFiggatt, C.1 aDebnath, S.1 aBrown, K., R.1 aMonroe, C. uhttps://arxiv.org/abs/1611.0694602166nas a2200205 4500008004100000245008500041210006900126260001500195520153900210100001701749700001501766700002101781700002101802700001901823700001901842700001701861700002001878700002401898856003801922 2016 eng d00aMany-body localization in a quantum simulator with programmable random disorder0 aManybody localization in a quantum simulator with programmable r c2016/06/063 aWhen a system thermalizes it loses all local memory of its initial conditions. This is a general feature of open systems and is well described by equilibrium statistical mechanics. Even within a closed (or reversible) quantum system, where unitary time evolution retains all information about its initial state, subsystems can still thermalize using the rest of the system as an effective heat bath. Exceptions to quantum thermalization have been predicted and observed, but typically require inherent symmetries or noninteracting particles in the presence of static disorder. The prediction of many-body localization (MBL), in which disordered quantum systems can fail to thermalize in spite of strong interactions and high excitation energy, was therefore surprising and has attracted considerable theoretical attention. Here we experimentally generate MBL states by applying an Ising Hamiltonian with long-range interactions and programmably random disorder to ten spins initialized far from equilibrium. We observe the essential signatures of MBL: memory retention of the initial state, a Poissonian distribution of energy level spacings, and entanglement growth in the system at long times. Our platform can be scaled to higher numbers of spins, where detailed modeling of MBL becomes impossible due to the complexity of representing such entangled quantum states. Moreover, the high degree of control in our experiment may guide the use of MBL states as potential quantum memories in naturally disordered quantum systems.
1 aSmith, Jacob1 aLee, Aaron1 aRicherme, Philip1 aNeyenhuis, Brian1 aHess, Paul, W.1 aHauke, Philipp1 aHeyl, Markus1 aHuse, David, A.1 aMonroe, Christopher uhttp://arxiv.org/abs/1508.07026v102179nas a2200157 4500008004100000245010300041210006900144520165700213100002001870700001901890700001901909700001701928700002501945700001501970856003601985 2016 eng d00aMapping constrained optimization problems to quantum annealing with application to fault diagnosis0 aMapping constrained optimization problems to quantum annealing w3 aCurrent quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions, and propose two new decomposition algorithms for solving problems too large to map directly into hardware. The mapping technique is locally-structured, as hardware compatible Ising models are generated for each problem constraint, and variables appearing in different constraints are chained together using ferromagnetic couplings. In contrast, global embedding techniques generate a hardware independent Ising model for all the constraints, and then use a minor-embedding algorithm to generate a hardware compatible Ising model. We give an example of a class of CSPs for which the scaling performance of D-Wave's QA hardware using the local mapping technique is significantly better than global embedding. We validate the approach by applying D-Wave's hardware to circuit-based fault-diagnosis. For circuits that embed directly, we find that the hardware is typically able to find all solutions from a min-fault diagnosis set of size N using 1000N samples, using an annealing rate that is 25 times faster than a leading SAT-based sampling method. Further, we apply decomposition algorithms to find min-cardinality faults for circuits that are up to 5 times larger than can be solved directly on current hardware.1 aBian, Zhengbing1 aChudak, Fabian1 aIsrael, Robert1 aLackey, Brad1 aMacready, William, G1 aRoy, Aidan uhttp://arxiv.org/abs/1603.0311103037nas a2200193 4500008004100000245010200041210006900143260001500212300000700227490000600234520240900240100002002649700001902669700002602688700001702714700002502731700001502756856007202771 2016 eng d00aMapping contrained optimization problems to quantum annealing with application to fault diagnosis0 aMapping contrained optimization problems to quantum annealing wi c2016/07/28 a140 v33 aCurrent quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping Boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular, we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model with a fixed sparse set of interactions and propose two new decomposition algorithms for solving problems too large to map directly into hardware. The mapping technique is locally structured, as hardware compatible Ising models are generated for each problem constraint, and variables appearing in different constraints are chained together using ferromagnetic couplings. By contrast, global embedding techniques generate a hardware-independent Ising model for all the constraints, and then use a minor-embedding algorithm to generate a hardware compatible Ising model. We give an example of a class of CSPs for which the scaling performance of the D-Wave hardware using the local mapping technique is significantly better than global embedding. We validate the approach by applying D- Wave’s QA hardware to circuit-based fault diagnosis. For circuits that embed directly, we find that the hardware is typically able to find all solutions from a min-fault diagnosis set of size N using 1000 N samples, using an annealing rate that is 25 times faster than a leading SAT-based sampling method. Furthermore, we apply decomposition algorithms to find min-cardinality faults for circuits that are up to 5 times larger than can be solved directly on current hardware.
1 aBian, Zhengbing1 aChudak, Fabian1 aIsrael, Robert, Brian1 aLackey, Brad1 aMacready, William, G1 aRoy, Aiden uhttp://journal.frontiersin.org/article/10.3389/fict.2016.00014/full02050nas a2200205 4500008004100000245008900041210006900130260001500199520143900214100001801653700001401671700001601685700001401701700001701715700001701732700001801749700002501767700001501792856003701807 2016 eng d00a{O}bservation of {P}rethermalization in {L}ong-{R}ange {I}nteracting {S}pin {C}hains0 aO bservation of P rethermalization in L ong R ange I nteracting c2016/08/023 aStatistical mechanics can predict thermal equilibrium states for most classical systems, but for an isolated quantum system there is no general understanding on how equilibrium states dynamically emerge from the microscopic Hamiltonian. For instance, quantum systems that are near-integrable usually fail to thermalize in an experimentally realistic time scale and, instead, relax to quasi-stationary prethermal states that can be described by statistical mechanics when approximately conserved quantities are appropriately included in a generalized Gibbs ensemble (GGE). Here we experimentally study the relaxation dynamics of a chain of up to 22 spins evolving under a long-range transverse field Ising Hamiltonian following a sudden quench. For sufficiently long-ranged interactions the system relaxes to a new type of prethermal state that retains a strong memory of the initial conditions. In this case, the prethermal state cannot be described by a GGE, but rather arises from an emergent double-well potential felt by the spin excitations. This result shows that prethermalization occurs in a significantly broader context than previously thought, and reveals new challenges for a generic understanding of the thermalization of quantum systems, particularly in the presence of long-range interactions.
1 aNeyenhuis, B.1 aSmith, J.1 aLee, A., C.1 aZhang, J.1 aRicherme, P.1 aHess, P., W.1 aGong, Z., -X.1 aGorshkov, Alexey, V.1 aMonroe, C. uhttps://arxiv.org/abs/1608.0068101645nas a2200205 4500008004100000245008200041210006900123260001500192300001100207490000700218520102200225100001501247700002401262700002101286700001701307700001601324700002701340700001701367856005501384 2016 eng d00aOptimized tomography of continuous variable systems using excitation counting0 aOptimized tomography of continuous variable systems using excita c2016/11/21 a0523270 v943 aWe propose a systematic procedure to optimize quantum state tomography protocols for continuous variable systems based on excitation counting preceded by a displacement operation. Compared with conventional tomography based on Husimi or Wigner function measurement, the excitation counting approach can significantly reduce the number of measurement settings. We investigate both informational completeness and robustness, and provide a bound of reconstruction error involving the condition number of the sensing map. We also identify the measurement settings that optimize this error bound, and demonstrate that the improved reconstruction robustness can lead to an order-of-magnitude reduction of estimation error with given resources. This optimization procedure is general and can incorporate prior information of the unknown state to further simplify the protocol.
1 aShen, Chao1 aHeeres, Reinier, W.1 aReinhold, Philip1 aJiang, Luyao1 aLiu, Yi-Kai1 aSchoelkopf, Robert, J.1 aJiang, Liang uhttp://link.aps.org/doi/10.1103/PhysRevA.94.05232701440nas a2200121 4500008004100000245010100041210006900142260001500211520101600226100002401242700001601266856003601282 2016 eng d00aPerformance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree0 aPerformance of QAOA on Typical Instances of Constraint Satisfact c2016/01/083 aWe consider constraint satisfaction problems of bounded degree, with a good notion of "typicality", e.g. the negation of the variables in each constraint is taken independently at random. Using the quantum approximate optimization algorithm (QAOA), we show that μ+Ω(1/D−−√) fraction of the constraints can be satisfied for typical instances, with the assignment efficiently produced by QAOA. We do so by showing that the averaged fraction of constraints being satisfied is μ+Ω(1/D−−√), with small variance. Here μ is the fraction that would be satisfied by a uniformly random assignment, and D is the number of constraints that each variable can appear. CSPs with typicality include Max-kXOR and Max-kSAT. We point out how it can be applied to determine the typical ground-state energy of some local Hamiltonians. We also give a similar result for instances with "no overlapping constraints", using the quantum algorithm. We sketch how the classical algorithm might achieve some partial result.1 aLin, Cedric, Yen-Yu1 aZhu, Yechao uhttp://arxiv.org/abs/1601.0174401933nas a2200277 4500008004100000245007200041210006900113260001500182300001100197490000700208520116900215100001301384700001901397700001401416700001801430700001401448700002501462700002301487700001701510700001701527700002101544700001801565700001401583700002201597856003601619 2016 eng d00aPure-state tomography with the expectation value of Pauli operators0 aPurestate tomography with the expectation value of Pauli operato c2016/03/31 a0321400 v933 aWe examine the problem of finding the minimum number of Pauli measurements needed to uniquely determine an arbitrary n-qubit pure state among all quantum states. We show that only 11 Pauli measurements are needed to determine an arbitrary two-qubit pure state compared to the full quantum state tomography with 16 measurements, and only 31 Pauli measurements are needed to determine an arbitrary three-qubit pure state compared to the full quantum state tomography with 64 measurements. We demonstrate that our protocol is robust under depolarizing error with simulated random pure states. We experimentally test the protocol on two- and three-qubit systems with nuclear magnetic resonance techniques. We show that the pure state tomography protocol saves us a number of measurements without considerable loss of fidelity. We compare our protocol with same-size sets of randomly selected Pauli operators and find that our selected set of Pauli measurements significantly outperforms those random sampling sets. As a direct application, our scheme can also be used to reduce the number of settings needed for pure-state tomography in quantum optical systems.
1 aMa, Xian1 aJackson, Tyler1 aZhou, Hui1 aChen, Jianxin1 aLu, Dawei1 aMazurek, Michael, D.1 aFisher, Kent, A.G.1 aPeng, Xinhua1 aKribs, David1 aResch, Kevin, J.1 aJi, Zhengfeng1 aZeng, Bei1 aLaflamme, Raymond uhttp://arxiv.org/abs/1601.0537901224nas a2200169 4500008004100000245005300041210005300094260001500147300001100162490000700173520074800180100001800928700002400946700001800970700001900988856004701007 2016 eng d00aQuantifying the coherence of pure quantum states0 aQuantifying the coherence of pure quantum states c2016/10/07 a0423130 v943 aIn recent years, several measures have been proposed for characterizing the coherence of a given quantum state. We derive several results that illuminate how these measures behave when restricted to pure states. Notably, we present an explicit characterization of the closest incoherent state to a given pure state under the trace distance measure of coherence, and we affirm a recent conjecture that the ℓ1 measure of coherence of a pure state is never smaller than its relative entropy of coherence. We then use our result to show that the states maximizing the trace distance of coherence are exactly the maximally coherent states, and we derive a new inequality relating the negativity and distillable entanglement of pure states.
1 aChen, Jianxin1 aJohnston, Nathaniel1 aLi, Chi-Kwong1 aPlosker, Sarah uhttps://doi.org/10.1103/PhysRevA.94.04231300861nas a2200121 4500008004100000245005500041210005500096260001500151520049300166100002000659700002400679856003600703 2016 eng d00aQuantum Merlin Arthur with Exponentially Small Gap0 aQuantum Merlin Arthur with Exponentially Small Gap c2016/01/083 aWe study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we show that a "precise" version of the Local Hamiltonian problem is PSPACE-complete, and give a provable setting in which the ability to prepare PEPS states is not as powerful as the ability to prepare the ground state of general Local Hamiltonians.1 aFefferman, Bill1 aLin, Cedric, Yen-Yu uhttp://arxiv.org/abs/1601.0197501372nas a2200181 4500008004100000245007800041210006900119260001500188300001100203490000800214520084100222100002101063700001601084700001701100700001801117700001901135856003601154 2016 eng d00aSisyphus Thermalization of Photons in a Cavity-Coupled Double Quantum Dot0 aSisyphus Thermalization of Photons in a CavityCoupled Double Qua c2016/07/25 a0568010 v1173 aA strongly driven quantum system, coupled to a thermalizing bath, generically evolves into a highly non-thermal state as the external drive competes with the equilibrating force of the bath. We demonstrate a notable exception to this picture for a microwave resonator interacting with a periodically driven double quantum dot (DQD). In the limit of strong driving and long times, we show that the resonator field can be driven into a thermal state with a chemical potential given by a harmonic of the drive frequency. Such tunable chemical potentials are achievable with current devices and would have broad utility for quantum simulation in circuit quantum electrodynamics. As an example, we show how several DQDs embedded in an array of microwave resonators can induce a phase transition to a Bose-Einstein condensate of light.
1 aGullans, Michael1 aStehlik, J.1 aLiu, Y., -Y.1 aPetta, J., R.1 aTaylor, J., M. uhttp://arxiv.org/abs/1512.0124821161nas a2200205 45000080041000000200022000410220014000632450069000772100068001462600015002143000016002294900007002455202053400252100002020786700002420806700002420830700002220854700002520876856005420901 2016 eng d a978-3-95977-013-2 a1868-896900aSpace-Efficient Error Reduction for Unitary Quantum Computations0 aSpaceEfficient Error Reduction for Unitary Quantum Computations c2016/04/27 a14:1--14:140 v553 aThis paper develops general space-efficient methods for error reduction for unitary quantum computation. Consider a polynomial-time quantum computation with completeness
Inspired by the Elitzur-Vaidman bomb testing problem [arXiv:hep-th/9305002], we introduce a new query complexity model, which we call bomb query complexity $B(f)$. We investigate its relationship with the usual quantum query complexity $Q(f)$, and show that $B(f)=\Theta(Q(f)^2)$. This result gives a new method to upper bound the quantum query complexity: we give a method of finding bomb query algorithms from classical algorithms, which then provide nonconstructive upper bounds on $Q(f)=\Theta(\sqrt{B(f)})$. We subsequently were able to give explicit quantum algorithms matching our upper bound method. We apply this method on the single-source shortest paths problem on unweighted graphs, obtaining an algorithm with $O(n^{1.5})$ quantum query complexity, improving the best known algorithm of $O(n^{1.5}\sqrt{\log n})$ [arXiv:quant-ph/0606127]. Applying this method to the maximum bipartite matching problem gives an $O(n^{1.75})$ algorithm, improving the best known trivial $O(n^2)$ upper bound.
1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan uhttp://theoryofcomputing.org/articles/v012a018/01527nas a2200181 4500008004100000245006900041210006900110260001500179300001100194490000700205520098100212100002001193700002401213700002301237700002201260700002501282856003801307 2015 eng d00aBilayer fractional quantum Hall states with ultracold dysprosium0 aBilayer fractional quantum Hall states with ultracold dysprosium c2015/09/10 a0336090 v923 a We show how dipolar interactions between dysprosium atoms in an optical lattice can be used to obtain fractional quantum Hall states. In our approach, dysprosium atoms are trapped one atom per site in a deep optical lattice with negligible tunneling. Microwave and spatially dependent optical dressing fields are used to define an effective spin-1/2 or spin-1 degree of freedom in each atom. Thinking of spin-1/2 particles as hardcore bosons, dipole-dipole interactions give rise to boson hopping, topological flat bands with Chern number 1, and the \nu = 1/2 Laughlin state. Thinking of spin-1 particles as two-component hardcore bosons, dipole-dipole interactions again give rise to boson hopping, topological flat bands with Chern number 2, and the bilayer Halperin (2,2,1) state. By adjusting the optical fields, we find a phase diagram, in which the (2,2,1) state competes with superfluidity. Generalizations to solid-state magnetic dipoles are discussed. 1 aYao, Norman, Y.1 aBennett, Steven, D.1 aLaumann, Chris, R.1 aLev, Benjamin, L.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1505.03099v101507nas a2200229 4500008004100000245005700041210005700098260001500155300001100170490000800181520087400189100002701063700002101090700001601111700001301127700001501140700002001155700001801175700002101193700002501214856003801239 2015 eng d00aCoulomb bound states of strongly interacting photons0 aCoulomb bound states of strongly interacting photons c2015/09/16 a1236010 v1153 a We show that two photons coupled to Rydberg states via electromagnetically induced transparency can interact via an effective Coulomb potential. This interaction gives rise to a continuum of two-body bound states. Within the continuum, metastable bound states are distinguished in analogy with quasi-bound states tunneling through a potential barrier. We find multiple branches of metastable bound states whose energy spectrum is governed by the Coulomb potential, thus obtaining a photonic analogue of the hydrogen atom. Under certain conditions, the wavefunction resembles that of a diatomic molecule in which the two polaritons are separated by a finite "bond length." These states propagate with a negative group velocity in the medium, allowing for a simple preparation and detection scheme, before they slowly decay to pairs of bound Rydberg atoms. 1 aMaghrebi, Mohammad, F.1 aGullans, Michael1 aBienias, P.1 aChoi, S.1 aMartin, I.1 aFirstenberg, O.1 aLukin, M., D.1 aBüchler, H., P.1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1505.03859v101250nas a2200217 4500008004100000245007700041210006900118260001500187300001100202490000700213520064200220100001800862700001800880700001800898700001900916700001300935700001600948700001400964700001700978856003700995 2015 eng d00aDiscontinuity of Maximum Entropy Inference and Quantum Phase Transitions0 aDiscontinuity of Maximum Entropy Inference and Quantum Phase Tra c2015/08/10 a0830190 v173 a In this paper, we discuss the connection between two genuinely quantum phenomena --- the discontinuity of quantum maximum entropy inference and quantum phase transitions at zero temperature. It is shown that the discontinuity of the maximum entropy inference of local observable measurements signals the non-local type of transitions, where local density matrices of the ground state change smoothly at the transition point. We then propose to use the quantum conditional mutual information of the ground state as an indicator to detect the discontinuity and the non-local type of quantum phase transitions in the thermodynamic limit. 1 aChen, Jianxin1 aJi, Zhengfeng1 aLi, Chi-Kwong1 aPoon, Yiu-Tung1 aShen, Yi1 aYu, Nengkun1 aZeng, Bei1 aZhou, Duanlu uhttp://arxiv.org/abs/1406.5046v202223nas a2200193 4500008004100000245007100041210006900112260001500181300001200196490000800208520166400216100002001880700001901900700002301919700001701942700001601959700001801975856003601993 2015 eng d00aEntangling two transportable neutral atoms via local spin exchange0 aEntangling two transportable neutral atoms via local spin exchan c2015/11/02 a208-2110 v5273 a To advance quantum information science a constant pursuit is the search for physical systems that meet the stringent requirements for creating and preserving quantum entanglement. In atomic physics, robust two-qubit entanglement is typically achieved by strong, long-range interactions in the form of Coulomb interactions between ions or dipolar interactions between Rydberg atoms. While these interactions allow fast gates, atoms subject to these interactions must overcome the associated coupling to the environment and cross-talk among qubits. Local interactions, such as those requiring significant wavefunction overlap, can alleviate these detrimental effects yet present a new challenge: To distribute entanglement, qubits must be transported, merged for interaction, and then isolated for storage and subsequent operations. Here we show how, via a mobile optical tweezer, it is possible to prepare and locally entangle two ultracold neutral atoms, and then separate them while preserving their entanglement. While ultracold neutral atom experiments have measured dynamics consistent with spin entanglement, we are now able to demonstrate two-particle coherence via application of a local gradient and parity measurements; this new entanglement-verification protocol could be applied to arbitrary spin-entangled states of spatially-separated atoms. The local entangling operation is achieved via ultracold spin-exchange interactions, and quantum tunneling is used to combine and separate atoms. Our toolset provides a framework for dynamically entangling remote qubits via local operations within a large-scale quantum register. 1 aKaufman, A., M.1 aLester, B., J.1 aFoss-Feig, Michael1 aWall, M., L.1 aRey, A., M.1 aRegal, C., A. uhttp://arxiv.org/abs/1507.0558601274nas a2200181 4500008004100000245010400041210006900145260001500214300001200229490000800241520071300249100002100962700001500983700002100998700001901019700001701038856003701055 2015 eng d00aFrom membrane-in-the-middle to mirror-in-the-middle with a high-reflectivity sub-wavelength grating0 aFrom membraneinthemiddle to mirrorinthemiddle with a highreflect c2015/01/02 a81 - 880 v5273 aWe demonstrate a "membrane in the middle" optomechanical system using a silicon nitride membrane patterned as a subwavelength grating. The grating has a reflectivity of over 99.8%, effectively creating two sub-cavities, with free spectral ranges of 6 GHz, optically coupled via photon tunneling. Measurements of the transmission and reflection spectra show an avoided crossing where the two sub-cavities simultaneously come into resonance, with a frequency splitting of 54 MHz. We derive expressions for the lineshapes of the symmetric and antisymmetric modes at the avoided crossing, and infer the grating reflection, transmission, absorption, and scattering through comparison with the experimental data. 1 aStambaugh, Corey1 aXu, Haitan1 aKemiktarak, Utku1 aTaylor, J., M.1 aLawall, John uhttp://arxiv.org/abs/1407.1709v101515nas a2200181 4500008004100000245007100041210006900112260001500181300001100196490000700207520099200214100001701206700001601223700002101239700001901260700001801279856003601297 2015 eng d00aInjection Locking of a Semiconductor Double Quantum Dot Micromaser0 aInjection Locking of a Semiconductor Double Quantum Dot Micromas c2015/11/02 a0538020 v923 a Emission linewidth is an important figure of merit for masers and lasers. We recently demonstrated a semiconductor double quantum dot (DQD) micromaser where photons are generated through single electron tunneling events. Charge noise directly couples to the DQD energy levels, resulting in a maser linewidth that is more than 100 times larger than the Schawlow-Townes prediction. Here we demonstrate a linewidth narrowing of more than a factor 10 by locking the DQD emission to a coherent tone that is injected to the input port of the cavity. We measure the injection locking range as a function of cavity input power and show that it is in agreement with the Adler equation. The position and amplitude of distortion sidebands that appear outside of the injection locking range are quantitatively examined. Our results show that this unconventional maser, which is impacted by strong charge noise and electron-phonon coupling, is well described by standard laser models. 1 aLiu, Y., -Y.1 aStehlik, J.1 aGullans, Michael1 aTaylor, J., M.1 aPetta, J., R. uhttp://arxiv.org/abs/1508.0414701704nas a2200169 4500008004100000245006100041210006100102260001500163520120900178100001501387700002101402700001701423700002001440700001701460700001901477856003801496 2015 eng d00aObservation of optomechanical buckling phase transitions0 aObservation of optomechanical buckling phase transitions c2015/10/163 aCorrelated phases of matter provide long-term stability for systems as diverse as solids, magnets, and potential exotic quantum materials. Mechanical systems, such as relays and buckling transition spring switches can yield similar stability by exploiting non-equilibrium phase transitions. Curiously, in the optical domain, observations of such phase transitions remain elusive. However, efforts to integrate optical and mechanical systems -- optomechanics -- suggest that a hybrid approach combining the quantum control of optical systems with the engineerability of mechanical systems may provide a new avenue for such explorations. Here we report the first observation of the buckling of an optomechanical system, in which transitions between stable mechanical states corresponding to both first- and second-order phase transitions are driven by varying laser power and detuning. Our results enable new applications in photonics and, given rapid progress in pushing optomechanical systems into the quantum regime, the potential for explorations of quantum phase transitions.
1 aXu, Haitan1 aKemiktarak, Utku1 aFan, Jingyun1 aRagole, Stephen1 aLawall, John1 aTaylor, J., M. uhttp://arxiv.org/abs/1510.04971v101035nas a2200181 4500008004100000020002200041022001400063245002300077210002300100260001500123300000900138490000700147520060100154100001900755700002400774700001900798856003600817 2015 eng d a978-3-939897-96-5 a1868-896900aOracles with Costs0 aOracles with Costs c2015/02/07 a1-260 v443 a While powerful tools have been developed to analyze quantum query complexity, there are still many natural problems that do not fit neatly into the black box model of oracles. We create a new model that allows multiple oracles with differing costs. This model captures more of the difficulty of certain natural problems. We test this model on a simple problem, Search with Two Oracles, for which we create a quantum algorithm that we prove is asymptotically optimal. We further give some evidence, using a geometric picture of Grover's algorithm, that our algorithm is exactly optimal. 1 aKimmel, Shelby1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan uhttp://arxiv.org/abs/1502.0217401564nas a2200133 4500008004100000245008900041210006900130260001500199300001200214520109500226100001901321700001601340856007401356 2015 eng d00aPhase Retrieval Without Small-Ball Probability Assumptions: Stability and Uniqueness0 aPhase Retrieval Without SmallBall Probability Assumptions Stabil c2015/05/25 a411-4143 aWe study stability and uniqueness for the phase retrieval problem. That is, we ask when is a signal x ∈ R n stably and uniquely determined (up to small perturbations), when one performs phaseless measurements of the form yi = |a T i x| 2 (for i = 1, . . . , N), where the vectors ai ∈ R n are chosen independently at random, with each coordinate aij ∈ R being chosen independently from a fixed sub-Gaussian distribution D. It is well known that for many common choices of D, certain ambiguities can arise that prevent x from being uniquely determined. In this note we show that for any sub-Gaussian distribution D, with no additional assumptions, most vectors x cannot lead to such ambiguities. More precisely, we show stability and uniqueness for all sets of vectors T ⊂ R n which are not too peaky, in the sense that at most a constant fraction of their mass is concentrated on any one coordinate. The number of measurements needed to recover x ∈ T depends on the complexity of T in a natural way, extending previous results of Eldar and Mendelson [12].1 aKrahmer, Felix1 aLiu, Yi-Kai uhttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7148923&tag=101003nas a2200181 4500008004100000245006900041210006800110260001500178300001100193490000800204520048000212100002100692700001700713700001600730700001800746700001900764856003800783 2015 eng d00aPhonon-Assisted Gain in a Semiconductor Double Quantum Dot Maser0 aPhononAssisted Gain in a Semiconductor Double Quantum Dot Maser c2015/05/13 a1968020 v1143 aWe develop a microscopic model for the recently demonstrated double quantum dot (DQD) maser. In characterizing the gain of this device we find that, in addition to the direct stimulated emission of photons, there is a large contribution from the simultaneous emission of a photon and a phonon, i.e., the phonon sideband. We show that this phonon-assisted gain typically dominates the overall gain which leads to masing. Recent experimental data are well fit with our model. 1 aGullans, Michael1 aLiu, Y., -Y.1 aStehlik, J.1 aPetta, J., R.1 aTaylor, J., M. uhttp://arxiv.org/abs/1501.03499v301216nas a2200121 4500008004100000245004700041210004600088260001500134520087400149100001901023700001601042856003601058 2015 eng d00aQuantum Compressed Sensing Using 2-Designs0 aQuantum Compressed Sensing Using 2Designs c2015/10/293 aWe develop a method for quantum process tomography that combines the efficiency of compressed sensing with the robustness of randomized benchmarking. Our method is robust to state preparation and measurement errors, and it achieves a quadratic speedup over conventional tomography when the unknown process is a generic unitary evolution. Our method is based on PhaseLift, a convex programming technique for phase retrieval. We show that this method achieves approximate recovery of almost all signals, using measurements sampled from spherical or unitary 2-designs. This is the first positive result on PhaseLift using 2-designs. We also show that exact recovery of all signals is possible using unitary 4-designs. Previous positive results for PhaseLift required spherical 4-designs, while PhaseLift was known to fail in certain cases when using spherical 2-designs.1 aKimmel, Shelby1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1510.0888701534nas a2200157 4500008004100000245007200041210006900113260001500182300001100197490000700208520106200215100001901277700002001296700002401316856003601340 2015 eng d00aRobust Single-Qubit Process Calibration via Robust Phase Estimation0 aRobust SingleQubit Process Calibration via Robust Phase Estimati c2015/12/08 a0623150 v923 a An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the error in gates and then using controls to correct the implementation. Quantum process tomography is a standard technique for estimating these errors, but is both time consuming, (when one only wants to learn a few key parameters), and requires resources, like perfect state preparation and measurement, that might not be available. With the goal of efficiently estimating specific errors using minimal resources, we develop a parameter estimation technique, which can gauge two key parameters (amplitude and off-resonance errors) in a single-qubit gate with provable robustness and efficiency. In particular, our estimates achieve the optimal efficiency, Heisenberg scaling. Our main theorem making this possible is a robust version of the phase estimation procedure of Higgins et al. [B. L. Higgins, New J. Phys. 11, 073023 (2009)]. 1 aKimmel, Shelby1 aLow, Guang, Hao1 aYoder, Theodore, J. uhttp://arxiv.org/abs/1502.0267701150nas a2200193 4500008004100000245004800041210004800089260001500137300001400152490000800166520063700174100001700811700001600828700001600844700002100860700001900881700001800900856003800918 2015 eng d00aSemiconductor double quantum dot micromaser0 aSemiconductor double quantum dot micromaser c2015/01/15 a285 - 2870 v3473 a 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. 1 aLiu, Y., -Y.1 aStehlik, J.1 aEichler, C.1 aGullans, Michael1 aTaylor, J., M.1 aPetta, J., R. uhttp://arxiv.org/abs/1507.06359v101206nas a2200169 4500008004100000245003600041210003500077260001500112300001200127490000700139520077800146100002100924700001700945700002100962700001800983856003501001 2015 eng d00aTensor network non-zero testing0 aTensor network nonzero testing c2015/07/01 a885-8990 v153 aTensor networks are a central tool in condensed matter physics. In this paper, we initiate the study of tensor network non-zero testing (TNZ): Given a tensor network T, does T represent a non-zero vector? We show that TNZ is not in the Polynomial-Time Hierarchy unless the hierarchy collapses. We next show (among other results) that the special cases of TNZ on non-negative and injective tensor networks are in NP. Using this, we make a simple observation: The commuting variant of the MA-complete stoquastic k-SAT problem on D-dimensional qudits is in NP for logarithmic k and constant D. This reveals the first class of quantum Hamiltonians whose commuting variant is known to be in NP for all (1) logarithmic k, (2) constant D, and (3) for arbitrary interaction graphs.1 aGharibian, Sevag1 aLandau, Zeph1 aShin, Seung, Woo1 aWang, Guoming uhttp://arxiv.org/abs/1406.527902194nas a2200133 4500008004100000245007300041210006800114260001500182520175300197100002301950700002401973700002601997856003702023 2014 eng d00aThe computational power of normalizer circuits over black-box groups0 acomputational power of normalizer circuits over blackbox groups c2014/09/163 a This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems. We show that all these different forms of quantum computation belong to a common new restricted model of quantum operations that we call \emph{black-box normalizer circuits}. To define these, we extend the previous model of normalizer circuits [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208], which are built of quantum Fourier transforms, group automorphism and quadratic phase gates associated to an Abelian group $G$. In previous works, the group $G$ is always given in an explicitly decomposed form. In our model, we remove this assumption and allow $G$ to be a black-box group. While standard normalizer circuits were shown to be efficiently classically simulable [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208], we find that normalizer circuits are powerful enough to factorize and solve classically-hard problems in the black-box setting. We further set upper limits to their computational power by showing that decomposing finite Abelian groups is complete for the associated complexity class. In particular, solving this problem renders black-box normalizer circuits efficiently classically simulable by exploiting the generalized stabilizer formalism in [arXiv:1201.4867v1,arXiv:1210.3637,arXiv:1409.3208]. Lastly, we employ our connection to draw a few practical implications for quantum algorithm design: namely, we give a no-go theorem for finding new quantum algorithms with black-box normalizer circuits, a universality result for low-depth normalizer circuits, and identify two other complete problems. 1 aBermejo-Vega, Juan1 aLin, Cedric, Yen-Yu1 aVan den Nest, Maarten uhttp://arxiv.org/abs/1409.4800v101142nas a2200157 4500008004100000245008300041210006900124260001500193520063900208100002300847700001800870700002400888700001900912700001600931856003700947 2014 eng d00aDifferent Strategies for Optimization Using the Quantum Adiabatic Algorithm 0 aDifferent Strategies for Optimization Using the Quantum Adiabati c2014/01/283 a We present the results of a numerical study, with 20 qubits, of the performance of the Quantum Adiabatic Algorithm on randomly generated instances of MAX 2-SAT with a unique assignment that maximizes the number of satisfied clauses. The probability of obtaining this assignment at the end of the quantum evolution measures the success of the algorithm. Here we report three strategies which consistently increase the success probability for the hardest instances in our ensemble: decreasing the overall evolution time, initializing the system in excited states, and adding a random local Hamiltonian to the middle of the evolution. 1 aCrosson, Elizabeth1 aFarhi, Edward1 aLin, Cedric, Yen-Yu1 aLin, Han-Hsuan1 aShor, Peter uhttp://arxiv.org/abs/1401.7320v101375nas a2200193 4500008004100000245007300041210006900114260002600183300000700209490000600216520073500222100002000957700001900977700001900996700001701015700002501032700001501057856010901072 2014 eng d00aDiscrete optimization using quantum annealing on sparse Ising models0 aDiscrete optimization using quantum annealing on sparse Ising mo bFrontiersc2014/09/01 a560 v23 aThis paper discusses techniques for solving discrete optimization problems using quantum annealing. Practical issues likely to affect the computation include precision limitations, finite temperature, bounded energy range, sparse connectivity, and small numbers of qubits. To address these concerns we propose a way of finding energy representations with large classical gaps between ground and first excited states, efficient algorithms for mapping non-compatible Ising models into the hardware, and the use of decomposition methods for problems that are too large to fit in hardware. We validate the approach by describing experiments with D-Wave quantum hardware for low density parity check decoding with up to 1000 variables.1 aBian, Zhengbing1 aChudak, Fabian1 aIsrael, Robert1 aLackey, Brad1 aMacready, William, G1 aRoy, Aidan uhttps://www.quics.umd.edu/publications/discrete-optimization-using-quantum-annealing-sparse-ising-models01571nas a2200217 4500008004100000245007400041210006900115260001500184300001400199490000800213520093800221100002001159700001901179700002101198700001701219700002301236700002301259700001601282700001801298856003701316 2014 eng d00aHong-Ou-Mandel atom interferometry in tunnel-coupled optical tweezers0 aHongOuMandel atom interferometry in tunnelcoupled optical tweeze c2014/06/26 a306 - 3090 v3453 a The quantum statistics of atoms is typically observed in the behavior of an ensemble via macroscopic observables. However, quantum statistics modifies the behavior of even two particles, inducing remarkable consequences that are at the heart of quantum science. Here we demonstrate near-complete control over all the internal and external degrees of freedom of two laser-cooled 87Rb atoms trapped in two optical tweezers. This full controllability allows us to implement a massive-particle analog of a Hong-Ou-Mandel interferometer where atom tunneling plays the role of a photon beamsplitter. We use the interferometer to probe the effect of quantum statistics on the two-atom dynamics under tunable initial conditions, chosen to adjust the degree of atomic indistinguishability. Our work thereby establishes laser-cooled atoms in optical tweezers as a new route to bottom-up engineering of scalable, low-entropy quantum systems. 1 aKaufman, A., M.1 aLester, B., J.1 aReynolds, C., M.1 aWall, M., L.1 aFoss-Feig, Michael1 aHazzard, K., R. A.1 aRey, A., M.1 aRegal, C., A. uhttp://arxiv.org/abs/1312.7182v201319nas a2200169 4500008004100000245004200041210004100083260001400124490000800138520086500146100001901011700001701030700002101047700002501068700001901093856003701112 2014 eng d00aKitaev chains with long-range pairing0 aKitaev chains with longrange pairing c2014/10/90 v1133 a 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. 1 aVodola, Davide1 aLepori, Luca1 aErcolessi, Elisa1 aGorshkov, Alexey, V.1 aPupillo, Guido uhttp://arxiv.org/abs/1405.5440v202029nas a2200241 4500008004100000245006600041210006500107260001400172490000800186520133800194100002601532700001801558700002301576700001201599700002201611700002101633700002001654700002301674700001201697700002101709700002001730856003701750 2014 eng d00aMany-body dynamics of dipolar molecules in an optical lattice0 aManybody dynamics of dipolar molecules in an optical lattice c2014/11/70 v1133 a Understanding the many-body dynamics of isolated quantum systems is one of the central challenges in modern physics. To this end, the direct experimental realization of strongly correlated quantum systems allows one to gain insights into the emergence of complex phenomena. Such insights enable the development of theoretical tools that broaden our understanding. Here, we theoretically model and experimentally probe with Ramsey spectroscopy the quantum dynamics of disordered, dipolar-interacting, ultracold molecules in a partially filled optical lattice. We report the capability to control the dipolar interaction strength, and we demonstrate that the many-body dynamics extends well beyond a nearest-neighbor or mean-field picture, and cannot be quantitatively described using previously available theoretical tools. We develop a novel cluster expansion technique and demonstrate that our theoretical method accurately captures the measured dependence of the spin dynamics on molecule number and on the dipolar interaction strength. In the spirit of quantum simulation, this agreement simultaneously benchmarks the new theoretical method and verifies our microscopic understanding of the experiment. Our findings pave the way for numerous applications in quantum information science, metrology, and condensed matter physics. 1 aHazzard, Kaden, R. A.1 aGadway, Bryce1 aFoss-Feig, Michael1 aYan, Bo1 aMoses, Steven, A.1 aCovey, Jacob, P.1 aYao, Norman, Y.1 aLukin, Mikhail, D.1 aYe, Jun1 aJin, Deborah, S.1 aRey, Ana, Maria uhttp://arxiv.org/abs/1402.2354v102028nas a2200229 4500008004100000245008700041210006900128260001300197300001400210490000800224520134100232100002101573700001901594700001501613700001901628700001701647700002301664700002501687700002501712700002401737856003701761 2014 eng d00aNon-local propagation of correlations in long-range interacting quantum systems 0 aNonlocal propagation of correlations in longrange interacting qu c2014/7/9 a198 - 2010 v5113 a The maximum speed with which information can propagate in a quantum many-body system directly affects how quickly disparate parts of the system can become correlated and how difficult the system will be to describe numerically. For systems with only short-range interactions, Lieb and Robinson derived a constant-velocity bound that limits correlations to within a linear effective light cone. However, little is known about the propagation speed in systems with long-range interactions, since the best long-range bound is too loose to give the correct light-cone shape for any known spin model and since analytic solutions rarely exist. In this work, we experimentally determine the spatial and time-dependent correlations of a far-from-equilibrium quantum many-body system evolving under a long-range Ising- or XY-model Hamiltonian. For several different interaction ranges, we extract the shape of the light cone and measure the velocity with which correlations propagate through the system. In many cases we find increasing propagation velocities, which violate the Lieb-Robinson prediction, and in one instance cannot be explained by any existing theory. Our results demonstrate that even modestly-sized quantum simulators are well-poised for studying complicated many-body systems that are intractable to classical computation. 1 aRicherme, Philip1 aGong, Zhe-Xuan1 aLee, Aaron1 aSenko, Crystal1 aSmith, Jacob1 aFoss-Feig, Michael1 aMichalakis, Spyridon1 aGorshkov, Alexey, V.1 aMonroe, Christopher uhttp://arxiv.org/abs/1401.5088v102350nas a2200133 4500008004100000245009000041210006900131260001500200520189100215100002302106700002402129700002602153856003702179 2014 eng d00aNormalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems 0 aNormalizer circuits and a GottesmanKnill theorem for infinitedim c2014/09/103 a $\textit{Normalizer circuits}$ [1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems $\mathcal{H}_{d_1}\otimes ... \otimes \mathcal{H}_{d_n}$ with a standard basis labeled by the elements of a finite Abelian group $G=\mathbb{Z}_{d_1}\times... \times \mathbb{Z}_{d_n}$. Normalizer gates implement operations associated with the group $G$ and can be of three types: quantum Fourier transforms, group automorphism gates and quadratic phase gates. In this work, we extend the normalizer formalism [1,2] to infinite dimensions, by allowing normalizer gates to act on systems of the form $\mathcal{H}_\mathbb{Z}^{\otimes a}$: each factor $\mathcal{H}_\mathbb{Z}$ has a standard basis labeled by $\textit{integers}$ $\mathbb{Z}$, and a Fourier basis labeled by $\textit{angles}$, elements of the circle group $\mathbb{T}$. Normalizer circuits become hybrid quantum circuits acting both on continuous- and discrete-variable systems. We show that infinite-dimensional normalizer circuits can be efficiently simulated classically with a generalized $\textit{stabilizer formalism}$ for Hilbert spaces associated with groups of the form $\mathbb{Z}^a\times \mathbb{T}^b \times \mathbb{Z}_{d_1}\times...\times \mathbb{Z}_{d_n}$. We develop new techniques to track stabilizer-groups based on normal forms for group automorphisms and quadratic functions. We use our normal forms to reduce the problem of simulating normalizer circuits to that of finding general solutions of systems of mixed real-integer linear equations [3] and exploit this fact to devise a robust simulation algorithm: the latter remains efficient even in pathological cases where stabilizer groups become infinite, uncountable and non-compact. The techniques developed in this paper might find applications in the study of fault-tolerant quantum computation with superconducting qubits [4,5]. 1 aBermejo-Vega, Juan1 aLin, Cedric, Yen-Yu1 aVan den Nest, Maarten uhttp://arxiv.org/abs/1409.3208v201400nas a2200121 4500008004100000245005500041210005500096260001500151300001200166520104700178100001601225856003701241 2014 eng d00aPrivacy Amplification in the Isolated Qubits Model0 aPrivacy Amplification in the Isolated Qubits Model c2014/10/15 a785-8143 a Isolated qubits are a special class of quantum devices, which can be used to implement tamper-resistant cryptographic hardware such as one-time memories (OTM's). Unfortunately, these OTM constructions leak some information, and standard methods for privacy amplification cannot be applied here, because the adversary has advance knowledge of the hash function that the honest parties will use. In this paper we show a stronger form of privacy amplification that solves this problem, using a fixed hash function that is secure against all possible adversaries in the isolated qubits model. This allows us to construct single-bit OTM's which only leak an exponentially small amount of information. We then study a natural generalization of the isolated qubits model, where the adversary is allowed to perform a polynomially-bounded number of entangling gates, in addition to unbounded local operations and classical communication (LOCC). We show that our technique for privacy amplification is also secure in this setting. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1410.3918v200657nas a2200229 4500008004100000245006300041210006200104300000800166490000800174100001400182700002500196700001600221700001700237700001400254700001900268700001300287700001300300700001000313700001600323700001700339856007100356 2014 eng d00aProbing many-body interactions in an optical lattice clock0 aProbing manybody interactions in an optical lattice clock a3110 v3401 aRey, A, M1 aGorshkov, Alexey, V.1 aKraus, C, V1 aMartin, M, J1 aBishof, M1 aSwallows, M, D1 aZhang, X1 aBenko, C1 aYe, J1 aLemke, N, D1 aLudlow, A, D uhttp://www.sciencedirect.com/science/article/pii/S000349161300254601013nas a2200133 4500008004100000245006000041210006000101260001500161520060100176100002400777700002200801700001900823856003700842 2014 eng d00aQuantum Algorithms for Fermionic Quantum Field Theories0 aQuantum Algorithms for Fermionic Quantum Field Theories c2014/04/283 a Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu model, a theory in two spacetime dimensions with quartic interactions. The algorithm introduces new techniques to meet the additional challenges posed by the characteristics of fermionic fields, and its run time is polynomial in the desired precision and the energy. Thus, it constitutes further progress towards an efficient quantum algorithm for simulating the Standard Model of particle physics. 1 aJordan, Stephen, P.1 aLee, Keith, S. M.1 aPreskill, John uhttp://arxiv.org/abs/1404.7115v101375nas a2200157 4500008004100000245007100041210006900112260001500181300001400196490000700210520089800217100002401115700002201139700001901161856003701180 2014 eng d00aQuantum Computation of Scattering in Scalar Quantum Field Theories0 aQuantum Computation of Scattering in Scalar Quantum Field Theori c2014/09/01 a1014-10800 v143 a Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally, and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great computational complexity and can generally be performed only when the interaction strength is weak. A full understanding of the foundations and rich consequences of quantum field theory remains an outstanding challenge. We develop a quantum algorithm to compute relativistic scattering amplitudes in massive phi-fourth theory in spacetime of four and fewer dimensions. The algorithm runs in a time that is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. Thus, it offers exponential speedup over existing classical methods at high precision or strong coupling. 1 aJordan, Stephen, P.1 aLee, Keith, S. M.1 aPreskill, John uhttp://arxiv.org/abs/1112.4833v101278nas a2200205 4500008004100000245009000041210006900131260001400200490000700214520065300221100001600874700001300890700002000903700002700923700002100950700001800971700002500989700002101014856003701035 2014 eng d00aScattering resonances and bound states for strongly interacting Rydberg polaritons 0 aScattering resonances and bound states for strongly interacting c2014/11/30 v903 a We provide a theoretical framework describing slow-light polaritons interacting via atomic Rydberg states. We use a diagrammatic method to analytically derive the scattering properties of two polaritons. We identify parameter regimes where polariton-polariton interactions are repulsive. Furthermore, in the regime of attractive interactions, we identify multiple two-polariton bound states, calculate their dispersion, and study the resulting scattering resonances. Finally, the two-particle scattering properties allow us to derive the effective low-energy many-body Hamiltonian. This theoretical platform is applicable to ongoing experiments. 1 aBienias, P.1 aChoi, S.1 aFirstenberg, O.1 aMaghrebi, Mohammad, F.1 aGullans, Michael1 aLukin, M., D.1 aGorshkov, Alexey, V.1 aBüchler, H., P. uhttp://arxiv.org/abs/1402.7333v101619nas a2200133 4500008004100000245007600041210006900117260001500186300001000201490001200211520120900223100001601432856003701448 2014 eng d00aSingle-shot security for one-time memories in the isolated qubits model0 aSingleshot security for onetime memories in the isolated qubits c2014/02/01 a19-360 vPart II3 a One-time memories (OTM's) are simple, tamper-resistant cryptographic devices, which can be used to implement sophisticated functionalities such as one-time programs. Can one construct OTM's whose security follows from some physical principle? This is not possible in a fully-classical world, or in a fully-quantum world, but there is evidence that OTM's can be built using "isolated qubits" -- qubits that cannot be entangled, but can be accessed using adaptive sequences of single-qubit measurements. Here we present new constructions for OTM's using isolated qubits, which improve on previous work in several respects: they achieve a stronger "single-shot" security guarantee, which is stated in terms of the (smoothed) min-entropy; they are proven secure against adversaries who can perform arbitrary local operations and classical communication (LOCC); and they are efficiently implementable. These results use Wiesner's idea of conjugate coding, combined with error-correcting codes that approach the capacity of the q-ary symmetric channel, and a high-order entropic uncertainty relation, which was originally developed for cryptography in the bounded quantum storage model. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1402.0049v201304nas a2200169 4500008004100000245009000041210006900131260001400200490000700214520080200221100001501023700001901038700001601057700001201073700001201085856003701097 2014 eng d00aSpin-orbit-coupled topological Fulde-Ferrell states of fermions in a harmonic trap 0 aSpinorbitcoupled topological FuldeFerrell states of fermions in c2014/11/70 v903 a Motivated by recent experimental breakthroughs in generating spin-orbit coupling in ultracold Fermi gases using Raman laser beams, we present a systematic study of spin-orbit-coupled Fermi gases confined in a quasi-one-dimensional trap in the presence of an in-plane Zeeman field (which can be realized using a finite two-photon Raman detuning). We find that a topological Fulde-Ferrell state will emerge, featuring finite-momentum Cooper pairing and zero-energy Majorana excitations localized near the edge of the trap based on the self-consistent Bogoliubov-de Genes (BdG) equations. We find analytically the wavefunctions of the Majorana modes. Finally using the time-dependent BdG we show how the finite-momentum pairing field manifests itself in the expansion dynamics of the atomic cloud. 1 aJiang, Lei1 aTiesinga, Eite1 aLiu, Xia-Ji1 aHu, Hui1 aPu, Han uhttp://arxiv.org/abs/1404.6211v101596nas a2200169 4500008004100000245004400041210004300085260001400128490000700142520114800149100001801297700001801315700001701333700002501350700001401375856003701389 2014 eng d00aSymmetric Extension of Two-Qubit States0 aSymmetric Extension of TwoQubit States c2014/9/170 v903 a Quantum key distribution uses public discussion protocols to establish shared secret keys. In the exploration of ultimate limits to such protocols, the property of symmetric extendibility of underlying bipartite states $\rho_{AB}$ plays an important role. A bipartite state $\rho_{AB}$ is symmetric extendible if there exits a tripartite state $\rho_{ABB'}$, such that the $AB$ marginal state is identical to the $AB'$ marginal state, i.e. $\rho_{AB'}=\rho_{AB}$. For a symmetric extendible state $\rho_{AB}$, the first task of the public discussion protocol is to break this symmetric extendibility. Therefore to characterize all bi-partite quantum states that possess symmetric extensions is of vital importance. We prove a simple analytical formula that a two-qubit state $\rho_{AB}$ admits a symmetric extension if and only if $\tr(\rho_B^2)\geq \tr(\rho_{AB}^2)-4\sqrt{\det{\rho_{AB}}}$. Given the intimate relationship between the symmetric extension problem and the quantum marginal problem, our result also provides the first analytical necessary and sufficient condition for the quantum marginal problem with overlapping marginals. 1 aChen, Jianxin1 aJi, Zhengfeng1 aKribs, David1 aLütkenhaus, Norbert1 aZeng, Bei uhttp://arxiv.org/abs/1310.3530v201306nas a2200145 4500008004100000245011100041210006900152260001300221490000700234520073400241100001600975700001800991700002101009856013001030 2014 eng d00aWhen the asymptotic limit offers no advantage in the local-operations-and-classical-communication paradigm0 aWhen the asymptotic limit offers no advantage in the localoperat c5/9/20140 v893 aWe consider bipartite LOCC, the class of operations implementable by local quantum operations and classical communication between two parties. Surprisingly, there are operations that can be approximated to arbitrary precision but are impossible to implement exactly if only a finite number of messages are exchanged. This significantly complicates the analysis of what can or cannot be approximated with LOCC. Toward alleviating this problem, we exhibit two scenarios in which allowing vanishing error does not help. The first scenario is implementation of projective measurements with product measurement operators. The second scenario is the discrimination of unextendable product bases on two three-dimensional systems.
1 aFu, Honghao1 aLeung, Debbie1 aMancinska, Laura uhttps://www.quics.umd.edu/publications/when-asymptotic-limit-offers-no-advantage-local-operations-and-classical-communication01470nas a2200205 4500008004100000245006500041210006400106260001500170300001400185490000800199520087200207100001701079700002201096700002001118700002101138700002301159700002501182700002001207856003701227 2013 eng d00aAll-Optical Switch and Transistor Gated by One Stored Photon0 aAllOptical Switch and Transistor Gated by One Stored Photon c2013/07/04 a768 - 7700 v3413 a The realization of an all-optical transistor where one 'gate' photon controls a 'source' light beam, is a long-standing goal in optics. By stopping a light pulse in an atomic ensemble contained inside an optical resonator, we realize a device in which one stored gate photon controls the resonator transmission of subsequently applied source photons. A weak gate pulse induces bimodal transmission distribution, corresponding to zero and one gate photons. One stored gate photon produces fivefold source attenuation, and can be retrieved from the atomic ensemble after switching more than one source photon. Without retrieval, one stored gate photon can switch several hundred source photons. With improved storage and retrieval efficiency, our work may enable various new applications, including photonic quantum gates, and deterministic multiphoton entanglement. 1 aChen, Wenlan1 aBeck, Kristin, M.1 aBücker, Robert1 aGullans, Michael1 aLukin, Mikhail, D.1 aTanji-Suzuki, Haruka1 aVuletic, Vladan uhttp://arxiv.org/abs/1401.3194v100504nas a2200169 4500008004100000245005300041210005300094300000700147490000800154100002200162700002300184700001700207700002500224700002300249700002000272856004200292 2013 eng d00aAttractive Photons in a Quantum Nonlinear Medium0 aAttractive Photons in a Quantum Nonlinear Medium a710 v5021 aFirstenberg, Ofer1 aPeyronel, Thibault1 aLiang, Qi-Yu1 aGorshkov, Alexey, V.1 aLukin, Mikhail, D.1 aVuletic, Vladan uhttp://dx.doi.org/10.1038/nature1251201994nas a2200121 4500008004100000245005200041210005100093260001500144300001200159520164800171100001601819856003701835 2013 eng d00aBuilding one-time memories from isolated qubits0 aBuilding onetime memories from isolated qubits c2013/04/18 a269-2863 a One-time memories (OTM's) are simple tamper-resistant cryptographic devices, which can be used to implement one-time programs, a very general form of software protection and program obfuscation. Here we investigate the possibility of building OTM's using quantum mechanical devices. It is known that OTM's cannot exist in a fully-quantum world or in a fully-classical world. Instead, we propose a new model based on "isolated qubits" -- qubits that can only be accessed using local operations and classical communication (LOCC). This model combines a quantum resource (single-qubit measurements) with a classical restriction (on communication between qubits), and can be implemented using current technologies, such as nitrogen vacancy centers in diamond. In this model, we construct OTM's that are information-theoretically secure against one-pass LOCC adversaries that use 2-outcome measurements. Our construction resembles Wiesner's old idea of quantum conjugate coding, implemented using random error-correcting codes; our proof of security uses entropy chaining to bound the supremum of a suitable empirical process. In addition, we conjecture that our random codes can be replaced by some class of efficiently-decodable codes, to get computationally-efficient OTM's that are secure against computationally-bounded LOCC adversaries. In addition, we construct data-hiding states, which allow an LOCC sender to encode an (n-O(1))-bit messsage into n qubits, such that at most half of the message can be extracted by a one-pass LOCC receiver, but the whole message can be extracted by a general quantum receiver. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1304.5007v201262nas a2200193 4500008004100000245009300041210006900134260001400203490000700217520064800224100002200872700002000894700002500914700002000939700002400959700002100983700002701004856003701031 2013 eng d00aControllable quantum spin glasses with magnetic impurities embedded in quantum solids 0 aControllable quantum spin glasses with magnetic impurities embed c2013/7/240 v883 a Magnetic impurities embedded in inert solids can exhibit long coherence times and interact with one another via their intrinsic anisotropic dipolar interaction. We argue that, as a consequence of these properties, disordered ensembles of magnetic impurities provide an effective platform for realizing a controllable, tunable version of the dipolar quantum spin glass seen in LiHo$_x$Y$_{1-x}$F$_4$. Specifically, we propose and analyze a system composed of dysprosium atoms embedded in solid helium. We describe the phase diagram of the system and discuss the realizability and detectability of the quantum spin glass and antiglass phases. 1 aLemeshko, Mikhail1 aYao, Norman, Y.1 aGorshkov, Alexey, V.1 aWeimer, Hendrik1 aBennett, Steven, D.1 aMomose, Takamasa1 aGopalakrishnan, Sarang uhttp://arxiv.org/abs/1307.1130v101243nas a2200181 4500008004100000245012700041210006900168260001400237490000700251520064800258100002100906700001900927700001700946700001500963700002200978700002401000856003701024 2013 eng d00aExperimental Performance of a Quantum Simulator: Optimizing Adiabatic Evolution and Identifying Many-Body Ground States 0 aExperimental Performance of a Quantum Simulator Optimizing Adiab c2013/7/310 v883 a We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of the instantaneous energy gap -- is found to maximize the ground state probability compared with other adiabatic methods while only requiring knowledge of the lowest $\sim N$ of the $2^N$ Hamiltonian eigenvalues. We also demonstrate that the ground state ordering can be experimentally identified as the most probable of all possible spin configurations, even when the evolution is highly non-adiabatic. 1 aRicherme, Philip1 aSenko, Crystal1 aSmith, Jacob1 aLee, Aaron1 aKorenblit, Simcha1 aMonroe, Christopher uhttp://arxiv.org/abs/1305.2253v101336nas a2200169 4500008004100000245006500041210006300106260001300169300001600182490000800198520084400206100002301050700001801073700002101091700001701112856003701129 2013 eng d00aA framework for bounding nonlocality of state discrimination0 aframework for bounding nonlocality of state discrimination c2013/9/4 a1121 - 11530 v3233 a We consider the class of protocols that can be implemented by local quantum operations and classical communication (LOCC) between two parties. In particular, we focus on the task of discriminating a known set of quantum states by LOCC. Building on the work in the paper "Quantum nonlocality without entanglement" [BDF+99], we provide a framework for bounding the amount of nonlocality in a given set of bipartite quantum states in terms of a lower bound on the probability of error in any LOCC discrimination protocol. We apply our framework to an orthonormal product basis known as the domino states and obtain an alternative and simplified proof that quantifies its nonlocality. We generalize this result for similar bases in larger dimensions, as well as the "rotated" domino states, resolving a long-standing open question [BDF+99]. 1 aChilds, Andrew, M.1 aLeung, Debbie1 aMancinska, Laura1 aOzols, Maris uhttp://arxiv.org/abs/1206.5822v100982nas a2200169 4500008004100000245008200041210006900123260001500192300001100207490000700218520047100225100002300696700001800719700002100737700001700758856003700775 2013 eng d00aInterpolatability distinguishes LOCC from separable von Neumann measurements0 aInterpolatability distinguishes LOCC from separable von Neumann c2013/06/25 a1122040 v543 a Local operations with classical communication (LOCC) and separable operations are two classes of quantum operations that play key roles in the study of quantum entanglement. Separable operations are strictly more powerful than LOCC, but no simple explanation of this phenomenon is known. We show that, in the case of von Neumann measurements, the ability to interpolate measurements is an operational principle that sets apart LOCC and separable operations. 1 aChilds, Andrew, M.1 aLeung, Debbie1 aMancinska, Laura1 aOzols, Maris uhttp://arxiv.org/abs/1306.5992v101002nas a2200193 4500008004100000020002200041245005400063210005100117260001500168300001200183490000900195520045300204100002500657700002900682700001900711700002000730700002100750856003700771 2013 eng d a978-3-642-38986-300aAn Introduction to Quantum Programming in Quipper0 aIntroduction to Quantum Programming in Quipper c2013/07/05 a110-1240 v79483 a Quipper is a recently developed programming language for expressing quantum computations. This paper gives a brief tutorial introduction to the language, through a demonstration of how to make use of some of its key features. We illustrate many of Quipper's language features by developing a few well known examples of Quantum computation, including quantum teleportation, the quantum Fourier transform, and a quantum circuit for addition. 1 aGreen, Alexander, S.1 aLumsdaine, Peter, LeFanu1 aRoss, Neil, J.1 aSelinger, Peter1 aValiron, Benoît uhttp://arxiv.org/abs/1304.5485v101523nas a2200181 4500008004100000245009800041210006900139260001500208300001000223520092900233100002101162700002201183700001701205700001601222700002401238700002801262856005101290 2013 eng d00aMultilingual Summarization: Dimensionality Reduction and a Step Towards Optimal Term Coverage0 aMultilingual Summarization Dimensionality Reduction and a Step T c2013/08/09 a55-633 aIn this paper we present three term weighting approaches for multi-lingual document summarization and give results on the DUC 2002 data as well as on the 2013 Multilingual Wikipedia feature articles data set. We introduce a new intervalbounded nonnegative matrix factorization. We use this new method, latent semantic analysis (LSA), and latent Dirichlet allocation (LDA) to give three term-weighting methods for multi-document multi-lingual summarization. Results on DUC and TAC data, as well as on the MultiLing 2013 data, demonstrate that these methods are very promising, since they achieve oracle coverage scores in the range of humans for 6 of the 10 test languages. Finally, we present three term weighting approaches for the MultiLing13 single document summarization task on the Wikipedia featured articles. Our submissions signifi- cantly outperformed the baseline in 19 out of 41 languages. 1 aConroy, John, M.1 aDavis, Sashka, T.1 aKubina, Jeff1 aLiu, Yi-Kai1 aO'Leary, Dianne, P.1 aSchlesinger, Judith, D. uhttp://aclweb.org/anthology/W/W13/W13-3108.pdf01759nas a2200169 4500008004100000245008100041210006900122260001400191490000700205520124300212100002101455700001801476700001901494700002101513700001801534856003701552 2013 eng d00aPreparation of Non-equilibrium Nuclear Spin States in Double Quantum Dots 0 aPreparation of Nonequilibrium Nuclear Spin States in Double Quan c2013/7/150 v883 a We theoretically study the dynamic polarization of lattice nuclear spins in GaAs double quantum dots containing two electrons. In our prior work [Phys. Rev. Lett. 104, 226807 (2010)] we identified three regimes of long-term dynamics, including the build up of a large difference in the Overhauser fields across the dots, the saturation of the nuclear polarization process associated with formation of so-called "dark states," and the elimination of the difference field. In particular, when the dots are different sizes we found that the Overhauser field becomes larger in the smaller dot. Here we present a detailed theoretical analysis of these problems including a model of the polarization dynamics and the development of a new numerical method to efficiently simulate semiclassical central-spin problems. When nuclear spin noise is included, the results agree with our prior work indicating that large difference fields and dark states are stable configurations, while the elimination of the difference field is unstable; however, in the absence of noise we find all three steady states are achieved depending on parameters. These results are in good agreement with dynamic nuclear polarization experiments in double quantum dots. 1 aGullans, Michael1 aKrich, J., J.1 aTaylor, J., M.1 aHalperin, B., I.1 aLukin, M., D. uhttp://arxiv.org/abs/1212.6953v301289nas a2200205 4500008004100000245007500041210006900116260001300185490000800198520067800206100002100884700001900905700002200924700001700946700001500963700001900978700002500997700002401022856003701046 2013 eng d00aQuantum Catalysis of Magnetic Phase Transitions in a Quantum Simulator0 aQuantum Catalysis of Magnetic Phase Transitions in a Quantum Sim c2013/9/50 v1113 a We control quantum fluctuations to create the ground state magnetic phases of a classical Ising model with a tunable longitudinal magnetic field using a system of 6 to 10 atomic ion spins. Due to the long-range Ising interactions, the various ground state spin configurations are separated by multiple first-order phase transitions, which in our zero temperature system cannot be driven by thermal fluctuations. We instead use a transverse magnetic field as a quantum catalyst to observe the first steps of the complete fractal devil's staircase, which emerges in the thermodynamic limit and can be mapped to a large number of many-body and energy-optimization problems. 1 aRicherme, Philip1 aSenko, Crystal1 aKorenblit, Simcha1 aSmith, Jacob1 aLee, Aaron1 aIslam, Rajibul1 aCampbell, Wesley, C.1 aMonroe, Christopher uhttp://arxiv.org/abs/1303.6983v201995nas a2200205 4500008004100000245005100041210005100092260001300143490000700156520142000163100002001583700001901603700002301622700002401645700001801669700002301687700001701710700002501727856003701752 2013 eng d00aQuantum Logic between Remote Quantum Registers0 aQuantum Logic between Remote Quantum Registers c2013/2/60 v873 a We analyze two approaches to quantum state transfer in solid-state spin systems. First, we consider unpolarized spin-chains and extend previous analysis to various experimentally relevant imperfections, including quenched disorder, dynamical decoherence, and uncompensated long range coupling. In finite-length chains, the interplay between disorder-induced localization and decoherence yields a natural optimal channel fidelity, which we calculate. Long-range dipolar couplings induce a finite intrinsic lifetime for the mediating eigenmode; extensive numerical simulations of dipolar chains of lengths up to L=12 show remarkably high fidelity despite these decay processes. We further consider the extension of the protocol to bosonic systems of coupled oscillators. Second, we introduce a quantum mirror based architecture for universal quantum computing which exploits all of the spins in the system as potential qubits. While this dramatically increases the number of qubits available, the composite operations required to manipulate "dark" spin qubits significantly raise the error threshold for robust operation. Finally, as an example, we demonstrate that eigenmode-mediated state transfer can enable robust long-range logic between spatially separated Nitrogen-Vacancy registers in diamond; numerical simulations confirm that high fidelity gates are achievable even in the presence of moderate disorder. 1 aYao, Norman, Y.1 aGong, Zhe-Xuan1 aLaumann, Chris, R.1 aBennett, Steven, D.1 aDuan, L., -M.1 aLukin, Mikhail, D.1 aJiang, Liang1 aGorshkov, Alexey, V. uhttp://arxiv.org/abs/1206.0014v100562nas a2200193 4500008004100000245005900041210005800100300000700158490000700165100001900172700001600191700001600207700001700223700001500240700002500255700001900280700001200299856005700311 2013 eng d00aQuantum Nonlinear Optics: Strongly Interacting Photons0 aQuantum Nonlinear Optics Strongly Interacting Photons a480 v241 aFirstenberg, O1 aLukin, M, D1 aPeyronel, T1 aLiang, Q, -Y1 aVuletic, V1 aGorshkov, Alexey, V.1 aHofferberth, S1 aPohl, T uhttp://www.osa-opn.org/abstract.cfm?URI=opn-24-12-4801302nas a2200181 4500008004100000245005300041210005200094260001500146300001200161490000700173520078900180100002500969700002900994700001901023700002001042700002101062856003701083 2013 eng d00aQuipper: A Scalable Quantum Programming Language0 aQuipper A Scalable Quantum Programming Language c2013/06/23 a333-3420 v483 aThe field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.
1 aGreen, Alexander, S.1 aLumsdaine, Peter, LeFanu1 aRoss, Neil, J.1 aSelinger, Peter1 aValiron, Benoît uhttp://arxiv.org/abs/1304.3390v101351nas a2200181 4500008004100000245006100041210006100102260001400163490000800177520081800185100002001003700002501023700002301048700002601071700001201097700002301109856003701132 2013 eng d00aRealizing Fractional Chern Insulators with Dipolar Spins0 aRealizing Fractional Chern Insulators with Dipolar Spins c2013/4/290 v1103 a Strongly correlated quantum systems can exhibit exotic behavior controlled by topology. We predict that the \nu=1/2 fractional Chern insulator arises naturally in a two-dimensional array of driven, dipolar-interacting spins. As a specific implementation, we analyze how to prepare and detect synthetic gauge potentials for the rotational excitations of ultra-cold polar molecules trapped in a deep optical lattice. While the orbital motion of the molecules is pinned, at finite densities, the rotational excitations form a fractional Chern insulator. We present a detailed experimental blueprint for KRb, and demonstrate that the energetics are consistent with near-term capabilities. Prospects for the realization of such phases in solid-state dipolar systems are discussed as are their possible applications. 1 aYao, Norman, Y.1 aGorshkov, Alexey, V.1 aLaumann, Chris, R.1 aLäuchli, Andreas, M.1 aYe, Jun1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1212.4839v101080nas a2200193 4500008004100000245003200041210002800073260001400101490000800115520060900123100001600732700001300748700001900761700001900780700001100799700002000810700001900830856003700849 2013 eng d00aThe Resonant Exchange Qubit0 aResonant Exchange Qubit c2013/7/310 v1113 aWe introduce a solid-state qubit in which exchange interactions among confined electrons provide both the static longitudinal field and the oscillatory transverse field, allowing rapid and full qubit control via rf gate-voltage pulses. We demonstrate two-axis control at a detuning sweet-spot, where leakage due to hyperfine coupling is suppressed by the large exchange gap. A {\pi}/2-gate time of 2.5 ns and a coherence time of 19 {\mu}s, using multi-pulse echo, are also demonstrated. Model calculations that include effects of hyperfine noise are in excellent quantitative agreement with experiment. 1 aMedford, J.1 aBeil, J.1 aTaylor, J., M.1 aRashba, E., I.1 aLu, H.1 aGossard, A., C.1 aMarcus, C., M. uhttp://arxiv.org/abs/1304.3413v201244nas a2200241 4500008004100000245008400041210006900125260001300194300001400207490000600221520055700227100001600784700001300800700001900813700002100832700002000853700001900873700002300892700001100915700002000926700001900946856003700965 2013 eng d00aSelf-Consistent Measurement and State Tomography of an Exchange-Only Spin Qubit0 aSelfConsistent Measurement and State Tomography of an ExchangeOn c2013/9/1 a654 - 6590 v83 aWe report initialization, complete electrical control, and single-shot readout of an exchange-only spin qubit. Full control via the exchange interaction is fast, yielding a demonstrated 75 qubit rotations in under 2 ns. Measurement and state tomography are performed using a maximum-likelihood estimator method, allowing decoherence, leakage out of the qubit state space, and measurement fidelity to be quantified. The methods developed here are generally applicable to systems with state leakage, noisy measurements, and non-orthogonal control axes. 1 aMedford, J.1 aBeil, J.1 aTaylor, J., M.1 aBartlett, S., D.1 aDoherty, A., C.1 aRashba, E., I.1 aDiVincenzo, D., P.1 aLu, H.1 aGossard, A., C.1 aMarcus, C., M. uhttp://arxiv.org/abs/1302.1933v101034nas a2200169 4500008004100000245005800041210005700099260001500156490000800171520053900179100002100718700001800739700002300757700002900780700001800809856003700827 2013 eng d00aSingle-photon nonlinear optics with graphene plasmons0 aSinglephoton nonlinear optics with graphene plasmons c2013/12/110 v1113 a We show that it is possible to realize significant nonlinear optical interactions at the few photon level in graphene nanostructures. Our approach takes advantage of the electric field enhancement associated with the strong confinement of graphene plasmons and the large intrinsic nonlinearity of graphene. Such a system could provide a powerful platform for quantum nonlinear optical control of light. As an example, we consider an integrated optical device that exploits this large nonlinearity to realize a single photon switch. 1 aGullans, Michael1 aChang, D., E.1 aKoppens, F., H. L.1 ade Abajo, F., J. García1 aLukin, M., D. uhttp://arxiv.org/abs/1309.2651v301428nas a2200193 4500008004100000245006800041210006700109260001300176490000800189520085100197100002401048700002501072700002201097700002201119700001801141700001901159700001901178856003701197 2013 eng d00aSpinor dynamics in an antiferromagnetic spin-1 thermal Bose gas0 aSpinor dynamics in an antiferromagnetic spin1 thermal Bose gas c2013/7/90 v1113 a We present experimental observations of coherent spin-population oscillations in a cold thermal, Bose gas of spin-1 sodium-23 atoms. The population oscillations in a multi-spatial-mode thermal gas have the same behavior as those observed in a single-spatial-mode antiferromagnetic spinor Bose Einstein condensate. We demonstrate this by showing that the two situations are described by the same dynamical equations, with a factor of two change in the spin-dependent interaction coefficient, which results from the change to particles with distinguishable momentum states in the thermal gas. We compare this theory to the measured spin population evolution after times up to a few hundreds of ms, finding quantitative agreement with the amplitude and period. We also measure the damping time of the oscillations as a function of magnetic field. 1 aPechkis, Hyewon, K.1 aWrubel, Jonathan, P.1 aSchwettmann, Arne1 aGriffin, Paul, F.1 aBarnett, Ryan1 aTiesinga, Eite1 aLett, Paul, D. uhttp://arxiv.org/abs/1306.4255v100882nas a2200157 4500008004100000245004900041210004700090260001400137490000700151520044900158100002200607700002400629700001600653700001800669856003700687 2013 eng d00aTesting quantum expanders is co-QMA-complete0 aTesting quantum expanders is coQMAcomplete c2013/4/150 v873 a A quantum expander is a unital quantum channel that is rapidly mixing, has only a few Kraus operators, and can be implemented efficiently on a quantum computer. We consider the problem of estimating the mixing time (i.e., the spectral gap) of a quantum expander. We show that this problem is co-QMA-complete. This has applications to testing randomized constructions of quantum expanders, and studying thermalization of open quantum systems. 1 aBookatz, Adam, D.1 aJordan, Stephen, P.1 aLiu, Yi-Kai1 aWocjan, Pawel uhttp://arxiv.org/abs/1210.0787v201443nas a2200217 4500008004100000245007500041210006900116260001400185300000900199490000600208520080900214100002001023700002301043700002501066700002001091700001701111700001901128700001801147700002301165856003701188 2013 eng d00aTopologically Protected Quantum State Transfer in a Chiral Spin Liquid0 aTopologically Protected Quantum State Transfer in a Chiral Spin c2013/3/12 a15850 v43 a Topology plays a central role in ensuring the robustness of a wide variety of physical phenomena. Notable examples range from the robust current carrying edge states associated with the quantum Hall and the quantum spin Hall effects to proposals involving topologically protected quantum memory and quantum logic operations. Here, we propose and analyze a topologically protected channel for the transfer of quantum states between remote quantum nodes. In our approach, state transfer is mediated by the edge mode of a chiral spin liquid. We demonstrate that the proposed method is intrinsically robust to realistic imperfections associated with disorder and decoherence. Possible experimental implementations and applications to the detection and characterization of spin liquid phases are discussed. 1 aYao, Norman, Y.1 aLaumann, Chris, R.1 aGorshkov, Alexey, V.1 aWeimer, Hendrik1 aJiang, Liang1 aCirac, Ignacio1 aZoller, Peter1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1110.3788v101295nas a2200145 4500008004100000245005300041210005000094260002500144300001600169490000700185520083300192100002001025700001701045856008701062 2012 eng d00aOn Galilean connections and the first jet bundle0 aGalilean connections and the first jet bundle bSpringerc2012/10/01 a1889–18950 v103 aWe see how the first jet bundle of curves into affine space can be realized as a homogeneous space of the Galilean group. Cartan connections with this model are precisely the geometric structure of second-order ordinary differential equations under time-preserving transformations — sometimes called KCC-theory. With certain regularity conditions, we show that any such Cartan connection induces “laboratory” coordinate systems, and the geodesic equations in this coordinates form a system of second-order ordinary differential equations. We then show the converse — the “fundamental theorem” — that given such a coordinate system, and a system of second order ordinary differential equations, there exists regular Cartan connections yielding these, and such connections are completely determined by their torsion.1 aDE Grant, James1 aLackey, Brad uhttps://www.quics.umd.edu/publications/galilean-connections-and-first-jet-bundle-001154nas a2200205 4500008004100000245004700041210004700088260001400135490000800149520061400157100002100771700001500792700001800807700001400825700002100839700001800860700001500878700001800893856003700911 2012 eng d00aNanoplasmonic Lattices for Ultracold atoms0 aNanoplasmonic Lattices for Ultracold atoms c2012/12/60 v1093 a We propose to use sub-wavelength confinement of light associated with the near field of plasmonic systems to create nanoscale optical lattices for ultracold atoms. Our approach combines the unique coherence properties of isolated atoms with the sub-wavelength manipulation and strong light-matter interaction associated with nano-plasmonic systems. It allows one to considerably increase the energy scales in the realization of Hubbard models and to engineer effective long-range interactions in coherent and dissipative many-body dynamics. Realistic imperfections and potential applications are discussed. 1 aGullans, Michael1 aTiecke, T.1 aChang, D., E.1 aFeist, J.1 aThompson, J., D.1 aCirac, J., I.1 aZoller, P.1 aLukin, M., D. uhttp://arxiv.org/abs/1208.6293v301068nas a2200157 4500008004100000245005000041210005000091260001500141300001600156490000800172520062800180100002400808700002200832700001900854856003700873 2012 eng d00aQuantum Algorithms for Quantum Field Theories0 aQuantum Algorithms for Quantum Field Theories c2012/05/31 a1130 - 11330 v3363 a Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory with quartic self-interactions (phi-fourth theory) in spacetime of four and fewer dimensions. Its run time is polynomial in the number of particles, their energy, and the desired precision, and applies at both weak and strong coupling. In the strong-coupling and high-precision regimes, our quantum algorithm achieves exponential speedup over the fastest known classical algorithm. 1 aJordan, Stephen, P.1 aLee, Keith, S. M.1 aPreskill, John uhttp://arxiv.org/abs/1111.3633v200654nas a2200193 4500008004100000245008700041210006900128300000700197490000800204100002300212700002200235700001700257700002700274700002500301700001700326700002300343700002000366856007400386 2012 eng d00aQuantum nonlinear optics with single photons enabled by strongly interacting atoms0 aQuantum nonlinear optics with single photons enabled by strongly a570 v4881 aPeyronel, Thibault1 aFirstenberg, Ofer1 aLiang, Qi-Yu1 aHofferberth, Sebastian1 aGorshkov, Alexey, V.1 aPohl, Thomas1 aLukin, Mikhail, D.1 aVuletic, Vladan uhttp://www.nature.com/nature/journal/v488/n7409/full/nature11361.html01417nas a2200253 4500008004100000245008300041210006900124260001500193300001100208490000700219520068500226100002200911700001600933700002300949700001900972700002300991700001901014700001801033700001701051700001801068700001601086700002401102856003701126 2012 eng d00aQuantum Simulation of Spin Models on an Arbitrary Lattice with Trapped Ions 0 aQuantum Simulation of Spin Models on an Arbitrary Lattice with T c2012/09/27 a0950240 v143 a 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. 1 aKorenblit, Simcha1 aKafri, Dvir1 aCampbell, Wess, C.1 aIslam, Rajibul1 aEdwards, Emily, E.1 aGong, Zhe-Xuan1 aLin, Guin-Dar1 aDuan, Luming1 aKim, Jungsang1 aKim, Kihwan1 aMonroe, Christopher uhttp://arxiv.org/abs/1201.0776v102431nas a2200169 4500008004100000245010800041210006900149260001500218300001100233490000700244520189900251100002402150700001702174700001602191700001702207856003702224 2012 eng d00aQuantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators 0 aQuantum Tomography via Compressed Sensing Error Bounds Sample Co c2012/09/27 a0950220 v143 a Intuitively, if a density operator has small rank, then it should be easier to estimate from experimental data, since in this case only a few eigenvectors need to be learned. We prove two complementary results that confirm this intuition. First, we show that a low-rank density matrix can be estimated using fewer copies of the state, i.e., the sample complexity of tomography decreases with the rank. Second, we show that unknown low-rank states can be reconstructed from an incomplete set of measurements, using techniques from compressed sensing and matrix completion. These techniques use simple Pauli measurements, and their output can be certified without making any assumptions about the unknown state. We give a new theoretical analysis of compressed tomography, based on the restricted isometry property (RIP) for low-rank matrices. Using these tools, we obtain near-optimal error bounds, for the realistic situation where the data contains noise due to finite statistics, and the density matrix is full-rank with decaying eigenvalues. We also obtain upper-bounds on the sample complexity of compressed tomography, and almost-matching lower bounds on the sample complexity of any procedure using adaptive sequences of Pauli measurements. Using numerical simulations, we compare the performance of two compressed sensing estimators with standard maximum-likelihood estimation (MLE). We find that, given comparable experimental resources, the compressed sensing estimators consistently produce higher-fidelity state reconstructions than MLE. In addition, the use of an incomplete set of measurements leads to faster classical processing with no loss of accuracy. Finally, we show how to certify the accuracy of a low rank estimate using direct fidelity estimation and we describe a method for compressed quantum process tomography that works for processes with small Kraus rank. 1 aFlammia, Steven, T.1 aGross, David1 aLiu, Yi-Kai1 aEisert, Jens uhttp://arxiv.org/abs/1205.2300v200674nas a2200193 4500008004100000245006100041210005900102260001500161520012900176100001700305700001900322700001800341700001700359700001600376700001600392700001800408700001700426856003700443 2012 eng d00aReply to Comment on "Space-Time Crystals of Trapped Ions0 aReply to Comment on SpaceTime Crystals of Trapped Ions c2012/10/153 a This is a reply to the comment from Patrick Bruno (arXiv:1211.4792) on our paper (Phys. Rev. Lett. 109, 163001 (2012)). 1 aLi, Tongcang1 aGong, Zhe-Xuan1 aYin, Zhang-qi1 aQuan, H., T.1 aYin, Xiaobo1 aZhang, Peng1 aDuan, L., -M.1 aZhang, Xiang uhttp://arxiv.org/abs/1212.6959v201927nas a2200205 4500008004100000245009400041210006900135260001400204300000800218490000600226520130900232100002001541700001701561700002501578700002201603700001701625700001901642700002301661856003701684 2012 eng d00aScalable Architecture for a Room Temperature Solid-State Quantum Information Processor 0 aScalable Architecture for a Room Temperature SolidState Quantum c2012/4/24 a8000 v33 a The realization of a scalable quantum information processor has emerged over the past decade as one of the central challenges at the interface of fundamental science and engineering. Much progress has been made towards this goal. Indeed, quantum operations have been demonstrated on several trapped ion qubits, and other solid-state systems are approaching similar levels of control. Extending these techniques to achieve fault-tolerant operations in larger systems with more qubits remains an extremely challenging goal, in part, due to the substantial technical complexity of current implementations. Here, we propose and analyze an architecture for a scalable, solid-state quantum information processor capable of operating at or near room temperature. The architecture is applicable to realistic conditions, which include disorder and relevant decoherence mechanisms, and includes a hierarchy of control at successive length scales. Our approach is based upon recent experimental advances involving Nitrogen-Vacancy color centers in diamond and will provide fundamental insights into the physics of non-equilibrium many-body quantum systems. Additionally, the proposed architecture may greatly alleviate the stringent constraints, currently limiting the realization of scalable quantum processors. 1 aYao, Norman, Y.1 aJiang, Liang1 aGorshkov, Alexey, V.1 aMaurer, Peter, C.1 aGiedke, Geza1 aCirac, Ignacio1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1012.2864v101472nas a2200217 4500008004100000245004000041210003900081260001500120300001100135490000800146520090500154100001701059700001901076700001801095700001701113700001601130700001601146700001601162700001701178856005901195 2012 eng d00aSpace-Time Crystals of Trapped Ions0 aSpaceTime Crystals of Trapped Ions c2012/10/19 a1630010 v1093 aSpontaneous symmetry breaking can lead to the formation of time crystals, as well as spatial crystals. Here we propose a space-time crystal of trapped ions and a method to realize it experimentally by confining ions in a ring-shaped trapping potential with a static magnetic field. The ions spontaneously form a spatial ring crystal due to Coulomb repulsion. This ion crystal can rotate persistently at the lowest quantum energy state in magnetic fields with fractional fluxes. The persistent rotation of trapped ions produces the temporal order, leading to the formation of a space-time crystal. We show that these space-time crystals are robust for direct experimental observation. We also study the effects of finite temperatures on the persistent rotation. The proposed space-time crystals of trapped ions provide a new dimension for exploring many-body physics and emerging properties of matter.1 aLi, Tongcang1 aGong, Zhe-Xuan1 aYin, Zhang-Qi1 aQuan, H., T.1 aYin, Xiaobo1 aZhang, Peng1 aDuan, L.-M.1 aZhang, Xiang uhttp://link.aps.org/doi/10.1103/PhysRevLett.109.16300101932nas a2200169 4500008004100000245005700041210005500098260001500153300001200168520144400180100002701624700002101651700001601672700002101688700001601709856003701725 2012 eng d00aA Spectral Algorithm for Latent Dirichlet Allocation0 aSpectral Algorithm for Latent Dirichlet Allocation c2012/04/30 a193-2143 a The problem of topic modeling can be seen as a generalization of the clustering problem, in that it posits that observations are generated due to multiple latent factors (e.g., the words in each document are generated as a mixture of several active topics, as opposed to just one). This increased representational power comes at the cost of a more challenging unsupervised learning problem of estimating the topic probability vectors (the distributions over words for each topic), when only the words are observed and the corresponding topics are hidden. We provide a simple and efficient learning procedure that is guaranteed to recover the parameters for a wide class of mixture models, including the popular latent Dirichlet allocation (LDA) model. For LDA, the procedure correctly recovers both the topic probability vectors and the prior over the topics, using only trigram statistics (i.e., third order moments, which may be estimated with documents containing just three words). The method, termed Excess Correlation Analysis (ECA), is based on a spectral decomposition of low order moments (third and fourth order) via two singular value decompositions (SVDs). Moreover, the algorithm is scalable since the SVD operations are carried out on $k\times k$ matrices, where $k$ is the number of latent factors (e.g. the number of topics), rather than in the $d$-dimensional observed space (typically $d \gg k$). 1 aAnandkumar, Animashree1 aFoster, Dean, P.1 aHsu, Daniel1 aKakade, Sham, M.1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1204.6703v401339nas a2200193 4500008004100000245005300041210005300094260001500147490000800162520078600170100002000956700002300976700002500999700002401024700001901048700001801067700002301085856003701108 2012 eng d00aTopological Flat Bands from Dipolar Spin Systems0 aTopological Flat Bands from Dipolar Spin Systems c2012/12/260 v1093 a We propose and analyze a physical system that naturally admits two-dimensional topological nearly flat bands. Our approach utilizes an array of three-level dipoles (effective S = 1 spins) driven by inhomogeneous electromagnetic fields. The dipolar interactions produce arbitrary uniform background gauge fields for an effective collection of conserved hardcore bosons, namely, the dressed spin-flips. These gauge fields result in topological band structures, whose bandgap can be larger than the corresponding bandwidth. Exact diagonalization of the full interacting Hamiltonian at half-filling reveals the existence of superfluid, crystalline, and supersolid phases. An experimental realization using either ultra-cold polar molecules or spins in the solid state is considered. 1 aYao, Norman, Y.1 aLaumann, Chris, R.1 aGorshkov, Alexey, V.1 aBennett, Steven, D.1 aDemler, Eugene1 aZoller, Peter1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1207.4479v301526nas a2200157 4500008004100000245005100041210005000092260001500142520108300157100002201240700001901262700001701281700001601298700001701314856003701331 2011 eng d00aContinuous-variable quantum compressed sensing0 aContinuousvariable quantum compressed sensing c2011/11/033 a 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. 1 aOhliger, Matthias1 aNesme, Vincent1 aGross, David1 aLiu, Yi-Kai1 aEisert, Jens uhttp://arxiv.org/abs/1111.0853v300981nas a2200133 4500008004100000245005900041210005900100260001300159490000800172520059000180100002400770700001600794856003700810 2011 eng d00aDirect Fidelity Estimation from Few Pauli Measurements0 aDirect Fidelity Estimation from Few Pauli Measurements c2011/6/80 v1063 a We describe a simple method for certifying that an experimental device prepares a desired quantum state rho. Our method is applicable to any pure state rho, and it provides an estimate of the fidelity between rho and the actual (arbitrary) state in the lab, up to a constant additive error. The method requires measuring only a constant number of Pauli expectation values, selected at random according to an importance-weighting rule. Our method is faster than full tomography by a factor of d, the dimension of the state space, and extends easily and naturally to quantum channels. 1 aFlammia, Steven, T.1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1104.4695v301088nas a2200169 4500008004100000245005200041210005100093260001400144490000800158520060000166100002500766700002400791700002600815700001700841700002300858856003700881 2011 eng d00aPhoton-Photon Interactions via Rydberg Blockade0 aPhotonPhoton Interactions via Rydberg Blockade c2011/9/220 v1073 a We develop the theory of light propagation under the conditions of electromagnetically induced transparency (EIT) in systems involving strongly interacting Rydberg states. Taking into account the quantum nature and the spatial propagation of light, we analyze interactions involving few-photon pulses. We demonstrate that this system can be used for the generation of nonclassical states of light including trains of single photons with an avoided volume between them, for implementing photon-photon quantum gates, as well as for studying many-body phenomena with strongly correlated photons. 1 aGorshkov, Alexey, V.1 aOtterbach, Johannes1 aFleischhauer, Michael1 aPohl, Thomas1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1103.3700v101573nas a2200181 4500008004100000245004700041210004700088260001400135490000700149520106900156100002501225700002701250700001501277700001901292700002301311700002001334856003701354 2011 eng d00aQuantum Magnetism with Polar Alkali Dimers0 aQuantum Magnetism with Polar Alkali Dimers c2011/9/150 v843 a We show that dipolar interactions between ultracold polar alkali dimers in optical lattices can be used to realize a highly tunable generalization of the t-J model, which we refer to as the t-J-V-W model. The model features long-range spin-spin interactions J_z and J_perp of XXZ type, long-range density-density interaction V, and long-range density-spin interaction W, all of which can be controlled in both magnitude and sign independently of each other and of the tunneling t. The "spin" is encoded in the rotational degree of freedom of the molecules, while the interactions are controlled by applied static electric and continuous-wave microwave fields. Furthermore, we show that nuclear spins of the molecules can be used to implement an additional (orbital) degree of freedom that is coupled to the original rotational degree of freedom in a tunable way. The presented system is expected to exhibit exotic physics and to provide insights into strongly correlated phenomena in condensed matter systems. Realistic experimental imperfections are discussed. 1 aGorshkov, Alexey, V.1 aManmana, Salvatore, R.1 aChen, Gang1 aDemler, Eugene1 aLukin, Mikhail, D.1 aRey, Ana, Maria uhttp://arxiv.org/abs/1106.1655v100483nas a2200169 4500008004100000245005300041210005200094300001100146490000700157100002500164700001800189700001200207700001400219700001600233700001400249856005000263 2011 eng d00aQuantum magnetism with polar alkali-metal dimers0 aQuantum magnetism with polar alkalimetal dimers a0336190 v841 aGorshkov, Alexey, V.1 aManmana, S, R1 aChen, G1 aDemler, E1 aLukin, M, D1 aRey, A, M uhttp://link.aps.org/abstract/PRA/v84/e033619/01287nas a2200181 4500008004100000245007300041210006900114260001400183490000800197520074600205100002000951700001400971700002600985700002501011700001201036700002001048856003701068 2011 eng d00aResolved atomic interaction sidebands in an optical clock transition0 aResolved atomic interaction sidebands in an optical clock transi c2011/6/220 v1063 a We report the observation of resolved atomic interaction sidebands (ISB) in the ${}^{87}$Sr optical clock transition when atoms at microkelvin temperatures are confined in a two-dimensional (2D) optical lattice. The ISB are a manifestation of the strong interactions that occur between atoms confined in a quasi-one-dimensional geometry and disappear when the confinement is relaxed along one dimension. The emergence of ISB is linked to the recently observed suppression of collisional frequency shifts in [1]. At the current temperatures, the ISB can be resolved but are broad. At lower temperatures, ISB are predicted to be substantially narrower and usable as powerful spectroscopic tools in strongly interacting alkaline-earth gases. 1 aBishof, Michael1 aLin, Yige1 aSwallows, Matthew, D.1 aGorshkov, Alexey, V.1 aYe, Jun1 aRey, Ana, Maria uhttp://arxiv.org/abs/1102.1016v201404nas a2200193 4500008004100000245006800041210006800109260001400177490000800191520083700199100002001036700001701056700002501073700001901098700001501117700001801132700002301150856003701173 2011 eng d00aRobust Quantum State Transfer in Random Unpolarized Spin Chains0 aRobust Quantum State Transfer in Random Unpolarized Spin Chains c2011/1/270 v1063 a We propose and analyze a new approach for quantum state transfer between remote spin qubits. Specifically, we demonstrate that coherent quantum coupling between remote qubits can be achieved via certain classes of random, unpolarized (infinite temperature) spin chains. Our method is robust to coupling strength disorder and does not require manipulation or control over individual spins. In principle, it can be used to attain perfect state transfer over arbitrarily long range via purely Hamiltonian evolution and may be particularly applicable in a solid-state quantum information processor. As an example, we demonstrate that it can be used to attain strong coherent coupling between Nitrogen-Vacancy centers separated by micrometer distances at room temperature. Realistic imperfections and decoherence effects are analyzed. 1 aYao, Norman, Y.1 aJiang, Liang1 aGorshkov, Alexey, V.1 aGong, Zhe-Xuan1 aZhai, Alex1 aDuan, L., -M.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1011.2762v201551nas a2200193 4500008004100000245008200041210006900123260001300192490000800205520096600213100002501179700002701204700001501231700001201246700001901258700002301277700002001300856003701320 2011 eng d00aTunable Superfluidity and Quantum Magnetism with Ultracold Polar Molecules 0 aTunable Superfluidity and Quantum Magnetism with Ultracold Polar c2011/9/80 v1073 a By selecting two dressed rotational states of ultracold polar molecules in an optical lattice, we obtain a highly tunable generalization of the t-J model, which we refer to as the t-J-V-W model. In addition to XXZ spin exchange, the model features density-density interactions and novel density-spin interactions; all interactions are dipolar. We show that full control of all interaction parameters in both magnitude and sign can be achieved independently of each other and of the tunneling. As a first step towards demonstrating the potential of the system, we apply the density matrix renormalization group method (DMRG) to obtain the 1D phase diagram of the simplest experimentally realizable case. Specifically, we show that the tunability and the long-range nature of the interactions in the t-J-V-W model enable enhanced superfluidity. Finally, we show that Bloch oscillations in a tilted lattice can be used to probe the phase diagram experimentally. 1 aGorshkov, Alexey, V.1 aManmana, Salvatore, R.1 aChen, Gang1 aYe, Jun1 aDemler, Eugene1 aLukin, Mikhail, D.1 aRey, Ana, Maria uhttp://arxiv.org/abs/1106.1644v101292nas a2200121 4500008004100000245006300041210006200104260001500166300001400181520092200195100001601117856003701133 2011 eng d00aUniversal low-rank matrix recovery from Pauli measurements0 aUniversal lowrank matrix recovery from Pauli measurements c2011/03/14 a1638-16463 a We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rd poly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed sensing: recovering a sparse vector from a few of its Fourier coefficients. We show that almost all sets of O(rd log^6 d) Pauli measurements satisfy the rank-r restricted isometry property (RIP). This implies that M can be recovered from a fixed ("universal") set of Pauli measurements, using nuclear-norm minimization (e.g., the matrix Lasso), with nearly-optimal bounds on the error. A similar result holds for any class of measurements that use an orthonormal operator basis whose elements have small operator norm. Our proof uses Dudley's inequality for Gaussian processes, together with bounds on covering numbers obtained via entropy duality. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1103.2816v201036nas a2200181 4500008004100000245006600041210006500107260001400172490000700186520050100193100002500694700001700719700002100736700001800757700002300775700001900798856003700817 2010 eng d00aAdiabatic preparation of many-body states in optical lattices0 aAdiabatic preparation of manybody states in optical lattices c2010/6/220 v813 a We analyze a technique for the preparation of low entropy many body states of atoms in optical lattices based on adiabatic passage. In particular, we show that this method allows preparation of strongly correlated states as stable highest energy states of Hamiltonians that have trivial ground states. As an example, we analyze the generation of antiferromagnetically ordered states by adiabatic change of a staggered field acting on the spins of bosonic atoms with ferromagnetic interactions. 1 aSorensen, Anders, S.1 aAltman, Ehud1 aGullans, Michael1 aPorto, J., V.1 aLukin, Mikhail, D.1 aDemler, Eugene uhttp://arxiv.org/abs/0906.2567v301458nas a2200145 4500008004100000245005700041210005600098260001500154520102700169100002301196700001801219700002101237700001701258856003701275 2010 eng d00aCharacterization of universal two-qubit Hamiltonians0 aCharacterization of universal twoqubit Hamiltonians c2010/04/093 a Suppose we can apply a given 2-qubit Hamiltonian H to any (ordered) pair of qubits. We say H is n-universal if it can be used to approximate any unitary operation on n qubits. While it is well known that almost any 2-qubit Hamiltonian is 2-universal (Deutsch, Barenco, Ekert 1995; Lloyd 1995), an explicit characterization of the set of non-universal 2-qubit Hamiltonians has been elusive. Our main result is a complete characterization of 2-non-universal 2-qubit Hamiltonians. In particular, there are three ways that a 2-qubit Hamiltonian H can fail to be universal: (1) H shares an eigenvector with the gate that swaps two qubits, (2) H acts on the two qubits independently (in any of a certain family of bases), or (3) H has zero trace. A 2-non-universal 2-qubit Hamiltonian can still be n-universal for some n >= 3. We give some partial results on 3-universality. Finally, we also show how our characterization of 2-universal Hamiltonians implies the well-known result that almost any 2-qubit unitary is universal. 1 aChilds, Andrew, M.1 aLeung, Debbie1 aMancinska, Laura1 aOzols, Maris uhttp://arxiv.org/abs/1004.1645v201401nas a2200217 4500008004100000245005600041210005600097260001300153490000800166520081300174100002100987700001801008700001901026700001401045700002101059700001901080700001401099700001501113700001801128856003701146 2010 eng d00aDynamic Nuclear Polarization in Double Quantum Dots0 aDynamic Nuclear Polarization in Double Quantum Dots c2010/6/40 v1043 aWe theoretically investigate the controlled dynamic polarization of lattice nuclear spins in GaAs double quantum dots containing two electrons. Three regimes of long-term dynamics are identified, including the build up of a large difference in the Overhauser fields across the dots, the saturation of the nuclear polarization process associated with formation of so-called "dark states," and the elimination of the difference field. We show that in the case of unequal dots, build up of difference fields generally accompanies the nuclear polarization process, whereas for nearly identical dots, build up of difference fields competes with polarization saturation in dark states. The elimination of the difference field does not, in general, correspond to a stable steady state of the polarization process. 1 aGullans, Michael1 aKrich, J., J.1 aTaylor, J., M.1 aBluhm, H.1 aHalperin, B., I.1 aMarcus, C., M.1 aStopa, M.1 aYacoby, A.1 aLukin, M., D. uhttp://arxiv.org/abs/1003.4508v201192nas a2200133 4500008004100000245005800041210005800099260001500157520078600172100002900958700001600987700001801003856003701021 2010 eng d00aEfficient Direct Tomography for Matrix Product States0 aEfficient Direct Tomography for Matrix Product States c2010/02/243 a In this note, we describe a method for reconstructing matrix product states from a small number of efficiently-implementable measurements. Our method is exponentially faster than standard tomography, and it can also be used to certify that the unknown state is an MPS. The basic idea is to use local unitary operations to measure in the Schmidt basis, giving direct access to the MPS representation. This compares favorably with recently and independently proposed methods that recover the MPS tensors by performing a variational minimization, which is computationally intractable in certain cases. Our method also has the advantage of recovering any MPS, while other approaches were limited to special classes of states that exclude important examples such as GHZ and W states. 1 aLandon-Cardinal, Olivier1 aLiu, Yi-Kai1 aPoulin, David uhttp://arxiv.org/abs/1002.4632v101775nas a2200229 4500008004100000245003900041210003900080260001500119300000800134490000600142520116900148100001901317700002301336700002401359700001701383700002601400700001901426700002901445700001601474700001801490856003701508 2010 eng d00aEfficient quantum state tomography0 aEfficient quantum state tomography c2010/12/21 a1490 v13 a Quantum state tomography, the ability to deduce the state of a quantum system from measured data, is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger systems it becomes infeasible because the number of quantum measurements and the amount of computation required to process them grows exponentially in the system size. Here we show that we can do exponentially better than direct state tomography for a wide range of quantum states, in particular those that are well approximated by a matrix product state ansatz. We present two schemes for tomography in 1-D quantum systems and touch on generalizations. One scheme requires unitary operations on a constant number of subsystems, while the other requires only local measurements together with more elaborate post-processing. Both schemes rely only on a linear number of experimental operations and classical postprocessing that is polynomial in the system size. A further strength of the methods is that the accuracy of the reconstructed states can be rigorously certified without any a priori assumptions. 1 aCramer, Marcus1 aPlenio, Martin, B.1 aFlammia, Steven, T.1 aGross, David1 aBartlett, Stephen, D.1 aSomma, Rolando1 aLandon-Cardinal, Olivier1 aLiu, Yi-Kai1 aPoulin, David uhttp://arxiv.org/abs/1101.4366v100782nas a2200265 4500008004100000245009300041210006900134300000800203490000600211100001700217700001500234700001800249700001300267700002500280700001700305700001300322700001700335700001700352700001400369700001600383700001500399700002000414700001600434856006600450 2010 eng d00aFar-field optical imaging and manipulation of individual spins with nanoscale resolution0 aFarfield optical imaging and manipulation of individual spins wi a9120 v61 aMaurer, P, C1 aMaze, J, R1 aStanwix, P, L1 aJiang, L1 aGorshkov, Alexey, V.1 aZibrov, A, A1 aHarke, B1 aHodges, J, S1 aZibrov, A, S1 aYacoby, A1 aTwitchen, D1 aHell, S, W1 aWalsworth, R, L1 aLukin, M, D uhttp://www.nature.com/nphys/journal/v6/n11/abs/nphys1774.html01226nas a2200181 4500008004100000245008600041210006900127260001400196490000700210520065700217100002300874700001700897700002500914700002000939700002500959700002300984856003701007 2010 eng d00aFast Entanglement Distribution with Atomic Ensembles and Fluorescent Detection 0 aFast Entanglement Distribution with Atomic Ensembles and Fluores c2010/2/120 v813 a Quantum repeaters based on atomic ensemble quantum memories are promising candidates for achieving scalable distribution of entanglement over long distances. Recently, important experimental progress has been made towards their implementation. However, the entanglement rates and scalability of current approaches are limited by relatively low retrieval and single-photon detector efficiencies. We propose a scheme, which makes use of fluorescent detection of stored excitations to significantly increase the efficiency of connection and hence the rate. Practical performance and possible experimental realizations of the new protocol are discussed. 1 aBrask, Jonatan, B.1 aJiang, Liang1 aGorshkov, Alexey, V.1 aVuletic, Vladan1 aSorensen, Anders, S.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/0907.3839v201374nas a2200133 4500008004100000245008300041210006900124260001500193520094600208100001401154700001801168700001701186856003701203 2010 eng d00aOptimal Perfect Distinguishability between Unitaries and Quantum Operations 0 aOptimal Perfect Distinguishability between Unitaries and Quantum c2010/10/123 a We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations. 1 aLu, Cheng1 aChen, Jianxin1 aDuan, Runyao uhttp://arxiv.org/abs/1010.2298v101038nas a2200169 4500008004100000245008300041210006900124260001300193490000800206520050000214100002500714700002400739700001900763700002600782700002300808856003700831 2010 eng d00aPhotonic Phase Gate via an Exchange of Fermionic Spin Waves in a Spin Chain 0 aPhotonic Phase Gate via an Exchange of Fermionic Spin Waves in a c2010/8/50 v1053 a We propose a new protocol for implementing the two-qubit photonic phase gate. In our approach, the pi phase is acquired by mapping two single photons into atomic excitations with fermionic character and exchanging their positions. The fermionic excitations are realized as spin waves in a spin chain, while photon storage techniques provide the interface between the photons and the spin waves. Possible imperfections and experimental systems suitable for implementing the gate are discussed. 1 aGorshkov, Alexey, V.1 aOtterbach, Johannes1 aDemler, Eugene1 aFleischhauer, Michael1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/1001.0968v301051nas a2200145 4500008004100000245007400041210006900115260001400184490000700198520060100205100002400806700001800830700002000848856003700868 2010 eng d00aQMA-complete problems for stoquastic Hamiltonians and Markov matrices0 aQMAcomplete problems for stoquastic Hamiltonians and Markov matr c2010/3/290 v813 a We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is QMA-complete. We also show that finding the highest energy of a stoquastic Hamiltonian is QMA-complete and that adiabatic quantum computation using certain excited states of a stoquastic Hamiltonian is universal. We also show that adiabatic evolution in the ground state of a stochastic frustration free Hamiltonian is universal. Our results give a new QMA-complete problem arising in the classical setting of Markov chains, and new adiabatically universal Hamiltonians that arise in many physical systems. 1 aJordan, Stephen, P.1 aGosset, David1 aLove, Peter, J. uhttp://arxiv.org/abs/0905.4755v202052nas a2200193 4500008004100000245002200041210002200063260001300085300001200098490000800110520156800118100002301686700001901709700002201728700002301750700002401773700002401797856003701821 2010 eng d00aQuantum Computing0 aQuantum Computing c2010/3/4 a45 - 530 v4643 a Quantum mechanics---the theory describing the fundamental workings of nature---is famously counterintuitive: it predicts that a particle can be in two places at the same time, and that two remote particles can be inextricably and instantaneously linked. These predictions have been the topic of intense metaphysical debate ever since the theory's inception early last century. However, supreme predictive power combined with direct experimental observation of some of these unusual phenomena leave little doubt as to its fundamental correctness. In fact, without quantum mechanics we could not explain the workings of a laser, nor indeed how a fridge magnet operates. Over the last several decades quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit these unique quantum properties? Today it is understood that the answer is yes. Many research groups around the world are working towards one of the most ambitious goals humankind has ever embarked upon: a quantum computer that promises to exponentially improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for this task---ranging from single particles of light to superconducting circuits---and it is not yet clear which, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain what the major challenges are for the future. 1 aLadd, Thaddeus, D.1 aJelezko, Fedor1 aLaflamme, Raymond1 aNakamura, Yasunobu1 aMonroe, Christopher1 aO'Brien, Jeremy, L. uhttp://arxiv.org/abs/1009.2267v101146nas a2200145 4500008004100000245005500041210005400096260001500150300001200165520072600177100002100903700002300924700001600947856003700963 2010 eng d00aQuantum property testing for bounded-degree graphs0 aQuantum property testing for boundeddegree graphs c2010/12/14 a365-3763 a We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also prove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph structure. 1 aAmbainis, Andris1 aChilds, Andrew, M.1 aLiu, Yi-Kai uhttp://arxiv.org/abs/1012.3174v301338nas a2200169 4500008004100000245005200041210005200093260001400145490000800159520087000167100001701037700001601054700002401070700002001094700001701114856003701131 2010 eng d00aQuantum state tomography via compressed sensing0 aQuantum state tomography via compressed sensing c2010/10/40 v1053 a We establish methods for quantum state tomography based on compressed sensing. These methods are specialized for quantum states that are fairly pure, and they offer a significant performance improvement on large quantum systems. In particular, they are able to reconstruct an unknown density matrix of dimension d and rank r using O(rd log^2 d) measurement settings, compared to standard methods that require d^2 settings. Our methods have several features that make them amenable to experimental implementation: they require only simple Pauli measurements, use fast convex optimization, are stable against noise, and can be applied to states that are only approximately low-rank. The acquired data can be used to certify that the state is indeed close to pure, so no a priori assumptions are needed. We present both theoretical bounds and numerical simulations. 1 aGross, David1 aLiu, Yi-Kai1 aFlammia, Steven, T.1 aBecker, Stephen1 aEisert, Jens uhttp://arxiv.org/abs/0909.3304v401144nas a2200145 4500008004100000245010200041210006900143260001500212490000800227520067200235100001900907700001700926700001800943856003700961 2010 eng d00aTemperature driven structural phase transition for trapped ions and its experimental detection 0 aTemperature driven structural phase transition for trapped ions c2010/12/290 v1053 a A Wigner crystal formed with trapped ion can undergo structural phase transition, which is determined only by the mechanical conditions on a classical level. Instead of this classical result, we show that through consideration of quantum and thermal fluctuation, a structural phase transition can be solely driven by change of the system's temperature. We determine a finite-temperature phase diagram for trapped ions using the renormalization group method and the path integral formalism, and propose an experimental scheme to observe the predicted temperature-driven structural phase transition, which is well within the reach of the current ion trap technology. 1 aGong, Zhe-Xuan1 aLin, G., -D.1 aDuan, L., -M. uhttp://arxiv.org/abs/1009.0089v100622nas a2200217 4500008004100000245006800041210006400109300000800173490000600181100002500187700001500212700001500227700001000242700001900252700001000271700001400281700001400295700001600309700001400325856006500339 2010 eng d00aTwo-orbital SU(N) magnetism with ultracold alkaline-earth atoms0 aTwoorbital SUN magnetism with ultracold alkalineearth atoms a2890 v61 aGorshkov, Alexey, V.1 aHermele, M1 aGurarie, V1 aXu, C1 aJulienne, P, S1 aYe, J1 aZoller, P1 aDemler, E1 aLukin, M, D1 aRey, A, M uhttp://www.nature.com/nphys/journal/v6/n4/abs/nphys1535.html01223nas a2200193 4500008004100000245006200041210005900103260001400162490000800176520066700184100002500851700002000876700002200896700002100918700001200939700001800951700002300969856003700992 2009 eng d00aAlkaline-Earth-Metal Atoms as Few-Qubit Quantum Registers0 aAlkalineEarthMetal Atoms as FewQubit Quantum Registers c2009/3/180 v1023 a We propose and analyze a novel approach to quantum information processing, in which multiple qubits can be encoded and manipulated using electronic and nuclear degrees of freedom associated with individual alkaline-earth atoms trapped in an optical lattice. Specifically, we describe how the qubits within each register can be individually manipulated and measured with sub-wavelength optical resolution. We also show how such few-qubit registers can be coupled to each other in optical superlattices via conditional tunneling to form a scalable quantum network. Finally, potential applications to quantum computation and precision measurements are discussed. 1 aGorshkov, Alexey, V.1 aRey, Ana, Maria1 aDaley, Andrew, J.1 aBoyd, Martin, M.1 aYe, Jun1 aZoller, Peter1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/0812.3660v201306nas a2200181 4500008004100000245007600041210006900117260001300186490000800199520075700207100001700964700001900981700002501000700002401025700001901049700001901068856003701087 2009 eng d00aNumber Fluctuations and Energy Dissipation in Sodium Spinor Condensates0 aNumber Fluctuations and Energy Dissipation in Sodium Spinor Cond c2009/6/50 v1023 a We characterize fluctuations in atom number and spin populations in F=1 sodium spinor condensates. We find that the fluctuations enable a quantitative measure of energy dissipation in the condensate. The time evolution of the population fluctuations shows a maximum. We interpret this as evidence of a dissipation-driven separatrix crossing in phase space. For a given initial state, the critical time to the separatrix crossing is found to depend exponentially on the magnetic field and linearly on condensate density. This crossing is confirmed by tracking the energy of the spinor condensate as well as by Faraday rotation spectroscopy. We also introduce a phenomenological model that describes the observed dissipation with a single coefficient. 1 aLiu, Yingmei1 aGomez, Eduardo1 aMaxwell, Stephen, E.1 aTurner, Lincoln, D.1 aTiesinga, Eite1 aLett, Paul, D. uhttp://arxiv.org/abs/0906.2110v101371nas a2200121 4500008004100000245005200041210005200093260001500145300001200160520102400172100001601196856003701212 2009 eng d00aQuantum Algorithms Using the Curvelet Transform0 aQuantum Algorithms Using the Curvelet Transform c2009/10/28 a391-4003 a The curvelet transform is a directional wavelet transform over R^n, which is used to analyze functions that have singularities along smooth surfaces (Candes and Donoho, 2002). I demonstrate how this can lead to new quantum algorithms. I give an efficient implementation of a quantum curvelet transform, together with two applications: a single-shot measurement procedure for approximately finding the center of a ball in R^n, given a quantum-sample over the ball; and, a quantum algorithm for finding the center of a radial function over R^n, given oracle access to the function. I conjecture that these algorithms succeed with constant probability, using one quantum-sample and O(1) oracle queries, respectively, independent of the dimension n -- this can be interpreted as a quantum speed-up. To support this conjecture, I prove rigorous bounds on the distribution of probability mass for the continuous curvelet transform. This shows that the above algorithms work in an idealized "continuous" model. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/0810.4968v201274nas a2200181 4500008004100000245011400041210006900155260001400224490000800238520068400246100001700930700002000947700002500967700002400992700001901016700002001035856003701055 2009 eng d00aQuantum Phase Transitions and Continuous Observation of Spinor Dynamics in an Antiferromagnetic Condensate 0 aQuantum Phase Transitions and Continuous Observation of Spinor D c2009/3/230 v1023 a Condensates of spin-1 sodium display rich spin dynamics due to the antiferromagnetic nature of the interactions in this system. We use Faraday rotation spectroscopy to make a continuous and minimally destructive measurement of the dynamics over multiple spin oscillations on a single evolving condensate. This method provides a sharp signature to locate a magnetically tuned separatrix in phase space which depends on the net magnetization. We also observe a phase transition from a two- to a three-component condensate at a low but finite temperature using a Stern-Gerlach imaging technique. This transition should be preserved as a zero-temperature quantum phase transition. 1 aLiu, Yingmei1 aJung, Sebastian1 aMaxwell, Stephen, E.1 aTurner, Lincoln, D.1 aTiesinga, Eite1 aLett, Paul., D. uhttp://arxiv.org/abs/0902.3189v100937nas a2200145 4500008004100000245005000041210004600091260001500137520051500152100002100667700002300688700002300711700002000734856003700754 2009 eng d00aThe quantum query complexity of certification0 aquantum query complexity of certification c2009/03/063 a We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NAND formula. Up to logarithmic factors, we show that the query complexity is Theta(d^{(k+1)/2}) for 0-certificates, and Theta(d^{k/2}) for 1-certificates. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is O(d^{(k+1)/2}) (again neglecting a logarithmic factor). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem. 1 aAmbainis, Andris1 aChilds, Andrew, M.1 aLe Gall, François1 aTani, Seiichiro uhttp://arxiv.org/abs/0903.1291v201343nas a2200193 4500008004100000245007300041210006900114260001300183490000700196520075700203100001400960700002500974700002100999700002601020700002001046700002301066700002301089856003701112 2009 eng d00aRealization of Coherent Optically Dense Media via Buffer-Gas Cooling0 aRealization of Coherent Optically Dense Media via BufferGas Cool c2009/1/60 v793 a We demonstrate that buffer-gas cooling combined with laser ablation can be used to create coherent optical media with high optical depth and low Doppler broadening that offers metastable states with low collisional and motional decoherence. Demonstration of this generic technique opens pathways to coherent optics with a large variety of atoms and molecules. We use helium buffer gas to cool 87Rb atoms to below 7 K and slow atom diffusion to the walls. Electromagnetically induced transparency (EIT) in this medium allows for 50% transmission in a medium with initial OD >70 and for slow pulse propagation with large delay-bandwidth products. In the high-OD regime, we observe high-contrast spectrum oscillations due to efficient four-wave mixing. 1 aHong, Tao1 aGorshkov, Alexey, V.1 aPatterson, David1 aZibrov, Alexander, S.1 aDoyle, John, M.1 aLukin, Mikhail, D.1 aPrentiss, Mara, G. uhttp://arxiv.org/abs/0805.1416v201661nas a2200217 4500008004100000245007400041210006900115260001400184300001400198490000600212520102000218100001701238700002301255700002501278700002201303700002101325700001901346700002301365700001801388856003701406 2008 eng d00aAnyonic interferometry and protected memories in atomic spin lattices0 aAnyonic interferometry and protected memories in atomic spin lat c2008/4/20 a482 - 4880 v43 a Strongly correlated quantum systems can exhibit exotic behavior called topological order which is characterized by non-local correlations that depend on the system topology. Such systems can exhibit remarkable phenomena such as quasi-particles with anyonic statistics and have been proposed as candidates for naturally fault-tolerant quantum computation. Despite these remarkable properties, anyons have never been observed in nature directly. Here we describe how to unambiguously detect and characterize such states in recently proposed spin lattice realizations using ultra-cold atoms or molecules trapped in an optical lattice. We propose an experimentally feasible technique to access non-local degrees of freedom by performing global operations on trapped spins mediated by an optical cavity mode. We show how to reliably read and write topologically protected quantum memory using an atomic or photonic qubit. Furthermore, our technique can be used to probe statistics and dynamics of anyonic excitations. 1 aJiang, Liang1 aBrennen, Gavin, K.1 aGorshkov, Alexey, V.1 aHammerer, Klemens1 aHafezi, Mohammad1 aDemler, Eugene1 aLukin, Mikhail, D.1 aZoller, Peter uhttp://arxiv.org/abs/0711.1365v101409nas a2200193 4500008004100000245006800041210006800109260001400177490000800191520083700199100001701036700002501053700001601078700002001094700002201114700001901136700002301155856003701178 2008 eng d00aCoherence of an optically illuminated single nuclear spin qubit0 aCoherence of an optically illuminated single nuclear spin qubit c2008/2/190 v1003 aWe investigate the coherence properties of individual nuclear spin quantum bits in diamond [Dutt et al., Science, 316, 1312 (2007)] when a proximal electronic spin associated with a nitrogen-vacancy (NV) center is being interrogated by optical radiation. The resulting nuclear spin dynamics are governed by time-dependent hyperfine interaction associated with rapid electronic transitions, which can be described by a spin-fluctuator model. We show that due to a process analogous to motional averaging in nuclear magnetic resonance, the nuclear spin coherence can be preserved after a large number of optical excitation cycles. Our theoretical analysis is in good agreement with experimental results. It indicates a novel approach that could potentially isolate the nuclear spin system completely from the electronic environment. 1 aJiang, Liang1 aDutt, M., V. Gurudev1 aTogan, Emre1 aChildress, Lily1 aCappellaro, Paola1 aTaylor, J., M.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/0707.1341v201158nas a2200169 4500008004100000245006700041210006700108260001300175490000800188520065200196100002500848700001700873700002000890700001800910700002300928856003700951 2008 eng d00aCoherent Quantum Optical Control with Subwavelength Resolution0 aCoherent Quantum Optical Control with Subwavelength Resolution c2008/3/70 v1003 a We suggest a new method for quantum optical control with nanoscale resolution. Our method allows for coherent far-field manipulation of individual quantum systems with spatial selectivity that is not limited by the wavelength of radiation and can, in principle, approach a few nanometers. The selectivity is enabled by the nonlinear atomic response, under the conditions of Electromagnetically Induced Transparency, to a control beam with intensity vanishing at a certain location. Practical performance of this technique and its potential applications to quantum information science with cold atoms, ions, and solid-state qubits are discussed. 1 aGorshkov, Alexey, V.1 aJiang, Liang1 aGreiner, Markus1 aZoller, Peter1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/0706.3879v201250nas a2200229 4500008004100000245006800041210006700109260001400176300001400190490000600204520061800210100001900828700001900847700001800866700001400884700001500898700001900913700001500932700001800947700001800965856003700983 2008 eng d00aHigh-sensitivity diamond magnetometer with nanoscale resolution0 aHighsensitivity diamond magnetometer with nanoscale resolution c2008/9/14 a810 - 8160 v43 aWe present a novel approach to the detection of weak magnetic fields that takes advantage of recently developed techniques for the coherent control of solid-state electron spin quantum bits. Specifically, we investigate a magnetic sensor based on Nitrogen-Vacancy centers in room-temperature diamond. We discuss two important applications of this technique: a nanoscale magnetometer that could potentially detect precession of single nuclear spins and an optical magnetic field imager combining spatial resolution ranging from micrometers to millimeters with a sensitivity approaching few femtotesla/Hz$^{1/2}$. 1 aTaylor, J., M.1 aCappellaro, P.1 aChildress, L.1 aJiang, L.1 aBudker, D.1 aHemmer, P., R.1 aYacoby, A.1 aWalsworth, R.1 aLukin, M., D. uhttp://arxiv.org/abs/0805.1367v101777nas a2200241 4500008004100000245007500041210006900116260001400185490000700199520107300206100001801279700002701297700001801324700001901342700001701361700002101378700001901399700002101418700002001439700001701459700002201476856003701498 2008 eng d00aMultilevel effects in the Rabi oscillations of a Josephson phase qubit0 aMultilevel effects in the Rabi oscillations of a Josephson phase c2008/9/150 v783 a We present Rabi oscillation measurements of a Nb/AlOx/Nb dc superconducting quantum interference device (SQUID) phase qubit with a 100 um^2 area junction acquired over a range of microwave drive power and frequency detuning. Given the slightly anharmonic level structure of the device, several excited states play an important role in the qubit dynamics, particularly at high power. To investigate the effects of these levels, multiphoton Rabi oscillations were monitored by measuring the tunneling escape rate of the device to the voltage state, which is particularly sensitive to excited state population. We compare the observed oscillation frequencies with a simplified model constructed from the full phase qubit Hamiltonian and also compare time-dependent escape rate measurements with a more complete density-matrix simulation. Good quantitative agreement is found between the data and simulations, allowing us to identify a shift in resonance (analogous to the ac Stark effect), a suppression of the Rabi frequency, and leakage to the higher excited states. 1 aDutta, S., K.1 aStrauch, Frederick, W.1 aLewis, R., M.1 aMitra, Kaushik1 aPaik, Hanhee1 aPalomaki, T., A.1 aTiesinga, Eite1 aAnderson, J., R.1 aDragt, Alex, J.1 aLobb, C., J.1 aWellstood, F., C. uhttp://arxiv.org/abs/0806.4711v200824nas a2200205 4500008004100000245007200041210006900113300001100182490000900193100001300202700001200215700002500227700001600252700001600268700001900284700001900303700001600322700002000338856026000358 2008 eng d00aOptimizing Slow and Stored Light for Multidisciplinary Applications0 aOptimizing Slow and Stored Light for Multidisciplinary Applicati a69040C0 v69041 aKlein, M1 aXiao, Y1 aGorshkov, Alexey, V.1 aHohensee, M1 aLeung, C, D1 aBrowning, M, R1 aPhillips, D, F1 aNovikova, I1 aWalsworth, R, L uhttp://spie.org/x648.xml?product_id=772216&Search_Origin=QuickSearch&Search_Results_URL=http://spie.org/x1636.xml&Alternate_URL=http://spie.org/x18509.xml&Alternate_URL_Name=timeframe&Alternate_URL_Value=Exhibitors&UseJavascript=1&Please_Wait_URL=http://s01383nas a2200157 4500008004100000245010900041210006900150260001300219490000700232520085500239100002501094700002101119700002301140700002501163856003701188 2008 eng d00aPhoton storage in Lambda-type optically dense atomic media. IV. Optimal control using gradient ascent 0 aPhoton storage in Lambdatype optically dense atomic media IV Opt c2008/4/40 v773 a We use the numerical gradient ascent method from optimal control theory to extend efficient photon storage in Lambda-type media to previously inaccessible regimes and to provide simple intuitive explanations for our optimization techniques. In particular, by using gradient ascent to shape classical control pulses used to mediate photon storage, we open up the possibility of high efficiency photon storage in the non-adiabatic limit, in which analytical solutions to the equations of motion do not exist. This control shaping technique enables an order-of-magnitude increase in the bandwidth of the memory. We also demonstrate that the often discussed connection between time reversal and optimality in photon storage follows naturally from gradient ascent. Finally, we discuss the optimization of controlled reversible inhomogeneous broadening. 1 aGorshkov, Alexey, V.1 aCalarco, Tommaso1 aLukin, Mikhail, D.1 aSorensen, Anders, S. uhttp://arxiv.org/abs/0710.2698v201766nas a2200181 4500008004100000245008100041210006900122260001500191300001800206490000800224520121000232100001701442700002401459700002001483700002001503700002401523856003701547 2008 eng d00aPolynomial-time quantum algorithm for the simulation of chemical dynamics 0 aPolynomialtime quantum algorithm for the simulation of chemical c2008/11/24 a18681 - 186860 v1053 a The computational cost of exact methods for quantum simulation using classical computers grows exponentially with system size. As a consequence, these techniques can only be applied to small systems. By contrast, we demonstrate that quantum computers could exactly simulate chemical reactions in polynomial time. Our algorithm uses the split-operator approach and explicitly simulates all electron-nuclear and inter-electronic interactions in quadratic time. Surprisingly, this treatment is not only more accurate than the Born-Oppenheimer approximation, but faster and more efficient as well, for all reactions with more than about four atoms. This is the case even though the entire electronic wavefunction is propagated on a grid with appropriately short timesteps. Although the preparation and measurement of arbitrary states on a quantum computer is inefficient, here we demonstrate how to prepare states of chemical interest efficiently. We also show how to efficiently obtain chemically relevant observables, such as state-to-state transition probabilities and thermal reaction rates. Quantum computers using these techniques could outperform current classical computers with one hundred qubits. 1 aKassal, Ivan1 aJordan, Stephen, P.1 aLove, Peter, J.1 aMohseni, Masoud1 aAspuru-Guzik, Alán uhttp://arxiv.org/abs/0801.2986v301333nas a2200181 4500008004100000245004900041210004900090260001400139490000700153520083600160100001900996700002001015700001701035700002101052700002201073700001901095856003701114 2008 eng d00aQuantum behavior of the dc SQUID phase qubit0 aQuantum behavior of the dc SQUID phase qubit c2008/6/130 v773 a We analyze the behavior of a dc Superconducting Quantum Interference Device (SQUID) phase qubit in which one junction acts as a phase qubit and the rest of the device provides isolation from dissipation and noise in the bias leads. Ignoring dissipation, we find the two-dimensional Hamiltonian of the system and use numerical methods and a cubic approximation to solve Schrodinger's equation for the eigenstates, energy levels, tunneling rates, and expectation value of the currents in the junctions. Using these results, we investigate how well this design provides isolation while preserving the characteristics of a phase qubit. In addition, we show that the expectation value of current flowing through the isolation junction depends on the state of the qubit and can be used for non-destructive read out of the qubit state. 1 aMitra, Kaushik1 aStrauch, F., W.1 aLobb, C., J.1 aAnderson, J., R.1 aWellstood, F., C.1 aTiesinga, Eite uhttp://arxiv.org/abs/0805.3680v100566nas a2200181 4500008004100000245008800041210006900129300001100198490000800209100002500217700001200242700001500254700001500269700001400284700001600298700001900314856005100333 2008 eng d00aSuppression of Inelastic Collisions Between Polar Molecules With a Repulsive Shield0 aSuppression of Inelastic Collisions Between Polar Molecules With a0732010 v1011 aGorshkov, Alexey, V.1 aRabl, P1 aPupillo, G1 aMicheli, A1 aZoller, P1 aLukin, M, D1 aBüchler, H, P uhttp://link.aps.org/abstract/PRL/v101/e073201/01885nas a2200109 4500008004100000245009000041210006900131260001500200520150700215100001601722856003701738 2007 eng d00aThe Complexity of the Consistency and N-representability Problems for Quantum States0 aComplexity of the Consistency and Nrepresentability Problems for c2007/12/183 a QMA (Quantum Merlin-Arthur) is the quantum analogue of the class NP. There are a few QMA-complete problems, most notably the ``Local Hamiltonian'' problem introduced by Kitaev. In this dissertation we show some new QMA-complete problems. The first one is ``Consistency of Local Density Matrices'': given several density matrices describing different (constant-size) subsets of an n-qubit system, decide whether these are consistent with a single global state. This problem was first suggested by Aharonov. We show that it is QMA-complete, via an oracle reduction from Local Hamiltonian. This uses algorithms for convex optimization with a membership oracle, due to Yudin and Nemirovskii. Next we show that two problems from quantum chemistry, ``Fermionic Local Hamiltonian'' and ``N-representability,'' are QMA-complete. These problems arise in calculating the ground state energies of molecular systems. N-representability is a key component in recently developed numerical methods using the contracted Schrodinger equation. Although these problems have been studied since the 1960's, it is only recently that the theory of quantum computation has allowed us to properly characterize their complexity. Finally, we study some special cases of the Consistency problem, pertaining to 1-dimensional and ``stoquastic'' systems. We also give an alternative proof of a result due to Jaynes: whenever local density matrices are consistent, they are consistent with a Gibbs state. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/0712.3041v101388nas a2200145 4500008004100000245009200041210006900133260001300202490000700215520092500222100001401147700001901161700001801180856004401198 2007 eng d00aA fast and robust approach to long-distance quantum communication with atomic ensembles0 afast and robust approach to longdistance quantum communication w c2007/7/20 v763 aQuantum repeaters create long-distance entanglement between quantum systems while overcoming difficulties such as the attenuation of single photons in a fiber. Recently, an implementation of a repeater protocol based on single qubits in atomic ensembles and linear optics has been proposed [Nature 414, 413 (2001)]. Motivated by rapid experimental progress towards implementing that protocol, here we develop a more efficient scheme compatible with active purification of arbitrary errors. Using similar resources as the earlier protocol, our approach intrinsically purifies leakage out of the logical subspace and all errors within the logical subspace, leading to greatly improved performance in the presence of experimental inefficiencies. Our analysis indicates that our scheme could generate approximately one pair per 3 minutes over 1280 km distance with fidelity (F>78%) sufficient to violate Bell's inequality. 1 aJiang, L.1 aTaylor, J., M.1 aLukin, M., D. uhttp://arxiv.org/abs/quant-ph/0609236v301273nas a2200145 4500008004100000245009500041210006900136260001400205490000700219520078700226100002301013700002401036700002301060856004401083 2007 eng d00aImproved quantum algorithms for the ordered search problem via semidefinite programming 0 aImproved quantum algorithms for the ordered search problem via s c2007/3/260 v753 a One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for ordered search in terms of a semidefinite program, we find new quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log_{605} N \approx 0.433 log_2 N queries, which improves upon the previously best known exact algorithm. 1 aChilds, Andrew, M.1 aLandahl, Andrew, J.1 aParrilo, Pablo, A. uhttp://arxiv.org/abs/quant-ph/0608161v101015nas a2200109 4500008004100000245007300041210006800114260001500182520065500197100001600852856003700868 2007 eng d00aThe Local Consistency Problem for Stoquastic and 1-D Quantum Systems0 aLocal Consistency Problem for Stoquastic and 1D Quantum Systems c2007/12/103 a The Local Hamiltonian problem (finding the ground state energy of a quantum system) is known to be QMA-complete. The Local Consistency problem (deciding whether descriptions of small pieces of a quantum system are consistent) is also known to be QMA-complete. Here we consider special cases of Local Hamiltonian, for ``stoquastic'' and 1-dimensional systems, that seem to be strictly easier than QMA. We show that there exist analogous special cases of Local Consistency, that have equivalent complexity (up to poly-time oracle reductions). Our main technical tool is a new reduction from Local Consistency to Local Hamiltonian, using SDP duality. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/0712.1388v200706nas a2200181 4500008004100000245009700041210006900138300001100207490000900218100001500227700001800242700001700260700002500277700001700302700001700319700001600336856017200352 2007 eng d00aMulti-photon Entanglement: From Quantum Curiosity to Quantum Computing and Quantum Repeaters0 aMultiphoton Entanglement From Quantum Curiosity to Quantum Compu a66640G0 v66641 aWalther, P1 aEisaman, M, D1 aNemiroski, A1 aGorshkov, Alexey, V.1 aZibrov, A, S1 aZeilinger, A1 aLukin, M, D uhttp://spiedigitallibrary.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=PSISDG00666400000166640G000001&idtype=cvips&gifs=Yes&bproc=volrange&scode=6600%20-%20669900845nas a2200145 4500008004100000245003900041210003700080260001500117490000700132520042900139100001600568700002500584700001900609856007100628 2007 eng d00aN-representability is QMA-complete0 aNrepresentability is QMAcomplete c2007/03/160 v983 aWe study the computational complexity of the N-representability problem in quantum chemistry. We show that this problem is quantum Merlin-Arthur complete, which is the quantum generalization of nondeterministic polynomial time complete. Our proof uses a simple mapping from spin systems to fermionic systems, as well as a convex optimization technique that reduces the problem of finding ground states to N representability.1 aLiu, Yi-Kai1 aChristandl, Matthias1 aVerstraete, F. uhttp://journals.aps.org/prl/abstract/10.1103/PhysRevLett.98.11050300984nas a2200181 4500008004100000245005700041210005700098260001400155490000700169520043900176100002000615700002500635700002400660700002500684700002300709700002600732856004400758 2007 eng d00aOptimal control of light pulse storage and retrieval0 aOptimal control of light pulse storage and retrieval c2007/6/150 v983 a We demonstrate experimentally a procedure to obtain the maximum efficiency for the storage and retrieval of light pulses in atomic media. The procedure uses time reversal to obtain optimal input signal pulse-shapes. Experimental results in warm Rb vapor are in good agreement with theoretical predictions and demonstrate a substantial improvement of efficiency. This optimization procedure is applicable to a wide range of systems. 1 aNovikova, Irina1 aGorshkov, Alexey, V.1 aPhillips, David, F.1 aSorensen, Anders, S.1 aLukin, Mikhail, D.1 aWalsworth, Ronald, L. uhttp://arxiv.org/abs/quant-ph/0702266v101045nas a2200121 4500008004100000245006200041210006200103260001500165520066900180100002300849700001400872856003700886 2007 eng d00aOptimal quantum adversary lower bounds for ordered search0 aOptimal quantum adversary lower bounds for ordered search c2007/08/243 a The goal of the ordered search problem is to find a particular item in an ordered list of n items. Using the adversary method, Hoyer, Neerbek, and Shi proved a quantum lower bound for this problem of (1/pi) ln n + Theta(1). Here, we find the exact value of the best possible quantum adversary lower bound for a symmetrized version of ordered search (whose query complexity differs from that of the original problem by at most 1). Thus we show that the best lower bound for ordered search that can be proved by the adversary method is (1/pi) ln n + O(1). Furthermore, we show that this remains true for the generalized adversary method allowing negative weights. 1 aChilds, Andrew, M.1 aLee, Troy uhttp://arxiv.org/abs/0708.3396v101698nas a2200157 4500008004100000245008300041210006900124260001300193490000700206520119400213100002501407700001601432700002301448700002501471856004401496 2007 eng d00aPhoton storage in Lambda-type optically dense atomic media. I. Cavity model 0 aPhoton storage in Lambdatype optically dense atomic media I Cavi c2007/9/70 v763 a In a recent paper [Gorshkov et al., Phys. Rev. Lett. 98, 123601 (2007)], we used a universal physical picture to optimize and demonstrate equivalence between a wide range of techniques for storage and retrieval of photon wave packets in Lambda-type atomic media in free space, including the adiabatic reduction of the photon group velocity, pulse-propagation control via off-resonant Raman techniques, and photon-echo-based techniques. In the present paper, we perform the same analysis for the cavity model. In particular, we show that the retrieval efficiency is equal to C/(1+C) independent of the retrieval technique, where C is the cooperativity parameter. We also derive the optimal strategy for storage and, in particular, demonstrate that at any detuning one can store, with the optimal efficiency of C/(1+C), any smooth input mode satisfying T C gamma >> 1 and a certain class of resonant input modes satisfying T C gamma ~ 1, where T is the duration of the input mode and 2 gamma is the transition linewidth. In the two subsequent papers of the series, we present the full analysis of the free-space model and discuss the effects of inhomogeneous broadening on photon storage. 1 aGorshkov, Alexey, V.1 aAndre, Axel1 aLukin, Mikhail, D.1 aSorensen, Anders, S. uhttp://arxiv.org/abs/quant-ph/0612082v201505nas a2200157 4500008004100000245008800041210006900129260001300198490000700211520099600218100002501214700001601239700002301255700002501278856004401303 2007 eng d00aPhoton storage in Lambda-type optically dense atomic media. II. Free-space model 0 aPhoton storage in Lambdatype optically dense atomic media II Fre c2007/9/70 v763 a In a recent paper [Gorshkov et al., Phys. Rev. Lett. 98, 123601 (2007)], we presented a universal physical picture for describing a wide range of techniques for storage and retrieval of photon wave packets in Lambda-type atomic media in free space, including the adiabatic reduction of the photon group velocity, pulse-propagation control via off-resonant Raman techniques, and photon-echo based techniques. This universal picture produced an optimal control strategy for photon storage and retrieval applicable to all approaches and yielded identical maximum efficiencies for all of them. In the present paper, we present the full details of this analysis as well some of its extensions, including the discussion of the effects of non-degeneracy of the two lower levels of the Lambda system. The analysis in the present paper is based on the intuition obtained from the study of photon storage in the cavity model in the preceding paper [Gorshkov et al., Phys. Rev. A 76, 033804 (2007)]. 1 aGorshkov, Alexey, V.1 aAndre, Axel1 aLukin, Mikhail, D.1 aSorensen, Anders, S. uhttp://arxiv.org/abs/quant-ph/0612083v201814nas a2200157 4500008004100000245010800041210006900149260001300218490000700231520128500238100002501523700001601548700002301564700002501587856004401612 2007 eng d00aPhoton storage in Lambda-type optically dense atomic media. III. Effects of inhomogeneous broadening 0 aPhoton storage in Lambdatype optically dense atomic media III Ef c2007/9/70 v763 a In a recent paper [Gorshkov et al., Phys. Rev. Lett. 98, 123601 (2007)] and in the two preceding papers [Gorshkov et al., Phys. Rev. A 76, 033804 (2007); 76, 033805 (2007)], we used a universal physical picture to optimize and demonstrate equivalence between a wide range of techniques for storage and retrieval of photon wave packets in homogeneously broadened Lambda-type atomic media, including the adiabatic reduction of the photon group velocity, pulse-propagation control via off-resonant Raman techniques, and photon-echo-based techniques. In the present paper, we generalize this treatment to include inhomogeneous broadening. In particular, we consider the case of Doppler-broadened atoms and assume that there is a negligible difference between the Doppler shifts of the two optical transitions. In this situation, we show that, at high enough optical depth, all atoms contribute coherently to the storage process as if the medium were homogeneously broadened. We also discuss the effects of inhomogeneous broadening in solid state samples. In this context, we discuss the advantages and limitations of reversing the inhomogeneous broadening during the storage time, as well as suggest a way for achieving high efficiencies with a nonreversible inhomogeneous profile. 1 aGorshkov, Alexey, V.1 aAndre, Axel1 aLukin, Mikhail, D.1 aSorensen, Anders, S. uhttp://arxiv.org/abs/quant-ph/0612084v201375nas a2200181 4500008004100000245008800041210006900129260001400198490000700212520082100219100001901040700001801059700002001077700001501097700001901112700001801131856004401149 2007 eng d00aRelaxation, dephasing, and quantum control of electron spins in double quantum dots0 aRelaxation dephasing and quantum control of electron spins in do c2007/7/130 v763 aRecent experiments have demonstrated quantum manipulation of two-electron spin states in double quantum dots using electrically controlled exchange interactions. Here, we present a detailed theory for electron spin dynamics in two-electron double dot systems that was used to guide these experiments and analyze experimental results. The theory treats both charge and spin degrees of freedom on an equal basis. Specifically, we analyze the relaxation and dephasing mechanisms that are relevant to experiments and discuss practical approaches for quantum control of two-electron system. We show that both charge and spin dephasing play important roles in the dynamics of the two-spin system, but neither represents a fundamental limit for electrical control of spin degrees of freedom in semiconductor quantum bits. 1 aTaylor, J., M.1 aPetta, J., R.1 aJohnson, A., C.1 aYacoby, A.1 aMarcus, C., M.1 aLukin, M., D. uhttp://arxiv.org/abs/cond-mat/0602470v201151nas a2200169 4500008004100000245006500041210006500106260001400171490000700185520063000192100002500822700001600847700002600863700002500889700002300914856004400937 2007 eng d00aUniversal Approach to Optimal Photon Storage in Atomic Media0 aUniversal Approach to Optimal Photon Storage in Atomic Media c2007/3/190 v983 a We present a universal physical picture for describing storage and retrieval of photon wave packets in a Lambda-type atomic medium. This physical picture encompasses a variety of different approaches to pulse storage ranging from adiabatic reduction of the photon group velocity and pulse-propagation control via off-resonant Raman fields to photon-echo based techniques. Furthermore, we derive an optimal control strategy for storage and retrieval of a photon wave packet of any given shape. All these approaches, when optimized, yield identical maximum efficiencies, which only depend on the optical depth of the medium. 1 aGorshkov, Alexey, V.1 aAndre, Axel1 aFleischhauer, Michael1 aSorensen, Anders, S.1 aLukin, Mikhail, D. uhttp://arxiv.org/abs/quant-ph/0604037v301845nas a2200145 4500008004100000245005400041210005100095260001500146300001200161520139800173100001601571700002401587700002401611856006401635 2006 eng d00aOn Bounded Distance Decoding for General Lattices0 aBounded Distance Decoding for General Lattices c2006/01/01 a450-4613 aA central problem in the algorithmic study of lattices is the closest vector problem: given a lattice L represented by some basis, and a target point y⃗ , find the lattice point closest to y⃗ . Bounded Distance Decoding is a variant of this problem in which the target is guaranteed to be close to the lattice, relative to the minimum distance λ1(L) of the lattice. Specifically, in the α-Bounded Distance Decoding problem (α-BDD), we are given a lattice L and a vector y⃗ (within distance α⋅λ1(L) from the lattice), and we are asked to find a lattice point x⃗ ∈L within distance α⋅λ1(L) from the target. In coding theory, the lattice points correspond to codewords, and the target points correspond to lattice points being perturbed by noise vectors. Since in coding theory the lattice is usually fixed, we may “pre-process” it before receiving any targets, to make the subsequent decoding faster. This leads us to consider α-BDD with pre-processing. We show how a recent technique of Aharonov and Regev [2] can be used to solve α-BDD with pre-processing in polynomial time for α=O((logn)/n−−−−−−−√). This improves upon the previously best known algorithm due to Klein [13] which solved the problem for α=O(1/n). We also establish hardness results for α-BDD and α-BDD with pre-processing, as well as generalize our results to other ℓ p norms.1 aLiu, Yi-Kai1 aLyubashevsky, Vadim1 aMicciancio, Daniele uhttp://link.springer.com/chapter/10.1007/11830924_41#page-100966nas a2200121 4500008004100000245008500041210006900126260001500195520055300210100001900763700001800782856004400800 2006 eng d00aCavity quantum electrodynamics with semiconductor double-dot molecules on a chip0 aCavity quantum electrodynamics with semiconductor doubledot mole c2006/05/053 aWe describe a coherent control technique for coupling electron spin states associated with semiconductor double-dot molecule to a microwave stripline resonator on a chip. We identify a novel regime of operation in which strong interaction between a molecule and a resonator can be achieved with minimal decoherence, reaching the so-called strong coupling regime of cavity QED. We describe potential applications of such a system, including low-noise coherent electrical control, fast QND measurements of spin states, and long-range spin coupling. 1 aTaylor, J., M.1 aLukin, M., D. uhttp://arxiv.org/abs/cond-mat/0605144v101241nas a2200121 4500008004100000245005800041210005700099260001500156300001200171520087600183100001601059856004401075 2006 eng d00aConsistency of Local Density Matrices is QMA-complete0 aConsistency of Local Density Matrices is QMAcomplete c2006/04/21 a438-4493 a Suppose we have an n-qubit system, and we are given a collection of local density matrices rho_1,...,rho_m, where each rho_i describes a subset C_i of the qubits. We say that the rho_i are ``consistent'' if there exists some global state sigma (on all n qubits) that matches each of the rho_i on the subsets C_i. This generalizes the classical notion of the consistency of marginal probability distributions. We show that deciding the consistency of local density matrices is QMA-complete (where QMA is the quantum analogue of NP). This gives an interesting example of a hard problem in QMA. Our proof is somewhat unusual: we give a Turing reduction from Local Hamiltonian, using a convex optimization algorithm by Bertsimas and Vempala, which is based on random sampling. Unlike in the classical case, simple mapping reductions do not seem to work here. 1 aLiu, Yi-Kai uhttp://arxiv.org/abs/quant-ph/0604166v301138nas a2200157 4500008004100000245007600041210006900117260001400186490000700200520065300207100001800860700001900878700002100897700001800918856004400936 2006 eng d00aFault-tolerant Quantum Communication with Minimal Physical Requirements0 aFaulttolerant Quantum Communication with Minimal Physical Requir c2006/2/230 v963 aWe describe a novel protocol for a quantum repeater which enables long distance quantum communication through realistic, lossy photonic channels. Contrary to previous proposals, our protocol incorporates active purification of arbitrary errors at each step of the protocol using only two qubits at each repeater station. Because of these minimal physical requirements, the present protocol can be realized in simple physical systems such as solid-state single photon emitters. As an example, we show how nitrogen vacancy color centers in diamond can be used to implement the protocol, using the nuclear and electronic spin to form the two qubits. 1 aChildress, L.1 aTaylor, J., M.1 aSorensen, A., S.1 aLukin, M., D. uhttp://arxiv.org/abs/quant-ph/0410123v301350nas a2200109 4500008004100000245006300041210006300104260001500167520099800182100001601180856004401196 2006 eng d00aGibbs States and the Consistency of Local Density Matrices0 aGibbs States and the Consistency of Local Density Matrices c2006/03/023 a Suppose we have an n-qubit system, and we are given a collection of local density matrices rho_1,...,rho_m, where each rho_i describes some subset of the qubits. We say that rho_1,...,rho_m are "consistent" if there exists a global state sigma (on all n qubits) whose reduced density matrices match rho_1,...,rho_m. We prove the following result: if rho_1,...,rho_m are consistent with some state sigma > 0, then they are also consistent with a state sigma' of the form sigma' = (1/Z) exp(M_1+...+M_m), where each M_i is a Hermitian matrix acting on the same qubits as rho_i, and Z is a normalizing factor. (This is known as a Gibbs state.) Actually, we show a more general result, on the consistency of a set of expectation values