M. Amy, D. Maslov, M. Mosca, and M. Roetteler, A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits, Trans. Comp.-Aided Des. Integ. Cir. Sys, vol.32, issue.6, pp.818-830, 2013.

A. Barenco, H. Charles, R. Bennett, . Cleve, P. David et al., Elementary gates for quantum computation, Physical review A, vol.52, p.3457, 1995.

R. Bellman, On a Routing Problem, Quart. Appl. Math, vol.16, pp.87-90, 1958.

A. Blais, Quantum network optimization, Phys. Rev. A, vol.64, p.22312, 2001.

É. Bonnet, T. Miltzow, and P. Rzazewski, Complexity of Token Swapping and its Variants, Article, vol.2, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01994385

G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopkins et al., Register Allocation via Coloring, Comput. Lang, vol.6, pp.47-57, 1981.

A. Stephen and . Cook, The Complexity of Theorem-proving Procedures, STOC. ACM, pp.151-158, 1971.

D. Copsey, M. Oskin, T. Metodiev, F. T. Chong, I. Chuang et al., The Effect of Communication Costs in Solid-state Quantum Computing Architectures, SPAA, pp.65-74, 2003.

L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, A (sub)graph isomorphism algorithm for matching large graphs, TPAMI, vol.26, pp.1367-1372, 2004.

A. W. Cross, L. S. Bishop, J. A. Smolin, and J. M. Gambetta, Open Quantum Assembly Language. IBM, 2017.

A. Dang, C. D. Hill, and L. C. Hollenberg, Optimising Matrix Product State Simulations of Shorâ??s Algorithm, CoRR, vol.3, pp.116-125, 2019.

J. Simon and . Devitt, Performing quantum computing experiments in the cloud, Phys. Rev. A, vol.94, p.32329, 2016.

H. Michel, A. Devoret, J. M. Wallraff, and . Martinis, Superconducting qubits: A short review, pp.1-41, 2004.

P. Erdös and A. Rényi, On Random Graphs I, Publicationes Mathematicae, vol.6, pp.290-297, 1959.

M. Jay, J. M. Gambetta, M. Chow, and . Steffen, Building logical qubits in a superconducting quantum computing system, NPJ Quantum Mechanics, vol.3, issue.2, 2017.

D. Gil, The Future of Computing: AI and Quantum. Online video, 2017.

P. L. Alexander-s-green, . Lumsdaine, J. Neil, P. Ross, B. Selinger et al., Quipper: a scalable quantum programming language, SIGPLAN Notices, vol.48, pp.333-342, 2013.

W. Han, J. Lee, and J. Lee, Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases, SIGMOD. ACM, pp.337-348, 2013.

T. Häner, D. S. Steiger, K. M. Svore, and M. Troyer, A Software Methodology for Compiling Quantum Programs, pp.1-14, 2016.

. Ibm, IBM QX Devices, 2016.

T. Itoko, R. Raymond, T. Imamichi, A. Matsuo, and A. W. Cross, Quantum Circuit Compilers Using Gate Commutation Rules, ASPDAC, pp.191-196, 2019.

A. Javadi-abhari, S. Patil, D. Kudrow, J. Heckey, A. Lvov et al., ScaffCC: a framework for compilation and analysis of quantum computing programs, Computing Frontiers, 2014.

J. Kawahara, T. Saitoh, and R. Yoshinaka, The Time Complexity of the Token Swapping Problem and Its Parallel Variants, WALCOM, pp.448-459, 2017.

J. Kelly, R. Barends, A. G. Fowler, A. Megrant, E. Jeffrey et al., State preservation by repetitive error detection in a superconducting quantum circuit, pp.1-30, 2014.

L. Lao, B. Van-wee, I. Ashraf, J. Van-someren, N. Khammassi et al., Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures, 2018.

G. Li, Y. Ding, and Y. Xie, Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices, 2018.

C. C. Lin, S. Sur-kolay, and N. K. Jha, PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit Synthesis, TVLSI, vol.23, pp.1221-1234, 2015.

B. Lin, M. Yu, D. Z. Li, and . Pan, Layout Synthesis for Topological Quantum Circuits With 1-D and 2-D Architectures, TCAD, vol.37, pp.1574-1587, 2018.

P. Magnard, P. Kurpiers, B. Royer, T. Walter, J. Besse et al., Alexandre Blais, and Andreas Wallraff. 2018. Fast and Unconditional All-Microwave Reset of a Superconducting Qubit, pp.1-9, 2018.

, OOPSLA, Article 120. Publication date, vol.3, 2019.

, Qubit Allocation as a Combination of Subgraph Isomorphism and Token Swapping, vol.120, p.29

I. L. Markov, A. Fatima, S. V. Isakov, and S. Boixo, Quantum Supremacy Is Both Closer and Farther than It Appears, pp.1-32, 2018.

D. Maslov, S. M. Falconer, and M. Mosca, Quantum Circuit Placement. TCAD, vol.27, pp.752-763, 2008.

T. Miltzow, L. Narins, Y. Okamoto, G. Rote, A. Thomas et al., Approximation and Hardness of Token Swapping, ESA. Schloss Dagstuhl, vol.66, p.15, 2016.

M. Oskin, F. T. Chong, and I. L. Chuang, A practical architecture for reliable quantum computers, Computer, vol.35, pp.79-87, 2002.

E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein et al., Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits, pp.1-29, 2018.

M. Pedram and A. Shafaei, Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures. Circuits and Systems Magazine, vol.16, pp.62-74, 2016.

F. Magno, Q. Pereira, and J. Palsberg, Register Allocation Via Coloring of Chordal Graphs, pp.315-329, 2005.

A. Saito, K. Kioi, Y. Akagi, N. Hashizume, and K. Ohta, Actual computational time-cost of the Quantum Fourier Transform in a quantum computer using nuclear spins, 2000.

D. Sank, E. Jeffrey, J. Y. Mutus, T. C. White, J. Kelly et al., Fast Scalable State Measurement with Superconducting Qubits, pp.1-9, 2014.

A. Shafaei, M. Saeedi, and M. Pedram, Qubit placement to minimize communication overhead in 2D quantum architectures, ASP-DAC, pp.495-500, 2014.

R. R. Shrivastwa, K. Datta, and I. Sengupta, Fast Qubit Placement in 2D Architecture Using Nearest Neighbor Realization, iNIS. IEEE, pp.95-100, 2015.

M. Y. Siraichi, V. Fernandes, S. Santos, F. Collange, and . Pereira, Qubit Allocation, CGO. ACM, pp.113-125, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01655951

P. Surynek, Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT, 2018.

K. M. Svore, A. V. Aho, A. W. Cross, I. Chuang, and I. L. Markov, A Layered Software Architecture for Quantum Computing Design Tools, Computer, vol.39, issue.1, pp.74-83, 2006.

K. M. Svore, A. Cross, and I. Chuang, Toward a Software Architecture for Quantum Computing Design Tools, 2004.

S. Tannu and M. Qureshi, A Case for Variability-Aware Policies for NISQ-Era Quantum Computers, ASPLOS. ACM, 2019.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.2, pp.83-97, 1955.

R. Wille, D. Groã-§e, L. Teuber, G. W. Dueck, and R. Drechsler, RevLib: An Online Resource for Reversible Functions and Reversible Circuits, ISMVL. IEEE, pp.220-225, 2008.

W. K. Wootters and W. H. Zurek, A single quantum cannot be cloned, Nature, vol.299, pp.802-803, 1982.

K. Yamanaka, E. D. Demaine, T. Horiyama, A. Kawamura, S. Nakano et al., Sequentially Swapping Colored Tokens on Graphs, WALCOM: Algorithms and Computation, pp.435-447, 2017.

K. Yamanaka, E. D. Demaine, T. Ito, J. Kawahara, M. Kiyomi et al., Swapping Labeled Tokens on Graphs, pp.364-375, 2014.

P. Zhao and J. Han, On Graph Query Optimization in Large Networks, Proc. VLDB Endow, vol.3, pp.340-351, 2010.

A. Zulehner, A. Paler, and R. Wille, Efficient mapping of quantum circuits to the IBM QX architectures, pp.1135-1138, 2018.

A. Zulehner and R. Wille, Compiling SU(4) Quantum Circuits to IBM QX Architectures, ASPDAC, pp.185-190, 2019.