Skip to content

Commit

Permalink
Fix some missing footnotes (#2004)
Browse files Browse the repository at this point in the history
Part of #1955. 

In older versions of Sphinx, footnotes looked like this:

```html
<dl class="footnote brackets">
<dt class="label" id="id2"><span class="brackets"><a class="fn-backref" href="#id1">1</a></span></dt>
```

This PR also adds ignores for 0.45 so that it's green. We don't plan to
fix those issues, which are only broken anchor links.
  • Loading branch information
Eric-Arellano authored Sep 20, 2024
1 parent b8112a7 commit 47688a1
Show file tree
Hide file tree
Showing 44 changed files with 176 additions and 8 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -52,6 +54,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
4 changes: 4 additions & 0 deletions docs/api/qiskit/0.25/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -50,6 +52,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -50,6 +52,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
4 changes: 4 additions & 0 deletions docs/api/qiskit/0.26/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -50,6 +52,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -50,6 +52,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
4 changes: 4 additions & 0 deletions docs/api/qiskit/0.27/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -50,6 +52,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -50,6 +52,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
4 changes: 4 additions & 0 deletions docs/api/qiskit/0.28/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -54,6 +56,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -28,6 +28,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand All @@ -50,6 +52,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id4" />

**1**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
6 changes: 6 additions & 0 deletions docs/api/qiskit/0.28/qpy.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -220,14 +220,20 @@ struct {

this matches the internal C representation of Python’s complex type. <span id="id3" />[3](#f3) Finally, if type is `i` it represents an integer which is an `int64_t`.

<span id="f1" />

**[1](#id1)**

[https://tools.ietf.org/html/rfc1700](https://tools.ietf.org/html/rfc1700)

<span id="f2" />

**[2](#id2)**

[https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html](https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html)

<span id="f3" />

**[3](#id3)**

[https://docs.python.org/3/c-api/complex.html#c.Py\_complex](https://docs.python.org/3/c-api/complex.html#c.Py_complex)
Expand Down
2 changes: 2 additions & 0 deletions docs/api/qiskit/0.29/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
6 changes: 6 additions & 0 deletions docs/api/qiskit/0.29/qpy.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -250,14 +250,20 @@ struct {

this matches the internal C representation of Python’s complex type. <span id="id3" />[3](#f3) Finally, if type is `i` it represents an integer which is an `int64_t`.

<span id="f1" />

**[1](#id1)**

[https://tools.ietf.org/html/rfc1700](https://tools.ietf.org/html/rfc1700)

<span id="f2" />

**[2](#id2)**

[https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html](https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html)

<span id="f3" />

**[3](#id3)**

[https://docs.python.org/3/c-api/complex.html#c.Py\_complex](https://docs.python.org/3/c-api/complex.html#c.Py_complex)
Expand Down
2 changes: 2 additions & 0 deletions docs/api/qiskit/0.30/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
6 changes: 6 additions & 0 deletions docs/api/qiskit/0.30/qpy.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -250,14 +250,20 @@ struct {

this matches the internal C representation of Python’s complex type. <span id="id3" />[3](#f3) Finally, if type is `i` it represents an integer which is an `int64_t`.

<span id="f1" />

**[1](#id1)**

[https://tools.ietf.org/html/rfc1700](https://tools.ietf.org/html/rfc1700)

<span id="f2" />

**[2](#id2)**

[https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html](https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html)

<span id="f3" />

**[3](#id3)**

[https://docs.python.org/3/c-api/complex.html#c.Py\_complex](https://docs.python.org/3/c-api/complex.html#c.Py_complex)
Expand Down
2 changes: 2 additions & 0 deletions docs/api/qiskit/0.31/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
6 changes: 6 additions & 0 deletions docs/api/qiskit/0.31/qpy.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -250,14 +250,20 @@ struct {

this matches the internal C representation of Python’s complex type. <span id="id3" />[3](#f3) Finally, if type is `i` it represents an integer which is an `int64_t`.

<span id="f1" />

**[1](#id1)**

[https://tools.ietf.org/html/rfc1700](https://tools.ietf.org/html/rfc1700)

<span id="f2" />

**[2](#id2)**

[https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html](https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html)

<span id="f3" />

**[3](#id3)**

[https://docs.python.org/3/c-api/complex.html#c.Py\_complex](https://docs.python.org/3/c-api/complex.html#c.Py_complex)
Expand Down
2 changes: 2 additions & 0 deletions docs/api/qiskit/0.32/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,8 @@ python_api_name: qiskit.aqua.components.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
6 changes: 6 additions & 0 deletions docs/api/qiskit/0.32/qpy.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -250,14 +250,20 @@ struct {

this matches the internal C representation of Python’s complex type. <span id="id3" />[3](#f3) Finally, if type is `i` it represents an integer which is an `int64_t`.

<span id="f1" />

**[1](#id1)**

[https://tools.ietf.org/html/rfc1700](https://tools.ietf.org/html/rfc1700)

<span id="f2" />

**[2](#id2)**

[https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html](https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html)

<span id="f3" />

**[3](#id3)**

[https://docs.python.org/3/c-api/complex.html#c.Py\_complex](https://docs.python.org/3/c-api/complex.html#c.Py_complex)
Expand Down
2 changes: 2 additions & 0 deletions docs/api/qiskit/0.33/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
6 changes: 6 additions & 0 deletions docs/api/qiskit/0.33/qpy.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -374,14 +374,20 @@ struct {

this matches the internal C representation of Python’s complex type. <span id="id10" />[3](#f3)

<span id="f1" />

**[1](#id1)**

[https://tools.ietf.org/html/rfc1700](https://tools.ietf.org/html/rfc1700)

<span id="f2" />

**2([1](#id3),[2](#id7))**

[https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html](https://numpy.org/doc/stable/reference/generated/numpy.lib.format.html)

<span id="f3" />

**[3](#id10)**

[https://docs.python.org/3/c-api/complex.html#c.Py\_complex](https://docs.python.org/3/c-api/complex.html#c.Py_complex)
Expand Down
2 changes: 2 additions & 0 deletions docs/api/qiskit/0.35/qiskit.algorithms.optimizers.NFT.mdx
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,8 @@ python_api_name: qiskit.algorithms.optimizers.NFT

**References**

<span id="id2" />

**[1](#id1)**

K. M. Nakanishi, K. Fujii, and S. Todo. 2019. Sequential minimal optimization for quantum-classical hybrid algorithms. arXiv preprint arXiv:1903.12166.
Expand Down
Loading

0 comments on commit 47688a1

Please sign in to comment.