Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Simulation of quantum circuits by low-rank stabilizer decompositions
- S. Bravyi, D. Browne, Padraic Calpin, E. Campbell, D. Gosset, M. Howard
- Computer ScienceQuantum
- 1 August 2018
A comprehensive mathematical theory of the stabilizerRank and the related approximate stabilizer rank is developed and a suite of classical simulation algorithms with broader applicability and significantly improved performance over the previous state-of-the-art are presented.
Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing.
This work shows that robustness of magic is a well-behaved magic monotone that operationally quantifies the classical simulation overhead for a Gottesman-Knill-type scheme using ancillary magic states, and forms a resource theory for magic states.
Magic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes
The five-dimensional protocol is, by many measures, the best magic state distillation scheme yet discovered and the efficiency measure know as "yield", where, for a large region of parameters, it outperforms its qubit counterpart by many orders of magnitude.
Random Compiler for Fast Hamiltonian Simulation.
- E. Campbell
- Computer SciencePhysical review letters
- 19 November 2018
A randomized compiler for Hamiltonian simulation where gate probabilities are proportional to the strength of a corresponding term in the Hamiltonian, especially suited to electronic structure Hamiltonians relevant to quantum chemistry.
An efficient quantum compiler that reduces T count
This work implemented several efficient quantum compilers for multi-qubit Clifford + $T$ circuits in C++ and benchmarked them on random circuits, from which it is determined that the TODD compiler yields the lowest number of gates in a circuit on average.
Quantum computation with realistic magic-state factories
It is found that the magic-state factory required for postclassical factoring can be as small as 6.3 million data qubits, ignoring ancilla qu bits, assuming 10^−4 error gates and the availability of long-range interactions.
Bound states for magic state distillation in fault-tolerant quantum computation.
It is shown that, when resources are finitely limited, nondistillable states exist outside the stabilizer octahedron, and such states bound states for magic state distillation are called.
Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost
An in-depth analysis of a unified framework that realizes one round of distillation and multiqubit gate synthesis in a single step, and provides an efficient algorithm for synthesizing controlled unitaries with the same worst-case resource scaling as optimal solutions.
Quantifying magic for multi-qubit operations
Two magic monotones are introduced, called channel robustness and magic capacity, which are well-defined for general n-qubit channels and treat all stabilizer-preserving CPTP maps as free operations.
Qutrit magic state distillation
Magic state distillation (MSD) is a purification protocol that plays an important role in fault-tolerant quantum computation. Repeated iteration of the steps of an MSD protocol generates pure single…