Realization of Shor's Algorithm at Room Temperature
arXiv:1706.03215
Abstract
Shor's algorithm can find prime factors of a large number more efficiently than any known classical algorithm. Understanding the properties that gives the speedup is essential for a general and scalable construction. Here we present a realization of Shor's algorithm, that does not need any of the simplifications presently needed in current experiments and also gives smaller systematic errors than any former experimental implementation. Our realization is based on classical pass-transistor logic, runs at room temperature, and uses the same amount of resources as a scalable quantum computer. In this paper, the focus is not on the result of the factorization, but to compare our realization with current state-of-the-art experiment, factoring 15. Our result gives further insight to the resources needed for quantum computation, aiming for a true understanding of the subject.
4 pages, 4 figures
References in corpus (12)
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Improved Simulation of Stabilizer Circuits
- Realization of a scalable Shor algorithm
- Shor's quantum factoring algorithm on a photonic chip
- Semiclassical Fourier Transform for Quantum Computation
- Experimental realisation of Shor's quantum factoring algorithm using qubit recycling
- Experimental demonstration of Shor's algorithm with quantum entanglement
- An approximate Fourier transform useful in quantum factoring
- Computing prime factors with a Josephson phase qubit quantum processor
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- Pretending to factor large numbers on a quantum computer
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms