246 citations · 794 across the 12 of their papers we have counts for
13 papers
Hardware-Efficient Fault Tolerant Quantum Computing with Bosonic Grid States in Superconducting Circuits
Marc-Antoine Lemonde, Dany Lachance-Quirion, Guillaume Duclos-Cianci +5
Quantum computing holds the promise of solving classically intractable problems. Enabling this requires scalable and hardware-efficient quantum processors with vanishing error rate…
Finite-rate sparse quantum codes aplenty
Maxime Tremblay, Guillaume Duclos-Cianci, Stefanos Kourtis
We introduce a methodology for generating random multi-qubit stabilizer codes based on solving a constraint satisfaction problem (CSP) on random bipartite graphs. This framework al…
Resource estimate for quantum many-body ground-state preparation on a quantum computer
Jessica Lemieux, Guillaume Duclos-Cianci, David Sénéchal +1
We estimate the resources required to prepare the ground state of a quantum many-body system on a quantum computer of intermediate size. This estimate is made possible using a comb…
Foliated Quantum Codes
A. Bolt, G. Duclos-Cianci, D. Poulin +1
We show how to construct a large class of quantum error correcting codes, known as CSS codes, from highly entangled cluster states. This becomes a primitive in a protocol that foli…
Reducing the quantum computing overhead with complex gate distillation
Guillaume Duclos-Cianci, David Poulin
In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant oper…
Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
Jonas T. Anderson, Guillaume Duclos-Cianci, David Poulin
Steane's 7-qubit quantum error-correcting code admits a set of fault-tolerant gates that generate the Clifford group, which in itself is not universal for quantum computation. The…
Fault-Tolerant Renormalization Group Decoder for Abelian Topological Codes
Guillaume Duclos-Cianci, David Poulin
We present a three-dimensional generalization of a renormalization group decoding algorithm for topological codes with Abelian anyonic excitations that we previously introduced for…
Kitaev's Z_d-Codes Threshold Estimates
Guillaume Duclos-Cianci, David Poulin
We study the quantum error correction threshold of Kitaev's toric code over the group Z_d subject to a generalized bit-flip noise. This problem requires novel decoding techniques,…
A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
Guillaume Duclos-Cianci, Krysta M. Svore
An important task required to build a scalable, fault-tolerant quantum computer is to efficiently represent an arbitrary single-qubit rotation by fault-tolerant quantum operations.…
Subsystem surface codes with three-qubit check operators
Sergey Bravyi, Guillaume Duclos-Cianci, David Poulin +1
We propose a simplified version of the Kitaev's surface code in which error correction requires only three-qubit parity measurements for Pauli operators XXX and ZZZ. The new code b…
Universal topological phase of 2D stabilizer codes
H. Bombin, Guillaume Duclos-Cianci, David Poulin
Two topological phases are equivalent if they are connected by a local unitary transformation. In this sense, classifying topological phases amounts to classifying long-range entan…
A renormalization group decoding algorithm for topological quantum codes
Guillaume Duclos-Cianci, David Poulin
Topological quantum error-correcting codes are defined by geometrically local checks on a two-dimensional lattice of quantum bits (qubits), making them particularly well suited for…
Fast Decoders for Topological Quantum Codes
Guillaume Duclos-Cianci, David Poulin
We present a family of algorithms, combining real-space renormalization methods and belief propagation, to estimate the free energy of a topologically ordered system in the presenc…