164 citations · 580 across the 12 of their papers we have counts for
12 papers
Meromorphic Quantum Computing
Simon Burton, Hussain Anwar
We consider the kinematic axioms of quantum mechanics projectively. Instead of normalized (pure) states up to global phase, states become one-dimensional subspaces of vector spaces…
Fault-tolerant quantum computation with non-deterministic entangling gates
James M. Auger, Hussain Anwar, Mercedes Gimeno-Segovia +2
Performing entangling gates between physical qubits is necessary for building a large-scale universal quantum computer, but in some physical implementations - for example, those th…
Fault-tolerance thresholds for the surface code with fabrication errors
James M. Auger, Hussain Anwar, Mercedes Gimeno-Segovia +2
The construction of topological error correction codes requires the ability to fabricate a lattice of physical qubits embedded on a manifold with a non-trivial topology such that t…
Smallest disentangling state spaces for general entangled bipartite quantum states
Hussain Anwar, Sania Jevtic, Oliver Rudolph +1
Entangled quantum states can be given a separable decomposition if we relax the restriction that the local operators be quantum states. Motivated by the construction of classical s…
Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
Fern H. E. Watson, Earl T. Campbell, Hussain Anwar +1
Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, d-level quantum systems, as the basic carrier of quantum inform…
Families of pure PEPS with efficiently simulatable local hidden variable models for most measurements
Hussain Anwar, Sania Jevtic, Oliver Rudolph +1
An important problem in quantum information theory is to understand what makes entangled quantum systems non-local or hard to simulate efficiently. In this work we consider situati…
Smallest state spaces for which bipartite entangled quantum states are separable
Hussain Anwar, Sania Jevtic, Oliver Rudolph +1
According to usual definitions, entangled states cannot be given a separable decomposition in terms of products of local density operators. If we relax the requirement that the loc…
A fast fault-tolerant decoder for qubit and qudit surface codes
Fern H. E. Watson, Hussain Anwar, Dan E. Browne
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the err…
Efficient Decoders for Qudit Topological Codes
Hussain Anwar, Benjamin J. Brown, Earl T. Campbell +1
Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are no…
Measurement-based classical computation
Matty J. Hoban, Joel J. Wallman, Hussain Anwar +3
Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multi-qubit quantum state.…
Magic state distillation in all prime dimensions using quantum Reed-Muller codes
Earl T. Campbell, Hussain Anwar, Dan E. Browne
We propose families of protocols for magic state distillation -- important components of fault tolerance schemes --- for systems of odd prime dimension. Our protocols utilize quant…
Qutrit Magic State Distillation
Hussain Anwar, Earl T. Campbell, Dan E. Browne
Magic state distillation (MSD) is a purification protocol that plays a central role in fault tolerant quantum computation. Repeated iteration of the steps of a MSD protocol, genera…