activity
20102025
most citedContextuality supplies the magic for quantum computation

624 citations · 3.8k across the 58 of their papers we have counts for

collaborators
Showing 2019Show all

8 papers · 1 filter

quant-ph2019

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…

quant-ph2019★ 29 cited

Independent State and Measurement Characterization for Quantum Computers

Junan Lin, Joel J. Wallman, Ian Hincks +1

Correctly characterizing state preparation and measurement (SPAM) processes is a necessary step towards building reliable quantum processing units (QPUs). In this work, we discuss…

quant-ph2019★ 211 cited

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…

quant-ph2019★ 122 cited

Efficient estimation of Pauli channels

Steven T. Flammia, Joel J. Wallman

Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fa…

quant-ph2019★ 253 cited

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…

quant-ph2019★ 14 cited

Clifford recompilation for faster classical simulation of quantum circuits

Hammam Qassim, Joel J. Wallman, Joseph Emerson

Simulating quantum circuits classically is an important area of research in quantum information, with applications in computational complexity and validation of quantum devices. On…

quant-ph2019★ 49 cited

Statistical analysis of randomized benchmarking

Robin Harper, Ian Hincks, Chris Ferrie +2

Randomized benchmarking and variants thereof, which we collectively call RB+, are widely used to characterize the performance of quantum computers because they are simple, scalable…

quant-ph2019★ 3 cited

Phenomenological measure of quantum non-Markovianity

Adam Winick, Joel J. Wallman, Joseph Emerson

Non-Markovian effects are ubiquitous in physical quantum systems and remain a significant challenge to achieving high-quality control and reliable quantum computation, but due to t…