2 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes
Mohammad Rowshan, Simon Devitt
Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically r…
tūQ: a design and modelling tool for cluster-state algorithms
Greg Bowen, Simon Devitt
This paper is a general introduction to the tūQ toolchain (https://github.com/QSI-BAQS/tuQ) and a discussion of its two main workflows, 'reduce and optimise' and 'draft and compile…
Design and efficiency in graph-state computation
Greg Bowen, Athena Caesura, Simon Devitt +1
The algorithm-specific graph and circuit etching are two strategies for compiling a graph state to implement quantum computation. Benchmark testing exposed limitations to the proto…
The Quantum Internet (Technical Version)
Peter P. Rohde, Zixin Huang, Yingkai Ouyang +14
Following the emergence of quantum computing, the subsequent quantum revolution will be that of interconnecting individual quantum computers at global level. In the same way that c…
Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates
Anthony Ryan O'Rourke, Simon Devitt
Practical quantum computers will require resource-efficient error-correcting codes. The rotated surface code uses approximately half the number of qubits as the unrotated surface c…