Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms

DOI10.1007/S11128-021-03398-1OpenAlexW4205750011MaRDI QIDQ2102279FDOQ2102279

Authors: Jinyoung Ha, Jun-Haeng Heo, Jong-Hyun Lee 

Publication date: 28 November 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-021-03398-1

Recommendations

• scientific article
• A low-resource quantum factoring algorithm
• Quantum factoring algorithm: resource estimation and survey of experiments
• Scalability of Shor’s algorithm with a limited set of rotation gates
• Implementation of Shor's algorithm on a linear nearest neighbour qubit array

zbMATH Keywords

quantum algorithmquantum computationquantum error correctionquantum gatesquantum resource analysis

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Multiple-particle interference and quantum error correction
• Quantum computation and quantum information. 10th anniversary edition
• Title not available (Why is that?)
• Scalability of Shor’s algorithm with a limited set of rotation gates
• Surface code quantum computing by lattice surgery

Cited In (5)

• MINIMAL EXECUTION TIME OF SHOR'S ALGORITHM AT LOW TEMPERATURES
• Concrete quantum cryptanalysis of binary elliptic curves via addition chain
• Concrete quantum cryptanalysis of binary elliptic curves via addition chain
• A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor
• Hierarchical system mapping for large-scale fault-tolerant quantum computing

This page was built for publication: Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102279)