11 citations · 18 across the 10 of their papers we have counts for
10 papers
Experimental validation of a compact fault-tolerant architecture for trapped ions
Noah Berthusen, Ali Lavasani, Asmae Benhemou +11
Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require m…
Automated logical Clifford gadgets for heterogeneous architectures via chain maps
Asmae Benhemou, Noah Berthusen
Transversal CNOTs are ubiquitous for entangling logical qubits of identical CSS codes pairwise. For distinct codes, the options are much more limited, and are typically known only…
Computing with many encoded logical qubits beyond break-even
Shival Dasu, Matthew DeCross, Andrew Y. Guo +42
High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementi…
Online Gaussian elimination for quantum LDPC decoding
Sam J. Griffiths, Asmae Benhemou, Dan E. Browne
Decoders for quantum LDPC codes generally rely on solving a parity-check equation with Gaussian elimination, with the generalised union-find decoder performing this repeatedly on g…
Snakes and Ladders: Adapting the surface code to defects
Catherine Leroux, Sophia F. Lin, Przemyslaw Bienias +4
One of the critical challenges solid-state quantum processors face is the presence of fabrication imperfections and two-level systems, which render certain qubits and gates either…
Probing quantum properties of black holes with a Floquet-driven optical lattice simulator
Asmae Benhemou, Georgia Nixon, Aydin Deger +2
In the curved spacetime of a black hole, quantum physics gives rise to distinctive effects such as Hawking radiation and maximally fast scrambling. Here, we present a scheme for an…
Minimising surface-code failures using a color-code decoder
Asmae Benhemou, Kaavya Sahay, Lingling Lao +1
The development of practical, high-performance decoding algorithms reduces the resource cost of fault-tolerant quantum computing. Here we propose a decoder for the surface code tha…
Universality of Z3 parafermions via edge mode interaction and quantum simulation of topological space evolution with Rydberg atoms
Asmae Benhemou, Toonyawat Angkhanawin, Charles S. Adams +2
Parafermions are Zn generalisations of Majorana quasiparticles, with fractional non-Abelian statistics. They can be used to encode topological qudits and perform Clifford operation…
Non-Abelian statistics with mixed-boundary punctures on the toric code
Asmae Benhemou, Jiannis K. Pachos, Dan E. Browne
The toric code is a simple and exactly solvable example of topological order realising Abelian anyons. However, it was shown to support non-local lattice defects, namely twists, wh…
Optimal quantum spatial search with one-dimensional long-range interactions
Dylan Lewis, Asmae Benhemou, Natasha Feinstein +2
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their…