496 citations · 1.4k across the 35 of their papers we have counts for
35 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…
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…
Benchmarking a machine-learning differential equations solver on a neutral-atom logical processor
Pauline Mathiot, Elio Garnaoui, Axel-Ugo Leriche +37
We report on a performance comparison between physical and logical computations on a prototypical machine-learning application: solving differential equations using quantum kernel…
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.…
Hybrid quantum-classical analog simulation of two-dimensional Fermi-Hubbard models with neutral atoms
Sergi Julià-Farré, Antoine Michel, Christophe Domain +11
We experimentally study the two-dimensional Fermi-Hubbard model using a Rydberg-based quantum processing unit in the analog mode. Our approach avoids encoding directly the original…
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…
Multiparticle quantum walks for distinguishing hard graphs
Sachin Kasture, Shaheen Acheche, Loic Henriet +1
Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its ap…
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…
Analog Counterdiabatic Quantum Computing
Qi Zhang, Narendra N. Hegade, Alejandro Gomez Cadavid +6
We propose analog counterdiabatic quantum computing (ACQC) to tackle combinatorial optimization problems on neutral-atom quantum processors. While these devices allow for the use o…
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…
Quantized Thouless pumps protected by interactions in dimerized Rydberg tweezer arrays
Sergi Julià-Farré, Javier Argüello-Luengo, Loïc Henriet +1
We study Thouless pumps, i.e., adiabatic topological transport, in an interacting spin chain described by the dimerized XXZ Hamiltonian. In the noninteracting case, quantized Thoul…
A Rydberg-atom approach to the integer factorization problem
Juyoung Park, Seokho Jeong, Minhyuk Kim +6
The task of factoring integers poses a significant challenge in modern cryptography, and quantum computing holds the potential to efficiently address this problem compared to class…
Enhancing Graph Neural Networks with Quantum Computed Encodings
Slimane Thabet, Romain Fouilland, Mehdi Djellabi +4
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential t…
Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery
Mauro D'Arcangelo, Daniele Loco, Fresnel team +8
We introduce quantum algorithms able to sample equilibrium water solvent molecules configurations within proteins thanks to analog quantum computing. To do so, we combine a quantum…
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 pricing-based column-generation framework for hard combinatorial problems
Wesley da Silva Coelho, Loïc Henriet, Louis-Paul Henry
In this work, we present a complete hybrid classical-quantum algorithm involving a quantum sampler based on neutral atom platforms. This approach is inspired by classical column ge…
Financial Risk Management on a Neutral Atom Quantum Processor
Lucas Leclerc, Luis Ortiz-Guitierrez, Sebastian Grijalva +19
Machine Learning models capable of handling the large datasets collected in the financial world can often become black boxes expensive to run. The quantum computing paradigm sugges…
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…
Extending Graph Transformers with Quantum Computed Aggregation
Slimane Thabet, Romain Fouilland, Loic Henriet
Recently, efforts have been made in the community to design new Graph Neural Networks (GNN), as limitations of Message Passing Neural Networks became more apparent. This led to the…
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…
Pulse-level Scheduling of Quantum Circuits for Neutral-Atom Devices
Richard Bing-Shiun Tsai, Henrique Silvério, Loic Henriet
We show how a pulse-level implementation of the multi-qubit gates in neutral-atom device architectures allows for the simultaneous execution of single- and multi-qubit gates acting…
Microwave-engineering of programmable XXZ Hamiltonians in arrays of Rydberg atoms
P. Scholl, H. J. Williams, G. Bornet +13
We use the resonant dipole-dipole interaction between Rydberg atoms and a periodic external microwave field to engineer XXZ spin Hamiltonians with tunable anisotropies. The atoms a…
Many-body localization in waveguide QED
Nikos Fayard, Loïc Henriet, Ana Asenjo-Garcia +1
At the quantum many-body level, atom-light interfaces generally remain challenging to solve for or understand in a non-perturbative fashion. Here, we consider a waveguide quantum e…