Academic literature on the topic 'Quantum halting problem'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Contents
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quantum halting problem.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Quantum halting problem"
SHALYT-MARGOLIN, A. E., V. I. STRAZHEV, and A. YA. TREGUBOVICH. "IRREVERSIBILITY IN THE HALTING PROBLEM OF QUANTUM COMPUTER." Modern Physics Letters B 21, no. 16 (July 10, 2007): 977–80. http://dx.doi.org/10.1142/s0217984907013559.
Full textDietrich, Eric, and Chris Fields. "Equivalence of the Frame and Halting Problems." Algorithms 13, no. 7 (July 20, 2020): 175. http://dx.doi.org/10.3390/a13070175.
Full textSong, Daegene. "Unsolvability of the Halting Problem in Quantum Dynamics." International Journal of Theoretical Physics 47, no. 7 (December 6, 2007): 1785–91. http://dx.doi.org/10.1007/s10773-007-9621-x.
Full textSiomau, Michael. "Undecidable, Unrecognizable, and Quantum Computing." Quantum Reports 2, no. 3 (July 1, 2020): 337–42. http://dx.doi.org/10.3390/quantum2030023.
Full textTarrataca, Luís, and Andreas Wichert. "Quantum Iterative Deepening with an Application to the Halting Problem." PLoS ONE 8, no. 3 (March 8, 2013): e57309. http://dx.doi.org/10.1371/journal.pone.0057309.
Full textMANIN, YURI I. "Renormalisation and computation II: time cut-off and the Halting Problem." Mathematical Structures in Computer Science 22, no. 5 (September 6, 2012): 729–51. http://dx.doi.org/10.1017/s0960129511000508.
Full textProos, J., and Ch Zalka. "Shor's discrete logarithm quantum algorithm for elliptic curves." Quantum Information and Computation 3, no. 4 (July 2003): 317–44. http://dx.doi.org/10.26421/qic3.4-3.
Full textGÖKDEN, BURÇ. "SEMICLASSICAL QUANTUM COMPUTATION SOLUTIONS TO THE COUNT TO INFINITY PROBLEM: A BRIEF DISCUSSION." International Journal of Quantum Information 03, no. 01 (March 2005): 159–64. http://dx.doi.org/10.1142/s0219749905000645.
Full textJi, Zhengfeng, Anand Natarajan, Thomas Vidick, John Wright, and Henry Yuen. "MIP* = RE." Communications of the ACM 64, no. 11 (November 2021): 131–38. http://dx.doi.org/10.1145/3485628.
Full textShojaei-Fard, Ali. "Non-perturbative graph languages, halting problem and complexity." Forum Mathematicum, June 30, 2022. http://dx.doi.org/10.1515/forum-2021-0119.
Full textDissertations / Theses on the topic "Quantum halting problem"
Lagana, Antonio. "Quantum computation and a universal quantum computer." Thesis, 2012. http://hdl.handle.net/2440/77320.
Full textThesis (Ph.D.) -- University of Adelaide, School of Chemistry and Physics, 2012