D. Alsina and J. I. Latorre, Experimental test of Mermin inequalities on a ve-qubit quantum computer, Physical Review A, vol.94, p.12314, 2016.

M. Amy, D. Maslov, M. Mosca, and M. Roetteler, A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.32, issue.6, pp.818-830, 2013.

E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel et al., L Users' Guide. Society for Industrial and Applied Mathematics, 1999.

A. Barenco, A universal two-bit gate for quantum computation, Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol.449, pp.679-683, 1937.

A. Barenco, C. H. Bennett, R. Cleve, D. P. Divincenzo, N. Margolus et al., Elementary gates for quantum computation, Physical Review A, vol.52, p.3457, 1995.

V. Bergholm, J. J. Vartiainen, M. Möttönen, and M. M. Salomaa, Quantum circuits with uniformly controlled one-qubit gates, Physical Review A, vol.71, p.52330, 2005.

J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe et al., Quantum machine learning, Nature, vol.549, issue.7671, p.195, 2017.

S. Blackford,

M. J. Bremner, C. M. Dawson, J. L. Dodd, A. Gilchrist, A. W. Harrow et al., Practical scheme for quantum computation with any two-qubit entangling gate, Physical Review Letters, vol.89, p.247902, 2002.

S. S. Bullock and I. L. Markov, An arbitrary two-qubit computation in 23 elementary gates or less, Proceedings of the 40 th Annual Design Automation Conference, pp.324-329, 2003.

S. S. Bullock and I. L. Markov, Asymptotically optimal circuits for arbitrary n-qubit diagonal computations, Quantum Information & Computation, vol.4, pp.27-47, 2004.

R. Cabrera, T. Strohecker, and H. Rabitz, The canonical coset decomposition of unitary matrices through Householder transformations, Journal of Mathematical Physics, vol.51, issue.8, p.82101, 2010.

L. Chen, S. Jordan, Y. Liu, D. Moody, R. Peralta et al., Report on post-quantum cryptography, 2016.

G. Cybenko, Reducing quantum computations to elementary unitary operations, Computing in Science & Engineering, vol.3, issue.2, pp.27-32, 2001.

C. M. Dawson and M. A. Nielsen, The Solovay-Kitaev algorithm, Quantum Information & Computation, vol.6, pp.81-95, 2006.

A. De-vos and S. Baerdemacker, Block-ZXZ synthesis of an arbitrary quantum circuit, Physical Review A, vol.94, p.52317, 2016.

D. Deutsch, Quantum theory, the Church-Turing principle and the universal quantum computer, Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol.400, pp.97-117, 1818.

D. Deutsch, A. Barenco, and A. Ekert, Universality in quantum computation, Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, vol.449, pp.669-677, 1937.

D. P. Divincenzo, Two-bit gates are universal for quantum computation, Physical Review A, vol.51, pp.1015-1022, 1995.

J. Dongarra, Preface: Basic linear algebra subprograms technical (BLAST) forum standard, International Journal of High Performance Computing Applications, vol.16, issue.1, pp.1-1, 2002.

E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, 2014.

R. P. Feynman, Simulating physics with computers, International journal of theoretical physics, vol.21, issue.6-7, pp.467-488, 1982.

G. H. Golub and C. F. Van-loan, Matrix Computations, 1996.

L. K. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the 28 th Annual ACM Symposium on Theory of Computing, pp.212-219, 1996.

L. E. Heyfron and E. T. Campbell, An e cient quantum compiler that reduces T-count, Quantum Science and Technology, vol.4, issue.1, p.15004, 2019.

, Intel. Math Kernel Library (MKL

R. Iten, R. Colbeck, I. Kukuljan, J. Home, and M. Christandl, Quantum circuits for isometries, Physical Review A, vol.93, p.32318, 2016.

R. Iten, O. Reardon-smith, L. Mondada, E. Redmond, R. S. Kohli et al., , 2019.

P. A. Ivanov, E. S. Kyoseva, and N. V. Vitanov, Engineering of arbitrary U(n) transformations by quantum Householder re ections, Physical Review A, vol.74, p.22323, 2006.

A. Javadi-abhari, S. Patil, D. Kudrow, J. Heckey, A. Lvov et al., Sca CC: Scalable compilation and analysis of quantum programs, Parallel Computing, vol.45, pp.2-17, 2015.

R. Jozsa and N. Linden, On the role of entanglement in quantum-computational speed-up, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, vol.459, pp.2011-2032, 2003.

I. Kerenidis and A. Prakash, Quantum recommendation systems, Proceedings of the 8 th Innovations in Theoretical Computer Science Conference, vol.67, pp.1-49, 2017.

I. Kerenidis and A. Prakash, Quantum gradient descent for linear systems and least squares, Physical Review A, vol.101, p.22316, 2020.

V. Kliuchnikov, D. Maslov, and M. Mosca, Fast and e cient exact synthesis of single-qubit unitaries generated by Cli ord and T gates. Quantum Information & Computation, vol.13, pp.607-630, 2013.

E. , Approximation by quantum circuits, 1995.

P. Kok, W. J. Munro, K. Nemoto, T. C. Ralph, J. P. Dowling et al., Linear optical quantum computing with photonic qubits, Reviews of Modern Physics, vol.79, pp.135-174, 2007.

B. Kraus and J. I. Cirac, Optimal creation of entanglement using a two-qubit gate, Physical Review A, vol.63, p.62309, 2001.

R. Larose, A. Tikku, É. O'neel-judy, L. Cincio, and P. J. Coles, Variational quantum state diagonalization, NPJ Quantum Information, vol.5, issue.1, 2019.

R. B. Lehoucq, The computation of elementary unitary matrices, ACM Transactions on Mathematical Software, vol.22, issue.4, pp.393-400, 1996.

S. Lloyd, Almost any quantum logic gate is universal, Physical Review Letters, vol.75, pp.346-349, 1995.

C. F. Loan, The ubiquitous Kronecker product, Journal of Computational and Applied Mathematics, vol.123, issue.1, pp.85-100, 2000.

D. Maslov, Basic circuit compilation techniques for an ion-trap quantum machine, New Journal of Physics, vol.19, issue.2, p.23035, 2017.

O. D. Matteo and M. Mosca, Parallelizing quantum circuit synthesis, Quantum Science and Technology, vol.1, issue.1, p.15003, 2016.

A. Montanaro, Quantum walk speedup of backtracking algorithms, 2015.

M. Möttönen and J. J. Vartiainen, Decompositions of general quantum gates, Trends in Quantum Computing Research, 2006.

M. Möttönen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Quantum circuits for general multiqubit gates, Physical Review Letters, vol.93, p.130502, 2004.

Y. Nam, N. J. Ross, Y. Su, A. M. Childs, and D. Maslov, Automated optimization of large quantum circuits with continuous parameters, NPJ Quantum Information, vol.4, issue.1, p.23, 2018.

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 2011.

A. Peruzzo, J. Mcclean, P. Shadbolt, M. Yung, X. Zhou et al., A variational eigenvalue solver on a photonic quantum processor, Nature Communications, vol.5, p.4213, 2014.

M. Plesch and ?. Brukner, Quantum-state preparation with universal gate decompositions, Physical Review A, vol.83, p.32302, 2011.

J. , Quantum Computing in the NISQ era and beyond. Quantum, vol.2, p.79, 2018.

M. Reck, A. Zeilinger, H. J. Bernstein, and P. Bertani, Experimental realization of any discrete unitary operator, Physical Review Letters, vol.73, pp.58-61, 1994.

N. J. Ross and P. Selinger, Optimal ancilla-free Cli ord+T approximation of Z-rotations, Quantum Information & Computation, vol.16, pp.901-953, 2016.

P. Schindler, D. Nigg, T. Monz, J. T. Barreiro, E. Martinez et al., A quantum information processor with trapped ions, New Journal of Physics, vol.15, issue.12, p.123012, 2013.

R. Schreiber and C. V. Loan, A storage-e cient W Y representation for products of Householder transformations, SIAM Journal on Scienti c and Statistical Computing, vol.10, issue.1, pp.53-57, 1989.

P. Selinger, E cient Cli ord+T approximation of single-qubit operators. Quantum Information & Computation, vol.15, pp.159-180, 2015.

V. V. Shende, S. S. Bullock, and I. L. Markov, Synthesis of quantum-logic circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.25, issue.6, pp.1000-1010, 2006.

Y. Shi, N. Leung, P. Gokhale, Z. Rossi, D. I. Schuster et al., Optimized compilation of aggregated instructions for realistic quantum computers, Proceedings of the 24 th International Conference on Architectural Support for Programming Languages and Operating Systems, pp.1031-1044, 2019.

P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Review, vol.41, issue.2, pp.303-332, 1999.

G. Stewart, The e cient generation of random orthogonal matrices with an application to condition estimators, SIAM Journal on Numerical Analysis, vol.17, issue.3, pp.403-409, 1980.

M. Suchara, Y. Alexeev, F. Chong, H. Finkel, H. Ho-mann et al., Hybrid quantum-classical computing architectures, Proceedings of the 3 rd International Workshop on Post-Moore Era Supercomputing, 2018.

X. Sun and C. Bischof, A basis-kernel representation of orthogonal matrices, SIAM Journal on Matrix Analysis and Applications, vol.16, issue.4, pp.1184-1196, 1995.

B. D. Sutton, Computing the complete cs decomposition, Numerical Algorithms, vol.50, issue.1, pp.33-65, 2009.

K. M. Svore and M. Troyer, The quantum future of computation, IEEE Computer, vol.49, issue.9, pp.21-030, 2016.

S. Tomov, J. Dongarra, and M. Baboulin, Towards dense linear algebra for hybrid GPU accelerated manycore systems, Special Issue on Parallel Matrix Algorithms and Applications, vol.36, issue.5, pp.232-240, 2010.

J. Urías and D. A. Quiñones, Householder methods for quantum circuit design, Canadian Journal of Physics, vol.94, issue.2, pp.150-157, 2016.

B. Valiron, N. J. Ross, P. Selinger, D. S. Alexander, and J. M. Smith, Programming the quantum future, Commununications of the ACM, vol.58, issue.8, pp.52-61, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01194416

J. J. Vartiainen, M. Möttönen, and M. M. Salomaa, E cient decomposition of quantum gates, Physical Review Letters, vol.92, p.177902, 2004.

F. Vatan and C. Williams, Optimal quantum circuits for general two-qubit gates, Physical Review A, vol.69, p.32315, 2004.

F. Vatan and C. P. Williams, Realization of a general three-qubit quantum gate. Draft available as quant-ph/0401178, 2004.

G. Vidal, E cient classical simulation of slightly entangled quantum computations, Physical Review Letters, vol.91, p.147902, 2003.

G. Vidal and C. M. Dawson, Universal quantum circuit for two-qubit transformations with three controlled-not gates, Physical Review A, vol.69, p.10301, 2004.

J. Wang and K. Manouchehri, Physical implementation of quantum walks, 2013.

J. M. Welch, On the Synthesis of Quantum Circuits for Diagonal Operators in Quantum Computation. Doctoral dissertation, Graduate School of Arts & Sciences, 2015.

A. C. and -. Yao, Quantum circuit complexity, Proceedings of the 34 th Annual Symposium on the Foundations of Computer Science, pp.352-361, 1993.