參考文獻 |
[1]Graph Algorithms in Bioinformatics Retrieved March 1, 2023, from https://cseweb.ucsd.edu/classes/wi12/cse282-a/Lecture06_Ch08_GraphsDNAseq.pdf
[2]Karp, R. M. (1972). Reducibility among combinatorial problems. In Complexity of computer computations (pp. 85-103). Springer, Boston, MA.
[3]Preskill, J. (2018). Quantum computing in the NISQ era and beyond. Quantum, 2, 79.
[4]Rigetti Computing, Inc. (2021, March 10). Rigetti investor presentation. Retrieved February 6, 2023, from https://investors.rigetti.com/node/7141/html
[5]International Business Machines Corporation(n.d.)The IBM Quantum Development Roadmap. Retrieved February 6, 2023, from https://www.ibm.com/quantum/roadmap
[6]科技產業資訊室 (iKnow) (2021年5月14日)。主要16國家量子科技政策 預算超過246億美元。2023年2月6日,取自:https://iknow.stpi.narl.org.tw/Post/Read.aspx?PostID=17799
[7]Shor, P. W. (1994, November). Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science (pp. 124-134). Ieee.
[8]Grover, L. K. (1996, July). A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (pp. 212-219).
[9]Wekipedia:Hamiltonian path problem. Retrieved March 1, 2023, from https://en.wikipedia.org/wiki/Hamiltonian_path_problem
[10]Dirac, P. A. M. (1939, July). A new notation for quantum mechanics. In Mathematical Proceedings of the Cambridge Philosophical Society (Vol. 35, No. 3, pp. 416-418). Cambridge University Press.
[11]Building a useful quantum computer Retrieved Jun 7, 2023, from https://quantumai.google/qecmilestone
[12]IBM Qiskit Retrieved Jun 7, 2023, from https://qiskit.org/
[13]Baldwin, C. H., Mayer, K., Brown, N. C., Ryan-Anderson, C., & Hayes, D. (2022). Re-examining the quantum volume test: Ideal distributions, compiler optimizations, confidence intervals, and scalable resource estimations. Quantum, 6, 707.
[14]Transpiler Passes and Pass Manager Retrieved Jun 7, 2023, from https://github.com/Qiskit/qiskit-tutorials/blob/master/tutorials/circuits_advanced/04_transpiler_passes_and_passmanager.ipynb
[15]Murali, P., Baker, J. M., Javadi-Abhari, A., Chong, F. T., & Martonosi, M. (2019, April). Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers. In Proceedings of the twenty-fourth international conference on architectural support for programming languages and operating systems (pp. 1015-1029).
[16]Li, G., Ding, Y., & Xie, Y. (2019, April). Tackling the qubit mapping problem for NISQ-era quantum devices. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (pp. 1001-1014).
[17]AerSimulator Retrieved Jun 7, 2023, from https://qiskit.org/ecosystem/aer/stubs/qiskit_aer.AerSimulator.html
[18]江振瑞(2022)。輕鬆學量子程式設計 -- 從量子位元到量子演算法。桃園市:碁峰資訊。
[19]Chen, G., Fulling, S. A., Lee, H., & Scully, M. O. (2001). Grover’s algorithm for multiobject search in quantum computing. In Directions in Quantum Optics: A Collection of Papers Dedicated to the Memory of Dan Walls Including Papers Presented at the TAMU-ONR Workshop Held at Jackson, Wyoming, USA, 26–30 July 1999 (pp. 165-175). Springer Berlin Heidelberg.
[20]Fawly(2021, June) Wekipedia:Grover′s algorithm. Retrieved March 1, 2023,from https://en.wikipedia.org/wiki/Grover%27s_algorithm#/media/File:Grover′s_algorithm_circuit.svg
[21]Nielsen, M.A. and Chuang, I.L. Quantum computation and quantum information. Cambridge University Press, 2000. Chapter 6.
[22]Saha, A., Saha, D., & Chakrabarti, A. (2020, December). Circuit design for k-coloring problem and its implementation on near-term quantum devices. In 2020 IEEE International Symposium on Smart Electronic Systems (iSES)(Formerly iNiS) (pp. 17-22). IEEE.
[23]Lutze, D. (2021). Solving Chromatic Number with Quantum Search and Quantum Counting. Master Thesis, California Polytechnic State University.
[24]Haverly, A., & López, S. (2021, July). Implementation of Grover’s Algorithm to Solve the Maximum Clique Problem. In 2021 IEEE Computer Society Annual Symposium on VLSI (ISVLSI) (pp. 441-446). IEEE.
[25]Mukherjee, S. (2022). A grover search-based algorithm for the list coloring problem. IEEE Transactions on Quantum Engineering, 3, 1-8.
[26]Roch, C., Castillo, S. L., & Linnhoff-Popien, C. (2022, March). A Grover based Quantum Algorithm for Finding Pure Nash Equilibria in Graphical Games. In 2022 IEEE 19th International Conference on Software Architecture Companion (ICSA-C) (pp. 147-151). IEEE.
[27]Alasow, A., & Perkowski, M. (2022, May). Quantum Algorithm for Maximum Satisfiability. In 2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL) (pp. 27-34). IEEE.
[28]Jehn-Ruey Jiang, "Quantum Circuit Based on Grover Algorithm to Solve Hamiltonian Cycle Problem," accepted to present at IEEE Eurasia Conference on IOT, Communication and Engineering (IEEE ECICE 2022), 2022.
[29]Wang, P. H., Chen, J. H., & Tseng, Y. J. (2022). Intelligent pharmaceutical patent search on a near-term gate-based quantum computer. Scientific Reports, 12(1), 175.
[30]Heidari, S., & Farzadnia, E. (2017). A novel quantum LSB-based steganography method using the Gray code for coloured quantum images. Quantum Information Processing, 16(10), 242.
[31]Boyer, M., Brassard, G., Høyer, P., & Tapp, A. (1998). Tight bounds on quantum searching. Fortschritte der Physik: Progress of Physics, 46(4‐5), 493-505.
[32]Held, M., & Karp, R. M. (1962). A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied mathematics, 10(1), 196-210.
[33]Björklund, A., & Husfeldt, T. (2013, October). The parity of directed Hamiltonian cycles. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (pp. 727-735). IEEE.
[34]Iwama, K., & Nakashima, T. (2007, July). An improved exact algorithm for cubic graph TSP. In International Computing and Combinatorics Conference (pp. 108-117). Springer, Berlin, Heidelberg.
[35]Eppstein, D. (2007). The traveling salesman problem for cubic graphs. J. Graph Algorithms Appl., 11(1), 61-81.
[36]Bjorklund, A. (2014). Determinant sums for undirected hamiltonicity. SIAM Journal on Computing, 43(1), 280-299.
[37]Nation, P., & Johnson, B. (2021). How to measure and reset a qubit in the middle of a circuit execution. IBM Research Blog, 11.
[38]Mastriani, M. (2019). Non-ambiguity quantum teleportation protocol. arXiv preprint arXiv:2001.05832.
[39]IBM Quantum, https://quantum-computing.ibm.com/ (accessed May
26, 2023).
[40]Mao, Y., Shresthamali, S., & Kondo, M. (2023). Quantum Circuit Fidelity Improvement with Long Short-Term Memory Networks. arXiv preprint arXiv:2303.17523. |