Quantum Computing Vocabulary

Superposition: a qubit state that is a linear combination of |0⟩ and |1⟩: α|0⟩ + β|1⟩, where |α|² + |β|² = 1. The probabilities of measuring 0 and 1 are |α|² and |β|² respectively. Before measurement: the qubit is in superposition. After measurement: the wave function collapses — you get 0 or 1. Quantum vocabulary: Qubit — a quantum bit. Physical implementations: superconducting circuits (IBM, Google), trapped ions (IonQ, Quantinuum), photonic qubits, topological qubits. Measurement — the act of reading a qubit's state. Irreversible — collapses superposition. Bloch sphere — a 3D geometric representation of a qubit's state. Hadamard gate (H) — puts a qubit in equal superposition of |0⟩ and |1⟩. Most commonly used gate to create superposition. Decoherence — the loss of quantum coherence due to environmental interaction; the primary engineering challenge. Coherence time must be long enough to run computations. In conversation: "Superposition means the qubit explores multiple computational paths simultaneously — that's where the potential parallelism comes from."

Entanglement: a quantum correlation where the joint state of two or more qubits cannot be described independently. Measuring one qubit instantly determines the correlated state of its entangled partner — regardless of distance. This is not faster-than-light communication — no information is transmitted. Why it matters: N entangled qubits represent a superposition of 2ⁿ states simultaneously. This is the source of quantum computing's potential exponential speedup. Creating entanglement: Hadamard gate on qubit A (creates superposition) → CNOT gate with A as control, B as target → result: Bell state (maximally entangled pair). CNOT gate: flips the target qubit if and only if the control qubit is |1⟩. When control is in superposition, the result is entanglement. Quantum circuit vocabulary: Gate — a unitary operation on qubits (like a logic gate for classical bits). Circuit depth — the number of sequential gate layers; determines computation time. Two-qubit gate — gates that operate on two qubits; CNOT is the most common; creates entanglement. Bell state — a maximally entangled two-qubit state. In conversation: "Without entanglement, a quantum computer is just a slow classical computer. Entanglement is what gives us access to the exponentially large state space."

Physical qubit: an actual hardware qubit — noisy, with limited coherence time and gate fidelity. Current error rates: 0.1–1% per two-qubit gate. Logical qubit: an error-corrected qubit built from many physical qubits using a quantum error correction code. Provides a reliable qubit abstraction for fault-tolerant algorithms. NISQ vocabulary: NISQ (Noisy Intermediate-Scale Quantum) — coined by John Preskill; describes current quantum devices: 50–1000 noisy physical qubits. NISQ algorithms try to be useful despite noise. Gate fidelity — the accuracy of a quantum gate. 99.9% fidelity means 0.1% error per gate operation. Decoherence time (T1, T2) — T1: energy relaxation time. T2: dephasing time. Both must be long relative to computation time. Surface code — the leading quantum error correction code; arranges physical qubits in a 2D grid with alternating data and measurement qubits. Requires ~1000 physical qubits per logical qubit. Quantum volume — IBM's metric for overall quantum device capability (accounts for qubit count, connectivity, fidelity). Fault-tolerant quantum computing (FTQC) — computation using logical qubits with error correction; the end goal; requires millions of physical qubits. In conversation: "We're years away from fault-tolerant quantum computing — today's algorithms have to work within the noise of physical qubits."

Quantum advantage: a quantum algorithm solves a problem faster (or at lower cost) than the best known classical algorithm. Types of speedup: Exponential — Shor's algorithm factors N-bit numbers in O(n³) vs classical best O(e^n^(1/3)). Would break RSA-2048. Quadratic — Grover's algorithm searches N items in O(√N) vs classical O(N). Useful but not as dramatic. Key algorithms: Shor's algorithm — factors large integers using quantum Fourier transform. Practical threat to RSA/ECC when fault-tolerant quantum computers exist (requires ~4000+ logical qubits for RSA-2048). Grover's algorithm — quantum search. Halves the effective key length of symmetric encryption (AES-128 → AES-256 recommended). VQE (Variational Quantum Eigensolver) — hybrid algorithm for quantum chemistry; finds ground state energy of molecules. NISQ-era. QAOA (Quantum Approximate Optimisation Algorithm) — hybrid algorithm for combinatorial optimisation. NISQ-era. Quantum supremacy (Google, 2019) — Google's Sycamore performed a sampling task in 200 seconds that would take classical computers ~10,000 years. Disputed but a milestone. Post-quantum cryptography — cryptographic algorithms resistant to Shor's algorithm. NIST standardised CRYSTALS-Kyber (KEM) and CRYSTALS-Dilithium (signatures) in 2024. In conversation: "Shor's algorithm is why we're migrating to post-quantum cryptography now — not because quantum computers can break RSA today, but because harvested-now-decrypt-later attacks are real."

Quantum annealer (D-Wave): a specialised quantum device for finding the minimum-energy state of a problem encoded as a physical system. Best suited for: quadratic unconstrained binary optimisation (QUBO), combinatorial optimisation (scheduling, logistics, portfolio optimisation). NOT a universal quantum computer — cannot run Shor's or Grover's algorithms. Universal (gate-based) quantum computer: implements an arbitrary quantum circuit using a universal gate set. Can run any quantum algorithm in principle. Examples: IBM Quantum (superconducting), IonQ (trapped ions), Quantinuum (trapped ions). Quantum hardware vocabulary: Superconducting qubits — implemented in circuits at ~15 mK (millikelvin); used by IBM, Google, Rigetti. Fast gate operations (~nanoseconds). Trapped ion qubits — individual ions held in place by electromagnetic fields; used by IonQ, Quantinuum. Slower but higher fidelity. Qiskit — IBM's open-source quantum SDK (Python). Largest ecosystem. Cirq — Google's quantum SDK (Python). PennyLane — quantum ML framework, hardware-agnostic. Amazon Braket — cloud quantum service offering access to multiple hardware providers. In conversation: "For our logistics optimisation problem, D-Wave's annealer is worth evaluating — it's not a general quantum computer, but it's specifically designed for the type of problem we're trying to solve."

This question tests understanding of a critical concept. Simply stating the definition isn't enough – the developer needs to demonstrate awareness of the problem. Option 0 shows an appropriate response; options 1 & 2 are simplistic or dismissive, and option 3 is passive.

This scenario assesses the ability to articulate a technical concept in a collaborative setting. Option 0 provides a concise and accurate explanation of the difference, while the other options demonstrate a lack of understanding or inappropriate responses.

Mark's description – 'oscillating wildly,' 'unpredictable outputs,' and 'high error rates' – directly points to decoherence. Decoherence causes instability in quantum systems, disrupting superposition and leading to erratic behaviour. While the other options are valid quantum concepts, they don't explain the specific symptoms Mark describes.

The PR description explicitly mentions 'exponential speedup,' which is a direct consequence of Shor's algorithm utilizing superposition and entanglement. This reflects the fundamental advantage of quantum computing over classical algorithms for specific tasks like prime factorization. Options A and B are misleading; option C describes the core benefit, while option D refers to hardware scaling.

David's statement centers around a 'hybrid computing' approach—combining classical and quantum resources. This is a common strategy in early quantum adoption where quantum algorithms are used for specific computationally demanding parts of a larger system. Options A and B describe aspects related to overall quantum capabilities; option C describes an important technical challenge.

'Logical qubits' are a crucial concept in quantum computing, particularly in noisy intermediate-scale quantum (NISQ) devices. They represent the number of *usable* qubits after error correction protocols have been applied to mitigate decoherence and other noise sources. Option A refers to physical hardware; option C is a simple count; option D describes virtual representations.

The correct answer highlights the importance of accurate terminology in quantum computing. 'Quantum tunneling' isn't a standard term within circuit design; instead, developers must accurately represent superposition and its related phenomena. Options A and C are misleading and could lead to misunderstandings about the underlying physics. Option D is incorrect because the concept is highly relevant.

Elena's message indicates a critical issue – high error rates. The most immediate and appropriate action is to investigate potential sources of noise within the quantum environment. While other options might be relevant in different situations, focusing on environmental factors (noise) is the first step to diagnose and mitigate the problem.

While all options are relevant to quantum algorithm performance, fidelity is paramount. In quantum computing, even small errors in qubit states or gate operations can accumulate and dramatically reduce accuracy, negating any potential speedup. Monitoring fidelity directly addresses the core challenge highlighted in the PR description.

Choosing an appropriate ansatz is critical for VQE. While complexity and qubit count matter, the primary goal is to select an ansatz that accurately represents the wavefunction. A complex or large ansatz without capturing the essential features of the wavefunction will lead to inaccurate results. Efficiency is also key due to computational constraints.

This question tests understanding of a common misuse of terminology. Teleportation in quantum computing refers to state transfer, not physical movement. The correct answer requires the developer to push for clarification and ensure accurate implementation, reflecting a deeper understanding than simply accepting the code based on its outcome. Options A and B are incorrect because they focus on superficial changes or acceptance without proper validation; option C is the most appropriate action – demanding clarity and ensuring accuracy.

Mark's problem is a classic sign of qubit decoherence. The correct response involves seeking expert guidance to understand the underlying issue and potential solutions related to mitigating decoherence – this is what a senior quantum engineer would advise. Options A and B are incorrect because they don't address the root cause; option C is inappropriate as it accepts the problem, and option D would likely exacerbate the instability.

The message indicates potential problems with the underlying quantum system. 'Significant deviations' and an 'increasing exponential error rate' strongly suggest that the quantum hardware itself is introducing noise or decoherence, leading to unreliable results. It's a classic sign of NISQ device limitations.

The architect's focus on 'minimizing communication overhead' directly addresses a critical bottleneck in hybrid classical-quantum systems. Efficient data transfer is vital for performance, especially when dealing with computationally intensive quantum algorithms running alongside classical workflows. Ignoring this can significantly slow down the entire process.

While 'quantum tunneling' has connections to quantum mechanics and superposition, it's a complex concept that isn't directly applicable in all scenarios within a quantum circuit. Using the term inaccurately can lead to misunderstandings about the underlying physics and potentially result in incorrect simulation outcomes or misinterpretations of the algorithm's behavior.