activity
20182024
most citedNon-Abelian Topological Order and Anyons on a Trapped-Ion Processor

175 citations · 425 across the 15 of their papers we have counts for

collaborators

15 papers

quant-ph2024★ 1 cited

Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem

Etienne Granet, Henrik Dreyer

According to the adiabatic theorem of quantum mechanics, a system initially in the ground state of a Hamiltonian remains in the ground state if one slowly changes the Hamiltonian.…

quant-ph2024

A noise-limiting quantum algorithm using mid-circuit measurements for dynamical correlations at infinite temperature

Etienne Granet, Henrik Dreyer

It is generally considered that the signal output by a quantum circuit is attenuated exponentially fast in the number of gates. This letter explores how algorithms using mid-circui…

quant-ph2023★ 15 cited

Continuous Hamiltonian dynamics on digital quantum computers without discretization error

Etienne Granet, Henrik Dreyer

We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero…

quant-ph2023★ 10 cited

Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers

Khaldoon Ghanem, Alexander Schuckert, Henrik Dreyer

Simulating properties of quantum materials is one of the most promising applications of quantum computation, both near- and long-term. While real-time dynamics can be straightforwa…

quant-ph2023★ 175 cited

Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor

Mohsin Iqbal, Nathanan Tantivasadakarn, Ruben Verresen +15

Non-Abelian topological order (TO) is a coveted state of matter with remarkable properties, including quasiparticles that can remember the sequence in which they are exchanged. The…

quant-ph2023★ 17 cited

Experimental demonstration of the advantage of adaptive quantum circuits

Michael Foss-Feig, Arkin Tikku, Tsung-Cheng Lu +16

Adaptive quantum circuits employ unitary gates assisted by mid-circuit measurement, classical computation on the measurement outcome, and the conditional application of future unit…

quant-ph2023★ 81 cited

Topological Order from Measurements and Feed-Forward on a Trapped Ion Quantum Computer

Mohsin Iqbal, Nathanan Tantivasadakarn, Thomas M. Gatterman +13

Quantum systems evolve in time in one of two ways: through the Schrödinger equation or wavefunction collapse. So far, deterministic control of quantum many-body systems in the lab…

quant-ph2023★ 42 cited

Volume-law to area-law entanglement transition in a non-unitary periodic Gaussian circuit

Etienne Granet, Carolyn Zhang, Henrik Dreyer

We consider Gaussian quantum circuits that alternate unitary gates and post-selected weak measurements, with spatial translation symmetry and time periodicity. We show analytically…

quant-ph2022

Preentangling Quantum Algorithms -- the Density Matrix Renormalization Group-assisted Quantum Canonical Transformation

Mohsin Iqbal, David Muñoz Ramo, Henrik Dreyer

We propose the use of parameter-free preentanglers as initial states for quantum algorithms. We apply this idea to the electronic structure problem, combining a quantized version o…

quant-ph2022★ 10 cited

Characterization of variational quantum algorithms using free fermions

Gabriel Matos, Chris N. Self, Zlatko Papić +2

We study variational quantum algorithms from the perspective of free fermions. By deriving the explicit structure of the associated Lie algebras, we show that the Quantum Approxima…

cond-mat.stat-mech2021★ 22 cited

Out-of-equilibrium dynamics of the XY spin chain from form factor expansion

Etienne Granet, Henrik Dreyer, Fabian H. L. Essler

We consider the XY spin chain with arbitrary time-dependent magnetic field and anisotropy. We argue that a certain subclass of Gaussian states, called Coherent Ensemble (CE) follow…

quant-ph2021★ 23 cited

Quantum computing critical exponents

Henrik Dreyer, Mircea Bejan, Etienne Granet

We show that the Variational Quantum-Classical Simulation algorithm admits a finite circuit depth scaling collapse when targeting the critical point of the transverse field Ising c…

cond-mat.str-el2020★ 1 cited

Robustness of critical U(1) spin liquids and emergent symmetries in tensor networks

Henrik Dreyer, Laurens Vanderstraeten, Ji-Yao Chen +2

We study the response of critical Resonating Valence Bond (RVB) spin liquids to doping with longer-range singlets, and more generally of U(1)-symmetric tensor networks to non-symme…

cond-mat.str-el2019★ 22 cited

Detecting subsystem symmetry protected topological order via entanglement entropy

David T. Stephen, Henrik Dreyer, Mohsin Iqbal +1

Subsystem symmetry protected topological (SSPT) order is a type of quantum order that is protected by symmetries acting on lower-dimensional subsystems of the entire system. In thi…

quant-ph2018★ 6 cited

Projected Entangled Pair States with continuous virtual symmetries

Henrik Dreyer, J. Ignacio Cirac, Norbert Schuch

We study Projected Entangled Pair States (PEPS) with continuous virtual symmetries, i.e., symmetries in the virtual degrees of freedom, through an elementary class of models with S…