Daniel Vert, PhD
Coordinateur du Hub Advanced Engineering & Computing
Paris, Île-de-France, France
5 k abonnés
+ de 500 relations
À propos
PhD in Quantum Computing on "Benchmarking different quantum computer technologies". The aim of my research was to evaluate the performance of the new generation of quantum computers.
Today, I'm part of an ecosystem focused on quantum and augmented computing (simulation, HPC, systems engineering).
My role is to lead and support these structures throughout their growth:
Accompanying and accrediting R&D projects, promoting technologies and companies, networking and setting up projects, organizing thematic events...
If you want to be part of this ecosystem, contact me!
My publications: https://www.researchgate.net/profile/Daniel_Vert
Articles de Daniel
Activité
-
🚀 Le CC-FR et l'Université de Reims Champagne-Ardenne vous invitent à la formation "Un quantum d'informatique quantique" Plus d'infos sur le site…
🚀 Le CC-FR et l'Université de Reims Champagne-Ardenne vous invitent à la formation "Un quantum d'informatique quantique" Plus d'infos sur le site…
Aimé par Daniel Vert, PhD
-
GENCI est très heureux et très fier d'annoncer l'arrivée de Guillaume Lechantre en tant que Chef de Projet Infrastructures / Infrastructures Chief of…
GENCI est très heureux et très fier d'annoncer l'arrivée de Guillaume Lechantre en tant que Chef de Projet Infrastructures / Infrastructures Chief of…
Aimé par Daniel Vert, PhD
-
🚀 Advancements in Quantum Error Correction (QEC)! 🧑🔬 Check out the latest paper from Google AI and Quantum team on arXiv:…
🚀 Advancements in Quantum Error Correction (QEC)! 🧑🔬 Check out the latest paper from Google AI and Quantum team on arXiv:…
Aimé par Daniel Vert, PhD
Expérience
Formation
-
Université Paris-Saclay
doctorat Informatique Quantique
-
Thèse de doctorat sur l’exploitation de calculateurs quantiques analogiques
-
Université de Bordeaux
Master 2 (M2) Noyaux, Plasmas, Univers
-
Master Physique Fondamentale et Applications, spécialités physique nucléaire, plasmas et fusion, astrophysique
-
Université Blaise Pascal (Clermont-II) - Clermont-Ferrand
Master 2 (M2) Physiques des Particules
-
Master Physique des Particules, spécialités théorie quantique des champs, astroparticules, cosmologie et modèle standard
-
Université Paul Sabatier Toulouse III
Master 1 Physique fondamentale
-
Master Physique Fondamentale, spécialités mécanique quantique, physique atomique et moléculaire et physique nucléaire
-
Université Paul Sabatier (Toulouse III)
Licence Physique fondamentale
-
Licence Physique Fondamentale, spécialités astrophysique et nanosciences
-
Université Blaise Pascal (Clermont-II) - Clermont-Ferrand
Diplôme Unversitaire de Technologie PHYSICAL SCIENCES
-
Diplôme Universitaire de Technologie en Mesures Physiques, spécialisation Techniques Instrumentales
Publications
-
Benchmarking quantum annealing against "hard" instances of the bipartite matching problem
SN Computer Science
This paper experimentally investigates the behavior of analog quantum computers as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem which is specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington” (2X) with 1098 operational qubits on various sizes of such instances and observe that for all but the most trivially small of these it fails to obtain an optimal solution. Thus, our results suggest…
This paper experimentally investigates the behavior of analog quantum computers as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem which is specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington” (2X) with 1098 operational qubits on various sizes of such instances and observe that for all but the most trivially small of these it fails to obtain an optimal solution. Thus, our results suggest that quantum annealing, at least as implemented in a D-Wave device, falls in the same pitfalls as simulated annealing and hence provides additional evidences suggesting that there exist polynomial-time problems that such a machine cannot solve efficiently to optimality. Additionally, we investigate the extent to which the qubits interconnection topologies explains these latter experimental results. In particular, we provide evidences that the sparsity of these topologies which, as such, lead to QUBO problems of artificially inflated sizes can partly explain the aforementioned disappointing observations. Therefore, this paper hints that denser interconnection topologies are necessary to unleash the potential of the quantum annealing approach.
-
Operational Quantum Annealers are Cursed by their Qubits Interconnection Topologies
2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)
Recent experimental works have studied how the quantum annealing approach, as implemented in D-Wave devices, deals with pathological instances of the (polynomial) bipartite matching problem known to be hard for classical simulated annealing algorithms and shown that the quantum approach also performed rather poorly on such instances. In this paper, we investigate the extent to which the qubits interconnection topologies explains these latter experimental results. In particular, we provide…
Recent experimental works have studied how the quantum annealing approach, as implemented in D-Wave devices, deals with pathological instances of the (polynomial) bipartite matching problem known to be hard for classical simulated annealing algorithms and shown that the quantum approach also performed rather poorly on such instances. In this paper, we investigate the extent to which the qubits interconnection topologies explains these latter experimental results. In particular, we provide evidences that the sparsity of these topologies which, as such, lead to QUBO problems of artificially inflated sizes can partly explain the aforementioned disappointing observations. Therefore, this paper hints that denser interconnection topologies are necessary to unleash the potential of the quantum annealing approach.
-
Revisiting Old Combinatorial Beasts in the Quantum Age: Quantum Annealing Versus Maximal Matching
International Conference on Computational Science ICCS 2020
This paper experimentally investigates the behavior of analog quantum computers such as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington” (2X) with 1098 operational qubits on various sizes of such instances and observe that for all but the most trivially small of these it fails to obtain an optimal solution. Thus, our results suggest that…
This paper experimentally investigates the behavior of analog quantum computers such as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington” (2X) with 1098 operational qubits on various sizes of such instances and observe that for all but the most trivially small of these it fails to obtain an optimal solution. Thus, our results suggest that quantum annealing, at least as implemented in a D-Wave device, falls in the same pitfalls as simulated annealing and therefore provides additional evidences suggesting that there exist polynomial-time problems that such a machine cannot solve efficiently to optimality.
-
Revisiting old combinatorial beasts in the quantum age: quantum annealing versus maximal matching
preprint
This paper experimentally investigates the behavior of analog quantum computers such as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington” (2X) with 1098 operational qubits on various sizes of such instances and observe that for all but the most trivially small of these it fails to obtain an optimal solution. Thus, our results suggests…
This paper experimentally investigates the behavior of analog quantum computers such as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington” (2X) with 1098 operational qubits on various sizes of such instances and observe that for all but the most trivially small of these it fails to obtain an optimal solution. Thus, our results suggests that quantum annealing, at least as implemented in a D-Wave device, falls in the same pitfalls as simulated annealing and therefore suggest that there exist polynomial-time problems that such a machine cannot solve efficiently to optimality.
-
On the limitations of the chimera graph topology in using analog quantum computers
16th ACM International Conference
This paper investigates the possibility of using an analog quantum computer as commercialized by D-Wave to solve large QUBO problems by means of a single invocation of the quantum annealer. Indeed this machine solves a spin glass problem with programmable coefficients but subject to quite strong topology restrictions on the set of non-zero coefficients. Rather than mapping problem variables onto multiple qbits, an approach which requires many invocations of the annealer to solve small size…
This paper investigates the possibility of using an analog quantum computer as commercialized by D-Wave to solve large QUBO problems by means of a single invocation of the quantum annealer. Indeed this machine solves a spin glass problem with programmable coefficients but subject to quite strong topology restrictions on the set of non-zero coefficients. Rather than mapping problem variables onto multiple qbits, an approach which requires many invocations of the annealer to solve small size problems, it is tempting to investigate the existence of sparse relaxations compliant with the qbits interconnection topology of the machine, hence solvable in one invocation of the annealing oracle, but still providing good-quality solutions to the original problem. This paper provides an experimental setup which aims to determine whether or not such convenient relaxations do exist or, rather, are easy to find. Our experiments suggest that it is not the case and, therefore, that solving even moderate size arbitrary problems with a single call to a quantum annealer is not possible at least within the constraints of the so-called Chimera topology. We conclude the paper with a number of perspectives that this results imply on the design of heuristics taking profit of a quantum annealing oracle to solve large scale problems.
-
Vers l'exploitation de calculateurs quantiques analogiques pour l'optimisation
ROADEF
Sur le plan pratique, l’émergence à moyen terme d’ordinateurs quantiques capables de rivaliser, pour la résolution de certains problèmes, avec les performances des calculateurs classiques les plus puissants reste hautement spéculative. En effet, et bien qu’il soit tout à fait pertinent d’investiguer les conséquences de l’existence de telles machines dans différents domaines applicatifs, les réalisations actuelles que l’on peut apparenter à des ordinateurs quantiques, bien qu’impressionnantes…
Sur le plan pratique, l’émergence à moyen terme d’ordinateurs quantiques capables de rivaliser, pour la résolution de certains problèmes, avec les performances des calculateurs classiques les plus puissants reste hautement spéculative. En effet, et bien qu’il soit tout à fait pertinent d’investiguer les conséquences de l’existence de telles machines dans différents domaines applicatifs, les réalisations actuelles que l’on peut apparenter à des ordinateurs quantiques, bien qu’impressionnantes sur le plan de la physique, restent très modestes sur le plan informatique. Ces remarques concernent néanmoins ce qu’il convient d’appeler aujourd’hui l’ordinateur quantique numérique, c’est-à-dire composé de portes logiques quantiques s’appliquant sur des qbits. Cette voie n’est néanmoins pas la seule, afin de mettre à profit les propriétés quantiques de la nature pour le traitement de l’information. Ces dernières années, sont apparues des machines quantiques dites analogiques, dont les calculateurs actuellement commercialisés par la société canadienne D-Wave sont les premiers représentants, fonctionnant selon un principe de recuit à accélération quantique.. Ces machines ont l’avantage d’exister à une échelle non triviale et le chemin technologique en vue de leur passage à l’échelle est beaucoup moins flou que celui de leurs cousins numériques. Dans ce contexte, nous cherchons des chemins de transformations polynomiales permettant aussi efficacement que possible de ramener des problèmes d’optimisation vers le type de problème traité par ces machines.
Langues
-
Anglais
Capacité professionnelle générale
-
Français
Bilingue ou langue natale
Plus d’activités de Daniel
-
Oui, la science change le monde ! 🌍 C’est ce que j’ai affirmé ce matin à la #REF2024, lors d’un panel exceptionnel aux côtés de Yasmine Belkaid…
Oui, la science change le monde ! 🌍 C’est ce que j’ai affirmé ce matin à la #REF2024, lors d’un panel exceptionnel aux côtés de Yasmine Belkaid…
Aimé par Daniel Vert, PhD
-
🚀 Breaking News: Major Strides in Quantum Error Correction! 🌟 Hot off the press—today, a significant breakthrough in quantum computing was…
🚀 Breaking News: Major Strides in Quantum Error Correction! 🌟 Hot off the press—today, a significant breakthrough in quantum computing was…
Aimé par Daniel Vert, PhD
-
💥Exciting opportunity at the EuroHPC Joint Undertaking (EuroHPC JU)! 🫵 Are you passionate about shaping the future of #HPC &…
💥Exciting opportunity at the EuroHPC Joint Undertaking (EuroHPC JU)! 🫵 Are you passionate about shaping the future of #HPC &…
Aimé par Daniel Vert, PhD
-
𝗧𝗵𝗲 #𝗤𝘂𝗯𝗶𝘁 𝗥𝗮𝘁𝗶𝗼: 𝗪𝗵𝗲𝗿𝗲 #𝗦𝗰𝗮𝗹𝗮𝗯𝗶𝗹𝗶𝘁𝘆 𝗠𝗲𝗲𝘁𝘀 #𝗘𝗿𝗿𝗼𝗿𝗖𝗼𝗿𝗿𝗲𝗰𝘁𝗶𝗼𝗻 🏭⚛️ The 𝘘𝘶𝘌𝘳𝘢 𝘑𝘶𝘭𝘺 2024…
𝗧𝗵𝗲 #𝗤𝘂𝗯𝗶𝘁 𝗥𝗮𝘁𝗶𝗼: 𝗪𝗵𝗲𝗿𝗲 #𝗦𝗰𝗮𝗹𝗮𝗯𝗶𝗹𝗶𝘁𝘆 𝗠𝗲𝗲𝘁𝘀 #𝗘𝗿𝗿𝗼𝗿𝗖𝗼𝗿𝗿𝗲𝗰𝘁𝗶𝗼𝗻 🏭⚛️ The 𝘘𝘶𝘌𝘳𝘢 𝘑𝘶𝘭𝘺 2024…
Aimé par Daniel Vert, PhD
-
Trois publications Presse (Les Echos, Le Monde, Le Figaro) pour C12 📸
Trois publications Presse (Les Echos, Le Monde, Le Figaro) pour C12 📸
Aimé par Daniel Vert, PhD
-
[IEEE P3329 working group meeting] This working group works on defining a standard for energy efficiency metrics for quantum computing. In their…
[IEEE P3329 working group meeting] This working group works on defining a standard for energy efficiency metrics for quantum computing. In their…
Aimé par Daniel Vert, PhD
-
International TQCI Seminar on Applications-oriented Benchmarks for Quantum Computing - Slides & Videos Organized by TERATEC, LNE and…
International TQCI Seminar on Applications-oriented Benchmarks for Quantum Computing - Slides & Videos Organized by TERATEC, LNE and…
Aimé par Daniel Vert, PhD
-
🔒 NIST Announces First Quantum-Resistant Encryption Standards—A New Era in Cybersecurity 🔒 On August 13, 2024, the U.S. National Institute of…
🔒 NIST Announces First Quantum-Resistant Encryption Standards—A New Era in Cybersecurity 🔒 On August 13, 2024, the U.S. National Institute of…
Aimé par Daniel Vert, PhD