Added refs.

cda-tum · Sep 12, 2022 · 5344688 · 5344688
1 parent c89e640
commit 5344688
Show file tree

Hide file tree

Showing 2 changed files with 10 additions and 3 deletions.
diff --git a/docs/source/Mapping.rst b/docs/source/Mapping.rst
@@ -95,10 +95,10 @@ Naively inserting SWAP gates that permute the logical-to-physical qubit mapping
 Over the course of the mapping, *four* SWAP gates have been introduce to satisfy the connectivity constraints of the device's architecture.
 Since every additional gate increases the probability of errors, this is a very costly overhead for such a small circuit.
 
-Keeping the number of additionally introduced gates as small as possible is key for ensuring the successful execution of the quantum circuit. Finding an optimal mapping for a quantum circuit is an NP-hard problem.
+Keeping the number of additionally introduced gates as small as possible is key for ensuring the successful execution of the quantum circuit. Finding an optimal mapping for a quantum circuit is an NP-hard problem :cite:labelpar:`boteaComplexityQuantumCircuit2018`.
 *QMAP* offers two dedicated techniques for tackling that problem:
-- An *exact* mapping approach that guarantees (gate-optimal) solutions and is typically suitable for up to 8 qubits.
-- A *heuristic* mapping approach that allows to determine efficient mapping solutions in a scalable fashion for up to hundreds of qubits.
+- An *exact* mapping approach (based on :cite:labelpar:`willeMappingQuantumCircuits2019, burgholzer2022limitingSearchSpace`) that guarantees (gate-optimal) solutions and is typically suitable for up to 8 qubits.
+- A *heuristic* mapping approach (based on :cite:labelpar:`zulehnerEfficientMethodologyMapping2019, hillmichExlpoitingQuantumTeleportation2021`) that allows to determine efficient mapping solutions in a scalable fashion for up to hundreds of qubits.
 
 Exact Mapping
 #############

diff --git a/docs/source/refs.bib b/docs/source/refs.bib
@@ -43,3 +43,10 @@ @inproceedings{wille2020JKQtools
     year = {2020},
     url = {https://www.cda.cit.tum.de/files/eda/2020_iccad_jku_tools_for_quantum_computing.pdf}
 }
+
+@inproceedings{boteaComplexityQuantumCircuit2018,
+  title = {On the complexity of quantum circuit compilation},
+  booktitle = {Int'l {{Symp}}. on {{Combinatorial Search}}},
+  author = {Botea, A. and Kishimoto, A. and Marinescu, Radu},
+  year = {2018},
+}