quantum-writing-guide
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| quantum-writing-guide [August 22, 2026 at 23:09] – Ivan Janevski | quantum-writing-guide [August 26, 2026 at 15:46] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | # Quantum Computing | + | # Quantum Computing |
| - | This guide provides | + | Writing |
| - | ## Article | + | ## Article |
| - | Every quantum computing article follows this general pattern: | + | 1. **Opening paragraph**: bold term, 2–3 sentence definition, context and importance |
| + | 2. **Definition**: | ||
| + | 3. **Subsections**: | ||
| + | 4. **Cross-references**: | ||
| - | 1. **Title**: noun phrase identifying the topic (e.g., "Quantum Fourier Transform", " | + | Example opening: |
| - | 2. **Opening paragraph**: | + | > **Quantum Fourier Transform** |
| - | 3. **Definition section**: mathematical formalism | + | |
| - | 4. **Subsections**: | + | |
| - | 5. **Cross-references**: | + | |
| - | ## Opening Paragraph | + | ## Math notation |
| - | The first paragraph establishes context and makes the article | + | - **Inline**: `$|\psi\rangle$`, |
| + | - **Block equations**: | ||
| + | - **Kets**: `$|\psi\rangle$` in body (LaTeX); Unicode `|ψ⟩` only in article | ||
| + | - **Operators**: | ||
| + | - **Matrices**: use `\begin{pmatrix}...\end{pmatrix}` | ||
| - | - **Bold the main term** at the start: `**Quantum gate**`, `**Bell state**`, etc. | + | ## Sections by type |
| - | - Provide a **2–3 sentence definition** explaining what the concept is and why it matters | + | |
| - | - Include **context**: | + | |
| - | - Avoid starting with "This article..." | + | |
| - | Example: | + | **Gates**: Definition, Properties, Circuit Implementation, |
| - | > **Quantum Fourier Transform** is an $n$-qubit unitary gate that maps the computational basis state $|j\rangle$ to a uniform superposition with phases determined by $j$. It is the quantum analogue of the classical discrete Fourier transform and is a subroutine in Shor's factoring algorithm and phase estimation. | + | |
| - | ## Mathematical Notation | + | **States**: Definition, Properties, Construction, |
| - | Use DokuWiki math mode (`$...$` for inline, `$$...$$` for block) consistently: | + | **Algorithms**: Problem statement, Overview, Quantum Subroutines, |
| - | - **Inline math**: small expressions, | + | ## Formatting |
| - | - **Block equations**: | + | |
| - | - **Ket notation**: use Unicode angle brackets directly (not `\langle`, `\rangle`). Example: `|Φ⁺⟩`, | + | |
| - | - **Operators**: | + | |
| - | - **Matrices**: | + | |
| - | Example block equation: | + | - **Lists**: use `- **term**: description` format with blank line before |
| - | ``` | + | - **Bold**: mark first mention of key terms in each section |
| - | $$\text{QFT}|j\rangle = \frac{1}{\sqrt{2^n}} \sum_{k=0}^{2^n-1} e^{2\pi i jk/2^n} |k\rangle$$ | + | - **Internal links**: use `[[article-id|Display Text]]` in body text, never in headings |
| - | ``` | + | - **Headings**: |
| + | - **Article titles**: sentence case, not title case | ||
| - | ## Sections and Subsections | + | ## Scope |
| - | ### Standard Sections for Gates | + | **Always**: definition, formalism, applications, |
| - | 1. **Definition**: Mathematical formalism, | + | **When relevant**: matrix |
| - | 2. **Properties**: | + | |
| - | 3. **Circuit Implementation**: | + | |
| - | 4. **Applications**: | + | |
| - | 5. **Scalability**: | + | |
| - | 6. **Relation to Other Gates**: Links to related concepts | + | |
| - | ### Standard Sections for States | + | **Omit**: proofs and derivations, |
| - | 1. **Definition**: | + | ## Tone |
| - | 2. **Properties**: | + | |
| - | 3. **Construction**: | + | |
| - | 4. **Measurement**: | + | |
| - | 5. **Applications**: | + | |
| - | 6. **Relation to Other States**: Links to related concepts | + | |
| - | ### Standard Sections | + | Technical but approachable. Short paragraphs (3–6 sentences). Neutral ("is used in" not "is important |
| - | 1. **Definition**: What problem does it solve and why it's interesting | + | ## Definition |
| - | 2. **Overview**: | + | |
| - | 3. **Quantum Subroutines**: | + | |
| - | 4. **Complexity**: | + | |
| - | 5. **Applications**: | + | |
| - | 6. **Limitations**: | + | |
| - | 7. **Relation to Other Algorithms**: | + | |
| - | ## Formatting Conventions | + | **Gate**: **[Name]** is an $n$-qubit gate that [action]. Its matrix is [form]. It is [Clifford/ |
| - | ### Lists | + | **State**: **[Name]** is an $n$-qubit state where [property]. It is an eigenstate of [operator] with eigenvalue [value]. Applications: |
| - | **Use empty line before lists** and format list items as `- **bold**: description`: | + | **Concept**: **[Name]** is the set of [gates/ |
| - | ``` | + | ## Common mistakes to avoid |
| - | ## Key Properties | + | |
| - | - **Unitarity**: | + | - Starting with "This article..." |
| - | - **Clifford property**: maps Paulis to Paulis | + | - Omitting definition or mathematical formalism |
| - | - **Error resilience**: | + | - Inconsistent notation |
| - | ``` | + | - Missing scalability analysis |
| + | - Embedding links in headings | ||
| + | - Over-explaining basics instead of linking | ||
| + | - No applications mentioned | ||
| + | - Generic opening paragraph | ||
| - | ### Bold for Key Terms | + | ## Before publishing |
| - | Bold the first instance of important terms within sections: | + | - Definition links to foundational concepts |
| - | + | - Applications | |
| - | - **Superposition**: | + | - Relations section links to similar concepts |
| - | - **Entanglement**: | + | - Scalability |
| - | - **Unitary**: | + | - Key terms bolded on first mention |
| - | + | - Math notation consistent (LaTeX in body, Unicode only in titles) | |
| - | ### Internal Links | + | - No dead links |
| - | + | ||
| - | Link to related articles using `[[article-id|Display Text]]`: | + | |
| - | + | ||
| - | - Link concepts to their dedicated pages: `[[quantum-gate-clifford|Clifford gates]]` | + | |
| - | - Use descriptive link text that matches the article title style | + | |
| - | - Don't embed links in headings (put them in the body text instead) | + | |
| - | + | ||
| - | Example: | + | |
| - | ``` | + | |
| - | See [[quantum-gate-qft|Quantum Fourier Transform]] for applications in phase estimation. | + | |
| - | ``` | + | |
| - | + | ||
| - | ### Code Comments (Rarely Used) | + | |
| - | + | ||
| - | Only add comments when the code or concept is genuinely non-obvious: | + | |
| - | + | ||
| - | - Avoid "This computes X" comments — the code structure already shows this | + | |
| - | - Use comments for hidden constraints, | + | |
| - | - Example: `# Bit-reversal reorders QFT output for compatibility with subsequent circuits` | + | |
| - | + | ||
| - | ## Levels of Detail | + | |
| - | + | ||
| - | ### When to Include vs. Omit | + | |
| - | + | ||
| - | **Always include**: | + | |
| - | - Definition | + | |
| - | - How the concept is used in quantum computing | + | |
| - | - Relations to other concepts (via links) | + | |
| - | - Scalability challenges on near-term devices | + | |
| - | + | ||
| - | **Include when relevant**: | + | |
| - | - Explicit matrix representations (for gates/small states) | + | |
| - | - Circuit diagrams (describe in text; actual diagrams handled separately) | + | |
| - | - Experimental implementation details | + | |
| - | - Approximations and optimizations | + | |
| - | + | ||
| - | **Omit**: | + | |
| - | - Proof sketches or detailed derivations (those belong in research papers) | + | |
| - | - Historical anecdotes (focus on current utility) | + | |
| - | - Trivial asides or disclaimers | + | |
| - | - "In conclusion" | + | |
| - | + | ||
| - | ## Writing Tone | + | |
| - | + | ||
| - | - **Technical but approachable**: | + | |
| - | - **Concise**: | + | |
| - | - **Neutral**: | + | |
| - | - **Avoid**: superlatives (" | + | |
| - | + | ||
| - | ## Common Patterns | + | |
| - | + | ||
| - | ### Gate vs. Concept vs. Algorithm | + | |
| - | + | ||
| - | **Gates** (e.g., `quantum-gate-cnot.md`): | + | |
| - | - Unitary transformation of qubits | + | |
| - | - Focus: definition, matrix, applications, | + | |
| - | - Examples: CNOT, Hadamard, Toffoli | + | |
| - | + | ||
| - | **Concepts** (e.g., `quantum-gate-clifford.md`): | + | |
| - | - Category or property of multiple gates/ | + | |
| - | - Focus: classification, | + | |
| - | - Examples: Clifford gates, entanglement, | + | |
| - | + | ||
| - | **Algorithms** (e.g., Grover' | + | |
| - | - Computational procedure with quantum subroutines | + | |
| - | - Focus: problem statement, algorithm steps, complexity, applications | + | |
| - | + | ||
| - | ### Two-Qubit vs. n-Qubit | + | |
| - | + | ||
| - | **Category pages** (e.g., `quantum-gate-two-qubit.md`): | + | |
| - | - Overview of gates/ | + | |
| - | - Link to individual pages | + | |
| - | - Compare/ | + | |
| - | - Example: " | + | |
| - | + | ||
| - | **Individual pages** (e.g., `quantum-gate-cnot.md`): | + | |
| - | - Deep dive into one specific gate/ | + | |
| - | - Focus: definition, matrix, properties, applications | + | |
| - | - Scalar content: properties specific to this gate | + | |
| - | + | ||
| - | ### Definition Patterns | + | |
| - | + | ||
| - | **For gates**: | + | |
| - | > **[Name]** is an $n$-qubit gate that [does what]. Its matrix is [form]. It is [key property: Clifford/ | + | |
| - | + | ||
| - | **For states**: | + | |
| - | > **[Name]** is an $n$-qubit state where [property]. It is an eigenstate of [operator] with eigenvalue [value]. It appears in [which algorithms/ | + | |
| - | + | ||
| - | **For concepts**: | + | |
| - | > **[Concept]** is the set of [gates/ | + | |
| - | + | ||
| - | ## Structure by Category | + | |
| - | + | ||
| - | ### Single-Qubit Gates (or States) | + | |
| - | - Definition | + | |
| - | - Matrix representation | + | |
| - | - Bloch sphere representation (if relevant) | + | |
| - | - Properties | + | |
| - | - Applications | + | |
| - | - Relation to other single-qubit gates | + | |
| - | + | ||
| - | ### Two-Qubit Gates (or States) | + | |
| - | - Definition | + | |
| - | - 4×4 matrix representation | + | |
| - | - Basis action (how it transforms basis states) | + | |
| - | - Entanglement properties | + | |
| - | - Applications | + | |
| - | - Decomposition into single-qubit + CNOT (if applicable) | + | |
| - | - Relation to other two-qubit gates | + | |
| - | + | ||
| - | ### Multi-Qubit Gates (or States) | + | |
| - | - Definition | + | |
| - | - $2^n \times 2^n$ matrix (or abstract description if too large) | + | |
| - | - Symmetries and special structure | + | |
| - | - Scalability analysis | + | |
| - | - Circuit implementation | + | |
| - | - Applications | + | |
| - | - Approximations (if any) | + | |
| - | + | ||
| - | ## Cross-Referencing Checklist | + | |
| - | + | ||
| - | Before finishing an article, ensure: | + | |
| - | + | ||
| - | - [ ] Definition section | + | |
| - | - [ ] Applications | + | |
| - | - [ ] Relations section links to similar | + | |
| - | - [ ] Scalability | + | |
| - | - [ ] Key terms are bolded on first mention | + | |
| - | - [ ] Math notation | + | |
| - | - [ ] No dead links (verify linked pages exist) | + | |
| - | + | ||
| - | ## Common Mistakes to Avoid | + | |
| - | + | ||
| - | 1. **Starting with "This article..." | + | |
| - | 2. **Omitting the definition** → Every article needs mathematical formalism | + | |
| - | 3. **Inconsistent notation** → Decide on ket style, operator notation early | + | |
| - | 4. **Missing scalability** → Always mention how the concept scales with $n$ | + | |
| - | 5. **Embedding links in headings** → Move to body text | + | |
| - | 6. **Over-explaining basics** → Link to foundational concepts instead | + | |
| - | 7. **Omitting applications** → Every concept should have at least one concrete use | + | |
| - | 8. **Generic or vague opening** → Be specific about what the article covers | + | |
| - | + | ||
| - | ## Examples of Well-Formed Articles | + | |
| - | + | ||
| - | **Gate article**: | + | |
| - | - `quantum-gate-qft.md` — comprehensive, | + | |
| - | - `quantum-gate-cnot.md` — concise, clear applications, | + | |
| - | + | ||
| - | **State article**: | + | |
| - | - `quantum-state-bell-00.md` — clear definition, properties, measurement, | + | |
| - | - `quantum-state-ghz.md` — multi-qubit state with scalability discussion | + | |
| - | + | ||
| - | **Concept article**: | + | |
| - | - `quantum-gate-clifford.md` — classification, | + | |
| - | - `quantum-state-entanglement.md` — types of entanglement, | + | |
| - | + | ||
| - | ## Summary | + | |
| - | + | ||
| - | Write quantum computing articles to be: | + | |
| - | - **Self-contained**: | + | |
| - | - **Structured**: | + | |
| - | - **Precise**: | + | |
| - | - **Connected**: | + | |
| - | - **Practical**: | + | |
| - | + | ||
| - | The goal is a personal knowledge base where each article is useful, findable, and connects naturally to related ideas. | + | |
quantum-writing-guide.1787440179.md.gz · Last modified: by Ivan Janevski
