Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Dalyac, Constantin"'
Autor:
Dalyac, Constantin, Leclerc, Lucas, Vignoli, Louis, Djellabi, Mehdi, Coelho, Wesley da Silva, Ximenez, Bruno, Dareau, Alexandre, Dreon, Davide, Elfving, VIncent E., Signoles, Adrien, Henry, Louis-Paul, Henriet, Loïc
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the ability to reco
Externí odkaz:
http://arxiv.org/abs/2403.11931
In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. In particular, the Maximum Independent Set (MIS) is a known NP-hard problem that can be naturally encoded in Rydberg atom arrays. By representing a g
Externí odkaz:
http://arxiv.org/abs/2306.13373
Autor:
Albrecht, Boris, Dalyac, Constantin, Leclerc, Lucas, Ortiz-Gutiérrez, Luis, Thabet, Slimane, D'Arcangelo, Mauro, Elfving, Vincent E., Lassablière, Lucas, Silvério, Henrique, Ximenez, Bruno, Henry, Louis-Paul, Signoles, Adrien, Henriet, Loïc
Using a quantum processor to embed and process classical data enables the generation of correlations between variables that are inefficient to represent through classical computation. A fundamental question is whether these correlations could be harn
Externí odkaz:
http://arxiv.org/abs/2211.16337
Many applications of quantum computing in the near term rely on variational quantum circuits (VQCs). They have been showcased as a promising model for reaching a quantum advantage in machine learning with current noisy intermediate scale quantum comp
Externí odkaz:
http://arxiv.org/abs/2210.13200
Autor:
Dalyac, Constantin, Henriet, Loic
In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. These algorithms, which have been studied in depth in complexity theory, are at the heart of many industrial applications. In particular, the Maximum
Externí odkaz:
http://arxiv.org/abs/2209.05164
Publikováno v:
Phys. Rev. A 104, 032416 (2021)
The rapid development of reliable Quantum Processing Units (QPU) opens up novel computational opportunities for machine learning. Here, we introduce a procedure for measuring the similarity between graph-structured data, based on the time-evolution o
Externí odkaz:
http://arxiv.org/abs/2107.03247
Pulser: An open-source package for the design of pulse sequences in programmable neutral-atom arrays
Autor:
Silvério, Henrique, Grijalva, Sebastián, Dalyac, Constantin, Leclerc, Lucas, Karalekas, Peter J., Shammah, Nathan, Beji, Mourad, Henry, Louis-Paul, Henriet, Loïc
Publikováno v:
Quantum 6, 629 (2022)
Programmable arrays of hundreds of Rydberg atoms have recently enabled the exploration of remarkable phenomena in many-body quantum physics. In addition, the development of high-fidelity quantum gates are making them promising architectures for the i
Externí odkaz:
http://arxiv.org/abs/2104.15044
Autor:
Dalyac, Constantin, Henriet, Loïc, Jeandel, Emmanuel, Lechner, Wolfgang, Perdrix, Simon, Porcheron, Marc, Veshchezerova, Margarita
Publikováno v:
EPJ Quantum Technology 8, 12 (2021)
In order to qualify quantum algorithms for industrial NP-Hard problems, comparing them to available polynomial approximate classical algorithms and not only to exact ones -- exponential by nature -- , is necessary. This is a great challenge as, in ma
Externí odkaz:
http://arxiv.org/abs/2012.14859
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.