Organize guides images (#1600)
Part of #154 This PR, following the idea of this [comment](https://github.com/Qiskit/documentation/issues/154#issuecomment-2104751884), moves all the images in the folders `start`, `build`, `transpile`, `verify`, and `run` to a new folder called `guides`, updating all the docs to point to that new folder. To change the links, I used the following script that updates all but 3 links that are missed by the regex. I changed them manually. <details> <summary>Script</summary> ```python from __future__ import annotations import re import glob from pathlib import Path from main import OLD_FOLDERS def update_link(markdown: str, image_folder: str, link: str) -> str: new_link = link.replace(f"/images/{image_folder}/", "/images/guides/") return markdown.replace(link, new_link) def main() -> None: inline_link_re = re.compile(r"\!\[([^\]]+)\]\(([^)]+)\)") for folder in [*OLD_FOLDERS, "api/migration-guides"]: image_folder = folder if folder != "api/migration-guides" else "run" for file_path in glob.glob(f"docs/{folder}/*"): file = Path(file_path) markdown = file.read_text() new_markdown = re.sub( inline_link_re, lambda m: update_link(m[0], image_folder, m[2]), markdown, ) if markdown != new_markdown: file.write_text(new_markdown) if __name__ == "__main__": main() ``` </details>
Arnau Casau
GitHub
|
|
@ -94,4 +94,4 @@ Usage is a measurement of the amount of time the system is locked for your workl
|
|||
* Batch usage is the sum of quantum time of all jobs in the batch.
|
||||
* Single job usage is the quantum time the job uses in processing.
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -48,7 +48,7 @@ circuit = qiskit.qasm2.loads(program)
|
|||
circuit.draw()
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
#### Example: import an OpenQASM 2 program from a file
|
||||
|
||||
|
|
|
|||
|
|
@ -82,7 +82,7 @@ program = """
|
|||
circuit = qiskit.qasm3.loads(program)
|
||||
circuit.draw("mpl")
|
||||
```
|
||||
|
||||
|
||||
|
||||
## Export to OpenQASM 3
|
||||
|
||||
|
|
|
|||
|
|
@ -156,7 +156,7 @@ circuit.measure_all()
|
|||
circuit.draw("mpl")
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
## Next steps
|
||||
|
||||
|
|
|
|||
|
|
@ -57,7 +57,7 @@ circuit.h(qreg_q[0])
|
|||
circuit.draw("mpl")
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
However, after re-synthesizing with the following code, it only needs a single CX gate. (Here we use the `QuantumCircuit.decompose()` method to better visualize the gates used to re-synthesize the unitary.)
|
||||
|
||||
|
|
@ -73,7 +73,7 @@ better_circuit.unitary(U, range(2))
|
|||
better_circuit.decompose().draw()
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
Qiskit's [transpile](../api/qiskit/compiler#qiskit.compiler.transpile) function automatically performs this re-synthesis for a sufficiently high optimization level.
|
||||
|
||||
|
|
|
|||
|
|
@ -10,17 +10,17 @@ description: Explanatory content on fixed and dynamic repetition rate execution
|
|||
|
||||
Most IBM Quantum™ systems execute circuits at a fixed rate. Although this *repetition rate* varies by system, the underlying execution model is the same, and is described here. First, consider three circuits sent to a system using separate jobs, one for each circuit. The example below shows what happens for jobs of varying lengths. Because of the fixed repetition rate, there is a variable amount of *idle time* that occurs before the start of a circuit in order to make the entire duration match that given by the system repetition rate.
|
||||
|
||||
|
||||
|
||||
|
||||
The situation changes somewhat when the same circuits are batched into a single job. In this case the circuits included in the job are executed by iterating over the circuits for each shot requested; the execution is column-wise over a matrix of circuits and shots (see below).
|
||||
|
||||
|
||||
|
||||
|
||||
Matrix of four circuits in a job showing the execution pattern over the circuits.
|
||||
|
||||
When submitting batches of circuits to the systems, the circuits are executed differently than they would be if executed separately. Namely, the initialization of the circuit, that is, prepare the ground state, and measurements (if any) are aligned over all circuits.
|
||||
|
||||
|
||||
|
||||
|
||||
Therefore, each circuit is equal in duration to the longest circuit in the batch, and there is a common idle time that is placed in front of all circuits to match the repetition rate.
|
||||
|
||||
|
|
|
|||
|
|
@ -12,7 +12,7 @@
|
|||
"\n",
|
||||
"## Memory limits and latency in control hardware\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"Running circuits on quantum processors involves not only the qubits themselves, but also a system of classical electronics and computers to generate and receive waveforms and orchestrate the control logic. When a job is submitted to the IBM Quantum™ service, it is processed into multiple classical programs that must be distributed between two kinds of units: central controllers and qubit controllers (see diagram above). A job may fail if it exceeds certain limitations of these controllers. There are two kinds of limitations to be aware of:\n",
|
||||
"\n",
|
||||
|
|
|
|||
|
|
@ -49,7 +49,7 @@
|
|||
"\n",
|
||||
"The diagram below depicts dynamical decoupling with an XX pulse sequence. The abstract circuit on the left is mapped onto a microwave pulse schedule on the top right. The bottom right depicts the same schedule, but with a sequence of two X pulses inserted during an idle period of the first qubit.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"Dynamical decoupling can be enabled by setting `enable` to `True` in the [dynamical decoupling options](/api/qiskit-ibm-runtime/qiskit_ibm_runtime.options.DynamicalDecouplingOptions). The `sequence_type` option can be used to pick from several different pulse sequences. The default sequence type is `\"XX\"`.\n",
|
||||
"\n",
|
||||
|
|
@ -93,11 +93,11 @@
|
|||
"\n",
|
||||
"Pauli twirling is implemented by sandwiching a chosen set of gates with randomly chosen single-qubit Pauli gates in such a way that the ideal effect of the gate remains the same. The result is that a single circuit is replaced with a random ensemble of circuits, all with the same ideal effect. When sampling the circuit, samples are drawn from multiple random instances, rather than just a single one.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"Since most of the errors in current quantum hardware come from two-qubit gates, this technique is often applied exclusively to (native) two-qubit gates. The following diagram depicts some Pauli twirls for the CNOT and ECR gates. Every circuit within a row has the same ideal effect.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"Pauli twirling can be enabled by setting `enable_gates` to `True` in the [twirling options](/api/qiskit-ibm-runtime/qiskit_ibm_runtime.options.TwirlingOptions). Other notable options include:\n",
|
||||
"\n",
|
||||
|
|
@ -137,7 +137,7 @@
|
|||
"[Twirled readout error extinction (TREX)](https://journals.aps.org/pra/abstract/10.1103/PhysRevA.105.032620) mitigates the effect of measurement errors for the estimation of Pauli observable expectation values.\n",
|
||||
" It is based on the notion of twirled measurements, which are accomplished by randomly substituting measurement gates by a sequence of (1) a Pauli X gate, (2) a measurement, and (3) classical bit flip. Just like in standard gate twirling, this sequence is equivalent to a plain measurement in the absence of noise, as depicted in the following diagram:\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"In the presence of readout error, measurement twirling has the effect of diagonalizing the readout-error transfer matrix, making it easy to invert. Estimating the readout-error transfer matrix requires executing additional calibration circuits, which introduces a small overhead.\n",
|
||||
"\n",
|
||||
|
|
@ -183,7 +183,7 @@
|
|||
"Both the noise amplification and extrapolation stages can be implemented in many different ways. Qiskit Runtime implements noise amplification by \"digital gate folding,\" which means that two-qubit gates are replaced with equivalent sequences of the gate and its inverse. For example, replacing a unitary $U$ with $U U^\\dagger U$ would yield a noise amplification factor of 3. For the extrapolation, you can choose from one of several functional forms, including a linear fit or an exponential fit.\n",
|
||||
"The image below depicts digital gate folding on the left, and the extrapolation procedure on the right.\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"ZNE can be enabled by setting `zne_mitigation` to `True` in the [Qiskit Runtime resilience options](/api/qiskit-ibm-runtime/qiskit_ibm_runtime.options.ResilienceOptionsV2) for V2 Estimator.\n",
|
||||
"The Qiskit Runtime options for ZNE are described [here](/api/qiskit-ibm-runtime/qiskit_ibm_runtime.options.ZneOptions). The following options are notable:\n",
|
||||
|
|
|
|||
|
|
@ -47,4 +47,4 @@ To find the usage time for your session or batch, in `qiskit-ibm-runtime` 0.23 o
|
|||
|
||||
If you are calling the REST API directly, the usage time is the `elapsed_time` value returned by the `GET /sessions/{id}` endpoint, for both session and batch workloads.
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -10,7 +10,7 @@ Access to IBM Quantum™ Platform services is controlled by the **instances*
|
|||
IBM Cloud® instances are different from IBM Quantum Platform instances. IBM Cloud does not use the hub/group/project structure for user management. This section describes instances in IBM Quantum Platform. To view and create IBM Cloud instances, visit the [IBM Cloud Quantum Instances page](https://cloud.ibm.com/quantum/instances). Click the name of an instance to see details such as your CRN for that instance, what compute resources (programs, systems, and simulators) are available to you by using that instance, and what jobs you have run on that instance.
|
||||
</Admonition>
|
||||
|
||||
|
||||
|
||||
|
||||
The hub/group/project hierarchy that makes up an IBM Quantum instance.
|
||||
|
||||
|
|
@ -18,7 +18,7 @@ Users with a public account automatically belong to the ibm-q/open/main [open pl
|
|||
|
||||
To see the instances to which you have access, look at the bottom of your [Account page](https://quantum.ibm.com/account).
|
||||
|
||||
|
||||
|
||||
|
||||
## Find your instances
|
||||
|
||||
|
|
@ -120,7 +120,7 @@ If you do not specify an instance, the code will select one in the following ord
|
|||
|
||||
To leave an instance, visit the instance list on your [Account page.](https://quantum.ibm.com/account) Select the instance you wish to leave, then select the overflow menu and choose *Leave instance*.
|
||||
|
||||
|
||||
|
||||
|
||||
## Next steps
|
||||
|
||||
|
|
|
|||
|
|
@ -166,7 +166,7 @@ observables = [
|
|||
>> pub result has shape (2, 3, 6)
|
||||
```
|
||||
|
||||
|
||||
|
||||
|
||||
<Admonition type="tip" title="SparsePauliOp">
|
||||
Each `SparsePauliOp` counts as a single element in this context, regardless of the number of Paulis contained in the `SparsePauliOp`. Thus, for the purpose of these broadcasting rules, all of the following elements have the same shape:
|
||||
|
|
|
|||
|
|
@ -8,12 +8,12 @@ description: Information on IBM Quantum hardware and features of different proce
|
|||
|
||||
Processor types are named for the general technology qualities that go into builds, consisting of the family and revision. Family (e.g., Falcon) refers to the size and scale of circuits possible on the chip. This is primarily determined by the number of qubits and the connectivity graph. Revisions (e.g., r1) are design variants within a given family, often leading to performance improvements or tradeoffs. Segments are comprised of chip sub-sections, and are defined within a given family. For instance, segment H of a Falcon consists of seven qubits arranged as seen in the illustration below. Segment H on a Hummingbird, if implemented, could be entirely different.
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
## Heron
|
||||
|
||||
|
||||
|
||||
|
||||
Quantum volume: 512
|
||||
|
||||
|
|
@ -25,7 +25,7 @@ At 133 qubits, Heron is an [Eagle](#eagle)-sized upgrade to [Egret](#egret) that
|
|||
|
||||
## Osprey
|
||||
|
||||
|
||||
|
||||
|
||||
Osprey is nearly quadruple the size of Eagle at 433 qubits. The larger chip sizes have required further enhancements to device packaging, as well as custom flex cabling in the cryostat to fit the greater I/O requirements within the same wiring footprint.
|
||||
|
||||
|
|
@ -33,7 +33,7 @@ Osprey is nearly quadruple the size of Eagle at 433 qubits. The larger chip size
|
|||
|
||||
## Eagle
|
||||
|
||||
|
||||
|
||||
|
||||
Quantum volume: 128
|
||||
|
||||
|
|
@ -53,7 +53,7 @@ See [IBM Quantum breaks the 100‑qubit processor barrier](https://www.ibm.com/q
|
|||
|
||||
## Hummingbird
|
||||
|
||||
|
||||
|
||||
|
||||
Quantum volume: 128
|
||||
|
||||
|
|
@ -71,7 +71,7 @@ Using a heavy-hexagonal qubit layout, the Hummingbird family allows up to 65 qub
|
|||
|
||||
## Egret
|
||||
|
||||
|
||||
|
||||
|
||||
Quantum volume: 512
|
||||
|
||||
|
|
@ -85,7 +85,7 @@ Egret brings the innovations of tunable couplers onto a 33-qubit platform, resul
|
|||
|
||||
## Falcon
|
||||
|
||||
|
||||
|
||||
|
||||
Quantum volume: 128
|
||||
|
||||
|
|
@ -109,7 +109,7 @@ The Falcon family of devices offers a valuable platform for medium-scale circuit
|
|||
|
||||
## Canary
|
||||
|
||||
|
||||
|
||||
|
||||
The Canary family comprises small designs containing anywhere from 5 to 16 qubits. It uses an optimized 2D lattice. That is, all of the qubits and readout resonators are on the same layer.
|
||||
* [View available Canary systems](https://quantum.ibm.com/services/resources?tab=systems&type=Canary)
|
||||
|
|
|
|||
|
|
@ -6,7 +6,7 @@ description: A list of IBM Quantum systems that are now retired
|
|||
|
||||
# Retired systems
|
||||
|
||||
The following IBM Quantum™ systems have been retired. For the full list of available systems, see the [Compute resources page.](https://quantum.ibm.com/services/resources?services=systems) By default, the information is shown in the card view, but you can use the view switchers () at the top right to change to a sortable table view.
|
||||
The following IBM Quantum™ systems have been retired. For the full list of available systems, see the [Compute resources page.](https://quantum.ibm.com/services/resources?services=systems) By default, the information is shown in the card view, but you can use the view switchers () at the top right to change to a sortable table view.
|
||||
|
||||
<Admonition type="note">
|
||||
To retrieve jobs from a retired system, see [these instructions.](#retrieve)
|
||||
|
|
|
|||
|
|
@ -21,7 +21,7 @@ Batch mode can shorten processing time if all jobs can be provided at the outset
|
|||
When batching, jobs are not guaranteed to run in the order they are submitted. Also, while your batch jobs will run as closely together as possible, they don't get exclusive access to the backend. Therefore, your batch jobs might run in parallel with other users' jobs if there is enough processing capacity on the system. Additionally, system calibration jobs could run between the batched jobs.
|
||||
</Admonition>
|
||||
|
||||
|
||||
|
||||
|
||||
There are multiple ways you can reconfigure your jobs to take advantage of the parallel processing provided by batching.
|
||||
|
||||
|
|
|
|||
|
|
@ -37,7 +37,7 @@ The basic workflow for sessions is as follows:
|
|||
The following video illustrates the session basic workflow:
|
||||
|
||||
<video title="A user starts a session job and becomes the priority user. They submit jobs to the quantum system while other users wait. After the prioritized user's session finishes, the next person's jobs can begin processing." className="max-w-auto h-auto" controls>
|
||||
<source src="/videos/run/sessions/demo.mp4" type="video/mp4"></source>
|
||||
<source src="/videos/guides/sessions/demo.mp4" type="video/mp4"></source>
|
||||
</video>
|
||||
|
||||
<Admonition type="note">
|
||||
|
|
|
|||
|
|
@ -85,7 +85,7 @@ View system configuration values by selecting a system on the [Compute resources
|
|||
|
||||
### Expanded card for a sample system
|
||||
|
||||
|
||||
|
||||
|
||||
### System tabs
|
||||
|
||||
|
|
@ -93,11 +93,11 @@ Click the download icon in the upper right of any tab to download a CSV file of
|
|||
|
||||
**Graph view tab.**
|
||||
|
||||
|
||||
|
||||
|
||||
**Table view tab**
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
## Find system information from other channels
|
||||
|
|
|
|||
|
|
@ -251,7 +251,7 @@ described in more detail below.
|
|||
|
||||
A tentative release schedule is included below:
|
||||
|
||||
|
||||
|
||||
|
||||
For an up-to-date release schedule, refer to the Qiskit Github project's [milestones list](https://github.com/Qiskit/qiskit/milestones), which will always contain the current release plan.
|
||||
|
||||
|
|
|
|||
|
|
@ -41,7 +41,7 @@
|
|||
" qc.draw(output='mpl')\n",
|
||||
"\n",
|
||||
"```\n",
|
||||
"![The circuit's DAG consists of nodes that are connected by directional edges. It is a visual way to represent qubits or classical bits, the operations, and the way that data flows. ](/images/transpile/custom-transpiler-pass/DAG_circ.png \"DAG\")\n",
|
||||
"![The circuit's DAG consists of nodes that are connected by directional edges. It is a visual way to represent qubits or classical bits, the operations, and the way that data flows. ](/images/guides/custom-transpiler-pass/DAG_circ.png \"DAG\")\n",
|
||||
"\n",
|
||||
"Use the `qiskit.tools.visualization.dag_drawer()` function to view this circuit's DAG. There are three kinds of graph nodes: qubit/clbit nodes (green), operation nodes (blue), and output nodes (red). Each edge indicates data flow (or dependency) between two nodes.\n",
|
||||
"\n",
|
||||
|
|
@ -52,7 +52,7 @@
|
|||
"dag = circuit_to_dag(qc)\n",
|
||||
"dag_drawer(dag)\n",
|
||||
"```\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"</details>"
|
||||
]
|
||||
},
|
||||
|
|
|
|||
|
|
@ -11,11 +11,11 @@ Transpilation is the process of rewriting a given input circuit to match the top
|
|||
|
||||
The process of transpilation takes a circuit that contains your instructions:
|
||||
|
||||
<img src="/images/transpile/pre-transpiled.png" alt="A two-qubit quantum circuit containing a Hadamard and two CNOT gates." />
|
||||
<img src="/images/guides/pre-transpiled.png" alt="A two-qubit quantum circuit containing a Hadamard and two CNOT gates." />
|
||||
|
||||
Transpilation then transforms it such that only instructions available on a chosen backend are used, and optimizes those instructions to minimize the effects of noise:
|
||||
|
||||
<img src="/images/transpile/transpiled.png" alt="The same two-qubit quantum circuit after transpilation. It contains RZ, X, SX, and ECR gates." />
|
||||
<img src="/images/guides/transpiled.png" alt="The same two-qubit quantum circuit after transpilation. It contains RZ, X, SX, and ECR gates." />
|
||||
|
||||
----
|
||||
|
||||
|
|
|
|||
|
|
@ -42,7 +42,7 @@
|
|||
"The next stage involves the layout or connectivity of the backend a circuit will be sent to. In general, quantum circuits are abstract entities whose qubits are \"virtual\" or \"logical\" representations of actual qubits used in computations. To execute a sequence of gates, a one-to-one mapping from the \"virtual\" qubits to the \"physical\" qubits in an actual quantum device is necesary. This mapping is stored as a `Layout` object and is part of the constraints defined within a backend's [instruction set architecture (ISA)](./#instruction-set-architecture).\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"![This image illustrates qubits being mapped from the wire representation to a diagram that represents how the qubits are connected on the system.](/images/transpile/transpiler-stages/layout-mapping.png \"Qubit mapping\")\n",
|
||||
"![This image illustrates qubits being mapped from the wire representation to a diagram that represents how the qubits are connected on the system.](/images/guides/transpiler-stages/layout-mapping.png \"Qubit mapping\")\n",
|
||||
"\n",
|
||||
"The choice of mapping is extremely important for minimizing the number of SWAP operations needed to map the input circuit onto the device topology and ensure the most well-calibrated qubits are used. Due to the importance of this stage, the preset pass managers try a few different methods to find the best layout. Typically this involves two steps: first, try to find a \"perfect\" layout (a layout that does not require any SWAP operations), and then, a heuristic pass that tries to find the best layout to use if a perfect layout cannot be found. There are two `Passes` typically used for this first step:\n",
|
||||
"\n",
|
||||
|
|
@ -318,7 +318,7 @@
|
|||
" The transpilation output varies due to the stochastic SWAP mapper. Therefore, the numbers below will likely change each time you run the code.\n",
|
||||
"</Admonition>\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"The following code constructs a 15-qubit GHZ state and compares the `optimization_levels` of transpilation in terms of resulting circuit depth, gate counts, and multi-qubit gate counts."
|
||||
]
|
||||
|
|
@ -442,11 +442,11 @@
|
|||
"id": "98748e38-8d7a-40b5-9376-9dae7c192ef0",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"The transpiler inserted `Delay` instructions to account for idle time on each qubit. To get a better idea of the timing of the circuit we can also look at it with the `timeline.draw()` function:\n",
|
||||
"\n",
|
||||
""
|
||||
""
|
||||
]
|
||||
},
|
||||
{
|
||||
|
|
|
|||
|
|
@ -41,7 +41,7 @@ qc.h(0)
|
|||
qc.cx(0,1)
|
||||
qc.draw("mpl", style="iqp")
|
||||
```
|
||||
|
||||
|
||||
|
||||
```python
|
||||
from qiskit.quantum_info import SparsePauliOp
|
||||
|
|
@ -244,7 +244,7 @@ qc.cx(0,1)
|
|||
qc.measure_all()
|
||||
qc.draw("mpl", style="iqp")
|
||||
```
|
||||
|
||||
|
||||
|
||||
<Admonition type="note">
|
||||
Any quantum circuit passed to a Sampler **must** include measurements.
|
||||
|
|
|
|||
|
Before Width: | Height: | Size: 16 KiB After Width: | Height: | Size: 16 KiB |
|
Before Width: | Height: | Size: 67 KiB After Width: | Height: | Size: 67 KiB |
|
Before Width: | Height: | Size: 40 KiB After Width: | Height: | Size: 40 KiB |
|
Before Width: | Height: | Size: 43 KiB After Width: | Height: | Size: 43 KiB |
|
Before Width: | Height: | Size: 6.7 KiB After Width: | Height: | Size: 6.7 KiB |
|
Before Width: | Height: | Size: 380 KiB After Width: | Height: | Size: 380 KiB |
|
Before Width: | Height: | Size: 174 KiB After Width: | Height: | Size: 174 KiB |
|
Before Width: | Height: | Size: 49 KiB After Width: | Height: | Size: 49 KiB |
|
Before Width: | Height: | Size: 168 KiB After Width: | Height: | Size: 168 KiB |
|
Before Width: | Height: | Size: 243 KiB After Width: | Height: | Size: 243 KiB |
|
Before Width: | Height: | Size: 218 KiB After Width: | Height: | Size: 218 KiB |
|
Before Width: | Height: | Size: 219 KiB After Width: | Height: | Size: 219 KiB |
|
Before Width: | Height: | Size: 703 KiB After Width: | Height: | Size: 703 KiB |
|
Before Width: | Height: | Size: 564 KiB After Width: | Height: | Size: 564 KiB |
|
Before Width: | Height: | Size: 51 KiB After Width: | Height: | Size: 51 KiB |
|
Before Width: | Height: | Size: 395 KiB After Width: | Height: | Size: 395 KiB |
|
Before Width: | Height: | Size: 184 KiB After Width: | Height: | Size: 184 KiB |
|
Before Width: | Height: | Size: 94 KiB After Width: | Height: | Size: 94 KiB |
|
Before Width: | Height: | Size: 104 KiB After Width: | Height: | Size: 104 KiB |
|
Before Width: | Height: | Size: 2.1 MiB After Width: | Height: | Size: 2.1 MiB |
|
Before Width: | Height: | Size: 33 KiB After Width: | Height: | Size: 33 KiB |
|
Before Width: | Height: | Size: 158 KiB After Width: | Height: | Size: 158 KiB |
|
Before Width: | Height: | Size: 51 KiB After Width: | Height: | Size: 51 KiB |
|
Before Width: | Height: | Size: 173 KiB After Width: | Height: | Size: 173 KiB |
|
Before Width: | Height: | Size: 26 KiB After Width: | Height: | Size: 26 KiB |
|
Before Width: | Height: | Size: 5.2 KiB After Width: | Height: | Size: 5.2 KiB |
|
Before Width: | Height: | Size: 1.2 KiB After Width: | Height: | Size: 1.2 KiB |
|
Before Width: | Height: | Size: 4.2 KiB After Width: | Height: | Size: 4.2 KiB |
|
Before Width: | Height: | Size: 2.2 KiB After Width: | Height: | Size: 2.2 KiB |
|
Before Width: | Height: | Size: 1.3 KiB After Width: | Height: | Size: 1.3 KiB |
|
Before Width: | Height: | Size: 1.9 KiB After Width: | Height: | Size: 1.9 KiB |
|
Before Width: | Height: | Size: 2.0 KiB After Width: | Height: | Size: 2.0 KiB |
|
Before Width: | Height: | Size: 1.7 KiB After Width: | Height: | Size: 1.7 KiB |
|
Before Width: | Height: | Size: 2.0 KiB After Width: | Height: | Size: 2.0 KiB |
|
Before Width: | Height: | Size: 19 KiB After Width: | Height: | Size: 19 KiB |
|
Before Width: | Height: | Size: 247 KiB After Width: | Height: | Size: 247 KiB |
|
Before Width: | Height: | Size: 4.6 KiB After Width: | Height: | Size: 4.6 KiB |
|
Before Width: | Height: | Size: 171 KiB After Width: | Height: | Size: 171 KiB |
|
Before Width: | Height: | Size: 22 KiB After Width: | Height: | Size: 22 KiB |
|
Before Width: | Height: | Size: 20 KiB After Width: | Height: | Size: 20 KiB |
|
Before Width: | Height: | Size: 22 KiB After Width: | Height: | Size: 22 KiB |
|
Before Width: | Height: | Size: 22 KiB After Width: | Height: | Size: 22 KiB |
|
Before Width: | Height: | Size: 4.9 KiB After Width: | Height: | Size: 4.9 KiB |
|
Before Width: | Height: | Size: 10 KiB After Width: | Height: | Size: 10 KiB |
|
Before Width: | Height: | Size: 139 KiB After Width: | Height: | Size: 139 KiB |
|
Before Width: | Height: | Size: 139 KiB After Width: | Height: | Size: 139 KiB |
|
Before Width: | Height: | Size: 15 KiB After Width: | Height: | Size: 15 KiB |
|
Before Width: | Height: | Size: 42 KiB After Width: | Height: | Size: 42 KiB |
|
Before Width: | Height: | Size: 94 KiB After Width: | Height: | Size: 94 KiB |
|
Before Width: | Height: | Size: 46 KiB After Width: | Height: | Size: 46 KiB |
|
Before Width: | Height: | Size: 108 KiB After Width: | Height: | Size: 108 KiB |
|
Before Width: | Height: | Size: 59 KiB After Width: | Height: | Size: 59 KiB |
|
Before Width: | Height: | Size: 53 KiB After Width: | Height: | Size: 53 KiB |
|
Before Width: | Height: | Size: 5.3 KiB After Width: | Height: | Size: 5.3 KiB |
|
Before Width: | Height: | Size: 5.3 KiB After Width: | Height: | Size: 5.3 KiB |
|
Before Width: | Height: | Size: 2.4 KiB After Width: | Height: | Size: 2.4 KiB |