Post-Quantum, PQC, Quantum Security
PostQuantum.com – Industry news and blog on Quantum Computing, Quantum Security, PQC, Post-Quantum, AI Security
-
Capability C.2: Magic State Production & Injection (Non-Clifford Gates)
Magic states are an essential “extra ingredient” for universal quantum computing, often metaphorically likened to a magic catalyst enabling otherwise impossible operations. Quantum algorithms require not only robust qubits and error correction, but also a way to perform non-Clifford gates - operations outside the easy Clifford group. These non-Clifford gates…
Read More » -
Capability C.1: High-Fidelity Logical Clifford Gates
Cryptographically Relevant Quantum Computers (CRQCs) will rely on a suite of core capabilities - and high-fidelity logical Clifford gates are among the most essential. This capability refers to performing the fundamental set of quantum logic operations (the Clifford gates: Pauli X, Y, Z flips; the Hadamard (H); the phase gate…
Read More » -
Capability B.3: Below-Threshold Operation & Scaling
“Below-threshold operation” refers to running a quantum processor at error rates below the critical threshold of a quantum error-correcting code. In simple terms, there is a tipping point in error rates: if each quantum gate and qubit has an error probability lower than this threshold, adding more qubits and more…
Read More » -
Capability B.2: Syndrome Extraction (Error Syndrome Measurement)
Quantum syndrome extraction - also called error syndrome measurement - is the process of measuring collective properties of qubits to detect errors without destroying the encoded quantum information. It is essentially the sensor mechanism of a quantum error-correcting code, analogous to measuring parity checks in a classical error-correcting code. In…
Read More » -
Capability B.1: Quantum Error Correction (QEC)
Quantum Error Correction (QEC) is the first and arguably most critical capability in the roadmap toward a cryptographically relevant quantum computer (CRQC). Without QEC, a large-scale quantum computer cannot reliably perform the billions of operations needed to break modern encryption - no matter how many qubits we build. In essence,…
Read More » -
Shor’s Algorithm: A Quantum Threat to Modern Cryptography
Shor’s Algorithm is more than just a theoretical curiosity – it’s a wake-up call for the security community. By understanding its principles and implications, we can appreciate why the cryptographic landscape must evolve. The goal of this guide is to equip you with that understanding, without delving into complex mathematics,…
Read More » -
Grover’s Algorithm and Its Impact on Cybersecurity
Grover’s algorithm was one of the first demonstrations of quantum advantage on a general problem. It highlighted how quantum phenomena like superposition and interference can be harnessed to outperform classical brute force search. Grover’s is often described as looking for “a needle in a haystack” using quantum mechanics.
Read More » -
Quantum-Safe vs. Quantum-Secure Cryptography
In 2010, I was serving as an interim CISO for an investment bank. During that time, I was already trying to figure out the risks posed by quantum computing. One day, I was approached by a vendor who, with great confidence, made two bold claims. First, they insisted that the…
Read More » -
Qubits: A Brief Introduction for Cybersecurity Professionals
A qubit is the quantum analog of a classical bit – it’s the basic unit of quantum information. However, unlike a classical bit that can only be 0 or 1 at any given time, a qubit can exist in a combination of both 0 and 1 states simultaneously. This property…
Read More » -
Bell States: An Introduction for Cybersecurity Professionals
Bell states are a set of four specific quantum states of two qubits (quantum bits) that are entangled. In simple terms, an entangled pair of qubits behaves as one system, no matter how far apart they are. Bell states are the simplest and most extreme examples of this phenomenon. They…
Read More » -
Kuperberg’s Algorithm and its Impact on Post-Quantum Cryptography (PQC)
Kuperberg’s algorithm is an impressive quantum algorithmic achievement that expands the boundary of what quantum computers might do beyond the original realm of Shor’s algorithm. It demonstrates that even some non-trivial group problems (like the dihedral hidden subgroup problem) are easier for quantum computers than for classical ones, albeit not…
Read More » -
Balancing Quantum Computing Hype and Hope
Quantum computing stands at the intersection of immense promise and intense hype. As someone who had led cybersecurity teams (including serving as an interim CISO for Fortune 500 companies) and was now investing in a quantum computing startup, I found myself navigating two contrasting narratives. On one hand, I am…
Read More » -
Quantum Computing Hype and Fear: Same Song, New Verse
Another year, another wave of "quantum computers are about to crack all our encryption" fear-mongering. It’s 2012, and I’m getting déjà vu reading headlines proclaiming the imminent doom of RSA and other cryptography. I've been writing about this for at least 10 years. Ever since Peter Shor unveiled an algorithm…
Read More » -
Quantum Computers Intro
I remember the first time I heard the phrase “quantum computer” about a ten years ago. I pictured something out of a sci-fi movie - maybe a glowing box humming with mystical power. As a techie who spends a lot of time worrying about encryption and security, my skeptical eyebrow…
Read More » -
Are Quantum Computers a Real Threat?
Our conclusion is that quantum computers are not an imminent threat to cybersecurity. They are a fascinating technology and potential threat in the long term, but certainly not something that keeps me awake at night today. For our clients such as governments and critical infrastructure operators, the prudent advice is…
Read More »
