Realization of a scalable shor algorithm
From MaRDI portal
Publication:2961622
DOI10.1126/SCIENCE.AAD9480zbMATH Open1355.81060arXiv1507.08852OpenAlexW1635919617WikidataQ50699457 ScholiaQ50699457MaRDI QIDQ2961622FDOQ2961622
Authors: Thomas Monz, Daniel Nigg, Esteban A. Martinez, Matthias F. Brandl, Philipp Schindler, Richard Rines, Shannon Wang, Isaac L. Chuang, R. Blatt 
Publication date: 15 February 2017
Published in: Science (Search for Journal in Brave)
Abstract: Quantum computers are able to outperform classical algorithms. This was long recognized by the visionary Richard Feynman who pointed out in the 1980s that quantum mechanical problems were better solved with quantum machines. It was only in 1994 that Peter Shor came up with an algorithm that is able to calculate the prime factors of a large number vastly more efficiently than known possible with a classical computer. This paradigmatic algorithm stimulated the flourishing research in quantum information processing and the quest for an actual implementation of a quantum computer. Over the last fifteen years, using skillful optimizations, several instances of a Shor algorithm have been implemented on various platforms and clearly proved the feasibility of quantum factoring. For general scalability, though, a different approach has to be pursued. Here, we report the realization of a fully scalable Shor algorithm as proposed by Kitaev. For this, we demonstrate factoring the number fifteen by effectively employing and controlling seven qubits and four "cache-qubits", together with the implementation of generalized arithmetic operations, known as modular multipliers. The scalable algorithm has been realized with an ion-trap quantum computer exhibiting success probabilities in excess of 90%.
Full work available at URL: https://arxiv.org/abs/1507.08852
Recommendations
Cited In (33)
- Scalability of Shor’s algorithm with a limited set of rotation gates
- An improved circuit for Shor's factoring algorithm using \(2n+2\) qubits
- Photonic scheme of quantum phase estimation for quantum algorithms via quantum dots
- Prime number factorization using a spinor Bose-Einstein condensate-inspired topological quantum computer
- Quantum circuit design for objective function maximization in gate-model quantum computers
- Open quantum generalisation of Hopfield neural networks
- Quantum computation: algorithms and applications
- Realization of quantum information processing in quantum star network constituted by superconducting hybrid systems
- Precision magnetometry exploiting excited state quantum phase transitions
- State stabilization for gate-model quantum computers
- Phase shifting control for IQ separation in qubit state tomography
- Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence
- Implementation of three-qubit Deutsch-Jozsa algorithm with pendular states of polar molecules by optimal control
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Implementation of the semiclassical quantum Fourier transform in a scalable system
- Quantum factoring algorithm: resource estimation and survey of experiments
- Memory-free quantum secret sharing protocol with collective detection
- Fuzzy matching template attacks on multivariate cryptography: a case study
- Efficient diabatic quantum algorithm in number factorization
- Decoherence dynamics estimation for superconducting gate-model quantum computers
- Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
- A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor
- Quantum dynamics of trapped ions in a dynamic field gradient using dressed states
- Facets of correlated non-Markovian channels
- Architecture of a Quantum Multicomputer Implementing Shor’s Algorithm
- Shor’s Quantum Factoring Algorithm on a Photonic Chip
- Automating quantum experiment control. From circuit compilation to ion routing
- Title not available (Why is that?)
- Minimally complex ion traps as modules for quantum communication and computing
- The variational quantum eigensolver: a review of methods and best practices
- Realization of the Hadamard gate based on superposition of the composite solitons
- A quantum related-key attack based on the Bernstein-Vazirani algorithm
This page was built for publication: Realization of a scalable shor algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961622)
