Next cohort starts September 4. Seats are open.
Back

Free resource

Quantum Computing Starter Cheat Sheet

Every core idea, gate, algorithm, and Qiskit command a beginner actually needs. One page. No fluff.

Level
Total beginner
Time
10 minute read
Cost
Free. No signup.

A free quantum computing cheat sheet for complete beginners. Everything you reach for in your first month, on one page.

  • Qubits and superposition in plain language.
  • Six quantum gates that cover almost every beginner circuit.
  • The algorithms worth knowing by name.
  • The Qiskit commands you type most often.

No physics needed. Basic algebra and a little Python is enough.

01

Core concepts

Six ideas. Everything else in quantum computing is built on top of them.

Qubit
The basic unit of quantum information. A classical bit is either 0 or 1. A qubit can be both at once, in superposition.
Superposition
Lets a qubit hold many possibilities at the same time, right up until you measure it. This is what lets a quantum computer explore paths in parallel.
Entanglement
Two or more qubits become correlated. Measuring one changes the whole state, no matter how far apart they are.
Interference
The trick behind every quantum algorithm. Amplify the answers you want, cancel out the ones you don't.
Phase
A hidden property of a quantum state. You can't measure it directly, but it's what makes Bernstein-Vazirani and the QFT work.
Measurement
Collapses the quantum state and hands you back a classical bit, 0 or 1. Once you look, the superposition is gone.
02

The gates you'll actually use

There are dozens. These six cover almost every circuit you'll write as a beginner.

X

Pauli-X

Flips the state. |0⟩ becomes |1⟩, and back again. The quantum NOT.

H

Hadamard

Puts a qubit into an equal superposition of |0⟩ and |1⟩. Usually your first move.

Z

Pauli-Z

Flips the phase of the |1⟩ state and leaves |0⟩ untouched.

CX

CNOT

Flips the target qubit when the control is |1⟩. The standard way to create entanglement.

CZ

Controlled-Z

Flips the phase of the target qubit when the control is |1⟩.

RY(θ)

Y rotation

Rotates a qubit around the Y axis by θ, so you control exactly how much superposition you get.

03

Algorithms worth knowing

What each one proves, and the quantum trick doing the actual work.

Deutsch

Tell a constant function from a balanced one in a single query.

Interference

Deutsch-Jozsa

The same question scaled to n inputs, still answered in one query.

Quantum parallelism

Bernstein-Vazirani

Recover a hidden binary string in one shot instead of n.

Phase kickback

Grover's search

Search an unsorted database in roughly √N steps instead of N.

Amplitude amplification

Quantum Fourier Transform

Move information into the phase domain. The engine inside Shor.

Phase transformation

Quantum teleportation

Move a quantum state from one qubit to another without moving the qubit.

Entanglement plus classical bits
04

The Qiskit workflow

Every quantum program you write follows the same seven steps. Learn the shape once.

  1. 01Create the circuit
  2. 02Prepare the initial state
  3. 03Apply quantum gates
  4. 04Measure the qubits
  5. 05Transpile
  6. 06Run on a simulator or real hardware
  7. 07Analyse the results
05

Qiskit commands you'll use most

The first 8 are here. All 21 are in the full sheet.

QuantumCircuit()

Creates a new circuit, where you define your qubits, gates, and measurements.

qc.h(0)

Applies a Hadamard gate, putting qubit 0 into an equal superposition.

qc.x(0)

Applies an X (NOT) gate, flipping qubit 0 from |0⟩ to |1⟩ and back.

qc.y(0)

Applies a Y gate, rotating the qubit around the Y axis and changing its phase.

qc.z(0)

Applies a Z gate, changing the phase of the |1⟩ state.

qc.cx(0,1)

Applies a CNOT, flipping the target qubit if the control qubit is |1⟩.

qc.cz(0,1)

Applies a Controlled-Z, flipping the phase of the target qubit if the control is |1⟩.

qc.ry(theta,0)

Rotates qubit 0 around the

13 more, in the full sheet

  • qc.measure(0,0)
  • qc.measure_all()
  • qc.barrier()
  • qc.draw("mpl")
  • AerSimulator()
  • transpile(qc, sim)
  • sim.run(compiled, shots=1024)
  • result.get_counts()
  • plot_histogram(counts)
  • Statevector.from_instruction(qc)
  • plot_bloch_multivector(state)
  • QFT(num_qubits=n)
  • display()

Names only. What each one does, when to reach for it, and the mistakes beginners make with it are in the complete guide.

06

Learning roadmap

Linear algebra to quantum machine learning, in the order that actually works.

End of the free preview

6 sections and 13 commands still to go.

You've read 5 of 11 sections. The rest of the sheet goes to learners inside Introduction to Quantum Computing, our live cohort.

5/11 free
Join the cohort

₹2,000 · Next cohort starts September 4

Fee in the way? Apply for a scholarship.

Still locked

  • 06Learning roadmap10 stages
  • 07Best free resources6 resources
  • 08Beginner project ideas10 projects
  • 09Communities to join6 communities
  • 10Career paths9 steps
  • 11Research papers4 papers

Plus the 13 remaining Qiskit commands, fully explained.

The cohort

Come build it. Don't just read about it.

The full sheet is the smallest thing you get. The real thing is a month inside Introduction to Quantum Computing, writing circuits with people who do this for a living. No physics prerequisite. No prior quantum background.

Join the cohort

₹2,000 · Next cohort starts September 4

What's included

  • The complete Starter Cheat Sheet, all 11 sections
  • 8 live sessions across 4 weekends
  • Hands-on projects and assignments with live doubt-clearing
  • One to one mentorship from people working in the field
  • Recordings of every session, yours to revisit
  • A closed Discord community and a certificate of completion

FAQ

Questions beginners ask first.

Short answers to what people search before they start learning quantum computing.

What is a qubit, in simple terms?

A classical bit is either 0 or 1. A qubit can be in a superposition of both at once, and only settles on 0 or 1 when you measure it. That is what lets a quantum computer explore many possibilities at the same time instead of one after another.

Which quantum gates should a beginner learn first?

Start with X, H, and Z on a single qubit, then CX (CNOT) and CZ for two qubits, and RY when you need a controlled amount of superposition. Those six cover almost every circuit a beginner writes, and each one is explained in the gates section of this cheat sheet.

Do I need physics or advanced math to learn Qiskit?

No. Basic algebra and a little Python are enough to write and run your first working quantum circuit. Linear algebra becomes useful once you go deeper into algorithms, but it is not a prerequisite for getting started.

Is Qiskit free to use?

Yes. Qiskit is open source and free, and IBM Quantum offers a free plan with simulator access plus limited time on real quantum hardware, so you can run everything on this sheet without paying for anything.

What is the difference between a quantum gate and a quantum algorithm?

A gate is a single operation on one or more qubits, like flipping a state or rotating it. An algorithm is a sequence of gates arranged so that interference amplifies the answers you want and cancels the ones you don't. Grover's search and the Quantum Fourier Transform are both just carefully ordered gates.

How long does it take to learn the basics of quantum computing?

Most people get comfortable with qubits, gates, and simple circuits within a few weeks of consistent practice. QuantumX School's Introduction to Quantum Computing covers that ground in one month, across 8 live weekend sessions, with no prior quantum background needed.

Want the bigger picture first? See everything we cover, from quantum foundations to post-quantum cryptography and quantum hardware.