Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation

@article{Seifert2000UsingFQ,
  title={Using fewer Qubits in Shor's Factorization Algorithm via Simultaneous Diophantine Approximation},
  author={Jean-Pierre Seifert},
  journal={IACR Cryptology ePrint Archive},
  year={2000},
  volume={2000},
  pages={36}
}
While quantum computers might speed up in principle certain computations dramatically , in pratice, though quantum computing technology is still in its infancy. Even we cannot clearly envison at present what the hardware of that machine will be like. Nevertheless, we can be quite conndent that it will be much easier to build any practical quantum computer operating on a few number of quantum bits rather than one operating on a huge number of of quantum bits. It is therefore of big practical… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

An Introduction to Linear and Integer Programming

A. Schrijver
John Wiley & Sons, New York • 1986
View 5 Excerpts
Highly Influenced

Silicon based quantum computation

B. E. Kane
Technical report, quant-ph/0003031 • 2000

Quantum Computations with Cold Trapped Ions.

Physical review letters • 1995
View 1 Excerpt