On the public citation graph

Factoring 51 and 85 with 8 qubits

0 signed · 41 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.1007/3-540-49208-9_15openalex-snapshot
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
inferredcites →https://doi.org/10.1038/414883aopenalex-snapshot
Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
inferredcites →https://doi.org/10.1038/nature12290openalex-snapshot
Oversimplifying quantum factoring
inferredcites →https://doi.org/10.1038/nphoton.2012.259openalex-snapshot
Experimental realization of Shor's quantum factoring algorithm using qubit recycling
inferredcites →https://doi.org/10.1038/nphys2385openalex-snapshot
Computing prime factors with a Josephson phase qubit quantum processor
inferredcites →https://doi.org/10.1103/physreva.76.030306openalex-snapshot
Arbitrary accuracy iterative quantum phase estimation algorithm using a single ancillary qubit: A two-qubit benchmark
inferredcites →https://doi.org/10.1103/physrevlett.101.220405openalex-snapshot
Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
inferredcites →https://doi.org/10.1103/physrevlett.108.130501openalex-snapshot
Quantum Factorization of 143 on a Dipolar-Coupling Nuclear Magnetic Resonance System
inferredcites →https://doi.org/10.1103/physrevlett.76.3228openalex-snapshot
Semiclassical Fourier Transform for Quantum Computation
inferredcites →https://doi.org/10.1103/physrevlett.85.3049openalex-snapshot
Efficient Factorization with a Single Pure Qubit and logN Mixed Qubits
inferredcites →https://doi.org/10.1103/physrevlett.99.250504openalex-snapshot
Demonstration of a Compiled Version of Shor’s Quantum Factoring Algorithm Using Photonic Qubits
inferredcites →https://doi.org/10.1103/physrevlett.99.250505openalex-snapshot
Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement
inferredcites →https://doi.org/10.1119/1.1891170openalex-snapshot
Shor’s factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers
inferredcites →https://doi.org/10.1126/science.1173731openalex-snapshot
Shor’s Quantum Factoring Algorithm on a Photonic Chip
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.26421/qic3.2-8openalex-snapshot
Circuit for Shor's algorithm using 2n+3 qubits
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-030-14082-3_7openalex-snapshot
Variational Quantum Factoring
inferred← citeshttps://doi.org/10.1007/978-3-030-99379-5_7openalex-snapshot
Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-25823-2_3openalex-snapshot
Quantum Algorithms for Integer Factorization
inferred← citeshttps://doi.org/10.1007/978-3-319-72536-9_5openalex-snapshot
Factoring Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-15-2471-4_10openalex-snapshot
The Crown Jewels of Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/s10773-021-04756-6openalex-snapshot
The Cost Reduction of Distributed Quantum Factorization Circuits
inferred← citeshttps://doi.org/10.1007/s10773-023-05473-yopenalex-snapshot
Variational Quantum Computation Integer Factorization Algorithm
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/s11227-023-05233-zopenalex-snapshot
A survey on implementations of homomorphic encryption schemes
inferred← citeshttps://doi.org/10.1007/s11433-018-9307-1openalex-snapshot
Factoring larger integers with fewer qubits via quantum annealing with optimized parameters
inferred← citeshttps://doi.org/10.1007/s11859-017-1218-5openalex-snapshot
A new quantum algorithm for computing RSA ciphertext period
inferred← citeshttps://doi.org/10.1007/s42484-022-00072-2openalex-snapshot
Using Shor’s algorithm on near term Quantum computers: a reduced version
inferred← citeshttps://doi.org/10.1038/nature12290openalex-snapshot
Oversimplifying quantum factoring
inferred← citeshttps://doi.org/10.1038/s41598-018-36058-zopenalex-snapshot
Quantum Annealing for Prime Factorization
inferred← citeshttps://doi.org/10.1038/s41598-020-62802-5openalex-snapshot
Prime factorization algorithm based on parameter optimization of Ising model
inferred← citeshttps://doi.org/10.1038/s41598-021-00339-xopenalex-snapshot
Prime factorization using quantum variational imaginary time evolution
inferred← citeshttps://doi.org/10.1038/s41598-023-36813-xopenalex-snapshot
HUBO and QUBO models for prime factorization
inferred← citeshttps://doi.org/10.1063/5.0153709openalex-snapshot
Improving the success rate of quantum algorithm attacking RSA encryption system
inferred← citeshttps://doi.org/10.1109/access.2019.2953755openalex-snapshot
The Integer Factorization Algorithm With Pisano Period
inferred← citeshttps://doi.org/10.1109/icaect54875.2022.9807860openalex-snapshot
HLS Implementation of Quantum Shor’s Algorithm Using Matrix Pruning
inferred← citeshttps://doi.org/10.1145/3763066openalex-snapshot
qblaze: An Efficient and Scalable Sparse Quantum Simulator
inferred← citeshttps://doi.org/10.26599/tst.2023.9010059openalex-snapshot
Deciphering a Million-Plus RSA Integer with Ultralow Local Field Coefficient h and Coupling Coefficient J of the Ising Model by D-Wave 2000Q
inferred← citeshttps://doi.org/10.3389/fphy.2022.914578openalex-snapshot
Research on Quantum Annealing Integer Factorization Based on Different Columns
inferred← citeshttps://doi.org/10.48550/arxiv.1408.1968openalex-snapshot
More period finding with adiabatic quantum computation
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.