Open AccessPosted Content
qHiPSTER: The Quantum High Performance Software Testing Environment
TL;DR: In this article, the authors present qHiPSTER, a distributed high-performance implementation of a quantum simulator on a classical computer, that can simulate general single qubit gates and two-qubit controlled gates, performing a number of single and multi-node optimizations, including vectorization, multi-threading, cache blocking, as well as overlapping computation with communication.
read more
Abstract: We present qHiPSTER, the Quantum High Performance Software Testing Environment. qHiPSTER is a distributed high-performance implementation of a quantum simulator on a classical computer, that can simulate general single-qubit gates and two-qubit controlled gates. We perform a number of single- and multi-node optimizations, including vectorization, multi-threading, cache blocking, as well as overlapping computation with communication. Using the TACC Stampede supercomputer, we simulate quantum circuits ("quantum software") of up to 40 qubits. We carry out a detailed performance analysis to show that our simulator achieves both high performance and high hardware efficiency, limited only by the sustainable memory and network bandwidth of the machine.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Supplementary information for "Quantum supremacy using a programmable superconducting processor"
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Alan Ho,Markus R. Hoffmann,Trent Huang,Travis S. Humble,Sergei V. Isakov,Evan Jeffrey,Zhang Jiang,Dvir Kafri,Kostyantyn Kechedzhi,Julian Kelly,Paul V. Klimov,Sergey Knysh,Alexander N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,Erik Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt McEwen,Anthony Megrant,Xiao Mi,Kristel Michielsen,Masoud Mohseni,Josh Mutus,Ofer Naaman,Matthew Neeley,Charles Neill,Murphy Yuezhen Niu,Eric Ostby,Andre Petukhov,John Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis +76 more
TL;DR: In this paper, an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature, is presented.
Quantum Chemistry in the Age of Quantum Computing.
Yudong Cao,Jonathan Romero,Jonathan P. Olson,Matthias Degroote,Matthias Degroote,Peter D. Johnson,Mária Kieferová,Mária Kieferová,Ian D. Kivlichan,Tim Menke,Tim Menke,Borja Peropadre,Nicolas P. D. Sawaya,Sukin Sim,Libor Veis,Alán Aspuru-Guzik +15 more
TL;DR: This Review provides an overview of the algorithms and results that are relevant for quantum chemistry and aims to help quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry.
1.5K
Characterizing Quantum Supremacy in Near-Term Devices
Sergio Boixo,Sergei V. Isakov,Vadim Smelyanskiy,Ryan Babbush,Nan Ding,Zhang Jiang,Michael J. Bremner,John M. Martinis,John M. Martinis,Hartmut Neven +9 more
TL;DR: In this article, the authors study the task of sampling from the output distributions of (pseudo-)random quantum circuits, a natural task for benchmarking quantum computers, and show that this sampling task must take exponential time in a classical computer.
1.2K
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
Ying Li,Simon C. Benjamin +1 more
TL;DR: This work proposes a variational method involving closely integrated classical and quantum coprocessors and finds that it is efficient and appears to be fundamentally more robust against error accumulation than a more conventional optimised Trotterisation technique.
848
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor.
Yulin Wu,Wan-Su Bao,Sirui Cao,Fusheng Chen,Ming-Cheng Chen,X. H. Chen,Tung-Hsun Chung,Hui Deng,Yajie Du,Daojin Fan,Ming Gong,Cheng Guo,Chu Guo,Shaojun Guo,L. Han,Linyin Hong,He-Liang Huang,Yongheng Huo,Liping Li,Na Li,Shaowei Li,Yuan Li,Futian Liang,Chun Lin,Jin Lin,Haoran Qian,Dan Qiao,Hao Rong,Hong Su,Lihua Sun,Liangyuan Wang,Shiyu Wang,Dachao Wu,Yu Xu,Kai Yan,Weifeng Yang,Yang Yang,Yangsen Ye,Jianghan Yin,Chong Ying,Jiale Yu,Chen Zha,Cha Zhang,Haibin Zhang,Kaili Zhang,Yiming Zhang,H. L. Zhao,Youwei Zhao,Liang Zhou,Qingling Zhu,Chao-Yang Lu,Cheng-Zhi Peng,Xiaobo Zhu,Jian-Wei Pan +53 more
TL;DR: Zuchongzhi as mentioned in this paper is a two-dimensional programmable superconducting quantum processor, which is composed of 66 functional qubits in a tunable coupling architecture, and performs random quantum circuits sampling for benchmarking.
846
References
Simulating physics with computers
TL;DR: In this paper, the authors describe the possibility of simulating physics in the classical approximation, a thing which is usually described by local differential equations, and the possibility that there is to be an exact simulation, that the computer will do exactly the same as nature.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for these two problems, which takes a number of steps polynomial in the input size of the integer to be factored.
7.5K
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
TL;DR: In this paper, the authors considered factoring integers and finding discrete logarithms on a quantum computer and gave an efficient randomized algorithm for both problems, which takes a number of steps polynomial in the input size, e.g., the number of digits to be factored.
5.9K
A variational eigenvalue solver on a photonic quantum processor
Alberto Peruzzo,Jarrod R. McClean,Peter Shadbolt,Man-Hong Yung,Xiao-Qi Zhou,Peter J. Love,Alán Aspuru-Guzik,Jeremy L. O'Brien +7 more
TL;DR: The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future.
Related Papers (5)
Michael A. Nielsen,Isaac L. Chuang +1 more
- 01 Jan 2000
John Preskill
- 06 Aug 2018
Lov K. Grover
- 01 Jul 1996