196 citations · 686 across the 16 of their papers we have counts for
16 papers
Addressing Stopping Failures for Small Set Flip Decoding of Hypergraph Product Codes
Lev Stambler, Anirudh Krishna, Michael E. Beverland
For a quantum error correcting code to be used in practice, it needs to be equipped with an efficient decoding algorithm, which identifies corrections given the observed syndrome o…
Viderman's algorithm for quantum LDPC codes
Anirudh Krishna, Inbal Livni Navon, Mary Wootters
Quantum low-density parity-check (LDPC) codes, a class of quantum error correcting codes, are considered a blueprint for scalable quantum circuits. To use these codes, one needs ef…
Improved rate-distance trade-offs for quantum codes with restricted connectivity
Nouédyn Baspin, Venkatesan Guruswami, Anirudh Krishna +1
For quantum error-correcting codes to be realizable, it is important that the qubits subject to the code constraints exhibit some form of limited connectivity. The works of Bravyi…
Hierarchical memories: Simulating quantum LDPC codes with local gates
Christopher A. Pattison, Anirudh Krishna, John Preskill
Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. However, if physical gates are subject to g…
Quantifying nonlocality: how outperforming local quantum codes is expensive
Nouédyn Baspin, Anirudh Krishna
Quantum low-density parity-check (LDPC) codes are a promising avenue to reduce the cost of constructing scalable quantum circuits. However, it is unclear how to implement these cod…
Connectivity constrains quantum codes
Nouédyn Baspin, Anirudh Krishna
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, a…
Combining hard and soft decoders for hypergraph product codes
Antoine Grospellier, Lucien Grouès, Anirudh Krishna +1
Hypergraph product codes are a class of constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF). This decoder di…
Fault-tolerant gates on hypergraph product codes
Anirudh Krishna, David Poulin
Hypergraph product codes are a class of quantum low density parity check (LDPC) codes discovered by Tillich and Zémor. These codes have a constant encoding rate and were recently s…
Topological wormholes
Anirudh Krishna, David Poulin
Locality plays a fundamental role in quantum computation but also severely restricts our ability to store and process quantum information. We argue that this restriction may be unw…
Bias-preserving gates with stabilized cat qubits
Shruti Puri, Lucas St-Jean, Jonathan A. Gross +9
The code capacity threshold for error correction using qubits which exhibit asymmetric or biased noise channels is known to be much higher than with qubits without such structured…
Towards low overhead magic state distillation
Anirudh Krishna, Jean-Pierre Tillich
Magic state distillation is a resource intensive sub-routine for quantum computation. The ratio of noisy input states to output states with error rate at most scales as $O(\log…
Magic state distillation with punctured polar codes
Anirudh Krishna, Jean-Pierre Tillich
We present a scheme for magic state distillation using punctured polar codes. Our results build on some recent work by Bardet et al. (ISIT, 2016) who discovered that polar codes ca…
Numerical study of hypergraph product codes
Antoine Grospellier, Anirudh Krishna
Hypergraph product codes introduced by Tillich and Zémor are a class of quantum LDPC codes with constant rate and distance scaling with the square-root of the block size. Quantum e…
Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen-Specker theorem: the Peres-Mermin square
Anirudh Krishna, Robert W. Spekkens, Elie Wolfe
When a measurement is compatible with each of two other measurements that are incompatible with one another, these define distinct contexts for the given measurement. The Kochen-Sp…
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…
Diagonal gates in the Clifford hierarchy
Shawn X. Cui, Daniel Gottesman, Anirudh Krishna
The Clifford hierarchy is a set of gates that appears in the theory of fault-tolerant quantum computation, but its precise structure remains elusive. We give a complete characteriz…