49 citations · 58 across the 6 of their papers we have counts for
15 papers
Designing Stochastic Channels
Matthew A. Graydon, Joshua Skanes-Norman, Joel J. Wallman
Stochastic channels are ubiquitous in the field of quantum information because they are simple and easy to analyze. In particular, Pauli channels and depolarizing channels are wide…
Clifford groups are not always 2-designs
Matthew A. Graydon, Joshua Skanes-Norman, Joel J. Wallman
The Clifford group is the quotient of the normalizer of the Weyl-Heisenberg group in dimension by its centre. We prove that when is not prime the Clifford group is not a gr…
Combining and estimation with randomized benchmarking and bounding the diamond distance
Hillary Dawkins, Joel Wallman, Joseph Emerson
The characterization of errors in a quantum system is a fundamental step for two important goals. First, learning about specific sources of error is essential for optimizing experi…
Classical vs. quantum satisfiability in linear constraint systems modulo an integer
Hammam Qassim, Joel. J. Wallman
A system of linear constraints can be unsatisfiable and yet admit a solution in the form of quantum observables whose correlated outcomes satisfy the constraints. Recently, it has…
Efficient learning of quantum noise
Robin Harper, Steven T. Flammia, Joel J. Wallman
Noise is the central obstacle to building large-scale quantum computers. Quantum systems with sufficiently uncorrelated and weak noise could be used to solve computational problems…
Characterizing large-scale quantum computers via cycle benchmarking
Alexander Erhard, Joel James Wallman, Lukas Postler +7
Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizi…