01 / Quantum Problems
Quantum Computing Problems
50 practice problems. Qubits, circuits, algorithms and error correction. You start with linear algebra and end with working programs.
Warm-up9 problems
- 01→
Qubit State Normalization
Derivationlinear algebraqubit states - 02→
Pauli Matrix Eigenvalues
Derivationlinear algebraPauli matrices - 03→
Hadamard Gate Action
Conceptualquantum gatessuperposition - 04→
Creating a Bell State
DerivationentanglementBell statesCNOT - 05→
Measurement and State Collapse
ConceptualmeasurementBorn rule - 06→
Two-Qubit Tensor Products
Derivationtensor productsmulti-qubit states - 07→
SWAP from CNOTs
CodingSWAPCNOTcircuit identities - 08→
Quantum Random Number Generation
Codingrandomnessmeasurementapplications - 09→
Properties of Unitary Matrices
Derivationunitarylinear algebraquantum gates
Interview24 problems
- 01→
Rotations on the Bloch Sphere
DerivationBloch sphererotationsquantum gates - 02→
CNOT Gate in Different Bases
DerivationCNOTbasis changeHadamard - 03→
Deutsch's Algorithm
Conceptualquantum algorithmsoraclesinterference - 04→
Phase Kickback Mechanism
Derivationphase kickbackcontrolled gateseigenvalues - 05→
Grover's Diffusion Operator
DerivationGrover's algorithmamplitude amplification - 06→
Optimal Number of Grover Iterations
DerivationGrover's algorithmquantum speedup - 07→
Quantum Fourier Transform
DerivationQFTFourier transform - 08→
Phase Estimation Precision
Conceptualphase estimationprecisionresource scaling - 09→
Depolarizing Channel
Derivationnoisequantum channelsdensity matrices - 10→
Three-Qubit Bit-Flip Code
Derivationerror correctionrepetition code - 11→
Variational Quantum Eigensolver
ConceptualVQEvariational algorithmshybrid - 12→
Decomposing the Toffoli Gate
CodingToffoligate decompositionuniversal gates - 13→
Quantum Teleportation Protocol
Derivationteleportationentanglementclassical communication - 14→
Superdense Coding
Derivationsuperdense codingentanglementinformation - 15→
No-Cloning Theorem
Derivationno-cloninglinearityunitarity - 16→
Quantum Parallelism Limitations
Conceptualquantum parallelismmeasurementspeedup - 17→
Implementing a Grover Oracle
CodingGrover's algorithmoraclecircuit design - 18→
Simon's Algorithm Implementation
CodingSimon's algorithmhidden subgrouplinear algebra - 19→
Density Matrix Formalism
Derivationdensity matricesmixed statespartial trace - 20→
Quantum State Tomography
Conceptualtomographymeasurementstate reconstruction - 21→
Commutators and the Uncertainty Principle
Derivationcommutatorsuncertaintyobservables - 22→
Partial Trace and Reduced Density Matrices
Derivationpartial tracedensity matrixentanglement - 23→
Composing Quantum Channels
Derivationquantum channelsKraus operatorscomposition - 24→
Bernstein-Vazirani Algorithm
Derivationquantum algorithmsoracleslinear algebra
Hard17 problems
- 01→
Period Finding and Factoring
ConceptualShor's algorithmperiod findingnumber theory - 02→
Stabilizer Codes
Conceptualstabilizerserror correctionPauli group - 03→
Fault-Tolerant Threshold
Conceptualfault tolerancethresholdconcatenation - 04→
QAOA for Max-Cut
DerivationQAOAoptimizationcombinatorial - 05→
Implementing the QFT Circuit
CodingQFTcircuit implementationcontrolled rotations - 06→
Surface Code Structure
Conceptualsurface codetopological codeserror correction - 07→
Minimum Weight Perfect Matching
ConceptualdecodingMWPMsurface code - 08→
T Gate and Magic State Distillation
ConceptualT gatemagic statesfault tolerance - 09→
Hamiltonian Simulation
ConceptualsimulationTrotterizationproduct formulas - 10→
Encoding Fermions for VQE
Conceptualquantum chemistryJordan-Wignerfermion encoding - 11→
Query Complexity Lower Bounds
Derivationquery complexityadversary methodlower bounds - 12→
Phase Estimation Circuit
Codingphase estimationcontrolled unitariescircuit design - 13→
Zero-Noise Extrapolation
Conceptualerror mitigationnoise scalingNISQ - 14→
CHSH Inequality Violation
DerivationBell inequalityentanglementnonlocality - 15→
Quantum Amplitude Estimation
Conceptualamplitude estimationphase estimationspeedup - 16→
Quantum Walk on a Graph
Conceptualquantum walkgraph algorithmsspeedup - 17→
The Steane Code [[7,1,3]]
DerivationSteane codeCSS codesfault tolerance
Topics covered
Bell inequalityBell statesBloch sphereBorn ruleCNOTCSS codesFourier transformGrover's algorithmHadamardJordan-WignerKraus operatorsMWPMNISQPauli groupPauli matricesQAOAQFTSWAPShor's algorithmSimon's algorithmSteane codeT gateToffoliTrotterizationVQEadversary methodamplitude amplificationamplitude estimationapplicationsbasis changecircuit designcircuit identitiescircuit implementationclassical communicationcombinatorialcommutatorscompositionconcatenationcontrolled gatescontrolled rotationscontrolled unitariesdecodingdensity matricesdensity matrixeigenvaluesentanglementerror correctionerror mitigationfault tolerancefermion encodinggate decompositiongraph algorithmshidden subgrouphybridinformationinterferencelinear algebralinearitylower boundsmagic statesmeasurementmixed statesmulti-qubit statesno-cloningnoisenoise scalingnonlocalitynumber theoryobservablesoptimizationoracleoraclespartial traceperiod findingphase estimationphase kickbackprecisionproduct formulasquantum algorithmsquantum channelsquantum chemistryquantum gatesquantum parallelismquantum speedupquantum walkqubit statesquery complexityrandomnessrepetition coderesource scalingrotationssimulationspeedupstabilizersstate reconstructionsuperdense codingsuperpositionsurface codeteleportationtensor productsthresholdtomographytopological codesuncertaintyunitarityunitaryuniversal gatesvariational algorithms
Practise on Uncertain Systems
These problems test whether you understand the material. Uncertain Systems verifies that understanding—so you know what you actually know, not just what you read.