Results 231 to 240 of about 45,791 (263)
Some of the next articles are maybe not open access.
Unstructured Adiabatic Quantum Search
International Journal of Theoretical Physics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrecut, M., Ali, M. K.
openaire +1 more source
Journal of Philosophical Logic, 2013
The author presents a general setup in the study of the truth function (describing the quantum reality) for a finite sample space using the so-called anhomomorphic logic of coevents (possible truth functions). He considers several conditions supposed for the truth function (regularity, precluditivity, 1-generation and 2-generation by a quantum measure)
openaire +2 more sources
The author presents a general setup in the study of the truth function (describing the quantum reality) for a finite sample space using the so-called anhomomorphic logic of coevents (possible truth functions). He considers several conditions supposed for the truth function (regularity, precluditivity, 1-generation and 2-generation by a quantum measure)
openaire +2 more sources
Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 2003
It has recently been shown that the searching speed of computers based on quantum mechanics is far superior to their classical counterparts.
openaire +1 more source
It has recently been shown that the searching speed of computers based on quantum mechanics is far superior to their classical counterparts.
openaire +1 more source
1998
Widespread interest in quantum computation was sparked by an algorithm of P. Shor for factoring integers on a quantum computer. We investigate here a more recent quantum algorithm of L. Grover for searching a database. This algorithm demonstrates a proven speed-up against the best possible classical algorithm for the same task.
Uwe Schöning, Randall Pruim
openaire +1 more source
Widespread interest in quantum computation was sparked by an algorithm of P. Shor for factoring integers on a quantum computer. We investigate here a more recent quantum algorithm of L. Grover for searching a database. This algorithm demonstrates a proven speed-up against the best possible classical algorithm for the same task.
Uwe Schöning, Randall Pruim
openaire +1 more source
Physical Review A, 2000
An alternative quantum algorithm for combinatorial search, adjusting amplitudes based on number of conflicts in search states, performs well, on average, for hard random satisfiability problems near a phase transition in search difficulty. The algorithm exploits correlations among problem properties more effectively than some current heuristics, and ...
openaire +1 more source
An alternative quantum algorithm for combinatorial search, adjusting amplitudes based on number of conflicts in search states, performs well, on average, for hard random satisfiability problems near a phase transition in search difficulty. The algorithm exploits correlations among problem properties more effectively than some current heuristics, and ...
openaire +1 more source
2017 IEEE Photonics Society Summer Topical Meeting Series (SUM), 2017
Quantum walks, quantum versions of random walks, can find structural anomalies in graphs with a quantum speedup. Examples of such anomalies are distinguished vertices, extra edges, and other structures that break the symmetry of the graph.
openaire +1 more source
Quantum walks, quantum versions of random walks, can find structural anomalies in graphs with a quantum speedup. Examples of such anomalies are distinguished vertices, extra edges, and other structures that break the symmetry of the graph.
openaire +1 more source
Materials challenges for trapped-ion quantum computers
Nature Reviews Materials, 2021Kenneth R Brown +2 more
exaly
Quantum guidelines for solid-state spin defects
Nature Reviews Materials, 2021Gary Wolfowicz +2 more
exaly
InP colloidal quantum dots for visible and near-infrared photonics
Nature Reviews Materials, 2023Guilherme Almeida +2 more
exaly