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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
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
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.
Quantum speedup stems from matching problem structure to interference patterns under constraints of measurement contexts, thermodynamic irreversibility, and contextuality, rather than from parallel computation.
citing papers explorer
-
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.
-
The Physical and Contextual Limits of Quantum Speedup
Quantum speedup stems from matching problem structure to interference patterns under constraints of measurement contexts, thermodynamic irreversibility, and contextuality, rather than from parallel computation.