624 citations · 3.8k across the 58 of their papers we have counts for
58 papers
Benchmarking Quantum Instruments
Darian McLaren, Matthew A. Graydon, Ali Assem Mahmoud +1
Quantum measurements with feed-forward are crucial components of fault-tolerant quantum computers. We show how the error rate of such a measurement can be directly estimated by fit…
Quasi-Probabilistic Readout Correction of Mid-Circuit Measurements for Adaptive Feedback via Measurement Randomized Compiling
Akel Hashim, Arnaud Carignan-Dugas, Larry Chen +6
Quantum measurements are a fundamental component of quantum computing. However, on modern-day quantum computers, measurements can be more error prone than quantum gates, and are su…
Randomized compiling in fault-tolerant quantum computation
Stefanie J. Beale, Joel J. Wallman
Studies of quantum error correction (QEC) typically focus on stochastic Pauli errors because the existence of a threshold error rate below which stochastic Pauli errors can be corr…
Stochastic errors in quantum instruments
Darian McLaren, Matthew A. Graydon, Joel J. Wallman
Fault-tolerant quantum computation requires non-destructive quantum measurements with classical feed-forward. Many experimental groups are actively working towards implementing suc…
Randomized compiling for subsystem measurements
Stefanie J. Beale, Joel J. Wallman
Measurements are a vital part of any quantum computation, whether as a final step to retrieve results, as an intermediate step to inform subsequent operations, or as part of the co…
The Error Reconstruction and Compiled Calibration of Quantum Computing Cycles
Arnaud Carignan-Dugas, Dar Dahlen, Ian Hincks +6
Quantum computers are inhibited by physical errors that occur during computation. For this reason, the development of increasingly sophisticated error characterization and error su…
Concepts and conditions for error suppression through randomized compiling
Adam Winick, Joel J. Wallman, Dar Dahlen +3
Randomized compiling reduces the effects of errors on quantum computers by tailoring arbitrary Markovian errors into stochastic Pauli noise. Here we prove that randomized compiling…
Non-Exponential Behaviour in Logical Randomized Benchmarking
Athena Ceasura, Pavithran Iyer, Joel J. Wallman +1
We construct a gate and time-independent noise model that results in the output of a logical randomized benchmarking protocol oscillating rather than decaying exponentially. To ill…
High-Fidelity Qutrit Entangling Gates for Superconducting Circuits
Noah Goss, Alexis Morvan, Brian Marinelli +9
Ternary quantum information processing in superconducting devices poses a promising alternative to its more popular binary counterpart through larger, more connected computational…
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…
Efficiently improving the performance of noisy quantum computers
Samuele Ferracin, Akel Hashim, Jean-Loup Ville +7
Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We devel…
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…
Leveraging Randomized Compiling for the QITE Algorithm
Jean-Loup Ville, Alexis Morvan, Akel Hashim +13
The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error corr…
Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
Akel Hashim, Ravi K. Naik, Alexis Morvan +11
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy int…
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…
Simulating and mitigating crosstalk
Adam Winick, Joel J. Wallman, Joseph Emerson
We describe an efficient and scalable framework for modeling crosstalk effects on quantum information processors. By applying optimal control techniques, we show how to tuneup arbi…
Efficiently computing logical noise in quantum error correcting codes
Stefanie J. Beale, Joel J. Wallman
Quantum error correction protocols have been developed to offset the high sensitivity to noise inherent in quantum systems. However, much is still unknown about the behaviour of a…
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…
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…
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…
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…
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…
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…
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…