Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Item TypeItem Type
-
SubjectSubject
-
YearFrom:-To:
-
More FiltersMore FiltersSourceLanguage
Done
Filters
Reset
48
result(s) for
"Leclerc, Lucas"
Sort by:
Continuous symmetry breaking in a two-dimensional Rydberg array
2023
Spontaneous symmetry breaking underlies much of our classification of phases of matter and their associated transitions
1
–
3
. The nature of the underlying symmetry being broken determines many of the qualitative properties of the phase; this is illustrated by the case of discrete versus continuous symmetry breaking. Indeed, in contrast to the discrete case, the breaking of a continuous symmetry leads to the emergence of gapless Goldstone modes controlling, for instance, the thermodynamic stability of the ordered phase
4
,
5
. Here, we realize a two-dimensional dipolar XY model that shows a continuous spin-rotational symmetry using a programmable Rydberg quantum simulator. We demonstrate the adiabatic preparation of correlated low-temperature states of both the XY ferromagnet and the XY antiferromagnet. In the ferromagnetic case, we characterize the presence of a long-range XY order, a feature prohibited in the absence of long-range dipolar interaction. Our exploration of the many-body physics of XY interactions complements recent works using the Rydberg-blockade mechanism to realize Ising-type interactions showing discrete spin rotation symmetry
6
–
9
.
A two-dimensional dipolar XY model with a continuous spin-rotational symmetry is realized using a programmable Rydberg quantum simulator, complementing recent studies using the Rydberg-blockade mechanism to realize Ising-type interactions showing discrete spin rotation symmetry.
Journal Article
Graph algorithms with neutral atom quantum processors
2024
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 reconfigure the geometry of the qubit register, from shot to shot. This unique feature makes possible the native embedding of graph-structured problems at the hardware level, with profound consequences for the resolution of complex optimization and machine learning tasks. By driving qubits, one can generate processed quantum states which retain graph complex properties. These states can then be leveraged to offer direct solutions to problems or as resources in hybrid quantum-classical schemes. In this paper, we review the advancements in quantum algorithms for graph problems running on neutral atom Quantum Processing Units (QPUs), and discuss recently introduced embedding and problem-solving techniques. In addition, we clarify ongoing advancements in hardware, with an emphasis on enhancing the scalability, controllability and computation repetition rate of neutral atom QPUs.
Journal Article
Analog QAOA with Bayesian optimisation on a neutral atom QPU
by
Tignone, Edoardo
,
Vodola, Davide
,
Tibaldi, Simone
in
Algorithms
,
Bayesian analysis
,
Efficiency
2026
This study explores the implementation of the Quantum Approximate Optimisation Algorithm (QAOA) in its analog form using a neutral atom quantum processing unit to solve the Maximum Independent Set problem. Our QAOA protocol leverages the natural encoding of problem Hamiltonians by Rydberg atom interactions, while employing Bayesian Optimisation to navigate the quantum-classical parameter space effectively under the constraints of hardware noise and resource limitations. We evaluate the approach through a combination of numerical simulations and experimental runs on Pasqal’s first commercial quantum processing unit, Orion Alpha, demonstrating effective parameter optimisation and noise mitigation strategies, such as selective bitstring discarding and detection error corrections. Results show that a limited number of measurements still allows for a quick convergence to a solution, making it a viable solution for resource-efficient scenarios.
Journal Article
Analog QAOA with Bayesian Optimisation on a neutral atom QPU
by
Tignone, Edoardo
,
Vodola, Davide
,
Tibaldi, Simone
in
Bayesian analysis
,
Error correction
,
Error detection
2025
This study explores the implementation of the Quantum Approximate Optimisation Algorithm (QAOA) in its analog form using a neutral atom quantum processing unit to solve the Maximum Independent Set problem. The analog QAOA leverages the natural encoding of problem Hamiltonians by Rydberg atom interactions, while employing Bayesian Optimisation to navigate the quantum-classical parameter space effectively under the constraints of hardware noise and resource limitations. We evaluate the approach through a combination of simulations and experimental runs on Pasqal's first commercial quantum processing unit, Orion Alpha, demonstrating effective parameter optimisation and noise mitigation strategies, such as selective bitstring discarding and detection error corrections. Results show that a limited number of measurements still allows for a quick convergence to a solution, making it a viable solution for resource-efficient scenarios.
Enhancing a Many-body Dipolar Rydberg Tweezer Array with Arbitrary Local Controls
2024
We implement and characterize a protocol that enables arbitrary local controls in a dipolar atom array, where the degree of freedom is encoded in a pair of Rydberg states. Our approach relies on a combination of local addressing beams and global microwave fields. Using this method, we directly prepare two different types of three-atom entangled states, including a W-state and a state exhibiting finite chirality. We verify the nature of the underlying entanglement by performing quantum state tomography. Finally, leveraging our ability to measure multi-basis, multi-body observables, we explore the adiabatic preparation of low-energy states in a frustrated geometry consisting of a pair of triangular plaquettes. By using local addressing to tune the symmetry of the initial state, we demonstrate the ability to prepare correlated states distinguished only by correlations of their chirality (a fundamentally six-body observable). Our protocol is generic, allowing for rotations on arbitrary subgroups of atoms within the array at arbitrary times during the experiment; this extends the scope of capabilities for quantum simulations of the dipolar XY model.
Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles
by
Joseph, Mikael
,
Henriet, Loïc
,
Leclerc, Lucas
in
Algorithms
,
Annealing
,
Combinatorial analysis
2025
In the quantum optimization paradigm, variational quantum algorithms face challenges with hardware-specific and instance-dependent parameter tuning, which can lead to computational inefficiencies. The promising potential of parameter transferability across problem instances with similar local structures has been demonstrated in the context of the quantum approximate optimization algorithm. In this paper we build on these advancements by extending the concept to annealing-based protocols, employing Bayesian optimization to design robust quasi adiabatic schedules. Our study reveals that, for maximum independent set problems on graph families with shared geometries, optimal parameters naturally concentrate, enabling efficient transferability between similar instances and from smaller to larger ones. Experimental results on the Orion Alpha platform validate the effectiveness of our approach, scaling to problems with up to \\(100\\) qubits. We apply this method to address a smart-charging optimization problem on a real dataset. These findings highlight a scalable, resource-efficient path for hybrid optimization strategies applicable in real-world scenarios.
Quantum Feature Maps for Graph Machine Learning on a Neutral Atom Quantum Processor
2022
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 harnessed to enhance learning performances on real datasets. Here, we report the use of a neutral atom quantum processor comprising up to \\(32\\) qubits to implement machine learning tasks on graph-structured data. To that end, we introduce a quantum feature map to encode the information about graphs in the parameters of a tunable Hamiltonian acting on an array of qubits. Using this tool, we first show that interactions in the quantum system can be used to distinguish non-isomorphic graphs that are locally equivalent. We then realize a toxicity screening experiment, consisting of a binary classification protocol on a biochemistry dataset comprising \\(286\\) molecules of sizes ranging from \\(2\\) to \\(32\\) nodes, and obtain results which are comparable to those using the best classical kernels. Using techniques to compare the geometry of the feature spaces associated with kernel methods, we then show evidence that the quantum feature map perceives data in an original way, which is hard to replicate using classical kernels.
Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles
by
Joseph, Mikael
,
Henriet, Loïc
,
Leclerc, Lucas
in
Algorithms
,
Annealing
,
Combinatorial analysis
2024
In the quantum optimisation paradigm, variational quantum algorithms face challenges with hardware-specific and instance-dependent parameter tuning, which can lead to computational inefficiencies. However, the promising potential of parameter transferability across problem instances with similar local structures has been demonstrated in the context of the Quantum Approximate Optimisation Algorithm. In this paper, we build on these advancements by extending the concept to annealing-based protocols, employing Bayesian optimisation to design robust quasi-adiabatic schedules. Our study reveals that, for Maximum Independent Set problems on graph families with shared geometries, optimal parameters naturally concentrate, enabling efficient transfer from smaller to larger instances. Experimental results on the Orion Alpha platform validate the effectiveness of our approach, scaling to problems with up to \\(100\\) qubits. We apply this method to address a smart-charging optimisation problem on a real dataset. These findings highlight a scalable, resource-efficient path for hybrid optimisation strategies applicable in real-world scenarios.
Continuous Symmetry Breaking in a Two-dimensional Rydberg Array
by
Yao, Norman Y
,
Chatterjee, Shubhayu
,
Hauschild, Johannes
in
Antiferromagnetism
,
Broken symmetry
,
Existence theorems
2023
Spontaneous symmetry breaking underlies much of our classification of phases of matter and their associated transitions. The nature of the underlying symmetry being broken determines many of the qualitative properties of the phase; this is illustrated by the case of discrete versus continuous symmetry breaking. Indeed, in contrast to the discrete case, the breaking of a continuous symmetry leads to the emergence of gapless Goldstone modes controlling, for instance, the thermodynamic stability of the ordered phase. Here, we realize a two-dimensional dipolar XY model -- which exhibits a continuous spin-rotational symmetry -- utilizing a programmable Rydberg quantum simulator. We demonstrate the adiabatic preparation of correlated low-temperature states of both the XY ferromagnet and the XY antiferromagnet. In the ferromagnetic case, we characterize the presence of long-range XY order, a feature prohibited in the absence of long-range dipolar interaction. Our exploration of the many-body physics of XY interactions complements recent works utilizing the Rydberg-blockade mechanism to realize Ising-type interactions exhibiting discrete spin rotation symmetry.