598 citations · 1.4k across the 22 of their papers we have counts for
23 papers
Algebraic structure of Tiger codes
Clément Poirson, Anthony Leverrier, Christophe Vuillot
Tiger codes form a family of multimode bosonic quantum codes that unify several previously known constructions, including cat, paircat, and the two-mode binomial code. In this work…
Biased-noise qubits: a guide to efficient fault-tolerance using the hierarchy of errors
Diego Ruiz, Jérémie Guillaud, Christophe Vuillot +1
Qubits with strongly biased noise, in which phase-flip errors are orders of magnitude more frequent than bit-flips, arise both naturally, as in electron and nuclear spins, and by e…
Quantum non-demolition measurements as a practical primitive for fault-tolerant computation against biased noise
Christophe Vuillot, Diego Ruiz, Jérémie Guillaud +1
Leveraging noise bias, where phase-flip errors dominate over bit-flips, can drastically reduce the hardware overhead of fault-tolerant quantum computation, but existing approaches…
Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
Diego Ruiz, Jérémie Guillaud, Christophe Vuillot +1
Magic state distillation enables universal fault-tolerant quantum computation by implementing non-Clifford gates via the preparation of high-fidelity magic states. However, it come…
High-performance local decoders for defect matching in 1D
Louis Paletta, Anthony Leverrier, Mazyar Mirrahimi +1
Local decoders, also known as cellular-automaton decoders, offer a promising path toward real-time quantum error correction by replacing centralized classical decoding, with inhere…
Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes
Alexandre Guernut, Christophe Vuillot
We propose and simulate the performance of a set of fault-tolerant and constant-depth logical gates on 2D toric codes. This set combines fold-transversal gates, Dehn twists and sin…
Letting the tiger out of its cage: bosonic coding without concatenation
Yijia Xu, Yixu Wang, Christophe Vuillot +1
Continuous-variable cat codes are encodings into a single photonic or phononic mode that offer a promising avenue for hardware-efficient fault-tolerant quantum computation. Protect…
Optimal number of parametrized rotations and Hadamard gates in parametrized Clifford circuits with non-repeated parameters
Vivien Vandaele, Simon Perdrix, Christophe Vuillot
We present an efficient algorithm to reduce the number of non-Clifford gates in quantum circuits and the number of parametrized rotations in parametrized quantum circuits. The meth…
LDPC-cat codes for low-overhead quantum computing in 2D
Diego Ruiz, Jérémie Guillaud, Anthony Leverrier +2
Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing (FTQC) architectures. However,…
Robust sparse IQP sampling in constant depth
Louis Paletta, Anthony Leverrier, Alain Sarlette +2
Between NISQ (noisy intermediate scale quantum) approaches without any proof of robust quantum advantage and fully fault-tolerant quantum computation, we propose a scheme to achiev…
Homological Quantum Rotor Codes: Logical Qubits from Torsion
Christophe Vuillot, Alessandro Ciani, Barbara M. Terhal
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubi…
Optimal Hadamard gate count for Clifford synthesis of Pauli rotations sequences
Vivien Vandaele, Simon Martiel, Simon Perdrix +1
The Clifford gate set is commonly used to perform universal quantum computation. In such setup the gate is typically much more expensive to implement in a fault-tolerant wa…
A graph-state based synthesis framework for Clifford isometries
Timothée Goubault de Brugière, Simon Martiel, Christophe Vuillot
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis t…
Planar Floquet Codes
Christophe Vuillot
A protocol called the "honeycomb code", or generically a "Floquet code", was introduced by Hastings and Haah in \cite{hastings_dynamically_2021}. The honeycomb code is a subsystem…
Quantum XYZ Product Codes
Anthony Leverrier, Simon Apers, Christophe Vuillot
We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classi…
Towards Scalable Bosonic Quantum Error Correction
Barbara M. Terhal, Jonathan Conrad, Christophe Vuillot
We review some of the recent efforts in devising and engineering bosonic qubits for superconducting devices, with emphasis on the Gottesman-Kitaev-Preskill (GKP) qubit. We present…
Quantum Pin Codes
Christophe Vuillot, Nikolas P. Breuckmann
We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure…
Code Deformation and Lattice Surgery Are Gauge Fixing
Christophe Vuillot, Lingling Lao, Ben Criger +3
The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the d…
Quantum Error Correction with the Toric-GKP Code
Christophe Vuillot, Hamed Asasi, Yang Wang +2
We examine the performance of the single-mode GKP code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can o…
Performance and structure of single-mode bosonic codes
Victor V. Albert, Kyungjoo Noh, Kasper Duivenvoorden +9
The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an oscillator has recently been followed by cat- and binomial-code proposals. Numerically optimized…
Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
Nikolas P. Breuckmann, Christophe Vuillot, Earl Campbell +2
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3% for the {4,5}-hyperbolic surfac…
Roads towards fault-tolerant universal quantum computation
Earl T. Campbell, Barbara M. Terhal, Christophe Vuillot
Current experiments are taking the first steps toward noise-resilient logical qubits. Crucially, a quantum computer must not merely store information, but also process it. A fault-…
Sparse spectral approximations for computing polynomial functionals
Erwan Faou, Fabio Nobile, Christophe Vuillot
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are…