Dan E. Browne
YOU?
Author Swipe
View article: Sequences of Bivariate Bicycle Codes from Covering Graphs
Sequences of Bivariate Bicycle Codes from Covering Graphs Open
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 original code's Tanner graph. When a BB code has a Tanner grap…
View article: Unlocking early fault-tolerant quantum computing with mitigated magic dilution
Unlocking early fault-tolerant quantum computing with mitigated magic dilution Open
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 operations. However, the number of logical qubits will initially …
View article: Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes
Single-Shot Decoding and Fault-tolerant Gates with Trivariate Tricycle Codes Open
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 beyond this resource efficiency. In this work, we introduce t…
View article: Fault-Tolerant Logical Clifford Gates from Code Automorphisms
Fault-Tolerant Logical Clifford Gates from Code Automorphisms Open
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 code to a binary linear code, compute its automorphism group…
View article: Unlocking early fault-tolerant quantum computing with mitigated magic dilution
Unlocking early fault-tolerant quantum computing with mitigated magic dilution Open
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 operations. However, the number of logical qubits will initially …
View article: Ordering Matters: Structure, Accuracy and Gate Cost in Second-Order Suzuki Product Formulas
Ordering Matters: Structure, Accuracy and Gate Cost in Second-Order Suzuki Product Formulas Open
Product formula methods, particularly the second-order Suzuki decomposition, are an important tool for simulating quantum dynamics on quantum computers due to their simplicity and unitarity preservation. While higher-order schemes have bee…
View article: Heuristic and Optimal Synthesis of CNOT and Clifford Circuits
Heuristic and Optimal Synthesis of CNOT and Clifford Circuits Open
Efficiently implementing Clifford circuits is crucial for quantum error correction and quantum algorithms. Linear reversible circuits, equivalent to circuits composed of CNOT gates, have important applications in classical computing. In th…
View article: Continuous-time quantum optimization without the adiabatic principle
Continuous-time quantum optimization without the adiabatic principle Open
Continuous-time quantum algorithms for combinatorial optimization problems, such as quantum annealing, have previously been motivated by the adiabatic principle. A number of continuous-time approaches exploit dynamics, however, and therefo…
View article: Automorphism Ensemble Decoding of Quantum LDPC Codes
Automorphism Ensemble Decoding of Quantum LDPC Codes Open
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 and an ensemble of belief propagation (BP) decoders. Each BP…
View article: Engineering Quantum Error Correction Codes Using Evolutionary Algorithms
Engineering Quantum Error Correction Codes Using Evolutionary Algorithms Open
Quantum error correction and the use of quantum error correction codes are likely to be essential for the realization of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes that are tailored …
View article: Fault-Tolerant Logical Clifford Gates from Code Automorphisms
Fault-Tolerant Logical Clifford Gates from Code Automorphisms Open
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 code to a binary linear code, compute its automorphism group…
View article: Engineering Quantum Error Correction Codes Using Evolutionary Algorithms
Engineering Quantum Error Correction Codes Using Evolutionary Algorithms Open
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 quantum devices vary widely, quantum codes which are tailored …
View article: Continuous-time quantum optimisation without the adiabatic principle
Continuous-time quantum optimisation without the adiabatic principle Open
Continuous-time quantum algorithms for combinatorial optimisation problems, such as quantum annealing, have previously been motivated by the adiabatic principle. A number of continuous-time approaches exploit dynamics, however, and therefo…
View article: Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer Open
We propose a new design heuristic to tackle combinatorial optimisation problems, inspired by Hamiltonians for optimal state-transfer. The result is a rapid approximate optimisation algorithm. We provide numerical evidence of the success of…
View article: Continuous-time quantum walks for MAX-CUT are hot
Continuous-time quantum walks for MAX-CUT are hot Open
By exploiting the link between time-independent Hamiltonians and thermalisation, heuristic predictions on the performance of continuous-time quantum walks for MAX-CUT are made. The resulting predictions depend on the number of triangles in…
View article: Union-find quantum decoding without union-find
Union-find quantum decoding without union-find Open
The union-find decoder is a leading algorithmic approach to the correction of quantum errors on the surface code, achieving code thresholds comparable to minimum-weight perfect matching (MWPM) with amortized computational time scaling near…
View article: Parallel window decoding enables scalable fault tolerant quantum computation
Parallel window decoding enables scalable fault tolerant quantum computation Open
Large-scale quantum computers have the potential to hold computational capabilities beyond conventional computers. However, the physical qubits are prone to noise which must be corrected in order to perform fault-tolerant quantum computati…
View article: A fault-tolerant variational quantum algorithm with limited T-depth
A fault-tolerant variational quantum algorithm with limited T-depth Open
We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant (FT) gate-set, and is hence suitable for implementation on a future error-corrected quantum computer. VQE quantum circuits are typically designed for n…
View article: Continuous-time quantum walks for MAX-CUT are hot
Continuous-time quantum walks for MAX-CUT are hot Open
By exploiting the link between time-independent Hamiltonians and thermalisation, heuristic predictions on the performance of continuous-time quantum walks for MAX-CUT are made. The resulting predictions depend on the number of triangles in…
View article: Union-find quantum decoding without union-find
Union-find quantum decoding without union-find Open
The union-find decoder is a leading algorithmic approach to the correction of quantum errors on the surface code, achieving code thresholds comparable to minimum-weight perfect matching (MWPM) with amortised computational time scaling near…
View article: Mediated Landscapes: Technology and Environment in Recent Canadian Cinema
Mediated Landscapes: Technology and Environment in Recent Canadian Cinema Open
A central defining feature of the contemporary era is an environmental crisis that has been triggered by the relationship of human-developed technologies to the natural world, which is leading us towards conditions of increasing collapse t…
View article: Mediated Landscapes: Technology and Environment in Recent Canadian Cinema
Mediated Landscapes: Technology and Environment in Recent Canadian Cinema Open
A central defining feature of the contemporary era is an environmental crisis that has been triggered by the relationship of human-developed technologies to the natural world, which is leading us towards conditions of increasing collapse t…
View article: Universality of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:msub><mml:mi mathvariant="double-struck">Z</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math> parafermions via edge-mode interaction and quantum simulation of topological space evolution with Rydberg atoms
Universality of parafermions via edge-mode interaction and quantum simulation of topological space evolution with Rydberg atoms Open
Parafermions are Zn generalizations of Majorana quasiparticles, with fractional non-Abelian statistics. They can be used to encode topological qudits and perform Clifford operations by their braiding. Here we investigate the generation of …
View article: A fault-tolerant variational quantum algorithm with limited T-depth
A fault-tolerant variational quantum algorithm with limited T-depth Open
We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant gate-set, and is hence suitable for implementation on a future error-corrected quantum computer. VQE quantum circuits are typically designed for near-t…
View article: Extending Matchgate Simulation Methods to Universal Quantum Circuits
Extending Matchgate Simulation Methods to Universal Quantum Circuits Open
Matchgates are a family of parity-preserving two-qubit gates, nearest-neighbour circuits of which are known to be classically simulable in polynomial time. In this work, we present a simulation method to classically simulate an $\boldsymbo…
View article: Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer Open
We propose a new design heuristic to tackle combinatorial optimisation problems, inspired by Hamiltonians for optimal state-transfer. The result is a rapid approximate optimisation algorithm. We provide numerical evidence of the success of…
View article: Quantifying the dust in SN 2012aw and iPTF14hls with ORBYTS
Quantifying the dust in SN 2012aw and iPTF14hls with ORBYTS Open
Core-collapse supernovae (CCSNe) are capable of producing large quantities of dust, with strong evidence that ejecta dust masses can grow significantly over extended periods of time. Red–blue asymmetries in the broad emission lines of CCSN…
View article: Non-Pauli errors in the three-dimensional surface code
Non-Pauli errors in the three-dimensional surface code Open
A powerful feature of stabiliser error correcting codes is the fact that stabiliser measurement projects arbitrary errors to Pauli errors, greatly simplifying the physical error correction process as well as classical simulations of code p…
View article: Parallel window decoding enables scalable fault tolerant quantum computation
Parallel window decoding enables scalable fault tolerant quantum computation Open
Dataset containing raw data presented in the publication "Parallel window decoding enables scalable fault tolerant quantum computation" as well as the stim circuits used to sample circuit-level noise.
View article: Parallel window decoding enables scalable fault tolerant quantum computation
Parallel window decoding enables scalable fault tolerant quantum computation Open
Large-scale quantum computers have the potential to hold computational capabilities beyond conventional computers for certain problems. However, the physical qubits within a quantum computer are prone to noise and decoherence, which must b…