# Shor's Algorithm from the Mindset of Quantum Oracles

@article{Cimmino2009ShorsAF, title={Shor's Algorithm from the Mindset of Quantum Oracles}, author={Luigi Cimmino}, journal={ArXiv}, year={2009}, volume={abs/0910.0287} }

The aim of this work is to show a brand-new way of making deterministic Quantum Computing (short QC), in the sense of Theory of Calculability, by meaning of unitary evolution. We start from the original Shor's Algorithm to explain how the newest one works, at least compared to theory. We will give a new conceptual foundation of QC, resulting from a set of conventional and well known results of Calculability and Quantum Mechanics. In the practice, if that can be used in its general sense, we… CONTINUE READING

#### Topics from this paper.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 34 REFERENCES

Quantum theory, the Church–Turing principle and the universal quantum computer

- Mathematics
- 1985

- 3,431
- PDF

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

- Computer Science, Mathematics
- 1999

- 6,302
- PDF

Mixing quantum and classical mechanics and uniqueness of Planck's constant

- Physics, Mathematics
- 2004

- 27
- PDF