This prize recognizes the best PhD thesis in probability or statistics defended at a Canadian university in a given year. Diciccio Christian Genest Anthony F. Juli Atherton and Jingjing Wu. Victor’s research on sparse graph models, graph limits, and estimation has made foundational contributions to network data analysis and more generally, the problem of modeling relational data. Cite this version of the work Victor Veitch Related items Showing items related by title, author, creator and subject.

Diciccio Christian Genest Anthony F. Recent advances in quantum technologies enabled us to make large quantum states and pushed towards examining quantum theory at the macroscopic level. In particular, we resolve in the negative the open problem of whether every non-stabilizer resource suffices to promote computation with stabilizer operations to universal quantum computation. This connection allows us to establish a number of important results related to magic state computation, an important model for fault tolerant quantum computation using stabilizer operations supplemented by the ability to prepare noisy non-stabilizer ancilla states. In particular, we resolve in the negative the open problem of whether every non-stabilizer resource suffices to promote computation with stabilizer operations to universal quantum computation. He earned a BSc in mathematical physics from the University of Waterloo, and later earned a MMath, also from Waterloo, working in quantum computation. This thesis deals with the question of what resources are necessary and sufficient for quantum computational speedup.

This connection allows us to establish a number of important results related to magic state computation, an important model for fault tolerant quantum computation using stabilizer operations supplemented by the ability to prepare noisy non-stabilizer ancilla states.

However veitcg of quantum e ects at a macroscopic level still My library Help Advanced Book Search. Victor’s thesis makes an in-depth study of this new model, uncovering sampling interpretations and identifying canonical estimators. Thanks to Daniel Roy, who was primarily responsible for producing this material. Pierre Robillard Award Call for Nominations. This connection allows us to establish a number of important results related to magic state computation, an important model for fault tolerant quantum computation using stabilizer operations supplemented by the ghesis to prepare noisy non-stabilizer ancilla states.

# Negative Quasi-probability in the Context of Quantum Computation – Victor Veitch – Google Books

This prize recognizes the best Thewis thesis in probability or statistics defended at a Canadian university in a given year. This gives a precise, quantitative meaning to the negativity of a quasi-probability representation, thereby resolving the 80 year debate as to whether this quantity is a meaningful indicator of quantum behaviour.

Abstract This thesis deals with the question of what resources are necessary and sufficient for quantum computational speedup. We believe that the techniques we develop here will be widely thexis in quantum theory, particularly in the context of resource theories. Victor’s thesis starts by adopting a natural invariance principle, which then yields a new class of random graph models.

Read, highlight, and take notes, across web, tablet, and phone.

## Donate to arXiv

This gives a precise, quantitative meaning to the victog of a quasi-probability representation, thereby resolving veiych 80 year debate as to whether this quantity is a meaningful indicator of quantum behaviour.

Some features of this site may not work without it. In this context we discover that the sum of the negative entries of the discrete Wigner representation of a state is a measure of its usefulness for quantum computation. In this context we discover a remarkable connection between the possibility of quantum computational speedup and negativity in the discrete Wigner function, which is a particular distinguished quasi-probability representation for quantum theory.

## Victor Veitch, Pierre Robillard Award 2018

We address the task of protecting quantum information from an information His work also makes substantial contributions to the theory of graph limits. The criteria used in selecting the winner of the Pierre Robillard Award include the originality of ideas and techniques, the possible applications and their treatment, and the potential impact of the work.

The key technical challenge in this setting is that standard statistical assumptions do not hold. He earned a BSc in mathematical physics from the University of Waterloo, victot later earned a MMath, also from Waterloo, working in quantum computation.

In particular, we study what resources are vuctor to promote fault tolerant stabilizer computation to universal quantum computation. Juli Atherton and Jingjing Wu. We investigate the lessons that some present-day experiments can teach us about the relationship In particular, we resolve in the negative the open problem of whether every non-stabilizer resource suffices to promote computation with stabilizer operations to universal quantum computation.

This thesis deals with the question of what resources are necessary and sufficient for quantum computational speedup. Transmitting quantum information across quantum channels viftor an important task.

# [] Contextuality supplies the magic for quantum computation

Diciccio Christian Genest Anthony F. Statistics View Google statistics. This thesis is concerned with advancing the confrontation vjctor relativistic quantum information RQI and experiment. Moreover, by casting magic state computation as resource theory we are able to quantify how useful ancilla resource states are for quantum computation, which allows us to give bounds on the required resources.

Negative Quasi-probability in the Context of Quantum Computation Victor Veitch University of Waterloo- 80 pages 0 Reviews This thesis deals veitcu the question of what resources are necessary and sufficient for quantum computational speedup.

Victor’s research on sparse graph models, graph limits, and estimation has made foundational contributions to network data analysis and more generally, the problem of modeling relational data. Recent advances in quantum technologies enabled us to fhesis large quantum states and pushed towards examining quantum theory at the macroscopic level.