• Publications
  • Influence
Scalable and robust randomized benchmarking of quantum processes.
TLDR
It is proved that the protocol provides an efficient and reliable estimate of the average error-rate for a set operations (gates) under a very general noise model that allows for both time and gate-dependent errors.
Negative quasi-probability as a resource for quantum computation
A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speed-up and, in particular, for fault-tolerant quantum
Characterizing Quantum Gates via Randomized Benchmarking
TLDR
This work describes and expands upon the scalable randomized benchmarking protocol proposed in Phys.
Exact and approximate unitary 2-designs and their application to fidelity estimation
We develop the concept of a unitary $t$-design as a means of expressing operationally useful subsets of the stochastic properties of the uniform (Haar) measure on the unitary group $U({2}^{n})$ on
The resource theory of stabilizer quantum computation
TLDR
A resource theory, analogous to the theory of entanglement, is developed that is relevant for fault-tolerant stabilizer computation and introduces two quantitative measures for the amount of non-stabilizer resource, including the sum of the negative entries of the discrete Wigner representation of a quantum state.
Contextuality supplies the ‘magic’ for quantum computation
TLDR
This work proves a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via ‘magic state’ distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer.
Quantum t-designs: t-wise Independence in the Quantum World
TLDR
It is shown that an approximate 4-design provides a derandomization of the statedistinction problem considered by Sen (quant-ph/0512085), which is relevant to solving certain instances of the hidden subgroup problem.
Scalable noise estimation with random unitary operators
TLDR
While the scalability of the stochastic protocol makes it most relevant in large Hilbert spaces (when quantum process tomography is infeasible), the method should be immediately useful for evaluating the degree of control that is achievable in any prototype quantum processing device.
FAST TRACK COMMUNICATION: Frame representations of quantum mechanics and the necessity of negativity in quasi-probability representations
Several finite-dimensional quasi-probability representations of quantum states have been proposed to study various problems in quantum information theory and quantum foundations. These
Noise tailoring for scalable quantum computation via randomized compiling
TLDR
This work proposes a method for introducing independent random single-qubit gates into the logical circuit in such a way that the effective logical circuit remains unchanged and proves that this randomization tailors the noise into stochastic Pauli errors, which can dramatically reduce error rates while introducing little or no experimental overhead.
...
...