Circuit Model of Computation
B. Zygelman · 2018
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Model of computation”
B. Zygelman · 2018
Cited by 0
Maxime Pelcat, Slaheddine Aridhi, Jonathan Piat et al. · Lecture notes in electrical engineering · 2012
Cited by 6
Bulletin of Miscellaneous Information (Royal Gardens Kew)
Cited by 0
2008
Cited by 3
B. Zygelman · Undergraduate topics in computer science · 2024
Cited by 0
Damien Woods, Thomas J. Naughton · Theoretical Computer Science · 2004
Cited by 47
Giacomo Nannicini · Society for Industrial and Applied Mathematics eBooks · 2025
Quantum computing is a relatively new field of computing that has the potential to greatly speed up the solution of certain problems. This book is about quantum algorithms, with a focus on algorithms that may be useful for mathematical optimization. Quantum computers work in a way that is fundamentally different from classical computers. We begin by introducing the model of computation, and then proceed to study several quantum algorithms. In the following, the term “classical” is used to mean “nonquantum,” as is common in the field.
Cited by 0
Weiwei Chen · 2014
Cited by 0
SpringerReference · 2011
Cited by 0
Krušina, Pavel · Digital Repository (National Repository of Grey Literature) · 2003
Cited by 0
Jerry L. Potter · 1992
Cited by 3
Iosr Journals, Pooja Tharani · Figshare · 2014
Cited by 0Open access
Axel Jantsch · Elsevier eBooks · 2003
Cited by 5
Pooja Tharani · IOSR Journal of Computer Engineering · 2014
In theoretical computer science and mathematics , the theory of computation is the branch that deals with how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory, computability theory, and computational complexity theory.
Cited by 0Open access
Norihiro Yamada · 2017
Cited by 0
George Milne · ERA · 1977
Cited by 6Open access
James R. Wootton · 2024
Quantum circuits are an abstract framework to represent quantum dynamics. They are used to formally describe and reason about processes within quantum information technology. They are primarily used in quantum computation, quantum communication, and quantum cryptography—for which they provide a machine code–level description of quantum algorithms and protocols. The quantum circuit model is an abstract representation of these technologies based on the use of quantum circuits, with which algorithms and protocols can be concretely developed and studied. Quantum circuits are typically based on the concept of qubits: two-level quantum systems that serve as a fundamental unit of quantum hardware. In their simplest form, circuits take a set of qubits initialized in a simple known state, apply a set of discrete single- and two-qubit evolutions known as “gates,” and then finally measure all qubits. Any quantum computation can be expressed in this form through a suitable choice of gates, in a quantum analogy of the Boolean circuit model of conventional digital computation. More complex versions of quantum circuits can include features such as qudits, which are higher level quantum systems, as well as the ability to reset and measure qubits or qudits throughout the circuit. However, even the simplest form of the model can be used to emulate such behavior, making it fully sufficient to describe quantum information technology. It is possible to use the quantum circuit model to emulate other models of quantum computing, such as the adiabatic and measurement-based models, which formalize quantum algorithms in a very different way. As well as being a theoretical model to reason about quantum information technology, quantum circuits can also provide a blueprint for quantum hardware development. Corresponding hardware is based on the concept of building physical systems that can be controlled in the way required for qubits or qudits, including applying gates on them in sequence and performing measurements.
Cited by 1
J. F. Traub · Physics Today · 1999
A central dogma of computer science is that the Turing-machine model is the appropriate abstraction of a digital computer. Physicists who've thought about the matter also seem to favor the Turing-machine model. For example, Roger Penrose devoted some 60 pages of a book to a description of this abstract model of computation and its implications. I argue here that physicists should consider the real-number model of computation as more appropriate and useful for scientific computation.
Cited by 32Open access
David Poulin · 2016
Cited by 0
Gordana Dodig-Crnković · Minds and Machines · 2011
Cited by 77