QCoder Problem Catalog
This catalog lists all problems from QCoder Programming Contests (QPC) 001-006, organized by topic. Use this as a reference for practice problems.
Total: 79 Problems Across 6 Contests
| Contest | Problems | Focus Areas |
|---|---|---|
| QPC001 | 11 | State Generation, Oracles |
| QPC002 | 14 | Phase, Arithmetic, QFT |
| QPC003 | 16 | One-hot States, Reflections, Grover |
| QPC004 | 17 | Zeta/Moebius Transform, Shor’s Algorithm |
| QPC005 | 9 | Controlled Gates, Fourier Basis |
| QPC006 | 12 | Error Correction, T-Gates |
By Topic
State Preparation
Basic States (QPC001)
- A1 - Generate Plus state | 100 pts
- A2 - Generate Uniform Superposition State | 200 pts
- A3 - Generate state (|0⟩+|3⟩)/√2 | 200 pts
- A4 - Generate state (|0⟩+|1⟩+|2⟩)/√3 | 200 pts
- A5 - Generate state II | 100 pts
Phase States (QPC002)
- A1 - Generate state (−|0⟩−|0⟩) | 100 pts
- A2 - Generate state (|0⟩−|3⟩)/2 | 200 pts
- A3 - Generate state (|0⟩−|2ⁿ−1⟩)/2 I | 300 pts
- A4 - Generate state (|0⟩−|2ⁿ−1⟩)/2 II | 100 pts
- A5 - Generate state (|0⟩−|2ⁿ−1⟩)/2 III | 200 pts
- B1 - Generate state e^(iθ)|0⟩ | 100 pts
One-Hot States (QPC003)
- A1 - Generate state i|1⟩ | 100 pts
- A2 - Generate state (|10⟩+|01⟩)/√2 | 200 pts
- A3 - Generate state (|100⟩+|010⟩+|001⟩)/√3 | 300 pts
- A4 - Generate One-hot Superposition State I | 200 pts
- A5 - Generate One-hot Superposition State II | 200 pts
- A6 - Generate One-hot Superposition State III | 300 pts
Tensor Product States (QPC003)
Uniform Amplitude Superposition (QPC001)
- C1 - Generate Uniform Amplitude Superposition State I | 300 pts
- C2 - Generate Uniform Amplitude Superposition State II | 600 pts
Oracles
Basic Oracles (QPC001)
- B1 - Copy Oracle | 100 pts
- B2 - XOR Oracle | 200 pts
- B3 - Less Than Oracle I | 300 pts
- B4 - Less Than Oracle II | 500 pts
Phase Shift Oracles (QPC002)
- B2 - Phase Shift Oracle | 200 pts
Shift Oracles (QPC004, QPC005)
- QPC004 A3 - Cyclic Shift Oracle I | 200 pts
- QPC004 A4 - Cyclic Shift Oracle II | 200 pts
- QPC004 A5 - Minus One Oracle | 300 pts
- QPC005 A4 - Cyclic Shift Oracle III | 400 pts
- QPC005 A5 - Minus Oracle | 400 pts
Polynomial Oracles (QPC006)
- B1 - Polynomial Oracle | 300 pts
- B2 - The Hidden Polynomial I | 600 pts
- B3 - The Hidden Polynomial II | 600 pts
Multi-Qubit Operations
SWAP and Qubit Manipulation (QPC002, QPC004)
- B3 - SWAP Qubits | 200 pts
- A2 - Qubit Swap | 200 pts
- QPC005 Ex - Reverse and Shift | 600 pts
Controlled Gates (QPC005, QPC006)
- A2 - Controlled Gate I | 200 pts
- A3 - Controlled Gate II | 200 pts
- C1 - T-dagger | 200 pts
- C2 - Controlled-T | 300 pts
- C3 - Multi-Controlled X | 300 pts
- C4 - Controlled-S | 400 pts
- C5 - Controlled-H | 400 pts
- C6 - Controlled-Controlled-Z | 500 pts
Quantum Fourier Transform (QFT)
- B4 - Quantum Fourier Transform | 200 pts
- B1 - Action in the Fourier Basis | 300 pts
- B2 - Left Action in Another Fourier Basis | 500 pts
- B3 - Right Action in Another Fourier Basis | 600 pts
Arithmetic Circuits
- B5 - Quantum Arithmetic I | 200 pts
- B6 - Quantum Arithmetic II | 200 pts
- B7 - Quantum Arithmetic III | 200 pts
- B8 - Quantum Arithmetic IV | 200 pts
Modular Arithmetic (QPC004)
- B3 - Controlled Constant Addition | 300 pts
- B4 - Left and Right Aligned | 400 pts
- B5 - Modular Arithmetic I | 600 pts
- C1 - Doubling Powers | 200 pts
- C2 - Modular Inverse | 300 pts
- C3 - Modular Arithmetic II | 300 pts
- C4 - Modular Arithmetic III | 400 pts
- C5 - Modular Arithmetic IV | 600 pts
Reflections and Grover’s Algorithm
Reflections (QPC003, QPC004)
- B4 - Reflection Operator I | 200 pts
- B5 - Reflection Operator II | 200 pts
- B7 - Reflection Operator III | 300 pts
- A6 - Zeta / Moebius Transform I | 200 pts
- A7 - Zeta / Moebius Transform II | 300 pts
Grover’s Algorithm (QPC003)
- B6 - Grover’s Algorithm I | 300 pts
- B8 - Grover’s Algorithm II | 300 pts
Bit-Phase Conversion (QPC003)
- B2 - Convert Bit-Flip into Phase-Flip I | 200 pts
- Ex1 - Convert Bit-Flip into Phase-Flip II | 300 pts
Gate Manipulation
Notation (QPC003)
- B1 - Bra-Ket Notated Gate | 100 pts
Uniform Superposition (QPC004)
- B1 - Uniform Superposition | 100 pts
- B2 - Controlled Phase Shift | 200 pts
Error Correction (QPC006)
- A1 - Correction | 100 pts
- A2 - Encoding | 200 pts
- A3 - Detection | 500 pts
Challenge Problems
- Ex - Can you prepare |ω⟩? | 600 pts
- Ex2 - Find Hidden Number | 500 pts
Problem Difficulty Guide
Beginner (100-200 pts)
Perfect for starting out:
- State generation (|0⟩, |1⟩, |+⟩, |−⟩)
- Basic superposition with H gate
- Simple oracles (Copy, XOR)
- Bra-Ket notation
Intermediate (200-400 pts)
Building proficiency:
- Multi-qubit state preparation
- Phase manipulation
- Controlled gates
- Basic arithmetic
- Shift oracles
Advanced (400-600 pts)
For deeper understanding:
- Uniform amplitude superposition
- QFT implementation
- Modular arithmetic
- Grover’s algorithm
- Zeta/Moebius transforms
- Error correction
Expert (600+ pts)
Challenge problems:
- Hidden polynomial finding
- Complex QFT applications
- Advanced Shor’s algorithm components
Suggested Learning Path
Based on this tutorial’s structure:
| Chapter | Recommended Problems |
|---|---|
| First Circuit | QPC001 A1, A2 |
| Single-Qubit Gates | QPC001 A3, A4, QPC003 A1 |
| Hadamard & Superposition | QPC001 A1, A2, QPC002 A1 |
| Phase | QPC002 B1, QPC003 A1 |
| Multi-Qubit Basics | QPC001 B1, B2 |
| CNOT & Entanglement | QPC001 A4, QPC003 A2, A3 |
| Two-Qubit Gates | QPC002 B3, QPC004 A2 |
| Oracles | QPC001 B3, B4 |
| Grover’s Algorithm | QPC003 B6, B8 |
| QFT | QPC002 B4, QPC005 B1 |
| Arithmetic | QPC002 B5-B8, QPC004 B3-B5 |
| Controlled Gates | QPC005 A2, A3, QPC006 C1-C6 |
| Error Correction | QPC006 A1-A3 |
Official QCoder Resources
- QCoder Main Site
- Q&A Page - Rules and format info
- Contest List