Cleanup: header levels, missing comma in code, add 'citation'

docs/migration-guides/classic-iqp-to-cloud-iqp.mdx

@@ -132,7 +132,7 @@ QiskitRuntimeService.save_account(
    channel="ibm_quantum_platform", # `channel` distinguishes between different account types.
    instance="instance-CRN or instance-name", # Optionally copy the instance CRN or name from the Instance section on the dashboard.
    name="account-name", # Optionally name this set of credentials.
-   overwrite=True # Only needed if you already have Cloud credentials.
+   overwrite=True, # Only needed if you already have Cloud credentials.
    set_as_default=True # Only needed if you want these credentials to be used as the default account. 
    # This is recommended if you have an IQP classic account set as the default. 
 )

docs/support/faq.mdx

@@ -17,7 +17,7 @@ For research papers, we encourage authors to acknowledge IBM Quantum® by usi
 
 >    We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors, and do not reflect the official policy or position of IBM or the IBM Quantum team.
 
-Paper references should be cited as follows:
+Paper references should use the following citation:
 
 > IBM Quantum. https://<span>quantum.cloud.ibm.com</span>/, YYYY
 
@@ -33,7 +33,7 @@ Example of citing an IBM Quantum program:
 
 ## How do I cite IBM Quantum Composer in my research?
 
-Example of citing IBM Quantum Composer:
+Example citation for IBM Quantum Composer:
 
 > IBM Quantum Composer. 2025. url: https://<span>quantum.cloud.ibm.com/composer</span>
 

docs/tutorials/compilation-methods-for-hamiltonian-simulation-circuits.ipynb

@@ -109,9 +109,9 @@
    "id": "c3a31b4d-d679-4657-b372-ba19bcaf8eca",
    "metadata": {},
    "source": [
-    "# Part 1: Efficient SU2 Circuit\n",
+    "## Part 1: Efficient SU2 Circuit\n",
     "\n",
-    "## Step 1: Map classical inputs to a quantum problem\n",
+    "### Step 1: Map classical inputs to a quantum problem\n",
     "\n",
     "In this section, we explore the `efficient_su2` circuit, a hardware-efficient ansatz commonly used in variational quantum algorithms (such as VQE) and quantum machine-learning tasks. The circuit consists of alternating layers of single-qubit rotations and entangling gates arranged in a circular pattern, designed to explore the quantum state space effectively while maintaining manageable depth.\n",
     "\n",
@@ -153,7 +153,7 @@
    "id": "d6671456-9b17-42bb-b94a-d42a29e6fad9",
    "metadata": {},
    "source": [
-    "## Step 2: Optimize problem for quantum hardware execution\n",
+    "### Step 2: Optimize problem for quantum hardware execution\n",
     "\n",
     "This step is the main focus of the tutorial. Here, we aim to optimize quantum circuits for efficient execution on real quantum hardware. Our primary objective is to reduce circuit depth and gate count, which are key factors in improving execution fidelity and mitigating hardware noise.\n",
     "\n",
@@ -277,7 +277,7 @@
    "id": "a16c8082-d0f1-462f-ad10-ebd7d87a0d82",
    "metadata": {},
    "source": [
-    "### Transpile and capture metrics\n",
+    "#### Transpile and capture metrics\n",
     "\n",
     "To compare the performance of the compilation methods, we define a function that transpiles the input circuit and captures relevant metrics in a consistent manner. This includes the total circuit depth, overall gate count, and transpilation time.\n",
     "\n",
@@ -800,7 +800,7 @@
    "id": "167834f1-00a7-4190-99e4-d221d1952357",
    "metadata": {},
    "source": [
-    "### Results graph\n",
+    "#### Results graph\n",
     "\n",
     "As we define a function to consistently capture metrics, we will also define one to graph the metrics. Here, we will plot the two-qubit depth, gate count, and runtime for each compilation method across the circuits."
    ]
@@ -909,7 +909,7 @@
    "id": "f75e8e3a-803f-4386-a60a-b088faa3c81a",
    "metadata": {},
    "source": [
-    "### Analysis of SU2 circuit compilation results\n",
+    "#### Analysis of SU2 circuit compilation results\n",
     "\n",
     "In this experiment, we compare two transpilation methods — Qiskit's SABRE transpiler and the AI-powered transpiler — on a set of `efficient_su2` circuits. Since these circuits do not include any `PauliEvolutionGate` operations, the Rustiq plugin is not included in this comparison.\n",
     "\n",
@@ -928,19 +928,19 @@
    "id": "4c3b2aa8-8187-488a-8e5b-197cf26085bb",
    "metadata": {},
    "source": [
-    "# Part 2: Hamiltonian simulation circuit\n",
+    "## Part 2: Hamiltonian simulation circuit\n",
     "\n",
-    "## Step 1: Investigate circuits with `PauliEvolutionGate`\n",
+    "### Step 1: Investigate circuits with `PauliEvolutionGate`\n",
     "\n",
     "In this section, we investigate quantum circuits constructed using `PauliEvolutionGate`, which enables efficient simulation of Hamiltonians. We will analyze how different compilation methods optimize these circuits across various Hamiltonians.\n",
     "\n",
-    "### Hamiltonians used in the benchmark\n",
+    "#### Hamiltonians used in the benchmark\n",
     "\n",
     "The Hamiltonians used in this benchmark describe pairwise interactions between qubits, including terms such as $ZZ$, $XX$, and $YY$. These Hamiltonians are commonly used in quantum chemistry, condensed matter physics, and materials science, where they model systems of interacting particles.\n",
     "\n",
     "For reference, users can explore a broader set of Hamiltonians in this paper: [Efficient Hamiltonian Simulation on Noisy Quantum Devices](https://arxiv.org/pdf/2306.13126).\n",
     "\n",
-    "### Benchmark source: Hamlib and Benchpress\n",
+    "#### Benchmark source: Hamlib and Benchpress\n",
     "\n",
     "The circuits used in this benchmark are drawn from the [Hamlib benchmark repository](https://github.com/SRI-International/QC-App-Oriented-Benchmarks/tree/master/hamlib), which contains realistic Hamiltonian simulation workloads.\n",
     "\n",
@@ -1011,7 +1011,7 @@
    "id": "9690d94d-7d38-45d3-b37d-85eaf268dbd6",
    "metadata": {},
    "source": [
-    "## Step 2: Optimize problem for quantum hardware execution\n",
+    "### Step 2: Optimize problem for quantum hardware execution\n",
     "\n",
     "As in the previous example, we will use the same backend to ensure consistency in our comparisons. Since the pass managers (`pm_sabre`, `pm_ai`, and `pm_rustiq`) have already been initialized, we can directly proceed with transpiling the Hamiltonian circuits using each method.\n",
     "\n",
@@ -1535,7 +1535,7 @@
    "id": "e4f6aa23-d528-4d66-92e0-31d29c522792",
    "metadata": {},
    "source": [
-    "### Analysis of Hamiltonian circuit compilation results\n",
+    "#### Analysis of Hamiltonian circuit compilation results\n",
     "\n",
     "In this section, we evaluate the performance of three transpilation methods — SABRE, the AI-powered transpiler, and Rustiq — on quantum circuits constructed with `PauliEvolutionGate`, which are commonly used in Hamiltonian simulation tasks.\n",
     "\n",
@@ -1564,7 +1564,7 @@
    "id": "9a747477-1dc1-4706-b844-d29570fb5844",
    "metadata": {},
    "source": [
-    "## Step 3: Execute using Qiskit primitives"
+    "### Step 3: Execute using Qiskit primitives"
    ]
   },
   {
@@ -1580,7 +1580,7 @@
    "id": "bb4c4c67-a7e8-4ca1-a5d6-908a2e1d27e5",
    "metadata": {},
    "source": [
-    "## Step 4: Post-process and return result in desired classical format"
+    "### Step 4: Post-process and return result in desired classical format"
    ]
   },
   {
@@ -1597,6 +1597,7 @@
    "metadata": {},
    "source": [
     "## References\n",
+    "\n",
     "[1] \"LightSABRE: A Lightweight and Enhanced SABRE Algorithm\". H. Zou, M. Treinish, K. Hartman, A. Ivrii, J. Lishman et al. https://arxiv.org/abs/2409.08368\n",
     "\n",
     "[2] \"Practical and efficient quantum circuit synthesis and transpiling with Reinforcement Learning\". D. Kremer, V. Villar, H. Paik, I. Duran, I. Faro, J. Cruz-Benito et al. https://arxiv.org/abs/2405.13196\n",

docs/tutorials/global-data-quantum-optimizer.ipynb

@@ -90,7 +90,7 @@
    "id": "ab6114f0-fad3-4f44-809d-3ff966f2b2ea",
    "metadata": {},
    "source": [
-    "# Setup"
+    "## Setup"
    ]
   },
   {
@@ -125,7 +125,7 @@
    "id": "0856b7ca-8cf5-457d-ac08-df83a02852af",
    "metadata": {},
    "source": [
-    "# Step 1: Read the input portfolio\n",
+    "## Step 1: Read the input portfolio\n",
     "\n",
     "In this step, we load historical data for the seven selected assets from the IBEX 35 index, specifically from **November 1, 2022** to **April 1, 2023**.\n",
     "\n",
@@ -234,7 +234,7 @@
    "id": "fbd9f5aa-dc2d-48bb-805f-ae0d55aedc54",
    "metadata": {},
    "source": [
-    "# Step 2: Define the problem inputs"
+    "## Step 2: Define the problem inputs"
    ]
   },
   {
@@ -358,7 +358,7 @@
    "id": "7bc6ac05-5c0b-418e-9978-8dd5bdcd97c4",
    "metadata": {},
    "source": [
-    "# Step 3: Analyze the optimization results"
+    "## Step 3: Analyze the optimization results"
    ]
   },
   {