Experimental realization of Shor's quantum factoring algorithm using qubit recycling
TLDR
This work demonstrates a scalable version of Shor's quantum factoring algorithm in which then qubit control register is replaced by a single qubit that is recycled n times: the total number of qubits is one third of that required in the standard protocol.Abstract:
By using qubit recycling, researchers demonstrate a scalable version of Shor's algorithm in which the total number of qubits is one third of that required in the standard protocol. They experimentally implemented a two-photon compiled algorithm to factor N = 21, pointing to larger-scale implementations of Shor's algorithm.read more
Citations
More filters
Journal ArticleDOI
Demonstration of a small programmable quantum computer with atomic qubits
Shantanu Debnath,Norbert M. Linke,Caroline Figgatt,K. A. Landsman,Kenneth Wright,Christopher Monroe +5 more
TL;DR: A five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates, which provides the flexibility to implement a variety of algorithms without altering the hardware.
Journal ArticleDOI
Quantum algorithms: an overview
TL;DR: A survey of known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details, including a discussion of recent developments and near-term applications.
Journal ArticleDOI
Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
Xiaogang Qiang,Xiaogang Qiang,Xiao-Qi Zhou,Jianwei Wang,Jianwei Wang,Callum M. Wilkes,T. Loke,Sean O’Gara,Laurent Kling,Graham D. Marshall,Raffaele Santagati,Timothy C. Ralph,Jingbo Wang,Jeremy L. O'Brien,Mark G. Thompson,Jonathan C. F. Matthews +15 more
TL;DR: In this article, a fully programmable two-qubit quantum processor is presented, which enables universal quantum information processing in optics, using large-scale silicon photonic circuits to implement an extension of the linear combination of quantum operators scheme.
Journal ArticleDOI
Realization of a scalable Shor algorithm
Thomas Monz,Daniel Nigg,Esteban Martínez,Matthias F. Brandl,Philipp Schindler,Richard Rines,Shannon X. Wang,Isaac L. Chuang,Rainer Blatt,Rainer Blatt +9 more
TL;DR: The realization of a scalable Shor algorithm, as proposed by Kitaev, is presented, which has been realized scalably within an ion-trap quantum computer and returns the correct factors with a confidence level exceeding 99%.
Journal ArticleDOI
Building logical qubits in a superconducting quantum computing system
TL;DR: In this paper, the authors describe the important route towards a logical memory with superconducting qubits, employing a rotated version of the surface code, and describe the current status of technology with regards to interconnected super-conducting-qubit networks.
References
More filters
Book
Quantum Computation and Quantum Information
TL;DR: In this article, the quantum Fourier transform and its application in quantum information theory is discussed, and distance measures for quantum information are defined. And quantum error-correction and entropy and information are discussed.
Quantum Computation and Quantum Information
TL;DR: This chapter discusses quantum information theory, public-key cryptography and the RSA cryptosystem, and the proof of Lieb's theorem.
Journal ArticleDOI
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.
Journal ArticleDOI
A scheme for efficient quantum computation with linear optics.
TL;DR: It is shown that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors and are robust against errors from photon loss and detector inefficiency.
Journal ArticleDOI
Quantum theory, the Church-Turing principle and the universal quantum computer
TL;DR: In this paper, it is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion: every finitely realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means.