Share This Author
Contextuality supplies the ‘magic’ for quantum computation
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.
Estimating the coherence of noise
It is shown that the coherence of a noise source can be quantified by the unitarity, which relates to the average change in purity averaged over input pure states and provides a lower bound on the optimal achievable gate infidelity under a given noisy process.
Randomized benchmarking with confidence
This paper proves that the estimates produced by randomized benchmarking (both standard and interleaved) for arbitrary Markovian noise sources are remarkably precise by showing that the variance due to sampling random gate sequences is small.
Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities.
We present a method for estimating the probabilities of outcomes of a quantum circuit using Monte Carlo sampling techniques applied to a quasiprobability representation. Our estimate converges to the…
Noise tailoring for scalable quantum computation via randomized compiling
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.
Non-negative subtheories and quasiprobability representations of qubits
Negativity in a quasiprobability representation is typically interpreted as an indication of nonclassical behavior. However, this does not preclude states that are non-negative from exhibiting…
Characterizing large-scale quantum computers via cycle benchmarking
Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the…
Multiqubit randomized benchmarking using few samples
The number of sampled sequences required for a fixed confidence interval is dramatically smaller than could previously be justified and is essentially independent of the number of qubits and scales favorably with the average error rate of the system under investigation.
Hard decoding algorithm for optimizing thresholds under general Markovian noise
This paper presents an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise.
Contextuality Supplies the Magic for Quantum Computation
- M. Howard, J. Wallman, Victor Veitch, J. Emerson
- Computer ScienceIEEE International Symposium on Multiple-Valued…
- 18 May 2015
It is established that quantum contextuality, a generalization of nonlocality identified by Bell and Kochen-Specker almost 50 years ago, is a critical resource for quantum speed-up within the leading model for fault-tolerant quantum computation, known as magic state distillation (MSD).