1.2k citations · 3.4k across the 22 of their papers we have counts for
22 papers
Instantaneous Quantum Polynomial-Time Sampling and Verifiable Quantum Advantage: Stabilizer Scheme and Classical Security
Michael J. Bremner, Bin Cheng, Zhengfeng Ji
Sampling problems demonstrating beyond classical computing power with noisy intermediate scale quantum devices have been experimentally realized. In those realizations, however, ou…
Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array
Alexis T. E. Shaw, Michael J. Bremner, Alexandru Paler +2
In this paper, we explore the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds for scalable, fault-tolerant quantum computatio…
Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes
Jason Gavriel, Daniel Herr, Alexis Shaw +3
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realisation of large-scale quantum algorithms that could lead to extremely impactf…
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis
Michael J. Bremner, Zhengfeng Ji, Xingjian Li +2
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computatio…
Quantum Parameterized Complexity
Michael J. Bremner, Zhengfeng Ji, Ryan L. Mann +3
Parameterized complexity theory was developed in the 1990s to enrich the complexity-theoretic analysis of problems that depend on a range of parameters. In this paper we establish…
Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
Ryan L. Mann, Michael J. Bremner
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximatio…