3 citations · 3 across the 17 of their papers we have counts for
17 papers
Soft decoding for quantum LDPC codes with experimental validation
Arda Aydin, Edwin Tham, Nicolas Delfosse +1
The decoder is a critical component of a fault-tolerant quantum computer, computing corrections based on parity-check measurements performed throughout the computation. A soft deco…
Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits
Thomas Häner, Felix Tripier, Jacob Young +11
One of the strengths of our recently proposed Walking Cat Architecture for a trapped-ion quantum computer is that it is straightforward to extend and optimize for a specific applic…
Real-time decoder for a MegaQuOp quantum computer using a single CPU
Min Ye, Andrii Maksymov, Nicolas Delfosse
As quantum computers advance toward the regime of MegaQuOp machines executing millions of gates, a decoding system capable of real-time error correction in such a device will be cr…
Fast logical operations in quantum LDPC codes using simple resource states
Mark Webster, Nicolas Delfosse
Quantum LPDC codes provide a substantial reduction in qubit overhead required for fault-tolerant quantum computation compared to surface code, thanks to their high encoding rate. H…
Breakeven demonstration of quantum low-density parity-check codes
Edwin Tham, Michael L. Goldman, Shantanu Debnath +8
High-rate quantum low-density parity-check (qLDPC) codes are a leading candidate for fault-tolerant quantum computing. They feature higher encoding rates than planar alternatives s…
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
Felix Tripier, Woo Chang Chung, Jacob Young +15
We propose a fault-tolerant quantum computer architecture for trapped-ion devices, which we call the walking cat architecture. Our blueprint includes a compiler, a detailed descrip…
Beam search decoder for quantum LDPC codes
Min Ye, Dave Wecker, Nicolas Delfosse
We propose a decoder for quantum low density parity check (LDPC) codes based on a beam search heuristic guided by belief propagation (BP). Our beam search decoder applies to all qu…
Advantage in distributed quantum computing with slow interconnects
Evan E Dobbs, Nicolas Delfosse, Aharon Brodutch
The main bottleneck for distributed quantum computing is the rate at which entanglement is produced between quantum processing units (QPUs). In this work, we prove that multiple QP…
Recursive Clifford noise reduction
Aharon Brodutch, Gregory Baimetov, Edwin Tham +1
Clifford noise reduction (CliNR) is a partial error correction scheme that reduces the logical error rate of Clifford circuits at the cost of a modest qubit and gate overhead. The…
Correction of chain losses in trapped ion quantum computers
Nolan J. Coble, Min Ye, Nicolas Delfosse
Neutral atom quantum computers and to a lesser extent trapped ions may suffer from atom loss. In this work, we investigate the impact of atom loss in long chains of trapped ions. E…
Cyclic Hypergraph Product Code
Arda Aydin, Nicolas Delfosse, Edwin Tham
Hypergraph product (HGP) codes are one of the most popular family of quantum low-density parity-check (LDPC) codes. Circuit-level simulations show that they can achieve the same lo…
Distributed fault-tolerant quantum memories over a 2xL array of qubit modules
Edwin Tham, Min Ye, Ilia Khait +2
We propose an architecture for a quantum memory distributed over a array of modules equipped with a cyclic shift implemented via flying qubits. The logical information…
Optimized Clifford Noise Reduction: Theory, Simulations and Experiments
Edwin Tham, Nicolas Delfosse
We propose several optimizations of the CliNR partial error correction scheme which implements Clifford circuits by consuming a resource state. Errors are corrected by measuring a…
Optimizing hypergraph product codes with random walks, simulated annealing and reinforcement learning
Bruno C. A. Freire, Nicolas Delfosse, Anthony Leverrier
Hypergraph products are quantum low-density parity-check (LDPC) codes constructed from two classical LDPC codes. Although their dimension and distance depend only on the parameters…
Low-cost noise reduction for Clifford circuits
Nicolas Delfosse, Edwin Tham
We propose a Clifford noise reduction (CliNR) scheme that provides a reduction of the logical error rate of Clifford circuit with lower overhead than error correction and without t…
Simulation of noisy Clifford circuits without fault propagation
Nicolas Delfosse, Adam Paetznick
The design and optimization of a large-scale fault-tolerant quantum computer architecture relies extensively on numerical simulations to assess the performance of each component of…
A Construction of Quantum LDPC Codes from Cayley Graphs
Alain Couvreur, Nicolas Delfosse, Gilles Zémor
We study a construction of Quantum LDPC codes proposed by MacKay, Mitchison and Shokrollahi. It is based on the Cayley graph of Fn together with a set of generators regarded as the…