Quantum Computing FAQ

A classical bit is always exactly 0 or 1. A qubit can exist in a quantum superposition of 0 and 1 simultaneously, but only until it is measured, at which point it collapses to one definite value. Qubits are physically implemented using systems like superconducting circuits, trapped ions, or photons. The power comes from the ability to manipulate the probability amplitudes before measurement, not from being "both at once" in a useful computational sense.

Superposition means a qubit has a probability amplitude for being 0 and a probability amplitude for being 1. These amplitudes are complex numbers, and their squared magnitudes give the probabilities of each outcome when you measure. Crucially, before measurement the amplitudes can interfere, like waves, which is what quantum algorithms exploit to amplify the probability of correct answers.

Entanglement is a correlation between two or more qubits that cannot be described by independent probability distributions. If two qubits are entangled, measuring one instantly determines something about the other, even across distance. This is not faster-than-light communication; you cannot use it to send information. Entanglement is a resource that algorithms like Grover's and Shor's use to achieve their speedups.

A quantum gate is a reversible operation that transforms a qubit's quantum state. Gates are represented by unitary matrices and are the quantum equivalent of logic gates in classical computing. Common gates include the Hadamard (H), which creates superposition, the CNOT, which entangles two qubits, and the Pauli X, Y, Z gates. Unlike classical logic gates, quantum gates can be applied to superpositions.

Yes, by simulating a quantum computer classically. Frameworks like Qiskit, Cirq, and PennyLane all include local simulators. The catch is that simulating n qubits requires 2^n complex numbers in memory, so classical simulation becomes impractical beyond about 30-40 qubits. You can also run programs on real quantum hardware via cloud services like IBM Quantum or Amazon Braket, often for free on small circuits.

The core requirement is linear algebra: vectors, matrices, complex numbers, inner products, and tensor products. You do not need to understand quantum mechanics deeply at first; many introductory courses treat it as applied linear algebra. Calculus and probability are useful for understanding quantum noise and variational algorithms. A good linear algebra foundation will take you a long way.

Python is by far the most common language for quantum programming. All major frameworks (Qiskit, Cirq, PennyLane, Amazon Braket) have Python APIs. There are also specialised quantum languages: Q# from Microsoft, Quil from Rigetti, and OpenQASM which is the assembly language underlying much IBM Quantum work. For most learners, Python plus one framework is the right starting point.

Qiskit is the most widely used framework and has the most learning resources; it is a reasonable default for most people. PennyLane is the best choice if you are interested in quantum machine learning, as it has the best autodifferentiation support. Cirq is worth knowing if you plan to work with Google hardware. See our framework comparison for a detailed breakdown.

It depends heavily on your starting point and goals. Someone with a Python and linear algebra background can write and run basic quantum circuits in 2 to 4 weeks. Understanding quantum algorithms well enough to implement Grover's or Shor's algorithm takes 2 to 3 months of consistent study. Research-level understanding typically requires a university-style programme of 6 to 12 months. The learning paths on this site give concrete timelines for each level.

Yes, quite a few. IBM's Qiskit learning content is free. Several Coursera and edX courses can be audited at no cost; you only pay for the certificate. The Delft University Quantum 101 programme on edX is free to audit. Our tutorials and framework reference pages are completely free. The courses page filters by free availability.

Today, very little of practical value. Current quantum computers are noisy intermediate-scale quantum (NISQ) devices; they have too many errors to run the algorithms that would beat classical computers on useful problems. Theoretically, a fault-tolerant quantum computer could run Shor's algorithm to factor large numbers exponentially faster than any known classical algorithm, and Grover's algorithm to search databases quadratically faster. Quantum simulation of molecular systems is the most plausible near-term application.

Honest estimates vary widely. Most researchers believe fault-tolerant quantum computing that meaningfully outperforms classical computers on practical problems is still 10 or more years away. The specific timeline depends on progress in error correction, qubit quality, and scaling. Some narrow applications in quantum chemistry and optimisation may see practical advantage sooner. Be sceptical of press releases claiming imminent quantum supremacy for commercial tasks.

Raw qubit counts vary widely by technology. IBM's current Heron-based processors focus on quality over count, with 133 high-fidelity qubits, after demonstrating that low-noise physical qubits matter more than raw numbers. Google's Willow chip (105 qubits) demonstrated below-threshold error correction in late 2024 - a key milestone. QuEra demonstrated 60 error-corrected logical qubits in 2026, meaning reliable computation, not just physical qubits. Quantinuum's H2-2 reached a record #AQ 56 score. Raw qubit count is misleading: what matters is logical qubit quality and the number of reliable operations you can run before errors dominate.

Yes. IBM Quantum provides free cloud access to real quantum processors via its open plan. Amazon Braket, Azure Quantum, and Google Cloud Quantum AI all offer pay-per-use access to multiple hardware types. IBM and IonQ also offer free access for small jobs. Expect queue times ranging from seconds to hours depending on the system and demand.

A physical qubit is the actual hardware component - a superconducting circuit, trapped ion, or photon. Physical qubits are noisy and error-prone; they decohere and produce wrong answers. A logical qubit is an error-corrected qubit built from many physical qubits working together using quantum error correction codes. One logical qubit might require hundreds or thousands of physical qubits to maintain. Current machines have many physical qubits but very few (or no) logical qubits. When you hear claims about "useful" quantum computing, ask specifically about logical qubit counts and error rates, not raw physical qubit numbers.

Pharmaceuticals and materials science stand to gain the most from quantum chemistry simulation, discovering new drugs or catalysts by simulating molecular behaviour that is intractable classically. Finance is exploring quantum optimisation for portfolio management and risk. Logistics and supply chain are potential beneficiaries of quantum combinatorial optimisation. Cybersecurity will be significantly disrupted by Shor's algorithm once large fault-tolerant machines exist.

A large, fault-tolerant quantum computer running Shor's algorithm would break RSA, ECC, and Diffie-Hellman, the public-key cryptography that secures most internet traffic today. Symmetric encryption like AES-256 is less affected: Grover's algorithm halves the effective key length, making AES-128 breakable but AES-256 still adequate. The threat is real but requires machines far beyond current capability; we are likely years to decades away.

Post-quantum cryptography (PQC) refers to classical cryptographic algorithms designed to be secure even against quantum computers. NIST finalised its first PQC standards in 2024, including ML-KEM (key encapsulation) and ML-DSA (digital signatures), both based on lattice problems believed to be hard for quantum computers. As of 2026, enterprise migration has begun in earnest: regulated industries, financial institutions, and government agencies are actively replacing RSA and ECC in new systems. If your organisation handles sensitive data and has not started a PQC migration plan, it is behind the curve.

These attacks involve adversaries collecting encrypted data today to decrypt it once large quantum computers exist. If your data needs to remain confidential for more than 10 to 15 years, you should already be concerned. Government secrets, medical records, and long-term financial data fall into this category. The NIST PQC standards are available now, and migration plans should be underway for any organisation handling sensitive long-lived data.

No. Quantum communication uses quantum mechanical properties, specifically entanglement and the no-cloning theorem, to transmit or verify information with security guarantees. Quantum key distribution (QKD) is the main application, where any eavesdropping disturbs the quantum state and is detectable. This is a separate field from quantum computing, though both use qubits and related hardware.

The quantum internet refers to a proposed network of quantum devices connected by quantum communication links, enabling entanglement distribution over long distances. It would support applications like quantum-secure communication, distributed quantum computing, and quantum sensing networks. Pilot quantum networks exist in several cities and countries, but a global quantum internet is decades away and faces immense engineering challenges in maintaining quantum coherence across fibre-optic links.

Implement a Bell state in Qiskit, run it on the IBM Quantum free tier, and verify the results by hand. This takes about two hours and covers circuit construction, noise effects, and hardware vs simulator differences in one exercise. After that, implement Grover's algorithm on a small database (4-8 items) - it is more interesting than a Bell state and forces you to think about oracles. Both tutorials are on this site, free.

The job market is real but small. IBM, Google, Microsoft, IonQ, Quantinuum, AWS, and a growing number of startups are hiring quantum software engineers, research scientists, and hardware engineers. Quantum software roles often require Python, one major framework (Qiskit, PennyLane), and some algorithm knowledge. Research positions typically require a relevant PhD. The field is growing faster than the academic pipeline, which keeps salaries high for skilled practitioners.

Several paths exist. Quantum software engineering and developer advocacy roles routinely hire candidates without PhDs who have strong Python skills, real circuit-writing experience, and a portfolio of projects. IBM Quantum certification signals baseline competence. Contributing to open-source (Qiskit, PennyLane, Mitiq) builds visible credibility. Quantum solutions architect and product manager roles at companies like IBM, AWS, and Microsoft value domain knowledge alongside technical understanding. The salary guide covers role-specific requirements.

Watch for two things: claims about imminent commercial quantum advantage on practical problems (almost always overblown), and code examples that use deprecated APIs or do not actually run. Good educational content cites specific hardware results with links to papers or announcements, distinguishes between what is theoretically possible and what is hardware-achievable today, and is honest about timelines. On this site, code examples are tested against current framework versions and factual claims are sourced. If you find an error, email us.

Yes, several. The Qiskit community is the largest: IBM runs a Slack workspace (linked from qiskit.org) and a community forum. PennyLane has an active Discord. The Quantum Open Source Foundation (QOSF) runs Slack groups for practitioners and researchers. Reddit's r/QuantumComputing has a mix of beginners and experts. For research-level discussion, the Unitary Fund Discord is well-moderated and technically serious.