Quantum Leap | Association for Computing Machinery | Quantum Leap (TV series) | Quantum of Solace | quantum mechanics | computing | Cloud computing | Parallel computing | Real-time computing | Quantum mechanics | Distributed Computing Environment | cloud computing | Kernel (computing) | Georgia Institute of Technology School of Interactive Computing | Georgia Institute of Technology College of Computing | distributed computing | Computing | The Quantum Rose | Server (computing) | server (computing) | Secure Computing | quantum chemistry | Hamiltonian (quantum mechanics) | First Quantum Minerals | Centre for Education in Mathematics and Computing | Scheduling (computing) | Quantum Link | Quantum | Process (computing) | Platform (computing) |
The r-to-1 collision problem is an important theoretical problem in complexity theory, quantum computing, and computational mathematics.
In quantum computing, the Gottesman–Knill theorem is a theoretical result by Daniel Gottesman and Emanuel Knill that states that an important subclass of quantum circuits, called stabilizer circuits, can be classically efficiently simulated.
He is the originator of the Grover database search algorithm used in quantum computing.
Adiabatic quantum computation, a quantum computing model that relies on the adiabatic theorem to do calculations
Mainstream symmetric ciphers (such as AES or Twofish) and collision resistant hash functions (such as SHA) are widely conjectured to offer greater security against known quantum computing attacks.