REVIEW 10 cited by
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.
Forward citations
Cited by 10 Pith papers
-
Local Equivalences of Graph States
Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.
-
Universal Quantum Computation with Multi-Mode Schr\"odinger Cat States Stabilized by Non-Local Dissipation Engineering
Dissipatively stabilized multi-mode Schrödinger-cat qubits are made universal by adding a self-Kerr Z(π/2) gate and a beam-splitter-induced XX(π/2) entangling gate.
-
Feynman's clock and hierarchy-informed sampling for quantum error mitigation
Feynman's clock maps arbitrary circuits onto Hamiltonian dynamics whose BBGKY hierarchy enables polynomial-overhead, controllable error mitigation via informed sampling.
-
Experimental characterization of the hierarchy of quantum correlations in top quark pairs
LHC top-quark data show quantum discord at >5σ, first evidence for steering at >3σ, no Bell correlations, and nonzero magic.
-
An Improved Quantum Algorithm for 3-Tuple Lattice Sieving
Using two-level amplitude amplification over random-product-code center points, 3-tuple lattice sieving runs in quantum time 2^{0.2846d} with memory 2^{0.1887d}, improving the previous 2^{0.3098d}.
-
Production of Magic States via $Z$ Bosons and Dark Photons
Magic distributions are computed for EW processes (reproducing QED at low energy, new at high energy/Z resonance) and dark-sector scatterings, reaching maximal magic at mass ratios m_f/m_χ → 0 and → 1.83929.
-
Architecting Hybrid Quantum-Classical Software Systems: Exploration of the Design Trade-off Space with Quantitative Guarantees
The paper formalizes a hybrid quantum-classical architectural style and demonstrates a method that identifies decision boundaries for selecting configurations based on user QoS criteria.
-
Answer Partitions and Oracle Access Determine Quantum Query Complexity
The abstract and full text of arXiv:2605.12675 describe different papers; the abstract's partition-query classification is absent from the v3 text, which is a clarificatory essay with a correct but routine which-path-...
-
Towards Continuous-variable Quantum Neural Networks for Biomedical Imaging
A 4-qumode Gaussian CV-QNN classifies MedMNIST images with accuracy statistically indistinguishable from a 42-parameter classical linear model and a DV-QNN.
-
Mid-circuit measurement as an algorithmic primitive
A single-ancilla Hadamard test post-selects a QAOA state toward low-energy answers, but the implementation sets its parameters from the exact ground energy, making the convergence demonstration self-referential.
Discussion (0). Sign in to comment.