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. ,
Elementary gates for quantum computation, Physical review A, vol.52, p.3457, 1995. ,
On a Routing Problem, Quart. Appl. Math, vol.16, pp.87-90, 1958. ,
Quantum network optimization, Phys. Rev. A, vol.64, p.22312, 2001. ,
Complexity of Token Swapping and its Variants, Article, vol.2, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01994385
Register Allocation via Coloring, Comput. Lang, vol.6, pp.47-57, 1981. ,
The Complexity of Theorem-proving Procedures, STOC. ACM, pp.151-158, 1971. ,
The Effect of Communication Costs in Solid-state Quantum Computing Architectures, SPAA, pp.65-74, 2003. ,
A (sub)graph isomorphism algorithm for matching large graphs, TPAMI, vol.26, pp.1367-1372, 2004. ,
, Open Quantum Assembly Language. IBM, 2017.
Optimising Matrix Product State Simulations of Shorâ??s Algorithm, CoRR, vol.3, pp.116-125, 2019. ,
Performing quantum computing experiments in the cloud, Phys. Rev. A, vol.94, p.32329, 2016. ,
Superconducting qubits: A short review, pp.1-41, 2004. ,
On Random Graphs I, Publicationes Mathematicae, vol.6, pp.290-297, 1959. ,
Building logical qubits in a superconducting quantum computing system, NPJ Quantum Mechanics, vol.3, issue.2, 2017. ,
The Future of Computing: AI and Quantum. Online video, 2017. ,
Quipper: a scalable quantum programming language, SIGPLAN Notices, vol.48, pp.333-342, 2013. ,
Turboiso: Towards Ultrafast and Robust Subgraph Isomorphism Search in Large Graph Databases, SIGMOD. ACM, pp.337-348, 2013. ,
A Software Methodology for Compiling Quantum Programs, pp.1-14, 2016. ,
, IBM QX Devices, 2016.
Quantum Circuit Compilers Using Gate Commutation Rules, ASPDAC, pp.191-196, 2019. ,
ScaffCC: a framework for compilation and analysis of quantum computing programs, Computing Frontiers, 2014. ,
The Time Complexity of the Token Swapping Problem and Its Parallel Variants, WALCOM, pp.448-459, 2017. ,
State preservation by repetitive error detection in a superconducting quantum circuit, pp.1-30, 2014. ,
, Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures, 2018.
, Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices, 2018.
PAQCS: Physical Design-Aware Fault-Tolerant Quantum Circuit Synthesis, TVLSI, vol.23, pp.1221-1234, 2015. ,
Layout Synthesis for Topological Quantum Circuits With 1-D and 2-D Architectures, TCAD, vol.37, pp.1574-1587, 2018. ,
, 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
Quantum Supremacy Is Both Closer and Farther than It Appears, pp.1-32, 2018. ,
, Quantum Circuit Placement. TCAD, vol.27, pp.752-763, 2008.
Approximation and Hardness of Token Swapping, ESA. Schloss Dagstuhl, vol.66, p.15, 2016. ,
A practical architecture for reliable quantum computers, Computer, vol.35, pp.79-87, 2002. ,
Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits, pp.1-29, 2018. ,
Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures. Circuits and Systems Magazine, vol.16, pp.62-74, 2016. ,
Register Allocation Via Coloring of Chordal Graphs, pp.315-329, 2005. ,
Actual computational time-cost of the Quantum Fourier Transform in a quantum computer using nuclear spins, 2000. ,
, Fast Scalable State Measurement with Superconducting Qubits, pp.1-9, 2014.
Qubit placement to minimize communication overhead in 2D quantum architectures, ASP-DAC, pp.495-500, 2014. ,
Fast Qubit Placement in 2D Architecture Using Nearest Neighbor Realization, iNIS. IEEE, pp.95-100, 2015. ,
Qubit Allocation, CGO. ACM, pp.113-125, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01655951
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT, 2018. ,
A Layered Software Architecture for Quantum Computing Design Tools, Computer, vol.39, issue.1, pp.74-83, 2006. ,
, Toward a Software Architecture for Quantum Computing Design Tools, 2004.
A Case for Variability-Aware Policies for NISQ-Era Quantum Computers, ASPLOS. ACM, 2019. ,
The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.2, pp.83-97, 1955. ,
RevLib: An Online Resource for Reversible Functions and Reversible Circuits, ISMVL. IEEE, pp.220-225, 2008. ,
A single quantum cannot be cloned, Nature, vol.299, pp.802-803, 1982. ,
Sequentially Swapping Colored Tokens on Graphs, WALCOM: Algorithms and Computation, pp.435-447, 2017. ,
Swapping Labeled Tokens on Graphs, pp.364-375, 2014. ,
On Graph Query Optimization in Large Networks, Proc. VLDB Endow, vol.3, pp.340-351, 2010. ,
Efficient mapping of quantum circuits to the IBM QX architectures, pp.1135-1138, 2018. ,
Compiling SU(4) Quantum Circuits to IBM QX Architectures, ASPDAC, pp.185-190, 2019. ,