Увійти

Готові списки джерел за темами / Universal quantum turing machine

Добірка наукової літератури з теми "Universal quantum turing machine"

Автор: Grafiati

Опубліковано: 10 грудня 2022

Оновлено: 28 січня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Universal quantum turing machine".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Universal quantum turing machine"

1

Iriyama, Satoshi, Takayuki Miyadera, and Masanori Ohya. "Note on a universal quantum Turing machine." Physics Letters A 372, no. 31 (July 2008): 5120–22. http://dx.doi.org/10.1016/j.physleta.2008.05.069.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

AKL, SELIM G. "THREE COUNTEREXAMPLES TO DISPEL THE MYTH OF THE UNIVERSAL COMPUTER." Parallel Processing Letters 16, no. 03 (September 2006): 381–403. http://dx.doi.org/10.1142/s012962640600271x.

Повний текст джерела

Анотація:

It is shown that the concept of a Universal Computer cannot be realized. Specifically, instances of a computable function [Formula: see text] are exhibited that cannot be computed on any machine [Formula: see text] that is capable of only a finite and fixed number of operations per step. This remains true even if the machine [Formula: see text] is endowed with an infinite memory and the ability to communicate with the outside world while it is attempting to compute [Formula: see text]. It also remains true if, in addition, [Formula: see text] is given an indefinite amount of time to compute [Formula: see text]. This result applies not only to idealized models of computation, such as the Turing Machine and the like, but also to all known general-purpose computers, including existing conventional computers (both sequential and parallel), as well as contemplated unconventional ones such as biological and quantum computers. Even accelerating machines (that is, machines that increase their speed at every step) cannot be universal.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Muller, Markus. "Strongly Universal Quantum Turing Machines and Invariance of Kolmogorov Complexity." IEEE Transactions on Information Theory 54, no. 2 (February 2008): 763–80. http://dx.doi.org/10.1109/tit.2007.913263.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Sarkar, Aritra, Zaid Al-Ars, and Koen Bertels. "Estimating Algorithmic Information Using Quantum Computing for Genomics Applications." Applied Sciences 11, no. 6 (March 17, 2021): 2696. http://dx.doi.org/10.3390/app11062696.

Повний текст джерела

Анотація:

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offers polynomial advantage, in contrast to the exhaustive enumeration needed in the corresponding classical case. The unstructured output data and the computational irreducibility of Turing machines make this algorithm impossible to approximate using heuristics. Thus, exploring the space of program-output relations is one of the most promising problems for demonstrating quantum supremacy using Grover search that cannot be dequantized. Experimental use cases for quantum acceleration are developed for self-replicating programs and algorithmic complexity of short strings. With quantum computing hardware rapidly attaining technological maturity, we discuss how this framework will have significant advantage for various genomics applications in meta-biology, phylogenetic tree analysis, protein-protein interaction mapping and synthetic biology. This is the first time experimental algorithmic information theory is implemented using quantum computation. Our implementation on the Qiskit quantum programming platform is copy-left and is publicly available on GitHub.

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Rowlands, Sydney, and Peter Rowlands. "A universal rewrite system adapted for formal language theory, classical and quantum computing." Journal of Physics: Conference Series 2197, no. 1 (March 1, 2022): 012024. http://dx.doi.org/10.1088/1742-6596/2197/1/012024.

Повний текст джерела

Анотація:

Abstract The meta-pattern of the universe, first formulated by Rowlands and Diaz [2002], is a universal rewrite system (URS). This universal pattern finds a formulation in formal language theory centred around the fundamental semantic unit of the zero word or the zero string: 0 = XoX# 0. This is realized successively in the computational procedures of Turing machines, Post machines and Finite machines with two pushdown stores.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Currin, Andrew, Konstantin Korovin, Maria Ababi, Katherine Roper, Douglas B. Kell, Philip J. Day, and Ross D. King. "Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA." Journal of The Royal Society Interface 14, no. 128 (March 2017): 20160990. http://dx.doi.org/10.1098/rsif.2016.0990.

Повний текст джерела

Анотація:

The theory of computer science is based around universal Turing machines (UTMs): abstract machines able to execute all possible algorithms. Modern digital computers are physical embodiments of classical UTMs. For the most important class of problem in computer science, non-deterministic polynomial complete problems, non-deterministic UTMs (NUTMs) are theoretically exponentially faster than both classical UTMs and quantum mechanical UTMs (QUTMs). However, no attempt has previously been made to build an NUTM, and their construction has been regarded as impossible. Here, we demonstrate the first physical design of an NUTM. This design is based on Thue string rewriting systems, and thereby avoids the limitations of most previous DNA computing schemes: all the computation is local (simple edits to strings) so there is no need for communication, and there is no need to order operations. The design exploits DNA's ability to replicate to execute an exponential number of computational paths in P time. Each Thue rewriting step is embodied in a DNA edit implemented using a novel combination of polymerase chain reactions and site-directed mutagenesis. We demonstrate that the design works using both computational modelling and in vitro molecular biology experimentation: the design is thermodynamically favourable, microprogramming can be used to encode arbitrary Thue rules, all classes of Thue rule can be implemented, and non-deterministic rule implementation. In an NUTM, the resource limitation is space, which contrasts with classical UTMs and QUTMs where it is time. This fundamental difference enables an NUTM to trade space for time, which is significant for both theoretical computer science and physics. It is also of practical importance, for to quote Richard Feynman ‘there's plenty of room at the bottom’. This means that a desktop DNA NUTM could potentially utilize more processors than all the electronic computers in the world combined, and thereby outperform the world's current fastest supercomputer, while consuming a tiny fraction of its energy.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Kurgaev, A. F., and S. N. Grygoryev. "The universal turing machine interpreter." Reports of the National Academy of Sciences of Ukraine, no. 10 (November 16, 2016): 28–34. http://dx.doi.org/10.15407/dopovidi2016.10.028.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

ROBINSON, RAPHAEL M. "MINSKY'S SMALL UNIVERSAL TURING MACHINE." International Journal of Mathematics 02, no. 05 (October 1991): 551–62. http://dx.doi.org/10.1142/s0129167x91000302.

Повний текст джерела

Анотація:

Marvin L. Minsky constructed a 4-symbol 7-state universal Turing machine in 1962. It was first announced in a postscript to [2] and is also described in [3, Sec. 14.8]. This paper contains everything that is needed for an understanding of his machine, including a complete description of its operation. Minsky's machine remains one of the minimal known universal Turing machines. That is, there is no known such machine which decreases one parameter without increasing the other. However, Rogozhin [6], [7] has constructed seven universal machines with the following parameters: [Formula: see text] His 4-symbol 7-state machine is somewhat different from Minsky's, but all of his machines use a construction similar to that used by Minsky. The following corrections should be noted: First machine, for q 6 00Lq 1 read q 6 00Lq 7; second machine, for q 4 11Rq 4 read q 4 11Rq 10; last machine, for q 2 b 2 bLq 2 read [Formula: see text]. A generalized Turing machine with 4 symbols and 7 states, closely related to Minsky's, was constructed and used in [5].

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Copeland, B. Jack, and Richard Sylvan. "Beyond the universal Turing machine." Australasian Journal of Philosophy 77, no. 1 (March 1999): 46–66. http://dx.doi.org/10.1080/00048409912348801.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Crounse, K. R., and L. O. Chua. "The CNN Universal Machine is as universal as a Turing Machine." IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 43, no. 4 (April 1996): 353–55. http://dx.doi.org/10.1109/81.488819.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Universal quantum turing machine"

1

Müller, Markus. "Quantum Kolmogorov complexity and the quantum turing machine." [S.l.] : [s.n.], 2007. http://opus.kobv.de/tuberlin/volltexte/2007/1655.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Lagana, Antonio. "Quantum computation and a universal quantum computer." Thesis, 2012. http://hdl.handle.net/2440/77320.

Повний текст джерела

Анотація:

This thesis covers two main topics in quantum computing: universal quantum computation and quantum search. We first demonstrate how a quantum harmonic oscillator can be used to implement the universal set of quantum gates and thereby serve as one possible building block for a universal quantum computer. We then address the core and primary focus of this thesis, the theoretical construction of a machine that can compute every computable function, that is, a universal (i.e.programmable) quantum computer. We thereby settle the questions that have been raised over the years regarding the validity of the UQTM proposed by Deutsch in 1985. We then demonstrate how to interface the universal quantum computer to external quantum devices by developing programs that implement well-known oracle based algorithms, including the well-known Grover search algorithm, using networked quantum oracle devices. Finally, we develop a partial search oracle and explore symmetry based partial search algorithms utilizing this oracle.
Thesis (Ph.D.) -- University of Adelaide, School of Chemistry and Physics, 2012

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Müller, Markus [Verfasser]. "Quantum Kolmogorov complexity and the Quantum Turing Machine / vorgelegt von Markus Müller." 2007. http://d-nb.info/985912529/34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "Universal quantum turing machine"

1

Rolf, Herken, ed. The universal turing machine: A half-century survey. Oxford: Oxford University Press, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Herken, Rolf, ed. The Universal Turing Machine A Half-Century Survey. Vienna: Springer Vienna, 1995. http://dx.doi.org/10.1007/978-3-7091-6597-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Herken, Rolf. The Universal Turing Machine A Half-Century Survey. Vienna: Springer Vienna, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

The universal computer: The road from Leibniz to Turing. Boca Raton, Fla: CRC Press, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Rolf, Herken, ed. The Universal Turing machine: A half-centurysurvey. Oxford: Oxford University Press, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Rolf, Herken, ed. The universal Turing machine: A half-century survey. 2nd ed. Wien: Springer-Verlag, 1995.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Herken, Rolf. The Universal Turing Machine: A Half-Century Survey. Oxford University Press, USA, 1992.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Rolf, Herken, ed. The universal Turing machine: A half-century survey. Wien: Springer-Verlag, 1994.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Rolf, Herken, ed. The Universal Turing machine: A half-century survey. Oxford: Oxford University Press, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Herken, Rolf. The Universal Turing Machine: A Half-Century Survey. Oxford University Press, USA, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Universal quantum turing machine"

1

Weik, Martin H. "universal Turing machine." In Computer Science and Communications Dictionary, 1865. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_20474.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Rendell, Paul. "Universal Counter Machine—Turing Machine." In Turing Machine Universality of the Game of Life, 143–46. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19842-2_9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Aanderaa, Stål. "A universal Turing machine." In Computer Science Logic, 1–4. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56992-8_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Scegulnaja, Oksana. "Quantum Real - Time Turing Machine." In Fundamentals of Computation Theory, 412–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44669-9_45.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Rendell, Paul. "Game of Life Universal Turing Machine." In Turing Machine Universality of the Game of Life, 71–89. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19842-2_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Rendell, Paul. "A Simple Universal Turing Machine for the Game of Life Turing Machine." In Game of Life Cellular Automata, 519–45. London: Springer London, 2010. http://dx.doi.org/10.1007/978-1-84996-217-9_26.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Chepurnoy, Alexander, Vasily Kharin, and Dmitry Meshkov. "Self-reproducing Coins as Universal Turing Machine." In Lecture Notes in Computer Science, 57–64. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00305-0_4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Restrepo, Hector Fabio, Gianluca Tempesti, and Daniel Mange. "Implementation of a Self-replicating Universal Turing Machine." In Alan Turing: Life and Legacy of a Great Thinker, 241–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-05642-4_10.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Axelsen, Holger Bock, and Robert Glück. "A Simple and Efficient Universal Reversible Turing Machine." In Language and Automata Theory and Applications, 117–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21254-3_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Dubrovsky, Andrej. "Space-Efficient 1.5-Way Quantum Turing Machine." In Fundamentals of Computation Theory, 380–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44669-9_37.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Universal quantum turing machine"

1

Rendell, Paul. "A Universal Turing Machine in Conway's Game of Life." In Simulation (HPCS). IEEE, 2011. http://dx.doi.org/10.1109/hpcsim.2011.5999906.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

IRIYAMA, S., and M. OHYA. "REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE." In Quantum Bio-Informatics — From Quantum Information to Bio-Informatics. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812793171_0010.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

IRIYAMA, SATOSHI, and MASANORI OHYA. "ON GENERALIZED QUANTUM TURING MACHINE AND ITS APPLICATION." In Proceedings of the 26th Conference. WORLD SCIENTIFIC, 2007. http://dx.doi.org/10.1142/9789812770271_0024.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Iqbal, Masab, Luis Velasco, Marc Ruiz, Antonio Napoli, Joao Pedro, and Nelson Costa. "Quantum Bit Retransmission Using Universal Quantum Copying Machine." In 2022 International Conference on Optical Network Design and Modeling (ONDM). IEEE, 2022. http://dx.doi.org/10.23919/ondm54585.2022.9782866.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

IRIYAMA, SATOSHI, MASANORI OHYA, and IGOR VOLOVICH. "GENERALIZED QUANTUM TURING MACHINE AND ITS APPLICATION TO THE SAT CHAOS ALGORITHM." In Quantum Information and Computing. WORLD SCIENTIFIC, 2006. http://dx.doi.org/10.1142/9789812774491_0017.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Hertel, Joachim. "Reversible Computation and a Toolkit for Quantum Turing Machine Simulation." In Proceedings of the Fifth International Mathematica Symposium. PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO., 2003. http://dx.doi.org/10.1142/9781848161313_0029.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Meunier, Pierre-Étienne, and Damien Woods. "The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation." In STOC '17: Symposium on Theory of Computing. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3055399.3055446.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Iriyama, Satoshi, and Masanori Ohya. "Generalized quantum Turing machine and its use to find an algorithm solving NP-Complete problem." In 2010 3rd International Symposium on Applied Sciences in Biomedical and Communication Technologies (ISABEL 2010). IEEE, 2010. http://dx.doi.org/10.1109/isabel.2010.5702873.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!