Results 261 to 270 of about 1,988,242 (296)
Some of the next articles are maybe not open access.
SIAM Journal on Computing, 1997
In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines (QTM) with rational amplitudes are sufficient to define the class of bounded error quantum polynomial time (BQP) introduced by Bernstein and Vazirani ...
Leonard M. Adleman +2 more
openaire +3 more sources
In this paper some theoretical and (potentially) practical aspects of quantum computing are considered. Using the tools of transcendental number theory it is demonstrated that quantum Turing machines (QTM) with rational amplitudes are sufficient to define the class of bounded error quantum polynomial time (BQP) introduced by Bernstein and Vazirani ...
Leonard M. Adleman +2 more
openaire +3 more sources
Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation.
Nicolas C. Menicucci +2 more
exaly +2 more sources
Quantum computers and quantum computations
Physics-Uspekhi, 2005This review outlines the principles of operation of quantum computers and their elements. The theory of ideal computers that do not interact with the environment and are immune to quantum decohering processes is presented. Decohering processes in quantum computers are investigated.
openaire +1 more source
2005
Many computational problems that turn up in industry, operations research, network design, artificial intelligence, simulation of physical systems, logic, number theory, combinatorics, algebra, and computational biology lack a fast or feasible algorithmic solution. The best known algorithms for these problems are horrendously slow.
openaire +2 more sources
Many computational problems that turn up in industry, operations research, network design, artificial intelligence, simulation of physical systems, logic, number theory, combinatorics, algebra, and computational biology lack a fast or feasible algorithmic solution. The best known algorithms for these problems are horrendously slow.
openaire +2 more sources
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation, 2007
Computer science will be radically transformed if ongoing efforts to build large-scale quantum computers eventually succeed and if the properties of these computers meet optimistic expectations. Nevertheless, computer scientists still lack a thorough understanding of the power of quantum computing, and it is not always clear how best to utilize the ...
openaire +3 more sources
Computer science will be radically transformed if ongoing efforts to build large-scale quantum computers eventually succeed and if the properties of these computers meet optimistic expectations. Nevertheless, computer scientists still lack a thorough understanding of the power of quantum computing, and it is not always clear how best to utilize the ...
openaire +3 more sources
International Journal of Theoretical Physics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Quantum Computers as Fuzzy Computers
2001An implementation of digitised fuzzy numbers on quantum computers is suggested. It is shown that due to the famous quantum parallelism quantum computers can operate "globally" on whole membership functions of fuzzy numbers, not by calculating them "point by point" as classical computers do, which leads to the considerable decrease in the number of ...
Jaroslaw Pykacz +2 more
openaire +3 more sources
Reversibility and Irreversibility in Quantum Computation and in Quantum Computational Logics
2007A characteristic feature of quantum computation is the use of reversible logical operations. These correspond to quantum logical gates that are mathematically represented by unitary operators defined on convenient Hilbert spaces. Two questions arise: 1) to what extent is quantum computation bound to the use of reversible logical operations?
DALLA CHIARA ML +2 more
openaire +4 more sources
Quantum computation and quantum information
Mathematical Structures in Computer Science, 2007This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal with entanglement. The paper by R. Mosseri and P. Ribeiro presents a detailed description of the two- and three-qubit geometry in Hilbert space, dealing ...
openaire +1 more source

