Efficient realization of quantum primitives for Shor's algorithm using PennyLane library. [PDF]
PLoS ONE, 2022 Efficient realization of quantum algorithms is among main challenges on the way towards practical quantum computing. Various libraries and frameworks for quantum software engineering have been developed.
A V Antipov, E O Kiktenko, A K Fedorov
doaj +2 more sources
Optimising Matrix Product State Simulations of Shor's Algorithm [PDF]
Quantum, 2019 We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure of a matrix ...
Aidan Dang +2 more
doaj +4 more sources
Realizing Shor’s algorithm with topological acoustic phase bits [PDF]
Communications EngineeringQuantum algorithms motivate alternative approaches to computation, and classical physical systems that generate correlations can enable parallelism. Here we present a framework for quantum-inspired computing based on phase bits (phibits), which represent
Ilia Kuk +4 more
doaj +2 more sources
HybriD-GM: A Framework for Quantum Computing Simulation Targeted to Hybrid Parallel Architectures [PDF]
Entropy, 2023 This paper presents the HybriD-GM model conception, from modeling to consolidation. The D-GM environment is also extended, providing efficient parallel executions for quantum computing simulations, targeted to hybrid architectures considering the CPU and
Anderson Avila +7 more
doaj +2 more sources
Resource analysis and modifications of quantum computing with noisy qubits for elliptic curve discrete logarithms [PDF]
Scientific ReportsWe estimate the number of physical qubits and execution time by decomposing an implementation of Shor’s algorithm for elliptic curve discrete logarithms into universal gate units at the logical level when surface codes are used.
Jinyoung Ha, Jonghyun Lee, Jun Heo
doaj +2 more sources
Distribution of controlled unitary quantum gates towards factoring large numbers on today’s small-register devices [PDF]
Scientific Reports, 2022 Factoring a 2048-bit number using Shor’s algorithm, when accounting for error correction, reportedly requires 400,000 qubits. However, it is well known that there is yet much time before we will have this many qubits in the same local system. This is why
Andrei Tănăsescu +2 more
doaj +2 more sources
Speed improvement of the quantum factorization algorithm of P. Shor by upgrade its classical part [PDF]
E3S Web of Conferences, 2020 This report discusses Shor’s quantum factorization algorithm and ρ–Pollard’s factorization algorithm. Shor’s quantum factorization algorithm consists of classical and quantum parts.
Cherckesova Larissa +5 more
doaj +1 more source
Shor's Factoring Algorithm and Modular Exponentiation Operators
Quanta, 2023 We provide a pedagogical presentation of Shor's factoring algorithm, which is a quantum algorithm for factoring very large numbers (of order of hundreds to thousands of bits) in polynomial time.
Robert L. Singleton Jr
doaj +1 more source
Large-Scale Simulation of Shor’s Quantum Factoring Algorithm
Mathematics, 2023 Shor’s factoring algorithm is one of the most anticipated applications of quantum computing. However, the limited capabilities of today’s quantum computers only permit a study of Shor’s algorithm for very small numbers.
Dennis Willsch +4 more
doaj +1 more source
AppliedMath, 2022 Shor’s algorithm for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis.
Johanna Barzen, Frank Leymann
doaj +1 more source