The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Open accessAbstract
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. First, we show 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. Our framework subsequently finds immediate application in the task of synthesizing non-Clifford gates using magic states. When magic states are interspersed with Clifford gates, Pauli measurements, and stabilizer ancillas-the most general synthesis scenario-then the class of synthesizable unitaries is hard to characterize. Our techniques can place nontrivial lower bounds on the number of magic states required for implementing a given target unitary. Guided by these results, we have found new and optimal examples of such synthesis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Contextuality supplies the ‘magic’ for quantum computation
Howard, M., Wallman, J., Veitch, V., & Emerson, J. (2014) · Nature · doi:10.1038/nature13460 · Cited by 616
Self-citationVidal, G., & Tarrach, R. (1999) · Physical Review A · doi:10.1103/physreva.59.141 · Cited by 599
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Self-citationRobustness of Coherence: An Operational and Observable Measure of Quantum Coherence
Napoli, C., Bromley, T. R., Cianciaruso, M., Piani, M., Johnston, N., & Adesso, G. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.150502 · Cited by 581
The resource theory of stabilizer quantum computation
Veitch, V., Hamed Mousavian, S. A., Gottesman, D., & Emerson, J. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/1/013009 · Cited by 501
Positive Wigner Functions Render Classical Simulation of Quantum Computation Efficient
Mari, A., & Eisert, J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.230503 · Cited by 451
Recent Advances in Learning and Control
(2008) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8 · Cited by 441
Negative quasi-probability as a resource for quantum computation
Veitch, V., Ferrie, C., Gross, D., & Emerson, J. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/113011 · Cited by 377
Reversible Framework for Quantum Resource Theories
Brandão, F. G. S. L., & Gour, G. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.070503 · Cited by 357
Methodology for quantum logic gate construction
Zhou, X., Leung, D. W., & Chuang, I. L. (2000) · Physical Review A · doi:10.1103/physreva.62.052316 · Cited by 355
Hudson’s theorem for finite-dimensional quantum systems
Gross, D. (2006) · Journal of Mathematical Physics · doi:10.1063/1.2393152 · Cited by 336
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates
Bravyi, S., & Gosset, D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.250501 · Cited by 320
A mathematical theory of resources
Coecke, B., Fritz, T., & Spekkens, R. W. (2016) · Information and Computation · doi:10.1016/j.ic.2016.02.008 · Cited by 301
Trading Classical and Quantum Computational Resources
Bravyi, S., Smith, G., & Smolin, J. A. (2016) · Physical Review X · doi:10.1103/physrevx.6.021043 · Cited by 299
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
Amy, M., Maslov, D., & Mosca, M. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2341953 · Cited by 274
(QUANTUMNESS IN THE CONTEXT OF) RESOURCE THEORIES
HORODECKI, M., & OPPENHEIM, J. (2013) · International Journal of Modern Physics B · doi:10.1142/s0217979213450197 · Cited by 271
Quantum circuits ofT-depth one
Selinger, P. (2013) · Physical Review A · doi:10.1103/physreva.87.042302 · Cited by 225
Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities
Pashayan, H., Wallman, J. J., & Bartlett, S. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.070501 · Cited by 210
Low-overhead constructions for the fault-tolerant Toffoli gate
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.022328 · Cited by 204
Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries
Paetznick, A., & Svore, K. M. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-2 · Cited by 194
Wigner Function Negativity and Contextuality in Quantum Computation on Rebits
Delfosse, N., Guerin, P. A., Bian, J., & Raussendorf, R. (2015) · Physical Review X · doi:10.1103/physrevx.5.021003 · Cited by 189
Robustness of quantum gates in the presence of noise
Harrow, A. W., & Nielsen, M. A. (2003) · Physical Review A · doi:10.1103/physreva.68.012308 · Cited by 164
An algorithm for the T-countAn algorithm for the T-count
Gosset, D., Kliuchnikov, V., Mosca, M., & Russo, V. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-1 · Cited by 140
Universal Quantum Computation with Little Entanglement
den Nest, M. V. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.060504 · Cited by 127
Grudka, A., Horodecki, K., Horodecki, M., Horodecki, P., Horodecki, R., Joshi, P. S., Kłobus, W., & Wójcik, A. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.120401 · Cited by 111
On the geometry of stabilizer states
García, H. J., Markov, I. L., & Cross, A. W. (2014) · Quantum Information and Computation · doi:10.26421/qic14.7-8-9 · Cited by 102
64 Lines from a Quaternionic Polytope
Hoggar, S. G. (1998) · Geometriae Dedicata · doi:10.1023/a:1005009727232 · Cited by 99
Quantum universality by state distillation
Reichardt, B. W. (2009) · Quantum Information and Computation · doi:10.26421/qic9.11-12-7 · Cited by 91
Catalysis and activation of magic states in fault-tolerant architectures
Campbell, E. T. (2011) · Physical Review A · doi:10.1103/physreva.83.032317 · Cited by 83
Self-citationQuantum arithmetic and numerical analysis using Repeat-Until-Success circuits
Wiebe, N., & Roetteler, M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2-9 · Cited by 79
Efficient decomposition of single-qubit gates into V basis circuits
Bocharov, A., Gurevich, Y. G., & Svore, K. M. (2013) · Physical Review A · doi:10.1103/physreva.88.012313 · Cited by 77
Quantum interference as a resource for quantum speedup
Stahlke, D. (2014) · Physical Review A · doi:10.1103/physreva.90.022302 · Cited by 57
Distillation of nonstabilizer states for universal quantum computation
Duclos-Cianci, G., & Svore, K. M. (2013) · Physical Review A · doi:10.1103/physreva.88.042325 · Cited by 52
Classical simulability, entanglement breaking, and quantum computation thresholds
Virmani, S., Huelga, S. F., & Plenio, M. B. (2005) · Physical Review A · doi:10.1103/physreva.71.042328 · Cited by 51
Noise thresholds for higher-dimensional systems using the discrete Wigner function
van Dam, W., & Howard, M. (2011) · Physical Review A · doi:10.1103/physreva.83.032310 · Cited by 44
Self-citationAn efficient magic state approach to small angle rotations
Campbell, E. T., & O’Gorman, J. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015007 · Cited by 40
Self-citationGosset, D., Kliuchnikov, V., Mosca, M., & Russo, V. (2013) · arXiv · doi:10.48550/arxiv.1308.4134 · Cited by 32
Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
Plenio, M. B., & Virmani, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/3/033012 · Cited by 17
Upper bounds on fault tolerance thresholds of noisy Clifford-based quantum computers
Plenio, M. B., & Virmani, S. (2010) · OPen Access Repositorium der Universität Ulm (OPARU) (Ulm University) · doi:10.18725/oparu-46600 · Cited by 15
States that are far from being stabilizer states
Andersson, D., Bengtsson, I., Blanchfield, K., & Dang, H. B. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/34/345301 · Cited by 11
Cited by
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
Practical Quantum Error Mitigation for Near-Future Applications
Endo, S., Benjamin, S. C., & Li, Y. (2018) · Physical Review X · doi:10.1103/physrevx.8.031027 · Cited by 562
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
Self-citationHalving the cost of quantum addition
Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279
“In [14] it is proven that a Toffoli gate requires at least 4 T gates, though the specific nature of the proof does not eliminate the possibility that n Toffolis could be implemented with fewer than 4n T gates for some large n.”
BackgroundLeone, L., Oliviero, S. F. E., & Hamma, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.050402 · Cited by 276
Metadata
- Authors
- Howard, M., & Campbell, E.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2017-03-03
- Volume
- 118
- Issue
- 9
- Pages
- 090501-090501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2524307097
- Cited by
- 387
- References
- 45
- FWCI
- 10.82
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.