Improved complexity of quantum oracles for ternary Grover algorithm for graph coloring

Proceedings - 41st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2011

Volumn , Issue , 2011, Pages 294-301

  Wang, Yushi ^a   Perkowski, Marek ^b  

^a Portland State University ^*

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

algorithm; coloring; complexity; cost; Grover's; map; oracle; quantum; ternary; Toffoli

Indexed keywords

COMPLEXITY; GROVER'S; ORACLE; QUANTUM; TERNARY; TOFFOLI;

ALGORITHMS; MANY VALUED LOGICS; QUANTUM COMPUTERS; QUANTUM OPTICS;

LOGIC CIRCUITS;

EID: 80051653175     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISMVL.2011.42     Document Type: Conference Paper

References (18)

1. A. Muthukrishnan, and C.R. Stroud, Jr. (2000). Multivalued logic gates for quantum computation. Phys. Rev. A 62, 52309.
2. Y. Fan, (2008). Applications of multi-valued quantum algorithms. arXiv: Available at arXiv:0901.4163v4.
3. also, Y. Fan: A Generalization of the Deutsch-Jozsa Algorithm to Multi-Valued Quantum Logic. Proc. ISMVL 2007: 12.
4. D. Maslov, and G.d Dueck. (2004). Improving quantum cost for n-bit Toffoli gates. arXiv: Available at arXiv:quantph/0403053v1
5. Ph. Kaye, et. al. (2007). An Introduction to Quantum Computing. Oxford: Oxford University Press Print.
6. A.N. Al-Rabadi et al., Multiple-Valued Quantum Logic. Proc. 11th ULSI, Boston, MA., May 2002.
7. R. Jozsa, (1999). Searching in Grover's algorithm. arXiv: Available at quant-ph/9901021.
8. M. Perkowski, (2015). Lecture notes on Quantum Computing. http://web.cecs.pdx.edu/~mperkows/
9. C. Lavor, and L.R.U. Manssur, (2003). Grover's algorithm: quantum database search. arXiv. Available at quant-ph/0301079.
10. R. Jozsa, (1997). Quantum algorithms and the Fourier transform. arXiv. Available at quant-ph/9707033.
11. A. Fabrikant, and T. Hogg, (2002) Graph coloring with quantum heuristics. American Association for Artificial Intelligence. Available at alex.fabrikant.us/papers/fh02.pdf
12. Z. Zilic, K. Radecka, Scaling and Better Approximating Quantum Fourier Transform by Higher Radices. IEEE Trans. Computers 56 (2): 202-207 (2007)
13. S. Hossain, "Classical and Quantum Search Algorithms for Quantum Circuits and Optimization of Quantum Oracles", Ph.D. Dissertation, 2009, Portland State University.
14. M. Perkowski, S. Hossain, F. Zhao, Minimal Graph Coloring using the Quantum Algorithm of Grover and the importance of the Quantum Composition/Layout Problem in the complete design of Quantum Oracles, Proc. ISBP 2010.
15. M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
16. L. Li, M.A. Thornton, M.A. Perkowski, "A Quantum CAD Accelerator Based on Grover's Algorithm for Finding the Minimum Fixed Polarity Reed-Muller Form," Proc. ISMVL 2006, pp. 33.
17. L. Grover, "A fast quantum mechanical algorithm for database search," Proc. 28th ACM Symp. on Theory of Computing 1996, pp. 212-219 1996.
18. M.D. Miller, and M.A. Thornton, "QMDD: A decision diagram structure for reversible and quantum circuits," Proc. 2006 ISMVL, Singapore, 6 pp, May 2006.