A. W. Harrow and A. Montanaro, Quantum computational supremacy, Nature, vol.549, p.203, 2017.

S. Aaronson and A. Arkhipov, The computational complexity of linear optics, Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp.333-342, 2011.

A. Neville, Classical boson sampling algorithms with superior performance to near-term experiments, Nat. Phys, vol.13, p.1153, 2017.

M. A. Broome, Photonic boson sampling in a tunable circuit, Science, vol.339, pp.794-798, 2013.

M. Tillmann, Experimental boson sampling, Nat. Photon, vol.7, pp.540-544, 2013.

A. Crespi, Integrated multimode interferometers with arbitrary designs for photonic boson sampling, Nat. Photon, vol.7, pp.545-549, 2013.

N. Spagnolo, Experimental validation of photonic boson sampling, Nat. Photon, vol.8, pp.615-620, 2014.

E. Farhi and A. W. Harrow, Quantum supremacy through the quantum approximate optimization algorithm, 2016.

M. J. Bremner, A. Montanaro, and D. J. Shepherd, Achieving quantum supremacy with sparse and noisy commuting quantum computations, vol.1, 2017.

S. Bravyi, D. Gosset, and R. Koenig, Quantum advantage with shallow circuits, 2017.

X. Gao, S. Wang, and L. Duan, Quantum supremacy for simulating a translation-invariant ising spin model, Phys. Rev. Lett, vol.118, p.40502, 2017.

J. Bermejo-vega, D. Hangleiter, M. Schwarz, R. Raussendorf, and J. Eisert, Architectures for quantum simulation showing a quantum speedup, Phys. Rev. X, vol.8, p.21010, 2018.

S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, 2016.

S. Boixo, Characterizing quantum supremacy in near-term devices, Nat. Phys, vol.14, p.595, 2018.

S. Aaronson, S. Beigi, A. Drucker, B. Fefferman, and P. Shor, The power of unentanglement, Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, pp.223-236, 2008.

J. M. Arrazola, E. Diamanti, and I. Kerenidis, Quantum superiority for verifying np-complete problems with linear optics, npj Quantum Inf, vol.4, p.56, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01671939

V. Scarani, The security of practical quantum key distribution, Rev. Mod. Phys, vol.81, p.1301, 2009.

E. Diamanti, H. Lo, B. Qi, and Z. Yuan, Practical challenges in quantum key distribution, npj Quantum Inf, vol.2, p.16025, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01671949

R. J. Donaldson, Experimental demonstration of kilometer-range quantum digital signatures, Phys. Rev. A, vol.93, p.12329, 2016.

A. Pappa, Experimental plug and play quantum coin flipping, Nat. Commun, vol.5, p.3717, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01094106

T. Lunghi, Experimental bit commitment based on quantum communication and special relativity, Phys. Rev. Lett, vol.111, p.180504, 2013.

Y. Liu, Experimental unconditionally secure bit commitment, Phys. Rev. Lett, vol.112, p.10504, 2014.

S. Barz, Demonstration of blind quantum computing, Science, vol.335, p.303, 2012.

W. Mccutcheon, Experimental verification of multipartite entanglement in quantum networks, Nat. Commun, vol.7, p.13251, 2016.

B. Hensen, Loophole-free bell inequality violation using electron spins separated by 1.3 kilometres, Nature, vol.526, pp.682-686, 2015.

A. Pappa, Nonlocality and conflicting interest games, Phys. Rev. Lett, vol.114, p.20401, 2015.
URL : https://hal.archives-ouvertes.fr/hal-02287032

Y. Liu, Device-independent quantum random-number generation, Nature, vol.562, p.548, 2018.

H. Buhrman, R. Cleve, J. Watrous, and R. De-wolf, Quantum fingerprinting, Phys. Rev. Lett, vol.87, p.167902, 2001.

H. Buhrman, R. Cleve, and A. Wigderson, Quantum vs. classical communication and computation, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp.63-68, 1998.

R. Raz, Exponential separation of quantum and classical communication complexity, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp.358-367, 1999.

D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. De-wolf, Exponential separations for one-way quantum communication complexity, with applications to cryptography, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp.516-525, 2007.

D. Gavinsky, Entangled simultaneity versus classical interactivity in communication complexity, 2016.

O. Regev and B. Klartag, Quantum one-way communication can be exponentially stronger than classical communication, Proceedings of the 43rd Annual ACM Symposium on Theory of Computing, pp.31-40, 2011.

Z. Bar-yossef, T. S. Jayram, and I. Kerenidis, Exponential separation of quantum and classical one-way communication complexity, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp.128-137, 2004.

J. M. Arrazola and N. Lütkenhaus, Quantum communication with coherent states and linear optics, Phys. Rev. A, vol.90, p.42335, 2014.

J. M. Arrazola and N. Lütkenhaus, Quantum fingerprinting with coherent states and a constant mean number of photons, Phys. Rev. A, vol.89, p.62305, 2014.

F. Xu, Experimental quantum fingerprinting with weak coherent pulses, Nat. Commun, vol.6, p.8735, 2015.

J. Guan, Observation of quantum fingerprinting beating the classical limit, Phys. Rev. Lett, vol.116, p.240502, 2016.

N. Kumar and E. Diamanti, Kerenidis, I. Efficient quantum communications with coherent state fingerprints over multiple channels, Phys. Rev. A, vol.95, p.32337, 2017.

K. Wei, Experimental quantum switching for exponentially superior quantum communication complexity, Phys. Rev. Lett, vol.122, p.120504, 2019.

T. Sasaki, Y. Yamamoto, and M. Koashi, Practical quantum key distribution protocol without monitoring signal disturbance, Nature, vol.509, p.475, 2014.

J. Guan, Experimental passive round-robin differential phase-shift quantum key distribution, Phys. Rev. Lett, vol.114, p.180502, 2015.

L. Comandar, Quantum key distribution without detector vulnerabilities using optically seeded lasers, Nat. Photonics, vol.10, p.312, 2016.

L. Schweickert, On-demand generation of background-free single photons from a solid-state source, Appl. Phys. Lett, vol.112, p.93106, 2018.

D. Gavinsky, Quantum money with classical verification, Proceedings of the 27th Annual IEEE Conference on Computational Complexity, pp.42-52, 2012.

R. Amiri and J. M. Arrazola, Quantum money with nearly optimal error tolerance, Phys. Rev. A, vol.95, p.62334, 2017.

H. Buhrman, O. Regev, G. Scarpa, and R. De-wolf, Near-optimal and explicit bell inequality violations, Proceedings of the 26th Annual IEEE Conference on Computational Complexity, pp.157-166, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01111567

J. Kahn, G. Kalai, and N. Linial, The Influence of Variables on Boolean Functions, 1988.