Skip to content

Commit

Permalink
Fix bad indentation in NoiseAdaptiveLayout (Qiskit#1343)
Browse files Browse the repository at this point in the history 
Closes Qiskit#1200

This PR fixes a bad indentation in `NoiseAdaptiveLayout` as explained in
Qiskit#1200.
  • Loading branch information
@arnaucasau
arnaucasau authored May 10, 2024
1 parent e593294 commit 37117de
Show file tree
Hide file tree
Showing 23 changed files with 138 additions and 506 deletions.
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.19/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -15,31 +15,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.24/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -17,31 +17,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.25/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -15,31 +15,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.26/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -15,31 +15,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.27/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -15,31 +15,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.28/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -15,31 +15,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.29/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -17,31 +17,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.30/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -17,31 +17,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.31/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -17,31 +17,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
28 changes: 6 additions & 22 deletions docs/api/qiskit/0.32/qiskit.transpiler.passes.NoiseAdaptiveLayout.mdx
View file
Original file line number Diff line number Diff line change
Expand Up @@ -17,31 +17,15 @@ python_api_name: qiskit.transpiler.passes.NoiseAdaptiveLayout
>
> The pass implements the qubit mapping method from: Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi ASPLOS 2019 (arXiv:1901.11054).
<Function signature="Ordering of edges" />

<Function signature="Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag." />
<Function signature="Ordering of edges">
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
</Function>

### Initialization

<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()" />

<Function signature="If an edge exists with both endpoints unmapped," />

<Function signature="pick the best available hardware cx to execute this edge." />

<Function signature="Iterative step" />

<Function signature="When an edge exists with one endpoint unmapped," />

<Function signature="map that endpoint to a location which allows" />

<Function signature="maximum reliability for CNOTs with previously mapped qubits." />

<Function signature="In the end if there are unmapped qubits (which don't" />

<Function signature="participate in any CNOT), map them to any available" />

<Function signature="hardware qubit." />
<Function id="qiskit.transpiler.passes.NoiseAdaptiveLayout.Initialization" signature="Initialization()">
If an edge exists with both endpoints unmapped, pick the best available hardware cx to execute this edge. Iterative step: When an edge exists with one endpoint unmapped, map that endpoint to a location which allows maximum reliability for CNOTs with previously mapped qubits. In the end if there are unmapped qubits (which don't participate in any CNOT), map them to any available hardware qubit.
</Function>

### Notes

Expand Down
Loading

0 comments on commit 37117de

Please sign in to comment.