August 7, 2018

“Hold Sway Over 100 [Qubits] or More”

Recent quantum computing developments have revealed possibilities of stable quantum environments that are ‘reasonable’ in resource requirements. The tool of “sampling complexity” plays into the power of a small quantum computer versus a classical computer. Sampling complexity, the tool, “…involves a mathematical tool—a standard measure of computational difficulty known as sampling complexity—that gauges how easy or hard it is for an ordinary computer to simulate the outcome of a quantum experiment.”

Read More »

Lattice-Based Amalgamated Algorithms, Quantum Secure, Round5

The U.S. National Institute of Standards and Technology Post-Quantum Computing project has been examining the pros and cons of nearly 70 proposed quantum secure algorithms. One proposed solution, Round5 (round5.org), boasts of “shortest key and ciphertext sizes” and holds a lead in performance and implementation. From a bandwidth, processing, and generally “size-matters” standpoint, Round5 may be the leader in NIST’s quest for a PQC algorithm solution.

Read More »
On Point

Qubit's Picks