Multiqubit Clifford groups are unitary 3-designs

@article{Zhu2017MultiqubitCG,
  title={Multiqubit Clifford groups are unitary 3-designs},
  author={Huangjun Zhu},
  journal={Physical Review A},
  year={2017},
  volume={96},
  pages={062336}
}
  • Huangjun Zhu
  • Published 9 October 2015
  • Mathematics
  • Physical Review A
Unitary $t$-designs are a ubiquitous tool in many research areas, including randomized benchmarking, quantum process tomography, and scrambling. Despite the intensive efforts of many researchers, little is known about unitary $t$-designs with $t\geq3$ in the literature. We show that the multiqubit Clifford group in any even prime-power dimension is not only a unitary 2-design, but also a 3-design. Moreover, it is a minimal 3-design except for dimension~4. As an immediate consequence, any orbit… 
View PDF on arXiv
94 Citations
Highly Influential Citations
5
Background Citations
55
Methods Citations
12
Results Citations
1

94 Citations

Citation Type

Citation Type

The Clifford group fails gracefully to be a unitary 4-design
A unitary t-design is a set of unitaries that is "evenly distributed" in the sense that the average of any t-th order polynomial over the design equals the average over the entire unitary group. In…
The Clifford group forms a unitary 3-design
  • Z. Webb
  • Mathematics
    Quantum Inf. Comput.
  • 2016
TLDR
It is proved that the Clifford group is a 3-design, showing that it is a better approximation to Haar-random unitaries than previously expected and characterizing how well random Clifford elements approximateHaar- random unitaries.
Complexity Classification of Conjugated Clifford Circuits
TLDR
This work fully classify the computational power of CCCs by showing that essentially any non-Clifford conjugating unitary U can give rise to sampling tasks which cannot be efficiently classically simulated to constant multiplicative error, unless the polynomial hierarchy collapses.
Representations of the multi-qubit Clifford group
The Clifford group is a fundamental structure in quantum information with a wide variety of applications. We discuss the tensor representations of the $q$-qubit Clifford group, which is defined as…
Qubit stabilizer states are complex projective 3-designs
TLDR
The main technical ingredient is a general recursion formula for the so-called frame potential of stabilizer states, which reduces to a counting problem in discrete symplectic vector spaces for which it is found a simple formula.
Quantum homeopathy works: Efficient unitary designs with a system-size independent number of non-Clifford gates
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one…
Approximate unitary 3-designs from transvection Markov chains
Unitary $t$-designs are probabilistic ensembles of unitary matrices whose first $t$ statistical moments match that of the full unitary group endowed with the Haar measure. In prior work, we showed…
Distinguishing quantum states using Clifford orbits
It is a fundamental property of quantum mechanics that information is lost as a result of performing measurements. Indeed, with every quantum measurement one can associate a number -- its POVM norm…
On the explicit constructions of certain unitary t-designs
Unitary $t$-designs are `good' finite subsets of the unitary group $U(d)$ that approximate the whole unitary group $U(d)$ well. Unitary $t$-designs have been applied in randomized benchmarking,…
Efficient quantum pseudorandomness with nearly time-independent hamiltonian dynamics
We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design…
...
...

References

SHOWING 1-10 OF 52 REFERENCES
The Clifford group forms a unitary 3-design
  • Z. Webb
  • Mathematics
    Quantum Inf. Comput.
  • 2016
TLDR
It is proved that the Clifford group is a 3-design, showing that it is a better approximation to Haar-random unitaries than previously expected and characterizing how well random Clifford elements approximateHaar- random unitaries.
Qubit stabilizer states are complex projective 3-designs
TLDR
The main technical ingredient is a general recursion formula for the so-called frame potential of stabilizer states, which reduces to a counting problem in discrete symplectic vector spaces for which it is found a simple formula.
Properties of the extended Clifford group with applications to SIC-POVMs and MUBs
We consider a version of the extended Clifford Group which is defined in terms of a finite Galois field in odd prime power dimension. We show that Neuhauser's result, that with the appropriate choice…
QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY
This is a one-to-one translation of a German-written Ph.D. thesis from 1999. Quantum designs are sets of orthogonal projection matrices in finite(b)-dimensional Hilbert spaces. A fundamental…
Mutually unbiased bases as minimal Clifford covariant 2-designs
Mutually unbiased bases (MUBs) are interesting for various reasons. The most attractive example of (a complete set of) MUBs is the one constructed by Ivanovi\ifmmode \acute{c}\else \'{c}\fi{} as well…
Evenly distributed unitaries: On the structure of unitary designs
We clarify the mathematical structure underlying unitary t-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any tth order polynomial over the design…
Nonmalleable encryption of quantum information
We introduce the notion of nonmalleability of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we…
Chaos and complexity by design
A bstractWe study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the “frame poten-tial,” which is minimized by…
Local random quantum circuits are approximate polynomial-designs: numerical results
We numerically investigate the statement that local random quantum circuits acting on n qubits composed of polynomially many nearest-neighbor two-qubit gates form an approximate unitary…
A Partial Derandomization of PhaseLift Using Spherical Designs
TLDR
This work presents a partial derandomization of PhaseLift that only requires sampling from certain polynomial size vector configurations, called $$t$$t-designs, and proves reconstruction guarantees for a number of measurements that depends on the degree $$ t$$t of the design.
...
...