Metraipolis › archive › dc_cbcc63012952

Quantum t-design — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Quantum_t-design
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T16:38:30.375Z
SHA-256 of the archived text
180bb46bee8a80a07366ba25065f7f8b20413d8b24174d8486799d278fdf2ab1
Stable URL of this page
https://metraipolis.com/documento/dc_cbcc63012952

How to cite

Quantum t-design — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_t-design (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_cbcc63012952 (Metraipolis archive dc_cbcc63012952, sha256 180bb46bee8a80a07366ba25065f7f8b20413d8b24174d8486799d278fdf2ab1)
BibTeX
@misc{dccbcc63012952,
  title = {Quantum t-design — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Quantum_t-design},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_cbcc63012952; sha256 180bb46bee8a80a07366ba25065f7f8b20413d8b24174d8486799d278fdf2ab1},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_t-design. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A quantum t-design is a probability distribution over either pure quantum states or unitary operators which can duplicate properties of the probability distribution over the Haar measure for polynomials of degree t or less. Specifically, the average of any polynomial function of degree t over the design is exactly the same as the average over Haar measure. Here the Haar measure is a uniform probability distribution over all quantum states or over all unitary operators. Quantum t-designs are so called because they are analogous to t-designs in classical statistics, which arose historically in connection with the problem of design of experiments. Two particularly important types of t-designs in quantum mechanics are projective and unitary t-designs. A spherical design is a collection of points on the unit sphere for which polynomials of bounded degree can be averaged over to obtain the same value that integrating over surface measure on the sphere gives. Spherical and projective t-designs derive their names from the works of Delsarte, Goethals, and Seidel in the late 1970s, but these objects played earlier roles in several branches of mathematics, including numerical integration and number theory. Particular examples of these objects have found uses in quantum information theory, quantum cryptography, and other related fields. Unitary t-designs are analogous to spherical designs in that they reproduce the entire unitary group via a finite collection of unitary matrices. The theory of unitary 2-designs was developed in 2006 specifically to achieve a practical means of efficient and scalable randomized benchmarking to assess the errors in quantum computing operations, called gates. Since then unitary t-designs have been found useful in other areas of quantum computing and more broadly in quantum information theory and applied to problems as far reaching as the black hole information paradox. Unitary t-designs are especially relevant to randomization tasks in quantum computing since ideal operations are usually represented by unitary operators.

Tema degli esploratori: fisica e astronomia (deposito sistematico; categoria «Quantum information science»).
Fonte: Wikipedia in inglese, voce «Quantum t-design» — https://en.wikipedia.org/wiki/Quantum_t-design
Wikidata Q7269105 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7269105
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quantum_t-design?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1354312213, consultata il 2026-10-07T16:07:15.968Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2e97cd02a4b58a5c5233402e2585add6854976fdb87f71a352f5ccee1f103ee6