# Quantum computing

> Source: Courseiva IT Certification Glossary — https://courseiva.com/glossary/quantum-computing

## Quick definition

Quantum computing is a new kind of computing that uses special bits called qubits, which can be both 0 and 1 at the same time. This allows quantum computers to solve certain problems much faster than regular computers. It is still experimental but promises to change cryptography and other fields.

## Simple meaning

Think of a regular computer as a very fast librarian who can only look at one book at a time. Each book is either on the shelf (0) or checked out (1). The librarian can find a single answer quickly, but if you ask a very complex question involving millions of books, it takes forever. A quantum computer is like having a magical librarian who can look at all the books at once, even books that are both on the shelf and checked out at the same time. This superpower comes from a strange rule of physics called superposition. Instead of regular bits that are either 0 or 1, quantum computers use qubits that can be in a combination of both states until you measure them. Another weird but useful rule is entanglement, where two qubits become linked so that the state of one instantly affects the other, no matter how far apart they are. By using these properties, quantum computers can explore many possible answers simultaneously, making them incredibly powerful for specific tasks like cracking encryption codes or simulating molecules. However, they are not faster at everything. For everyday tasks like checking email or editing a document, a classical laptop is still better. Quantum computers are also extremely sensitive to heat and noise, which is why most are kept near absolute zero in special labs. In IT, the biggest concern is that quantum computers could break many of the encryption methods we use today, which is why researchers are already working on post-quantum cryptography to keep our data safe in the future.

## Technical definition

Quantum computing uses the principles of quantum mechanics to perform calculations. The fundamental unit of information is the quantum bit, or qubit. Unlike a classical bit which is strictly 0 or 1, a qubit can exist in a superposition of states, represented as a linear combination of |0⟩ and |1⟩. This allows a quantum computer to process a vast number of possibilities simultaneously, providing a quantum parallelism advantage. Another key principle is quantum entanglement, where two or more qubits become correlated such that the quantum state of each qubit cannot be described independently, even when separated by large distances. This enables coordinated operations across qubits. Quantum gates (e.g., Hadamard, CNOT, Toffoli) manipulate qubits through unitary transformations, forming quantum circuits. These circuits implement quantum algorithms such as Shor’s algorithm for integer factorization (which threatens RSA encryption) and Grover’s algorithm for unstructured search (which reduces the effective key strength of symmetric ciphers by half). Physical qubit implementations include superconducting circuits (used by IBM and Google), trapped ions (used by IonQ and Honeywell), and photonic systems. Error rates in quantum computations are high due to decoherence and environmental noise; quantum error correction codes (e.g., surface codes) are essential for fault-tolerant quantum computing. Real IT implementation currently focuses on cloud-based quantum computing services (e.g., Amazon Braket, IBM Quantum Experience, Azure Quantum) that allow developers to run quantum circuits on remote hardware or simulators. In cryptography, the threat is quantifiable: Shor’s algorithm could factor a 2048-bit RSA key in hours with enough logical qubits. This has driven the development of post-quantum cryptography standards by NIST, including lattice-based, code-based, and multivariate signature algorithms. IT professionals should understand that quantum computing is not an immediate replacement for classical infrastructure but will require a migration of cryptographic systems over the next decade.

## Real-life example

Imagine you are a chef in a huge kitchen, and you need to find the exact combination of spices to recreate a secret sauce. The recipe book has 100 different spices, and you have to test every possible mix. A classical chef would have to mix one combination at a time, taste it, and if it is wrong, start over. This could take weeks. Now imagine a quantum chef who can prepare all combinations in parallel in one giant pot, tasting every variation at the same time, and instantly knowing which one is correct. That is the power of quantum computing. In IT terms, the secret sauce is like an encrypted message, and the spices are the possible decryption keys. A classical computer tries keys one by one, which is extremely slow for strong encryption. A quantum computer, using Grover’s algorithm, can search through all possibilities much faster, effectively cutting a 256-bit key’s security down to 128-bit strength. Another analogy is a maze. A classical mouse explores one path at a time and backtracks when it hits a dead end. A quantum mouse can essentially walk all paths simultaneously, finding the exit in one try. This maps to how Shor’s algorithm can factor large numbers by finding periods in a function, something classical computers find extremely hard. In practice, IT teams preparing for quantum computing are like chefs learning to cook with a new, very sensitive oven. They need to know the right recipes (quantum-safe algorithms) and understand that the new oven (quantum computer) is not for boiling pasta (simple arithmetic) but for specialized, high-value tasks (breaking RSA or simulating new materials).

## Why it matters

For IT professionals, quantum computing matters because it directly threatens the cryptographic foundations that secure nearly all digital communications today. Public-key cryptography, which secures HTTPS, email encryption (PGP), VPNs, and digital signatures, relies on the computational difficulty of problems like integer factorization and discrete logarithms. A sufficiently powerful quantum computer running Shor’s algorithm could break RSA-2048 in hours, rendering much of current cybersecurity infrastructure obsolete. This is not a distant future scenario; NIST has already been standardizing post-quantum cryptographic algorithms, and organizations are being advised to begin inventorying their cryptographic assets and planning migration paths. Quantum computing can solve optimization problems relevant to IT operations, such as network routing, resource allocation, and supply chain logistics, potentially providing speedups that reduce costs and improve efficiency. However, the practical impact today is limited. Most IT professionals do not need to write quantum circuits; they need to understand the timeline and the necessary changes to encryption standards. The arrival of quantum computing will also create new roles in quantum software development and quantum key distribution (QKD), which uses quantum mechanics to secure communication channels against eavesdropping. Ignoring quantum computing risks leaving an organization vulnerable to harvest-now-decrypt-later attacks, where adversaries collect encrypted data today and decrypt it once quantum computers become available. Therefore, staying informed is not optional for security-conscious IT professionals.

## Why it matters in exams

Quantum computing appears in several IT certification exams, primarily to test candidates' awareness of its implications for cryptography. For the CompTIA Security+ (SY0-601 and SY0-701), you will see questions about emerging threats, including quantum computers as a threat to current cryptographic algorithms. The objective “Explain the importance of cryptographic concepts” may include understanding that RSA and ECC could be broken by quantum attacks, and that post-quantum cryptography is being developed. For CompTIA Network+, the topic is lighter, but you may encounter questions about the evolution of security threats and future networking concerns. For the CISSP (Certified Information Systems Security Professional), quantum computing is part of Domain 3 (Security Architecture and Engineering) where you must understand the impact on cryptosystems and the role of quantum key distribution. For the CISM (Certified Information Security Manager), the focus is on governance and risk management, where quantum computing is a strategic risk to data confidentiality. For the AWS Certified Security - Specialty, you might see references to quantum-safe key management services as part of future-proofing encryption strategies. For the Cisco CCNA and CCNP Security, questions are rare but may touch on the fact that quantum computing will require changes to encryption protocols used in VPNs and network security. The key exam patterns are multiple-choice questions asking which cryptographic algorithm is most vulnerable to quantum attacks (answer: asymmetric algorithms like RSA, DH, ECDH), or what NIST is doing about it (standardizing post-quantum algorithms). You will also see questions asking for the primary risk quantum computing poses to IT systems, with the correct answer being the ability to break current public-key cryptography. Scenario-based questions might ask about planning a cryptographic migration in the face of quantum threats.

## How it appears in exam questions

In exam questions, quantum computing is often used as a distractor or as a known threat vector. A typical multiple-choice question might read: “Which of the following technologies poses a future threat to the security of RSA-2048 encryption?” Correct answer: Quantum computing. Another pattern: “An organization wants to prepare for the eventual arrival of large-scale quantum computers. Which cryptographic approach should they implement today?” Correct answer: Post-quantum cryptography (or lattice-based cryptography). In scenario-based questions, you might be given a situation where an attacker has collected encrypted data and plans to decrypt it later when technology improves. The question asks: “Which type of attack does this describe?” Answer: Harvest now, decrypt later (a quantum-related threat). Configuration-based questions are less common because quantum computing is not something you configure on a network device yet. However, you could see a question about a firewall or VPN appliance that includes a setting for “Quantum-safe encryption” or “Post-quantum key exchange.” In such cases, you need to know that this setting enables algorithms like CRYSTALS-Kyber or Falcon. Troubleshooting questions are rare, but you might encounter a scenario where a security scan reports that a server supports RSA key exchange, and you need to recommend replacing it with a quantum-resistant key exchange method. The exam also tests your understanding that quantum computing does NOT break symmetric encryption as severely; AES-256 is still considered safe if used with large enough keys. A trick question might ask: “Which encryption algorithm is completely immune to quantum attacks?” The correct answer is none are completely immune, but symmetric ciphers with 256-bit keys are only weakened to 128-bit strength, which is still acceptable for now. Always read carefully, the exam may ask about “quantum computing” in the context of blockchain, AI, or IoT as a distractor.

## Example scenario

You are a junior IT security analyst at a mid-sized company that handles sensitive customer financial data. Your manager asks you to evaluate the company’s long-term encryption strategy. The company currently uses RSA-2048 for digital signatures and TLS certificates, and AES-256 for encrypting data at rest. You are told that a major threat intelligence report indicates that nation-state actors are already harvesting encrypted data traffic from large financial institutions, planning to decrypt it once quantum computers become operational. Your task is to propose a plan to mitigate this risk. You begin by explaining to your manager that quantum computers running Shor’s algorithm could break RSA-2048 in a matter of hours, rendering the company’s digital signatures and TLS handshakes insecure. You recommend a phased migration: first, inventory all uses of RSA and ECDSA across the organization. Second, adopt hybrid certificates that combine traditional ECDH with a post-quantum key exchange algorithm like CRYSTALS-Kyber during the transition period. Third, migrate to AES-256 with larger key sizes for symmetric encryption, and ensure that all new systems support quantum-safe cryptographic libraries. You also remind your manager that AES-256 remains relatively safe because Grover’s algorithm only reduces its effective strength to 128 bits, which is still considered strong. You propose scheduling a cryptographic agility review every six months to track NIST’s finalization of post-quantum standards. This scenario tests your ability to connect quantum computing threats to practical, actionable IT security measures. The exam would expect you to identify the immediate risk to asymmetric cryptography and recommend a hybrid approach.

## Common mistakes

- **Mistake:** Thinking quantum computers will replace all classical computers.
  - Why it is wrong: Quantum computers are not general-purpose; they only outperform classical computers on specific types of problems like factoring and search. For everyday tasks, classical computers remain more efficient.
  - Fix: Understand that quantum and classical computers will coexist, with quantum computers used for specialized workloads.
- **Mistake:** Believing AES-256 is completely broken by quantum computers.
  - Why it is wrong: Grover’s algorithm reduces the effective key strength of AES-256 to 128 bits, which is still considered secure. AES-256 is not instantly broken.
  - Fix: Know that symmetric encryption is less impacted; AES-256 remains a safe choice with appropriate key lengths.
- **Mistake:** Confusing quantum computing with classical parallel computing.
  - Why it is wrong: Classical parallel computing uses many CPUs working on different parts of a problem, but each CPU still processes bits one at a time. Quantum parallelism uses superposition to process many possibilities simultaneously in a single qubit.
  - Fix: Remember that quantum parallelism is fundamentally different due to superposition and entanglement.
- **Mistake:** Assuming quantum computers exist today that can break RSA-2048.
  - Why it is wrong: Current quantum computers are small (fewer than 1000 qubits) and error-prone. Breaking RSA-2048 would require millions of error-corrected logical qubits, which is years away.
  - Fix: Understand that practical quantum attacks on current encryption are a future risk, not an immediate threat.
- **Mistake:** Thinking all encryption will be replaced by quantum key distribution (QKD).
  - Why it is wrong: QKD is a key exchange method, not a full encryption solution. It requires specialized hardware and is not a drop-in replacement for existing cryptographic protocols.
  - Fix: Distinguish between quantum-resistant cryptography (algorithm changes) and QKD (physical-layer security).

## Exam trap

{"trap":"The exam might ask: “Which encryption algorithm is most vulnerable to quantum computing?” Some learners choose AES-256 because they think it is old, but the correct answer is RSA because Shor’s algorithm directly breaks integer factorization.","why_learners_choose_it":"They see “quantum” and assume all encryption is equally broken, or they think older algorithms like DES are the answer. They also may not know the difference between symmetric and asymmetric.","how_to_avoid_it":"Remember that Shor’s algorithm breaks asymmetric cryptography (RSA, ECC, DH). Grover’s algorithm only halves the effective key strength for symmetric ciphers (AES-256 becomes 128-bit). If the question asks about “most vulnerable,” always pick an asymmetric algorithm."}

## Commonly confused with

- **Quantum computing vs Classical parallel computing:** Classical parallel computing uses multiple processors to split tasks, but each processor still works with binary bits (0 or 1). Quantum computing uses qubits that can be in superposition, allowing simultaneous exploration of many paths at once. Parallel computing does not provide exponential speedup for factoring. (Example: Parallel computing is like having 100 chefs each making one dish; quantum computing is like one chef making all dishes at once.)
- **Quantum computing vs Quantum key distribution (QKD):** QKD is a technique that uses quantum mechanics to securely share encryption keys between two parties, detecting any eavesdropper. It is not a form of quantum computing. Quantum computing is about computation, not communication security. (Example: QKD is like a tamper-proof envelope for sending keys; quantum computing is a machine that can break locks.)
- **Quantum computing vs Post-quantum cryptography:** Post-quantum cryptography refers to new cryptographic algorithms designed to be secure against both classical and quantum computers. Quantum computing is the technology that threatens current cryptography; post-quantum cryptography is the defense. (Example: Quantum computing is the new lock-breaking tool; post-quantum cryptography is the new unbreakable lock.)
- **Quantum computing vs Quantum annealing:** Quantum annealing is a specific type of quantum computation used for optimization problems (like D-Wave systems). It is not a general-purpose quantum computing approach like circuit-based quantum computing used for Shor’s algorithm. (Example: Quantum annealing is a specialized hammer for one type of nail; circuit-based quantum computing is a full toolbox.)

## Step-by-step breakdown

1. **Initialize qubits** — The quantum computer starts by placing each qubit into a known initial state, usually the |0⟩ state. This is like resetting all the registers before starting a calculation.
2. **Apply superposition** — A Hadamard gate is applied to each qubit, putting them into an equal superposition of |0⟩ and |1⟩. This creates a massive number of possible states simultaneously, enabling parallelism.
3. **Perform quantum operations** — Quantum gates (CNOT, Toffoli, etc.) are applied according to the algorithm (e.g., Shor’s or Grover’s). These gates manipulate the amplitudes of the superposition, performing the actual computation.
4. **Execute interference** — By carefully designing the sequence of gates, the algorithm causes constructive interference for correct answers and destructive interference for incorrect ones. This amplifies the probability of measuring the correct result.
5. **Measure the qubits** — The qubits are measured, collapsing the superposition into a classical binary output. This final state represents the answer to the computation, though it may need to be combined with classical post-processing.
6. **Post-process results** — The measured bits are processed by a classical computer to extract the final answer. For example, in Shor’s algorithm, the period found from the quantum circuit is used to compute factors of a large number.

## Practical mini-lesson

Quantum computing in practice is not something you deploy on your own infrastructure today; rather, access is provided via cloud services. For example, IBM Quantum Experience allows you to write quantum circuits using Qiskit (a Python library) and run them on IBM’s quantum hardware. As an IT professional, you need to understand the limitations: current quantum processors are noisy intermediate-scale quantum (NISQ) devices. They have a limited number of qubits (typically 50–127 for IBM’s systems), and gate errors reduce the reliability of long computations. Therefore, most useful quantum algorithms require error correction, which itself consumes many physical qubits to produce a single logical qubit. For cryptography purposes, the practical concern is not writing quantum algorithms but managing the transition to quantum-safe cryptography. This involves several steps: first, perform a cryptographic inventory to identify all uses of public-key algorithms (TLS certificates, code signing, SSH keys, etc.). Second, prioritize data that must remain confidential long-term (e.g., healthcare records, classified data) because it is most at risk from harvest-now-decrypt-later attacks. Third, adopt hybrid modes that combine classical and post-quantum algorithms during the transition, such as using X25519 with CRYSTALS-Kyber for key exchange. IT professionals must also understand that TLS 1.3 already supports hybrid key exchange extensions, and several certificate authorities offer quantum-safe certificates for testing. What can go wrong? Incorrectly replacing all RSA with an unproven post-quantum algorithm could introduce performance issues or vulnerabilities. Also, some post-quantum algorithms have larger key sizes (e.g., 1.5 KB for Kyber vs. 32 bytes for X25519), which can impact bandwidth and storage. Training your team on these new algorithms and testing them in lab environments before production deployment is essential. Finally, monitoring NIST’s standardization process is critical, as of 2025, algorithms like CRYSTALS-Dilithium (signatures) and CRYSTALS-Kyber (encryption) are leading standards, but final designations may change.

## Memory tip

Remember Shor’s breaks RSA (asymmetric), Grover’s halves AES (symmetric). Both have ‘r’ in the name, Shor’s for factoring, Grover’s for search.

## FAQ

**Will quantum computers break all encryption immediately?**

No, only certain types of encryption, especially asymmetric algorithms like RSA and ECC, are vulnerable to Shor’s algorithm. Symmetric encryption like AES-256 is still relatively safe with reduced effective strength.

**Do I need to learn quantum programming for IT certifications?**

No, most IT certifications only require conceptual understanding of the threat and the need for post-quantum cryptography. Programming quantum circuits is not part of general IT certification objectives.

**What is the biggest risk of quantum computing to an organization today?**

The biggest risk is harvest-now-decrypt-later attacks, where adversaries collect encrypted data today and decrypt it once a quantum computer becomes available.

**How many qubits are needed to break RSA-2048?**

Estimates suggest around 20 million physical qubits, but with error correction, several million logical qubits are required. Current systems have under 1,000 physical qubits.

**What is post-quantum cryptography?**

Post-quantum cryptography refers to cryptographic algorithms designed to be secure against both classical and quantum computers, such as lattice-based or code-based cryptography.

**Can quantum computing speed up all IT operations?**

No, quantum computers are only faster for specific problems like factoring, search, and optimization. For general computing tasks, classical computers are more efficient.

## Summary

Quantum computing is an emerging technology that leverages qubits, superposition, and entanglement to perform computations that are infeasible for classical computers. Its most critical impact on IT is the threat it poses to current public-key cryptography, including RSA, ECC, and Diffie-Hellman. While large-scale fault-tolerant quantum computers are still years away, the risk of harvest-now-decrypt-later attacks makes it imperative for IT professionals to begin planning cryptographic migration. Understanding the difference between symmetric and asymmetric algorithms in the quantum context is essential for certification exams. NIST is standardizing post-quantum algorithms such as CRYSTALS-Kyber and Dilithium, and organizations should adopt hybrid cryptographic approaches during the transition. Quantum computing is not a replacement for classical systems but a specialized tool that will coexist with traditional IT infrastructure. For exam takers, focus on the security implications, the specific algorithms that are vulnerable, and the timeline for practical quantum threats. Staying informed on this topic demonstrates forward-thinking security awareness that is highly valued in the industry.

---

Practice questions and the full interactive page: https://courseiva.com/glossary/quantum-computing