65 citations · 125 across the 17 of their papers we have counts for
18 papers
Exploring the Relaxation Landscape of a 2D Quantum Magnet on a 256-Qubit Processor
Tiago Mendes-Santos, Joseph Vovrosh, Sergi Julià-Farré +33
How quantum matter relaxes far from equilibrium is a central open problem in many-body physics, and one for which analog quantum simulators are well positioned to move from confirm…
Noise-aware emulation and cross-device validation of neutral atom analog quantum processing units
Constantin Dalyac, Sergi Julià-Farré, Lucas Leclerc +26
Analog quantum processors based on Rydberg atom arrays are a powerful platform for many-body quantum simulation, combinatorial optimization, and graph machine learning. As these de…
Lowering the implementation barrier of neutral-atom quantum computing with agentic workflows
Constantin Dalyac, Alexandre Dauphin, Loïc Henriet +1
Quantum computers are moving from research laboratories to industrial machines accessible via the cloud and integrated into high-performance computing facilities. However, translat…
One-to-one quantum simulation of a frustrated magnet with 256 qubits
Lucas Leclerc, Sergi Julià-Farré, Gabriel Silva Freitas +33
Analog quantum simulators offer a powerful microscopic probe of quantum many-body systems, yet have largely been benchmarked against model Hamiltonians rather than real materials.…
Resource assessment of classical and quantum hardware for post-quench dynamics
Joseph Vovrosh, Tiago Mendes-Santos, Hadriel Mamann +6
We estimate the run-time and energy consumption of simulating non-equilibrium dynamics on neutral atom quantum computers in analog mode, directly comparing their performance to sta…
Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics
Joseph Vovrosh, Sergi Julià-Farré, Wladislaw Krinitsin +11
The quantum dynamics of many-qubit systems is an outstanding problem that has recently driven significant advances in both numerical methods and programmable quantum processing uni…
Quantum Optimization on Rydberg Atom Arrays with Arbitrary Connectivity: Gadgets Limitations and a Heuristic Approach
Pierre Cazals, Amalia Sorondo, Victor Onofre +3
Programmable quantum systems based on Rydberg atom arrays have recently emerged as a promising testbed for combinatorial optimization. Indeed, the Maximum Weighted Independent Set…
A Framework for Quantum Advantage
Olivia Lanes, Mourad Beji, Antonio D. Corcoles +12
As quantum computing approaches the threshold where certain tasks demonstrably outpace their classical machines, the need for a precise, clear, consensus-driven definition of quant…
Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors
Pierre Cazals, Aymeric François, Loïc Henriet +9
The Maximum Independent Set (MIS) problem is a fundamental combinatorial optimization task that can be naturally mapped onto the Ising Hamiltonian of neutral atom quantum processor…
Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles
Lucas Leclerc, Constantin Dalyac, Pascale Bendotti +3
In the quantum optimization paradigm, variational quantum algorithms face challenges with hardware-specific and instance-dependent parameter tuning, which can lead to computational…
Graph Algorithms with Neutral Atom Quantum Processors
Constantin Dalyac, Lucas Leclerc, Louis Vignoli +9
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithm…
Exploring the impact of graph locality for the resolution of MIS with neutral atom devices
Constantin Dalyac, Louis-Paul Henry, Minhyuk Kim +2
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 tha…
Quantum Feature Maps for Graph Machine Learning on a Neutral Atom Quantum Processor
Boris Albrecht, Constantin Dalyac, Lucas Leclerc +10
Using a quantum processor to embed and process classical data enables the generation of correlations between variables that are inefficient to represent through classical computati…
Classically Approximating Variational Quantum Machine Learning with Random Fourier Features
Jonas Landman, Slimane Thabet, Constantin Dalyac +2
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…
Embedding the MIS problem for non-local graphs with bounded degree using 3D arrays of atoms
Constantin Dalyac, Loic Henriet
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…
Quantum evolution kernel : Machine learning on graphs with programmable arrays of qubits
Louis-Paul Henry, Slimane Thabet, Constantin Dalyac +1
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 s…
Pulser: An open-source package for the design of pulse sequences in programmable neutral-atom arrays
Henrique Silvério, Sebastián Grijalva, Constantin Dalyac +6
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-fi…
Qualifying quantum approaches for hard industrial optimization problems. A case study in the field of smart-charging of electric vehicles
Constantin Dalyac, Loïc Henriet, Emmanuel Jeandel +4
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 -- expone…