2022
DOI: 10.1038/s41534-022-00551-1
|View full text |Cite
|
Sign up to set email alerts
|

Constraints on magic state protocols from the statistical mechanics of Wigner negativity

Abstract: Magic states are key ingredients in schemes to realize universal fault-tolerant quantum computation. Theories of magic states attempt to quantify this computational element via monotones and determine how these states may be efficiently transformed into useful forms. Here, we develop a statistical mechanical framework based on majorization to describe Wigner negative magic states for qudits of odd prime dimension processed under Clifford circuits. We show that majorization allows us to both quantify disorder i… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 142 publications
(167 reference statements)
0
3
0
Order By: Relevance
“…where [n] is a shorthand notation for {1, 2, 3, • • • , n}, and p ↓ is the vector with the absolute values of the entries of p arranged in non-increasing order. A technical tool with many applications and generalizations in the quantum regime [45][46][47][48][49][50][51][52][53][54][55][56][57][58] on which we rely is the concept of (relative) majorization: Let p, r ∈ Prob(n) and q, s ∈ Prob(m). We say that (p, r) relatively majorizes (q, s), written as (p, r) (q, s), iff there exists a m × n column stochastic matrix E such that Ep = q, Er = s.…”
Section: Notation and Preliminariesmentioning
confidence: 99%
“…where [n] is a shorthand notation for {1, 2, 3, • • • , n}, and p ↓ is the vector with the absolute values of the entries of p arranged in non-increasing order. A technical tool with many applications and generalizations in the quantum regime [45][46][47][48][49][50][51][52][53][54][55][56][57][58] on which we rely is the concept of (relative) majorization: Let p, r ∈ Prob(n) and q, s ∈ Prob(m). We say that (p, r) relatively majorizes (q, s), written as (p, r) (q, s), iff there exists a m × n column stochastic matrix E such that Ep = q, Er = s.…”
Section: Notation and Preliminariesmentioning
confidence: 99%
“…This means that the power of quantum advance requires resources beyond the Clifford group, like the Phase π/8 gate (T gate) or the Toffoli gate and non-Gaussian states for the MCGs 14,15 . The precious resource that makes quantum computers special is colloquially dubbed as 'magic' and a resource theory of magic has been developed in recent years [2][3][4][16][17][18][19][20][21][22][23][24][25][26][27] .…”
Section: Introductionmentioning
confidence: 99%
“…where [n] is a shorthand notation for {1, 2, 3, • • • , n}, and p ↓ is the vector with the absolute values of the entries of p arranged in non-increasing order. A technical tool with many applications and generalization in the quantum regime [38][39][40][41][42][43][44][45][46][47][48][49][50] on which we rely is the concept of (relative) majorization: Let p, r ∈ Prob(n) and q, s ∈ Prob(m). We say that (p, r) relatively majorizes (q, s), written as (p, r) (q, s), iff there exists a m × n column stochastic matrix E such that Ep = q, Er = s.…”
mentioning
confidence: 99%