Open AccessPosted Content
A Universal Quantum Computing Virtual Machine
Qiantan Hong,Zi-Yong Ge,Wen Wang,Haifeng Lang,Zheng-An Wang,Yi Peng,J. H. Chen,Li-Hang Ren,Yu Zeng,Liang-Zhu Mu,Heng Fan +10 more
TL;DR: A 34-qubit quantum virtual machine (QtVM) based on a medium server that can run quantum assembly language with graphic interfaces and realize a series of basic functions, such as, the "if" conditional programming language based on single-shot projective measurement results, "for" iteration programming language, build in arithmetic calculation.
read more
Abstract: A medium-scale quantum computer with full universal quantum computing capability is necessary for various practical aims and testing applications. Here we report a 34-qubit quantum virtual machine (QtVM) based on a medium server. Our QtVM can run quantum assembly language with graphic interfaces. The QtVM is implemented with single qubit rotation gate, single to multiple controlled NOT gates to realize the universal quantum computation. Remarkably, it can realize a series of basic functions, such as, the "if" conditional programming language based on single-shot projective measurement results, "for" iteration programming language, build in arithmetic calculation. The measurement can be single-shot and arbitrary number of multi-shot types. In addition, there is in principle no limitation on number of logic gates implemented for quantum computation. By using QtVM, we demonstrate the simulation of dynamical quantum phase transition of transverse field Ising model by quantum circuits, where 34 qubits with one million gates are realized. We also show the realization of programmable Shor algorithm for factoring 15 and 35.
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
I and i
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
38.1K
•Journal Article
Direct Measurement of the Zak phase in Topological Bloch Bands
Marcos Atala,Monika Aidelsburger,Julio T. Barreiro,Dmitry A. Abanin,Takuya Kitagawa,Takuya Kitagawa,Eugene Demler,Immanuel Bloch +7 more
TL;DR: In this paper, the topological properties of Bloch bands in one-dimensional optical lattices were investigated using Bloch oscillations and Ramsey interferometry, and the Zak phase obtained by cold atoms moving across the Brillouin zone was extracted.
34
•Journal Article
Digitized adiabatic quantum computing with a superconducting circuit, part I: Theory
Lucas Lamata,Rami Barends,Alireza Shabani,Julian Kelly,Antonio Mezzacapo,U. Las Heras,Ryan Babbush,Austin G. Fowler,Brooks Campbell,Yu Chen,Zongjian Chen,Ben Chiaro,Andrew Dunsworth,Evan Jeffrey,Erik Lucero,Anthony Megrant,Josh Mutus,Matthew Neeley,Charles Neill,Peter O'Malley,C. Quintana,Pedram Roushan,Enrique Solano,Hartmut Neven,John M. Martinis +24 more
TL;DR: The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems.
References
I and i
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
38.1K
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor
- 20 Nov 1994
TL;DR: Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.
9.1K
Density matrix formulation for quantum renormalization groups
TL;DR: A generalization of the numerical renormalization-group procedure used first by Wilson for the Kondo problem is presented and it is shown that this formulation is optimal in a certain sense.
8.3K
Quantum Mechanics Helps in Searching for a Needle in a Haystack
TL;DR: In this article, a phone directory containing $N$ names arranged in completely random order is presented, and the desired phone number can be obtained in only O(sqrt{N})$ accesses to the database.