quantum computer

(redirected from Quantum algorithm)
Also found in: Encyclopedia.

quantum computer

n.
A computer that exploits the quantum mechanical properties of subatomic particles to allow a single operation to act on a large amount of data.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.

quantum computer

n
(Computer Science) a type of computer which uses the ability of quantum systems to be in many different states at once, thus allowing it to perform many different computations simultaneously
Collins English Dictionary – Complete and Unabridged, 12th Edition 2014 © HarperCollins Publishers 1991, 1994, 1998, 2000, 2003, 2006, 2007, 2009, 2011, 2014
References in periodicals archive ?
They furthermore answer the question of why the quantum algorithm beats any comparable classical circuit: The quantum algorithm exploits the non-locality of quantum physics.
However, Shor's quantum algorithm reveals that the DLP can be solved in polynomial time [2].
In 1994, Peter Shor invented a fast quantum algorithm for factoring numbers.
"The massive processing capabilities found in Quantum computers will challenge our current beliefs around complexity and security," said Michael Brown, CTO at ISARA Corporation, posing the case for 'Quantum safe cryptography', which is resistant to quantum algorithm attack.
Quantum algorithm can solve some classical nonpolynomial problems in polynomial time and has many advantages of the superposition, coherence, and entanglement of the quantum state.
Recently, a quantum encryption algorithm has been proposed but it has been noticed that the quantum encryption algorithm is very similar to the classical encryption algorithm with the crucial difference that the quantum algorithm is based on quantum laws whilst the classical algorithms are based on mathematical ones [4-7].
Considering that Shor's quantum algorithm and its extension work well over some commutative groups, such as the multiplication group [Z.sup.*.sub.n], the multiplication group [F.sup.*.sub.q], and the addition group over elliptic curves on finite field [F.sub.q], and we have already known efficient quantum algorithms for hidden group problems (HSP) over all commutative groups, a lot of attempts on developing cryptosystems are based on noncommutative algebraic structures.