Publisher
Springer International Publishing
Reference28 articles.
1. Beauregard, S. (2003). Circuit for Shor’s algorithm using 2n+3 qubits.
2. Bera, R. K. (2020). The amazing world of quantum computing. Singapore: Springer.
3. Bernstein, E., & Vazirani, U. (1997). Quantum complexity theory. SIAM Journal on Computing, 26(5), 1411–1473.
4. Chen, L. (2017). Deciphering: The thrill of a lifetime. https://www.nist.gov/blogs/taking-measure/deciphering-thrill-lifetime. Retrieved 18 Jan 2022.
5. Chuang, I., Gershenfeld, N., & Kubinec, M. (1998). Experimental implementation of fast quantum searching. Physical Review Letters - PHYS REV LETT, 80(04), 3408–3411.