Quantum states for error correction are described by their stabilizer, a commuting group of tensor products of Pauli matrices, enabling analysis of a rich class of quantum effects short of full quantum computation.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
5 Pith papers cite this work, alongside 5 external citations. Polarity classification is still indexing.
5
Pith papers citing it
5
external citations · Pith
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.
representative citing papers
Feynman's clock maps arbitrary circuits onto Hamiltonian dynamics whose BBGKY hierarchy enables polynomial-overhead, controllable error mitigation via informed sampling.
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.
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.
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-interference appendix.
citing papers explorer
-
The Heisenberg Representation of Quantum Computers
Quantum states for error correction are described by their stabilizer, a commuting group of tensor products of Pauli matrices, enabling analysis of a rich class of quantum effects short of full quantum computation.
-
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.
-
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-interference appendix.