598 citations · 1.4k across the 22 of their papers we have counts for
3 papers · 2 filters
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…