6 papers
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
Aydin Deger, Stergios Koutsioumpas, Mark Webster +3
We introduce a family of quantum circuits that possess standard indicators of classical simulation hardness including high entanglement entropy, magic, and non-Gaussianity, yet adm…
Variational Learning with Sparse Long-range Entangling Gates
Helene M. Lösl, Aydin Deger, Andrew J. Daley
The performance of variational quantum algorithms depends in general on the structure of the parametrized quantum circuit, but the most common ansätze are typically based on local…
Interaction geometry and ground-state properties of sparse quantum lattice models
Alex Gunning, Sebastian Schmid, Zhengxiao Liu +3
We investigate how interaction geometry shapes the low-energy phases of sparse tunable long-range quantum models. We focus on a class of graphs whose degree grows logarithmically w…
Geometry-driven transitions in sparse long-range spin models with cold atoms
Alex Gunning, Aydin Deger, Sridevi Kuriyattil +1
We explore the influence of geometry in the critical behavior of sparse long-range spin models. We examine a model with interactions that can be continuously tuned to induce distin…
Running Quantum Computers in Discovery Mode
Benedikt Placke, Aydin Deger, G. J. Sreejith +2
Using a 36-qubit quantum processor, we demonstrate that, by operating in conjunction with a classical machine learning agent, quantum computers can discover instances of interestin…
Graph Coloring via Quantum Optimization on a Rydberg-Qudit Atom Array
Toonyawat Angkhanawin, Aydin Deger, Jonathan D. Pritchard +1
Neutral atom arrays have emerged as a versatile candidate for the embedding of hard classical optimization problems. Prior work has focused on mapping problems onto finding the max…