01495nas a2200181 4500008004100000245008500041210006900126260001400195490000800209520092100217100001901138700002101157700002701178700002301205700002001228700002801248856003701276 2023 eng d00aCritical phase and spin sharpening in SU(2)-symmetric monitored quantum circuits0 aCritical phase and spin sharpening in SU2symmetric monitored qua c8/17/20230 v1083 a
Monitored quantum circuits exhibit entanglement transitions at certain measurement rates. Such a transition separates phases characterized by how much information an observer can learn from the measurement outcomes. We study SU(2)-symmetric monitored quantum circuits, using exact numerics and a mapping onto an effective statistical-mechanics model. Due to the symmetry's non-Abelian nature, measuring qubit pairs allows for nontrivial entanglement scaling even in the measurement-only limit. We find a transition between a volume-law entangled phase and a critical phase whose diffusive purification dynamics emerge from the non-Abelian symmetry. Additionally, we numerically identify a "spin-sharpening transition." On one side is a phase in which the measurements can efficiently identify the system's total spin quantum number; on the other side is a phase in which measurements cannot.
1 aMajidy, Shayan1 aAgrawal, Utkarsh1 aGopalakrishnan, Sarang1 aPotter, Andrew, C.1 aVasseur, Romain1 aHalpern, Nicole, Yunger uhttps://arxiv.org/abs/2305.1335601030nas 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.0398205435nas 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.0973301289nas 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.1638701282nas 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.0320301498nas 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.1431601846nas a2200181 4500008004100000245009600041210006900137260001400206520121100220653003801431653004301469653002701512653003101539100001501570700001901585700002301604856003701627 2022 eng d00aGroup coset monogamy games and an application to device-independent continuous-variable QKD0 aGroup coset monogamy games and an application to deviceindepende c12/7/20223 aWe develop an extension of a recently introduced subspace coset state monogamy-of-entanglement game [Coladangelo, Liu, Liu, and Zhandry; Crypto'21] to general group coset states, which are uniform superpositions over elements of a subgroup to which has been applied a group-theoretic generalization of the quantum one-time pad. We give a general bound on the winning probability of a monogamy game constructed from subgroup coset states that applies to a wide range of finite and infinite groups. To study the infinite-group case, we use and further develop a measure-theoretic formalism that allows us to express continuous-variable measurements as operator-valued generalizations of probability measures.
We apply the monogamy game bound to various physically relevant groups, yielding realizations of the game in continuous-variable modes as well as in rotational states of a polyatomic molecule. We obtain explicit strong bounds in the case of specific group-space and subgroup combinations. As an application, we provide the first proof of one sided-device independent security of a squeezed-state continuous-variable quantum key distribution protocol against general coherent attacks.
We consider a model of monitored quantum dynamics with quenched spatial randomness: specifically, random quantum circuits with spatially varying measurement rates. These circuits undergo a measurement-induced phase transition (MIPT) in their entanglement structure, but the nature of the critical point differs drastically from the case with constant measurement rate. In particular, at the critical measurement rate, we find that the entanglement of a subsystem of size ℓ scales as S∼ℓ√; moreover, the dynamical critical exponent z=∞. The MIPT is flanked by Griffiths phases with continuously varying dynamical exponents. We argue for this infinite-randomness scenario on general grounds and present numerical evidence that it captures some features of the universal critical properties of MIPT using large-scale simulations of Clifford circuits. These findings demonstrate that the relevance and irrelevance of perturbations to the MIPT can naturally be interpreted using a powerful heuristic known as the Harris criterion.
1 aZabalo, Aidan1 aWilson, Justin, H.1 aGullans, Michael, J.1 aVasseur, Romain1 aGopalakrishnan, Sarang1 aHuse, David, A.1 aPixley, J., H. uhttps://arxiv.org/abs/2205.1400201571nas a2200205 4500008004100000245006800041210006700109260001400176520091100190653002701101653003101128100002801159700001801187700003201205700002301237700002201260700002501282700002101307856003701328 2022 eng d00aMonitoring-induced Entanglement Entropy and Sampling Complexity0 aMonitoringinduced Entanglement Entropy and Sampling Complexity c1/29/20223 aThe dynamics of open quantum systems is generally described by a master equation, which describes the loss of information into the environment. By using a simple model of uncoupled emitters, we illustrate how the recovery of this information depends on the monitoring scheme applied to register the decay clicks. The dissipative dynamics, in this case, is described by pure-state stochastic trajectories and we examine different unravelings of the same master equation. More precisely, we demonstrate how registering the sequence of clicks from spontaneously emitted photons through a linear optical interferometer induces entanglement in the trajectory states. Since this model consists of an array of single-photon emitters, we show a direct equivalence with Fock-state boson sampling and link the hardness of sampling the outcomes of the quantum jumps with the scaling of trajectory entanglement.
10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aVan Regemortel, Mathias1 aShtanko, Oles1 aGarcía-Pintos, Luis, Pedro1 aDeshpande, Abhinav1 aDehghani, Hossein1 aGorshkov, Alexey, V.1 aHafezi, Mohammad uhttps://arxiv.org/abs/2201.1267201727nas 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.0339302013nas 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.abi789402845nas 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.0338101906nas 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.1238402392nas a2200181 4500008004100000245006700041210006600108260001400174520183100188653002702019653003102046100001602077700001802093700002702111700002002138700001502158856003702173 2022 eng d00aTailoring three-dimensional topological codes for biased noise0 aTailoring threedimensional topological codes for biased noise c11/3/20223 aTailored topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for several advantages including a transversal implementation of non-Clifford logical gates, single-shot decoding strategies, parallelized decoding in the case of fracton codes as well as construction of fractal lattice codes. Motivated by this, we tailor 3D topological codes for enhanced storage performance under biased Pauli noise. We present Clifford deformations of various 3D topological codes, such that they exhibit a threshold error rate of 50% under infinitely biased Pauli noise. Our examples include the 3D surface code on the cubic lattice, the 3D surface code on a checkerboard lattice that lends itself to a subsystem code with a single-shot decoder, the 3D color code, as well as fracton models such as the X-cube model, the Sierpinski model and the Haah code. We use the belief propagation with ordered statistics decoder (BP-OSD) to study threshold error rates at finite bias. We also present a rotated layout for the 3D surface code, which uses roughly half the number of physical qubits for the same code distance under appropriate boundary conditions. Imposing coprime periodic dimensions on this rotated layout leads to logical operators of weight O(n) at infinite bias and a corresponding exp[−O(n)] subthreshold scaling of the logical failure rate, where n is the number of physical qubits in the code. Even though this scaling is unstable due to the existence of logical representations with O(1) low-rate Pauli errors, the number of such representations scales only polynomially for the Clifford-deformed code, leading to an enhanced effective distance.
10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aHuang, Eric1 aPesah, Arthur1 aChubb, Christopher, T.1 aVasmer, Michael1 aDua, Arpit uhttps://arxiv.org/abs/2211.0211601963nas 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.1497201944nas a2200181 4500008004100000245006800041210006700109260001400176520137900190100002201569700001801591700001801609700002401627700002801651700002101679700002501700856003701725 2021 eng d00aDiscovering hydrodynamic equations of many-body quantum systems0 aDiscovering hydrodynamic equations of manybody quantum systems c11/3/20213 aSimulating and predicting dynamics of quantum many-body systems is extremely challenging, even for state-of-the-art computational methods, due to the spread of entanglement across the system. However, in the long-wavelength limit, quantum systems often admit a simplified description, which involves a small set of physical observables and requires only a few parameters such as sound velocity or viscosity. Unveiling the relationship between these hydrodynamic equations and the underlying microscopic theory usually requires a great effort by condensed matter theorists. In the present paper, we develop a new machine-learning framework for automated discovery of effective equations from a limited set of available data, thus bypassing complicated analytical derivations. The data can be generated from numerical simulations or come from experimental quantum simulator platforms. Using integrable models, where direct comparisons can be made, we reproduce previously known hydrodynamic equations, strikingly discover novel equations and provide their derivation whenever possible. We discover new hydrodynamic equations describing dynamics of interacting systems, for which the derivation remains an outstanding challenge. Our approach provides a new interpretable method to study properties of quantum materials and quantum simulators in non-perturbative regimes.
1 aKharkov, Yaroslav1 aShtanko, Oles1 aSeif, Alireza1 aBienias, Przemyslaw1 aVan Regemortel, Mathias1 aHafezi, Mohammad1 aGorshkov, Alexey, V. uhttps://arxiv.org/abs/2111.0238502114nas a2200181 4500008004100000245005300041210005300094260001500147490000600162520160200168100002201770700002601792700001801818700001801836700001901854700002201873856003701895 2021 eng d00aEfficient quantum measurement of Pauli operators0 aEfficient quantum measurement of Pauli operators c01/19/20210 v53 aEstimating the expectation value of an observable is a fundamental task in quantum computation. Unfortunately, it is often impossible to obtain such estimates directly, as the computer is restricted to measuring in a fixed computational basis. One common solution splits the observable into a weighted sum of Pauli operators and measures each separately, at the cost of many measurements. An improved version first groups mutually commuting Pauli operators together and then measures all operators within each group simultaneously. The effectiveness of this depends on two factors. First, to enable simultaneous measurement, circuits are required to rotate each group to the computational basis. In our work, we present two efficient circuit constructions that suitably rotate any group of k commuting n-qubit Pauli operators using at most kn−k(k+1)/2 and O(kn/logk) two-qubit gates respectively. Second, metrics that justifiably measure the effectiveness of a grouping are required. In our work, we propose two natural metrics that operate under the assumption that measurements are distributed optimally among groups. Motivated by our new metrics, we introduce SORTED INSERTION, a grouping strategy that is explicitly aware of the weighting of each Pauli operator in the observable. Our methods are numerically illustrated in the context of the Variational Quantum Eigensolver, where the observables in question are molecular Hamiltonians. As measured by our metrics, SORTED INSERTION outperforms four conventional greedy colouring algorithms that seek the minimum number of groups.
1 aCrawford, Ophelia1 avan Straaten, Barnaby1 aWang, Daochen1 aParks, Thomas1 aCampbell, Earl1 aBrierley, Stephen uhttps://arxiv.org/abs/1908.0694201588nas a2200241 4500008004100000022001400041245008300055210006900138260001400207300001100221490000600232520086600238100002401104700002201128700002101150700001801171700002801189700001401217700002401231700002301255700002101278856004701299 2021 eng d a2058-956500aEntangled quantum cellular automata, physical complexity, and Goldilocks rules0 aEntangled quantum cellular automata physical complexity and Gold c9/29/2021 a0450170 v63 aCellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under "Goldilocks rules" that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms -- Rydberg arrays, trapped ions, and superconducting qubits -- can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.
1 aHillberry, Logan, E1 aJones, Matthew, T1 aVargas, David, L1 aRall, Patrick1 aHalpern, Nicole, Yunger1 aBao, Ning1 aNotarnicola, Simone1 aMontangero, Simone1 aCarr, Lincoln, D uhttp://dx.doi.org/10.1088/2058-9565/ac1c4101706nas a2200193 4500008004100000245008500041210006900126260001400195490000600209520111700215100001901332700001901351700001801370700001601388700002401404700002201428700002501450856003701475 2021 eng d00aFrustration-induced anomalous transport and strong photon decay in waveguide QED0 aFrustrationinduced anomalous transport and strong photon decay i c9/16/20210 v33 aWe 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.0369002349nas 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.0515602003nas 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.1247401315nas a2200145 4500008004100000245007600041210006900117260001400186520084500200100002201045700002701067700002001094700001801114856003701132 2021 eng d00aSubdiffusive hydrodynamics of nearly-integrable anisotropic spin chains0 aSubdiffusive hydrodynamics of nearlyintegrable anisotropic spin c9/27/20213 aWe address spin transport in the easy-axis Heisenberg spin chain subject to integrability-breaking perturbations. We find that spin transport is subdiffusive with dynamical exponent z=4 up to a timescale that is parametrically long in the anisotropy. In the limit of infinite anisotropy, transport is subdiffusive at all times; for large finite anisotropy, one eventually recovers diffusion at late times, but with a diffusion constant independent of the strength of the integrability breaking perturbation. We provide numerical evidence for these findings, and explain them by adapting the generalized hydrodynamics framework to nearly integrable dynamics. Our results show that the diffusion constant of near-integrable interacting spin chains is not generically a continuous function of the integrability-breaking parameter.
1 aDe Nardis, Jacopo1 aGopalakrishnan, Sarang1 aVasseur, Romain1 aWare, Brayden uhttps://arxiv.org/abs/2109.1325102762nas a2200169 4500008004100000022001400041245007800055210006900133260001300202300001200215490000800227520222700235100002102462700001702483700001902500856007302519 2021 eng d a0010-361600aTrading Locality for Time: Certifiable Randomness from Low-Depth Circuits0 aTrading Locality for Time Certifiable Randomness from LowDepth C c2/9/2021 a49 - 860 v3823 aThe generation of certifiable randomness is the most fundamental informationtheoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion using a single quantum device. The protocol calls for the device to implement a simple quantum circuit of constant depth on a 2D lattice of qubits. The output of the circuit can be verified classically in linear time, and is guaranteed to contain a polynomial number of certified random bits assuming that the device used to generate the output operated using a (classical or quantum) circuit of sub-logarithmic depth. This assumption contrasts with the locality assumption used for randomness certification based on Bell inequality violation and more recent proposals for randomness certification based on computational assumptions. Furthermore, to demonstrate randomness generation it is sufficient for a device to sample from the ideal output distribution within constant statistical distance. Our procedure is inspired by recent work of Bravyi et al. (Science 362(6412):308–311, 2018), who introduced a relational problem that can be solved by a constant-depth quantum circuit, but provably cannot be solved by any classical circuit of sub-logarithmic depth. We develop the discovery of Bravyi et al. into a framework for robust randomness expansion. Our results lead to a new proposal for a demonstrated quantum advantage that has some advantages compared to existing proposals. First, our proposal does not rest on any complexity-theoretic conjectures, but relies on the physical assumption that the adversarial device being tested implements a circuit of sub-logarithmic depth. Second, success on our task can be easily verified in classical linear time. Finally, our task is more noise-tolerant than most other existing proposals that can only tolerate multiplicative error, or require additional conjectures from complexity theory; in contrast, we are able to allow a small constant additive error in total variation distance between the sampled and ideal distributions.
1 aCoudron, Matthew1 aStark, Jalex1 aVidick, Thomas uhttps://link.springer.com/content/pdf/10.1007/s00220-021-03963-w.pdf01742nas 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.0670001656nas a2200157 4500008004100000245008100041210006900122260001500191520114900206100002801355700001701383700001801400700002201418700002101440856003701461 2020 eng d00aEntanglement entropy scaling transition under competing monitoring protocols0 aEntanglement entropy scaling transition under competing monitori c08/19/20203 aDissipation generally leads to the decoherence of a quantum state. In contrast, numerous recent proposals have illustrated that dissipation can also be tailored to stabilize many-body entangled quantum states. While the focus of these works has been primarily on engineering the non-equilibrium steady state, we investigate the build-up of entanglement in the quantum trajectories. Specifically, we analyze the competition between two different dissipation channels arising from two incompatible continuous monitoring protocols. The first protocol locks the phase of neighboring sites upon registering a quantum jump, thereby generating a long-range entanglement through the system, while the second one destroys the coherence via dephasing mechanism. By studying the unraveling of stochastic quantum trajectories associated with the continuous monitoring protocols, we present a transition for the scaling of the averaged trajectory entanglement entropies, from critical scaling to area-law behavior. Our work provides novel insights into the occurrence of a measurement-induced phase transition within a continuous monitoring protocol.
1 aVan Regemortel, Mathias1 aCian, Ze-Pei1 aSeif, Alireza1 aDehghani, Hossein1 aHafezi, Mohammad uhttps://arxiv.org/abs/2008.0861902048nas 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.0882702064nas 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.0369002010nas a2200409 4500008004100000245006800041210006600109260001500175520084400190100001901034700002601053700002001079700002001099700002001119700001701139700002501156700002201181700001901203700001701222700002201239700002101261700002501282700001901307700002301326700001801349700001901367700002101386700002101407700001501428700002001443700002401463700001801487700002301505700001901528700001601547856003701563 2019 eng d00aOpportunities for Nuclear Physics & Quantum Information Science0 aOpportunities for Nuclear Physics Quantum Information Science c03/13/20193 ahis whitepaper is an outcome of the workshop Intersections between Nuclear Physics and Quantum Information held at Argonne National Laboratory on 28-30 March 2018 [www.phy.anl.gov/npqi2018/]. The workshop brought together 116 national and international experts in nuclear physics and quantum information science to explore opportunities for the two fields to collaborate on topics of interest to the U.S. Department of Energy (DOE) Office of Science, Office of Nuclear Physics, and more broadly to U.S. society and industry. The workshop consisted of 22 invited and 10 contributed talks, as well as three panel discussion sessions. Topics discussed included quantum computation, quantum simulation, quantum sensing, nuclear physics detectors, nuclear many-body problem, entanglement at collider energies, and lattice gauge theories.
1 aCloët, I., C.1 aDietrich, Matthew, R.1 aArrington, John1 aBazavov, Alexei1 aBishof, Michael1 aFreese, Adam1 aGorshkov, Alexey, V.1 aGrassellino, Anna1 aHafidi, Kawtar1 aJacob, Zubin1 aMcGuigan, Michael1 aMeurice, Yannick1 aMeziani, Zein-Eddine1 aMueller, Peter1 aMuschik, Christine1 aOsborn, James1 aOtten, Matthew1 aPetreczky, Peter1 aPolakovic, Tomas1 aPoon, Alan1 aPooser, Raphael1 aRoggero, Alessandro1 aSaffman, Mark1 aVanDevender, Brent1 aZhang, Jiehang1 aZohar, Erez uhttps://arxiv.org/abs/1903.0545301947nas a2200397 4500008004100000245005400041210005400095260001500149520085000164100001801014700001601032700002301048700002301071700002201094700002401116700001901140700001801159700001801177700002001195700002501215700001801240700001801258700001901276700001901295700001601314700002301330700001901353700001701372700002401389700001901413700002201432700001901454700001901473700002001492856003701512 2019 eng d00aQuantum Computer Systems for Scientific Discovery0 aQuantum Computer Systems for Scientific Discovery c12/16/20193 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.0757701837nas 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.1138201804nas a2200157 4500008004100000245003600041210003600077520137400113100001701487700001801504700001901522700002401541700002501565700001901590856003701609 2018 eng d00aBlack Hole Microstate Cosmology0 aBlack Hole Microstate Cosmology3 aIn this note, we explore the possibility that certain high-energy holographic CFT states correspond to black hole microstates with a geometrical behind-the-horizon region, modelled by a portion of a second asymptotic region terminating at an end-of-the-world (ETW) brane. We study the time-dependent physics of this behind-the-horizon region, whose ETW boundary geometry takes the form of a closed FRW spacetime. We show that in many cases, this behind-the-horizon physics can be probed directly by looking at the time dependence of entanglement entropy for sufficiently large spatial CFT subsystems. We study in particular states defined via Euclidean evolution from conformal boundary states and give specific predictions for the behavior of the entanglement entropy in this case. We perform analogous calculations for the SYK model and find qualitative agreement with our expectations. A fascinating possibility is that for certain states, we might have gravity localized to the ETW brane as in the Randall-Sundrum II scenario for cosmology. In this case, the effective description of physics beyond the horizon could be a big bang/big crunch cosmology of the same dimensionality as the CFT. In this case, the d-dimensional CFT describing the black hole microstate would give a precise, microscopic description of the d-dimensional cosmological physics.
1 aCooper, Sean1 aRozali, Moshe1 aSwingle, Brian1 aVan Raamsdonk, Mark1 aWaddell, Christopher1 aWakeham, David uhttps://arxiv.org/abs/1810.1060101552nas 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.02210402023nas 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/78301599nas a2200133 4500008004100000245006800041210006800109520117300177100001801350700002001368700002001388700002001408856003701428 2018 eng d00aQuantum Supremacy and the Complexity of Random Circuit Sampling0 aQuantum Supremacy and the Complexity of Random Circuit Sampling3 aA critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study both the hardness and verification of RCS. While RCS was defined with experimental realization in mind, we show complexity theoretic evidence of hardness that is on par with the strongest theoretical proposals for supremacy. Specifically, we show that RCS satisfies an average-case hardness condition - computing output probabilities of typical quantum circuits is as hard as computing them in the worst-case, and therefore #P-hard. Our reduction exploits the polynomial structure in the output amplitudes of random quantum circuits, enabled by the Feynman path integral. In addition, it follows from known results that RCS satisfies an anti-concentration property, making it the first supremacy proposal with both average-case hardness and anti-concentration.
1 aBouland, Adam1 aFefferman, Bill1 aNirkhe, Chinmay1 aVazirani, Umesh uhttps://arxiv.org/abs/1803.0440201895nas 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.0730901280nas 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.0565101532nas a2200193 4500008004100000020002200041022001400063245005900077210005900136260001500195300001600210490000700226520098400233100002301217700001701240700001901257700002601276856003601302 2016 eng d a978-3-95977-013-2 a1868-896900aOptimal quantum algorithm for polynomial interpolation0 aOptimal quantum algorithm for polynomial interpolation c2016/03/01 a16:1--16:130 v553 aWe consider the number of quantum queries required to determine the coefficients of a degree-d polynomial over GF(q). A lower bound shown independently by Kane and Kutin and by Meyer and Pommersheim shows that d/2+1/2 quantum queries are needed to solve this problem with bounded error, whereas an algorithm of Boneh and Zhandry shows that d quantum queries are sufficient. We show that the lower bound is achievable: d/2+1/2 quantum queries suffice to determine the polynomial with bounded error. Furthermore, we show that d/2+1 queries suffice to achieve probability approaching 1 for large q. These upper bounds improve results of Boneh and Zhandry on the insecurity of cryptographic protocols against quantum attacks. We also show that our algorithm's success probability as a function of the number of queries is precisely optimal. Furthermore, the algorithm can be implemented with gate complexity poly(log q) with negligible decrease in the success probability.
1 aChilds, Andrew, M.1 avan Dam, Wim1 aHung, Shih-Han1 aShparlinski, Igor, E. uhttp://arxiv.org/abs/1509.0927101473nas a2200181 4500008004100000245003500041210003500076260001500111300001000126490000700136520094600143100002101089700001901110700002001129700002401149700002101173856009701194 2015 eng d00aProgramming the Quantum Future0 aProgramming the Quantum Future c2015/08/01 a52-610 v583 aThe earliest computers, like the ENIAC, were rare and heroically difficult to program. That difficulty stemmed from the requirement that algorithms be expressed in a "vocabulary" suited to the particular hardware available, ranging from function tables for the ENIAC to more conventional arithmetic and movement operations on later machines. Introduction of symbolic programming languages, exemplified by FORTRAN, solved a major difficulty for the next generation of computing devices by enabling specification of an algorithm in a form more suitable for human understanding, then translating this specification to a form executable by the machine. The "programming language" used for such specification bridged a semantic gap between the human and the computing device. It provided two important features: high-level abstractions, taking care of automated bookkeeping, and modularity, making it easier to reason about sub-parts of programs.1 aAlexander, Scott1 aRoss, Neil, J.1 aSelinger, Peter1 aSmith, Jonathan, M.1 aValiron, Benoît uhttp://cacm.acm.org/magazines/2015/8/189851-programming-the-quantum-future/fulltext#comments02194nas 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.4800v101319nas 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.5440v202350nas 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.3208v202620nas a2200253 4500008004100000245007300041210006900114260001300183300001200196490000800208520192500216100001402141700001702155700001502172700002302187700001602210700001402226700001902240700001802259700001402277700001902291700001902310856003702329 2014 eng d00aOptical detection of radio waves through a nanomechanical transducer0 aOptical detection of radio waves through a nanomechanical transd c2014/3/5 a81 - 850 v5073 aLow-loss transmission and sensitive recovery of weak radio-frequency (rf) and microwave signals is an ubiquitous technological challenge, crucial in fields as diverse as radio astronomy, medical imaging, navigation and communication, including those of quantum states. Efficient upconversion of rf-signals to an optical carrier would allow transmitting them via optical fibers dramatically reducing losses, and give access to the mature toolbox of quantum optical techniques, routinely enabling quantum-limited signal detection. Research in the field of cavity optomechanics has shown that nanomechanical oscillators can couple very strongly to either microwave or optical fields. An oscillator accommodating both functionalities would bear great promise as the intermediate platform in a radio-to-optical transduction cascade. Here, we demonstrate such an opto-electro-mechanical transducer utilizing a high-Q nanomembrane. A moderate voltage bias (<10V) is sufficient to induce strong coupling between the voltage fluctuations in a rf resonance circuit and the membrane's displacement, which is simultaneously coupled to light reflected off its metallized surface. The circuit acts as an antenna; the voltage signals it induces are detected as an optical phase shift with quantum-limited sensitivity. The half-wave voltage is in the microvolt range, orders of magnitude below that of standard optical modulators. The noise added by the membrane is suppressed by the electro-mechanical cooperativity C~6800 and has a temperature of 40mK, far below 300K where the entire device is operated. This corresponds to a sensitivity limit as low as 5 pV/Hz^1/2, or -210dBm/Hz in a narrow band around 1 MHz. Our work introduces an entirely new approach to all-optical, ultralow-noise detection of classical electronic signals, and sets the stage for coherent upconversion of low-frequency quantum signals to the optical domain. 1 aBagci, T.1 aSimonsen, A.1 aSchmid, S.1 aVillanueva, L., G.1 aZeuthen, E.1 aAppel, J.1 aTaylor, J., M.1 aSørensen, A.1 aUsami, K.1 aSchliesser, A.1 aPolzik, E., S. uhttp://arxiv.org/abs/1307.3467v201850nas a2200205 4500008004100000245008200041210006900123260001500192490000700207520120600214100002601420700002601446700002301472700002701495700002701522700001701549700002101566700002001587856003701607 2014 eng d00aQuantum correlations and entanglement in far-from-equilibrium spin systems 0 aQuantum correlations and entanglement in farfromequilibrium spin c2014/12/150 v903 a By applying complementary analytic and numerical methods, we investigate the dynamics of spin-$1/2$ XXZ models with variable-range interactions in arbitrary dimensions. The dynamics we consider is initiated from uncorrelated states that are easily prepared in experiments, and can be equivalently viewed as either Ramsey spectroscopy or a quantum quench. Our primary focus is the dynamical emergence of correlations and entanglement in these far-from-equilibrium interacting quantum systems: we characterize these correlations by the entanglement entropy, concurrence, and squeezing, which are inequivalent measures of entanglement corresponding to different quantum resources. In one spatial dimension, we show that the time evolution of correlation functions manifests a non-perturbative dynamic singularity. This singularity is characterized by a universal power-law exponent that is insensitive to small perturbations. Explicit realizations of these models in current experiments using polar molecules, trapped ions, Rydberg atoms, magnetic atoms, and alkaline-earth and alkali atoms in optical lattices, along with the relative merits and limitations of these different systems, are discussed. 1 aHazzard, Kaden, R. A.1 avan den Worm, Mauritz1 aFoss-Feig, Michael1 aManmana, Salvatore, R.1 aTorre, Emanuele, Dalla1 aPfau, Tilman1 aKastner, Michael1 aRey, Ana, Maria uhttp://arxiv.org/abs/1406.0937v101088nas a2200145 4500008004100000245006400041210006300105260001500168520063800183100002400821700001900845700002000864700002100884856003700905 2014 eng d00aQuipper: Concrete Resource Estimation in Quantum Algorithms0 aQuipper Concrete Resource Estimation in Quantum Algorithms c2014/12/013 aDespite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is done at the level of complexity analysis, but actual concrete numbers (of quantum gates, qubits, etc.) can differ by orders of magnitude. The line of work we present here is a formal framework to write, and reason about, quantum algorithms. Specifically, we designed a language, Quipper, with scalability in mind, and we are able to report actual resource counts for seven non-trivial algorithms found in the quantum computer science literature.
1 aSmith, Jonathan, M.1 aRoss, Neil, J.1 aSelinger, Peter1 aValiron, Benoît uhttp://arxiv.org/abs/1412.0625v101470nas 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/nature1251201002nas 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.5485v100594nas a2200205 4500008004100000245006400041210006100105300000800166490000800174100001700182700001400199700001900213700001300232700001300245700001900258700002500277700001400302700001200316856006000328 2013 eng d00aA quantum many-body spin system in an optical lattice clock0 aquantum manybody spin system in an optical lattice clock a6320 v3411 aMartin, M, J1 aBishof, M1 aSwallows, M, D1 aZhang, X1 aBenko, C1 avon-Stecher, J1 aGorshkov, Alexey, V.1 aRey, A, M1 aYe, Jun uhttp://www.sciencemag.org/content/341/6146/632.abstract00562nas 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.3390v102607nas a2200169 4500008004100000245003500041210003200076260001500108300001200123490000600135520215500141100002002296700002002316700002302336700002002359856005802379 2012 eng d00aOn Beating the Hybrid Argument0 aBeating the Hybrid Argument c2013/11/14 a809-8430 v93 aThe hybrid argument allows one to relate the distinguishability of a distribution (from uniform) to the predictability of individual bits given a prefix. The argument incurs a loss of a factor k equal to the bit-length of the distributions: -distinguishability implies only /k-predictability. This paper studies the consequences of avoiding this loss – what we call “beating the hybrid argument” – and develops new proof techniques that circumvent the loss in certain natural settings. Specifically, we obtain the following results: 1. We give an instantiation of the Nisan-Wigderson generator (JCSS ’94) that can be broken by quantum computers, and that is o(1)-unpredictable against AC0 . This is not enough to imply indistinguishability via the hybrid argument because of the hybrid-argument loss; nevertheless, we conjecture that this generator indeed fools AC0 , and we prove this statement for a simplified version of the problem. Our conjecture implies the existence of an oracle relative to which BQP is not in the PH, a longstanding open problem. 2. We show that the “INW” generator by Impagliazzo, Nisan, and Wigderson (STOC ’94) with seed length O(log n log log n) produces a distribution that is 1/ log n-unpredictable against poly-logarithmic width (general) read-once oblivious branching programs. Thus avoiding the hybrid-argument loss would lead to a breakthrough in generators against small space. 3. We study pseudorandom generators obtained from a hard function by repeated sampling. We identify a property of functions, “resamplability,” that allows us to beat the hybrid argument, leading to new pseudorandom generators for AC0 [p] and similar classes. Although the generators have sub-linear stretch, they represent the best-known generators for these classes. Thus we establish that “beating” or bypassing the hybrid argument would have two significant consequences in complexity, and we take steps toward that goal by developing techniques that indeed beat the hybrid argument in related (but simpler) settings, leading to best-known PRGs for certain complexity classes. 1 aFefferman, Bill1 aShaltiel, Ronen1 aUmans, Christopher1 aViola, Emanuele uhttp://users.cms.caltech.edu/~umans/papers/FSUV10.pdf00860nas a2200169 4500008004100000245005600041210005600097260001500153300001100168490000700179520036800186100002100554700001900575700002400594700001700618856005500635 2012 eng d00aGluon chain formation in presence of static charges0 aGluon chain formation in presence of static charges c2012/12/10 a1140150 v863 aWe consider the origins of the gluon chain model. The model serves as a realization of the dynamics of the chromoelectric flux between static quark-antiquark sources. The derivation is based on the large-NC limit of the Coulomb gauge Hamiltonian in the presence of a background field introduced to model magnetic charge condensation inducing electric confinement.1 aOstrander, Aaron1 aSantopinto, E.1 aSzczepaniak, A., P.1 aVassallo, A. uhttp://link.aps.org/doi/10.1103/PhysRevD.86.11401500654nas 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.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.3839v201122nas a2200145 4500008004100000245004600041210004600087260001400133300001100147490000700158520073400165100002300899700001700922856003700939 2010 eng d00aQuantum algorithms for algebraic problems0 aQuantum algorithms for algebraic problems c2010/1/15 a1 - 520 v823 a Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor. 1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/0812.0380v100845nas 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.11050300989nas a2200133 4500008004100000245005500041210005500096260001500151520057900166100002300745700002600768700002400794856003700818 2007 eng d00aQuantum algorithms for hidden nonlinear structures0 aQuantum algorithms for hidden nonlinear structures c2007/05/213 a Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an alternative generalization, namely to problems of finding hidden nonlinear structures over finite fields. We give examples of two such problems that can be solved efficiently by a quantum computer, but not by a classical computer. We also give some positive results on the quantum query complexity of finding hidden nonlinear structures. 1 aChilds, Andrew, M.1 aSchulman, Leonard, J.1 aVazirani, Umesh, V. uhttp://arxiv.org/abs/0705.2784v101235nas a2200145 4500008004100000245005000041210004800091260001500139300001200154520081600166100001900982700001601001700001601017856005601033 2005 eng d00aDesigning Incentives for Peer-to-Peer Routing0 aDesigning Incentives for PeertoPeer Routing c2005/03/13 a374-3853 aIn a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but refuse to route other nodes’ packets. In this paper we study ways of designing incentives to discourage free-loading. We model the interactions between nodes as a “random matching game,” and describe a simple reputation system that provides incentives for good behavior. Under certain assumptions, we obtain a stable subgame-perfect equilibrium. We use simulations to investigate the robustness of this scheme in the presence of noise and malicious nodes, and we examine some of the design trade-offs. We also evaluate some possible adversarial strategies, and discuss how our results might apply to real peer-to-peer systems.1 aBlanc, Alberto1 aLiu, Yi-Kai1 aVahda, Amin uhttp://cseweb.ucsd.edu/~vahdat/papers/infocom05.pdf01370nas a2200133 4500008004100000245012700041210006900168260001500237520088400252100001601136700002301152700001701175856004401192 2005 eng d00aFrom optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups 0 aFrom optimal measurement to efficient quantum algorithms for the c2005/04/113 a We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probability of success and unitary implementation are closely related to an average-case algebraic problem. By solving this problem, we find efficient quantum algorithms for a number of nonabelian hidden subgroup problems, including some for which no efficient algorithm was previously known: certain metacyclic groups as well as all groups of the form (Z_p)^r X| Z_p for fixed r (including the Heisenberg group, r=2). In particular, our results show that entangled measurements across multiple copies of hidden subgroup states can be useful for efficiently solving the nonabelian HSP. 1 aBacon, Dave1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/quant-ph/0504083v201943nas a2200133 4500008004100000245006600041210006600107260001500173520152100188100001601709700002301725700001701748856004401765 2005 eng d00aOptimal measurements for the dihedral hidden subgroup problem0 aOptimal measurements for the dihedral hidden subgroup problem c2005/01/103 a We consider the dihedral hidden subgroup problem as the problem of distinguishing hidden subgroup states. We show that the optimal measurement for solving this problem is the so-called pretty good measurement. We then prove that the success probability of this measurement exhibits a sharp threshold as a function of the density nu=k/log N, where k is the number of copies of the hidden subgroup state and 2N is the order of the dihedral group. In particular, for nu<1 the optimal measurement (and hence any measurement) identifies the hidden subgroup with a probability that is exponentially small in log N, while for nu>1 the optimal measurement identifies the hidden subgroup with a probability of order unity. Thus the dihedral group provides an example of a group G for which Omega(log|G|) hidden subgroup states are necessary to solve the hidden subgroup problem. We also consider the optimal measurement for determining a single bit of the answer, and show that it exhibits the same threshold. Finally, we consider implementing the optimal measurement by a quantum circuit, and thereby establish further connections between the dihedral hidden subgroup problem and average case subset sum problems. In particular, we show that an efficient quantum algorithm for a restricted version of the optimal measurement would imply an efficient quantum algorithm for the subset sum problem, and conversely, that the ability to quantum sample from subset sum solutions allows one to implement the optimal measurement. 1 aBacon, Dave1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/quant-ph/0501044v201092nas a2200121 4500008004100000245006100041210006100102260001500163520070800178100002300886700001700909856004400926 2005 eng d00aQuantum algorithm for a generalized hidden shift problem0 aQuantum algorithm for a generalized hidden shift problem c2005/07/193 a Consider the following generalized hidden shift problem: given a function f on {0,...,M-1} x Z_N satisfying f(b,x)=f(b+1,x+s) for b=0,1,...,M-2, find the unknown shift s in Z_N. For M=N, this problem is an instance of the abelian hidden subgroup problem, which can be solved efficiently on a quantum computer, whereas for M=2, it is equivalent to the dihedral hidden subgroup problem, for which no efficient algorithm is known. For any fixed positive epsilon, we give an efficient (i.e., poly(log N)) quantum algorithm for this problem provided M > N^epsilon. The algorithm is based on the "pretty good measurement" and uses H. Lenstra's (classical) algorithm for integer programming as a subroutine. 1 aChilds, Andrew, M.1 avan Dam, Wim uhttp://arxiv.org/abs/quant-ph/0507190v101270nas a2200157 4500008004100000245006000041210006000101260001500161300001600176490000700192520080600199100002301005700002201028700001801050856004401068 2004 eng d00aReversible simulation of bipartite product Hamiltonians0 aReversible simulation of bipartite product Hamiltonians c2004/06/01 a1189 - 11970 v503 a Consider two quantum systems A and B interacting according to a product Hamiltonian H = H_A x H_B. We show that any two such Hamiltonians can be used to simulate each other reversibly (i.e., without efficiency losses) with the help of local unitary operations and local ancillas. Accordingly, all non-local features of a product Hamiltonian -- including the rate at which it can be used to produce entanglement, transmit classical or quantum information, or simulate other Hamiltonians -- depend only upon a single parameter. We identify this parameter and use it to obtain an explicit expression for the entanglement capacity of all product Hamiltonians. Finally, we show how the notion of simulation leads to a natural formulation of measures of the strength of a nonlocal Hamiltonian. 1 aChilds, Andrew, M.1 aLeung, Debbie, W.1 aVidal, Guifre uhttp://arxiv.org/abs/quant-ph/0303097v101384nas a2200181 4500008004100000245004300041210004000084260001500124520088400139100001601023700002001039700002301059700001601082700001901098700001801117700002301135856004401158 2003 eng d00aUltracold Cs$_2$ Feshbach Spectroscopy0 aUltracold Cs2 Feshbach Spectroscopy c2003/12/233 a We have observed and located more than 60 magnetic field-induced Feshbach resonances in ultracold collisions of ground-state $^{133}$Cs atoms. These resonances are associated with molecular states with up to four units of rotational angular momentum, and are detected through variations in the elastic, inelastic, and radiative collision cross sections. These observations allow us to greatly improve upon the interaction potentials between two cesium atoms and to reproduce the positions of most resonances to accuracies better than 0.5%. Based on the relevant coupling scheme between the electron spin, nuclear spin, and orbital angular momenta of the nuclei, quantum numbers and energy structure of the molecular states beneath the dissociation continuum are revealed. Finally, we predict the relevant collision properties for cesium Bose-Einstein condensation experiments. 1 aChin, Cheng1 aVuletic, Vladan1 aKerman, Andrew, J.1 aChu, Steven1 aTiesinga, Eite1 aLeo, Paul, J.1 aWilliams, Carl, J. uhttp://arxiv.org/abs/cond-mat/0312613v200853nas a2200145 4500008004100000245009300041210006900134260001500203520037100218100002300589700001800612700001900630700001400649856004400663 2002 eng d00aAsymptotic entanglement capacity of the Ising and anisotropic Heisenberg interactions 0 aAsymptotic entanglement capacity of the Ising and anisotropic He c2002/07/103 a We compute the asymptotic entanglement capacity of the Ising interaction ZZ, the anisotropic Heisenberg interaction XX + YY, and more generally, any two-qubit Hamiltonian with canonical form K = a XX + b YY. We also describe an entanglement assisted classical communication protocol using the Hamiltonian K with rate equal to the asymptotic entanglement capacity. 1 aChilds, Andrew, M.1 aLeung, D., W.1 aVerstraete, F.1 aVidal, G. uhttp://arxiv.org/abs/quant-ph/0207052v2