On the public citation graph

A quantum circuit for Shor's factoring algorithm using 2n+2 qubits

https://doi.org/10.26421/qic6.2-4
0 signed · 52 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1093/ietfec/e88-a.1.105openalex-snapshot
Exact Analyses of Computational Time for Factoring in Quantum Computers
inferredcites →https://doi.org/10.1103/physreva.54.147openalex-snapshot
Quantum networks for elementary arithmetic operations
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1109/sfcs.2000.892140openalex-snapshot
Fast parallel circuits for the quantum Fourier transform
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.26421/qic3.2-8openalex-snapshot
Circuit for Shor's algorithm using 2n+3 qubits
inferredcites →https://doi.org/10.26421/qic5.6-2openalex-snapshot
A linear-size quantum circuit for addition with no ancillary qubits
inferredcites →https://doi.org/10.4230/lipics.snapl.2019.12openalex-snapshot
An approximate Fourier transform useful in quantum factoring
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0008033openalex-snapshot
Addition on a Quantum Computer
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9806084openalex-snapshot
Fast versions of Shor's quantum factoring algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-031-97063-4_11openalex-snapshot
Ancilla-Free Quantum Adder with Sublinear Depth
inferred← citeshttps://doi.org/10.1007/978-3-032-09303-5_8openalex-snapshot
Quantum Circuit Simulation
inferred← citeshttps://doi.org/10.1007/978-3-319-59879-6_19openalex-snapshot
A Low-Resource Quantum Factoring Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-15-5191-8_7openalex-snapshot
Quantum Factoring Algorithm: Resource Estimation and Survey of Experiments
inferred← citeshttps://doi.org/10.1007/978-981-96-1218-5_7openalex-snapshot
Shor’s Quantum Algorithm for Solving the Binary ECDLP: A Survey
inferred← citeshttps://doi.org/10.1007/s00145-026-09572-xopenalex-snapshot
Space-Efficient and Noise-Robust Quantum Factoring
inferred← citeshttps://doi.org/10.1007/s11128-020-02673-xopenalex-snapshot
Quantum algorithms for typical hard problems: a perspective of cryptanalysis
inferred← citeshttps://doi.org/10.1007/s11128-025-04968-3openalex-snapshot
Construction and optimization of quantum modular exponentiation circuits based on the V gate
inferred← citeshttps://doi.org/10.1016/j.micpro.2019.02.003openalex-snapshot
Advantages of a modular high-level quantum programming framework
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.039openalex-snapshot
Power of uninitialized qubits in shallow quantum circuits
inferred← citeshttps://doi.org/10.1063/5.0186385openalex-snapshot
An efficient quantum circuit implementation of Shor’s algorithm for GPU accelerated simulation
inferred← citeshttps://doi.org/10.1073/pnas.1801723115openalex-snapshot
Toward the first quantum simulation with quantum speedup
inferred← citeshttps://doi.org/10.1088/1367-2630/acfd52openalex-snapshot
An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit
inferred← citeshttps://doi.org/10.1103/lrld-vn7gopenalex-snapshot
Discrete Fourier-transform-based quantum circuit for modular multiplication in Shor's algorithm
inferred← citeshttps://doi.org/10.1103/physreva.88.062310openalex-snapshot
Robustness and performance scaling of a quantum computer with respect to a class of static defects
inferred← citeshttps://doi.org/10.1103/physreva.96.012306openalex-snapshot
Factoring with qutrits: Shor's algorithm on ternary and metaplectic quantum architectures
inferred← citeshttps://doi.org/10.1103/physrevx.2.031007openalex-snapshot
Layered Architecture for Quantum Computing
inferred← citeshttps://doi.org/10.1109/ecice59523.2023.10383099openalex-snapshot
Distributed Shor’s Algorithm with Sequential Quantum Teleportation
inferred← citeshttps://doi.org/10.1109/icsp54964.2022.9778669openalex-snapshot
Grover algorithm circuit optimization and noise analysis on integer factorization
inferred← citeshttps://doi.org/10.1109/mc.2022.3218046openalex-snapshot
Post-Quantum Adversarial Modeling: A User’s Perspective
inferred← citeshttps://doi.org/10.1109/qce60285.2024.00095openalex-snapshot
Decision Diagram vs. State Vector: A Comparative Study on Quantum Computing Simulation Efficiency
inferred← citeshttps://doi.org/10.1109/qsw62656.2024.00025openalex-snapshot
Accelerating Decision Diagram-based Multi-node Quantum Simulation with Ring Communication and Automatic SWAP Insertion
inferred← citeshttps://doi.org/10.1109/tqe.2025.3610800openalex-snapshot
Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
inferred← citeshttps://doi.org/10.1109/vlsi-soc62099.2024.10767796openalex-snapshot
Minimum Depth Quantum Modular Addition Through Carry-Save Architecture
inferred← citeshttps://doi.org/10.1155/2023/2963110openalex-snapshot
Feasibility Analysis of Cracking RSA with Improved Quantum Circuits of the Shor’s Algorithm
inferred← citeshttps://doi.org/10.1186/s40580-025-00525-xopenalex-snapshot
Photonic variational quantum eigensolver for NISQ-compatible quantum technology
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.1276openalex-snapshot
Quantum Arithmetic Circuits: A Survey
inferred← citeshttps://doi.org/10.18690/978-961-286-485-9.35openalex-snapshot
Quantum Computer Resistant Cryptographic Methods and Their Suitability for Long-Term Preservation of Evidential Value
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2018739/v1openalex-snapshot
A Survey on Implementations of Homomorphic Encryption Schemes
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2018739/v2openalex-snapshot
A Survey on Implementations of Homomorphic Encryption Schemes
inferred← citeshttps://doi.org/10.22364/bjmc.2018.7.1.08openalex-snapshot
A Faster Half Subtractor Circuit Using Reversible Quantum Gates
inferred← citeshttps://doi.org/10.22364/bjmc.2019.7.1.08openalex-snapshot
A Faster Half Subtractor Circuit Using Reversible Quantum Gates
inferred← citeshttps://doi.org/10.26421/qic10.9-10-12openalex-snapshot
Quantum addition circuits and unbounded fan-out
inferred← citeshttps://doi.org/10.26421/qic13.11-12-3openalex-snapshot
A 2D nearest-neighbor quantum architecture for factoring in polylogarithmic depth
inferred← citeshttps://doi.org/10.26421/qic17.7-8-7openalex-snapshot
Factoring using 2n+2 qubits with Toffoli based modular multiplication
inferred← citeshttps://doi.org/10.26421/qic7.4-7openalex-snapshot
The quantum Fourier transform on a linear nearest neighbor architecture
inferred← citeshttps://doi.org/10.26421/qic8.8-9-1openalex-snapshot
Estimating Jones polynomials is a complete problem for one clean qubit
inferred← citeshttps://doi.org/10.3929/ethz-b-000457964openalex-snapshot
Assertion-based optimization of Quantum programs
inferred← citeshttps://doi.org/10.48550/arxiv.0809.2307openalex-snapshot
Quantum Computation Beyond the Circuit Model
inferred← citeshttps://doi.org/10.48550/arxiv.2112.11358openalex-snapshot
CNOT-count optimized quantum circuit of the Shor's algorithm
inferred← citeshttps://doi.org/10.5555/2017011.2017012openalex-snapshot
Estimating Jones polynomials is a complete problem for one clean qubit
inferred← citeshttps://doi.org/10.7566/jpsj.93.054002openalex-snapshot
Optimized Synthesis of Circuits for Diagonal Unitary Matrices with Reflection Symmetry
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.