Realization of a scalable shor algorithm
From MaRDI portal
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%.
Recommendations
- Shor’s Quantum Factoring Algorithm on a Photonic Chip
- Scalability of Shor’s algorithm with a limited set of rotation gates
- Architecture of a Quantum Multicomputer Implementing Shor’s Algorithm
- scientific article; zbMATH DE number 5320229
- Implementation of the semiclassical quantum Fourier transform in a scalable system
Cited in
(40)- Realization of quantum information processing in quantum star network constituted by superconducting hybrid systems
- The variational quantum eigensolver: a review of methods and best practices
- Realization of the Hadamard gate based on superposition of the composite solitons
- 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
- State stabilization for gate-model quantum computers
- Efficient diabatic quantum algorithm in number factorization
- Automating quantum experiment control. From circuit compilation to ion routing
- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- Quantum algorithm for preparing the ground state of a physical system through multi-step quantum resonant transitions
- Decoherence dynamics estimation for superconducting gate-model quantum computers
- A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor
- Implementation of the semiclassical quantum Fourier transform in a scalable system
- Shor’s Quantum Factoring Algorithm on a Photonic Chip
- Scalability of Shor’s algorithm with a limited set of rotation gates
- scientific article; zbMATH DE number 5320378 (Why is no real title available?)
- Open quantum generalisation of Hopfield neural networks
- Quantum factoring algorithm: resource estimation and survey of experiments
- Quantum algorithm for the computation of the reactant conversion rate in homogeneous turbulence
- Architecture of a Quantum Multicomputer Implementing Shor’s Algorithm
- Minimally complex ion traps as modules for quantum communication and computing
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Memory-free quantum secret sharing protocol with collective detection
- An improved circuit for Shor's factoring algorithm using 2n+2 qubits
- Quantum dynamics of trapped ions in a dynamic field gradient using dressed states
- Phase shifting control for IQ separation in qubit state tomography
- Implementation of three-qubit Deutsch-Jozsa algorithm with pendular states of polar molecules by optimal control
- Quantum computation: algorithms and applications
- Concrete quantum cryptanalysis of binary elliptic curves via addition chain
- Precision magnetometry exploiting excited state quantum phase transitions
- Facets of correlated non-Markovian channels
- Lattice-based homomorphic encryption for distributed privacy protection
- Quantum related-key differential cryptanalysis
- Coherence and entanglement dynamics in Shor's algorithm
- Quantum computing and fuzzy logic
- Quantum error correction with Kolmogorov-Arnold network for rotated surface codes decoding
- Efficient implementation of quantum permutation algorithm using a polar SrO molecule in pendular states
- Truncated modular exponentiation operators: a strategy for quantum factoring
- Fuzzy matching template attacks on multivariate cryptography: a case study
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)
