21 citations · 35 across the 15 of their papers we have counts for
15 papers
Qubit Loss Inference with Stabilizer Codes without Leakage Detection Units
Shin Nishio, Takeaki Uno, Fumiyoshi Kobayashi +2
Qubit loss occurs when the physical carrier of a qubit leaves the computational system without directly revealing the event's location. Such errors are a major obstacle to fault-to…
Anticipating Decoder Side-channel Attacks in Fault-tolerant Quantum Computers
Shashvat Shukla, Dan E. Browne, Shin Nishio
As quantum computing emerges as an applied technology, there is a growing need to protect quantum computers against information security attacks. This work identifies a new class o…
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
Aydin Deger, Stergios Koutsioumpas, Mark Webster +3
We introduce a family of quantum circuits that possess standard indicators of classical simulation hardness including high entanglement entropy, magic, and non-Gaussianity, yet adm…
Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree
Nicholas Connolly, Shin Nishio, Dan E. Browne +2
Graph states are a key resource for measurement-based quantum computation and quantum networking, but state-preparation costs limit their practical use. Graph states related by loc…
High-performance syndrome extraction circuits for quantum codes
Armands Strikis, Dan E. Browne, Michael E. Beverland
We present a fast and effective framework for analysing and designing syndrome extraction circuits (SECs). Our approach is based on left--right circuits, a general SEC design that…
Sequences of Bivariate Bicycle Codes from Covering Graphs
Benjamin C. B. Symons, Abhishek Rajput, Dan E. Browne
We show that given an instance of a bivariate bicycle (BB) code, it is possible to generate an infinite sequence of new BB codes using increasingly large covering graphs of the ori…
Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes
Abraham Jacob, Campbell McLauchlan, Dan E. Browne
While quantum low-density parity check (qLDPC) codes are a low-overhead means of quantum information storage, it is valuable for quantum codes to possess fault-tolerant features be…
Unlocking early fault-tolerant quantum computing with mitigated magic dilution
Surabhi Luthra, Alexandra E. Moylett, Dan E. Browne +1
As quantum computing progresses towards the early fault-tolerant regime, quantum error correction will play a crucial role in protecting qubits and enabling logical Clifford operat…
Online Gaussian elimination for quantum LDPC decoding
Sam J. Griffiths, Asmae Benhemou, Dan E. Browne
Decoders for quantum LDPC codes generally rely on solving a parity-check equation with Gaussian elimination, with the generalised union-find decoder performing this repeatedly on g…
Automorphism Ensemble Decoding of Quantum LDPC Codes
Stergios Koutsioumpas, Hasan Sayginel, Mark Webster +1
We introduce AutDEC, a fast and accurate decoder for quantum error-correcting codes with large automorphism groups. Our decoder employs a set of automorphisms of the quantum code a…
Heuristic and Optimal Synthesis of CNOT and Clifford Circuits
Mark Webster, Stergios Koutsioumpas, Dan E Browne
Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates…
Engineering Quantum Error Correction Codes Using Evolutionary Algorithms
Mark Webster, Dan Browne
Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. Because the error models of qua…
Fault-Tolerant Logical Clifford Gates from Code Automorphisms
Hasan Sayginel, Stergios Koutsioumpas, Mark Webster +2
We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer c…
Continuous-time quantum optimisation without the adiabatic principle
Robert J. Banks, Georgios S. Raftis, Dan E. Browne +1
Continuous-time quantum algorithms for combinatorial optimisation problems, such as quantum annealing, have previously been motivated by the adiabatic principle. A number of contin…
Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code
T. R. Scruby, D. E. Browne, P. Webster +1
We build on recent work by B. Brown (Sci. Adv. 6, eaay4929 (2020)) to develop and simulate an explicit recipe for a just-in-time decoding scheme in three 3D surface codes, which ca…