Local Transition Functions of Quantum Turing Machines
RAIRO-Theor. Inf. Appl., 34 5 (2000) 379-402
Published online: 2002-04-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Quaternionic quantum Turing machines
Songsong DaiFrontiers in Physics 11 (2023)
https://doi.org/10.3389/fphy.2023.1162973
How does adiabatic quantum computation fit into quantum automata theory?
Tomoyuki YamakamiInformation and Computation 284 104694 (2022)
https://doi.org/10.1016/j.ic.2021.104694
Quantum Turing Machines: Computations and Measurements
Stefano Guerrini, Simone Martini and Andrea MasiniApplied Sciences 10 (16) 5551 (2020)
https://doi.org/10.3390/app10165551
A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
TOMOYUKI YAMAKAMIThe Journal of Symbolic Logic 85 (4) 1546 (2020)
https://doi.org/10.1017/jsl.2020.45
Revisiting the simulation of quantum Turing machines by quantum circuits
Abel Molina and John WatrousProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 475 (2226) 20180767 (2019)
https://doi.org/10.1098/rspa.2018.0767
Mathematical Foundations of Quantum Information and Computation and Its Applications to Nano- and Bio-systems
Masanori Ohya and Igor VolovichTheoretical and Mathematical Physics, Mathematical Foundations of Quantum Information and Computation and Its Applications to Nano- and Bio-systems 313 (2011)
https://doi.org/10.1007/978-94-007-0171-7_11
Paraconsistent Machines and their Relation to Quantum Computing
J. C. Agudelo and W. CarnielliJournal of Logic and Computation 20 (2) 573 (2010)
https://doi.org/10.1093/logcom/exp072
Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families
Harumichi Nishimura and Masanao OzawaQuantum Information Processing 8 (1) 13 (2009)
https://doi.org/10.1007/s11128-008-0091-8
Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity
Markus MullerIEEE Transactions on Information Theory 54 (2) 763 (2008)
https://doi.org/10.1109/TIT.2007.913263
Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno’s Theorem
Fabio Benatti, Tyll Krüger, Markus Müller, Rainer Siegmund-Schultze and Arleta SzkołaCommunications in Mathematical Physics 265 (2) 437 (2006)
https://doi.org/10.1007/s00220-006-0027-z
Quantum branching programs and space-bounded nonuniform quantum complexity
Martin Sauerhoff and Detlef SielingTheoretical Computer Science 334 (1-3) 177 (2005)
https://doi.org/10.1016/j.tcs.2004.12.031
Polynomial time quantum computation with advice
Harumichi Nishimura and Tomoyuki YamakamiInformation Processing Letters 90 (4) 195 (2004)
https://doi.org/10.1016/j.ipl.2004.02.005
ANALYSIS OF QUANTUM FUNCTIONS
TOMOYUKI YAMAKAMIInternational Journal of Foundations of Computer Science 14 (05) 815 (2003)
https://doi.org/10.1142/S0129054103002047
QUANTUM COMPUTATION WITH RESTRICTED AMPLITUDES
HARUMICHI NISHIMURAInternational Journal of Foundations of Computer Science 14 (05) 853 (2003)
https://doi.org/10.1142/S0129054103002059
STACS 2002
Harumichi NishimuraLecture Notes in Computer Science, STACS 2002 2285 311 (2002)
https://doi.org/10.1007/3-540-45841-7_25