Evenly distributed unitaries: On the structure of unitary designs
Open accessThe DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Abstract
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 equals the average over the entire unitary group. We present a simple necessary and sufficient criterion for deciding if a set of matrices constitutes a design. Lower bounds for the number of elements of 2-designs are derived. We show how to turn mutually unbiased bases into approximate 2-designs whose cardinality is optimal in leading order. Designs of higher order are discussed and an example of a unitary 5-design is presented. We comment on the relation between unitary and spherical designs and outline methods for finding designs numerically or by searching character tables of finite groups. Further, we sketch connections to problems in linear optics and questions regarding typical entanglement.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Clearly the CPT state and the | Z 〉 state with the same three-tangle are completely different objects.”
From Three-Qubit Entangled Embeddings of CPT and Dirac Groups within E 8 Weyl Group (2010) · cites this paper as [11]
Experimental — accuracy not yet measured
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
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Huppert, B. (1967) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-64981-3 · Cited by 5,171
Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
Werner, R. F. (1989) · Physical Review A · doi:10.1103/physreva.40.4277 · Cited by 4,062
Lidl, R., & Niederreiter, H. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511525926 · Cited by 3,346
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
Lide, R., & Niederreiter, H. (1996) · Cited by 2,213
Character theory of finite groups
(1999) · Choice Reviews Online · doi:10.5860/choice.36-6326a · Cited by 2,187
Average entropy of a subsystem
Page, D. N. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.1291 · Cited by 1,578
Average Entropy of a Subsystem
Page, D. N. (1993) · arXiv · doi:10.48550/arxiv.gr-qc/9305007 · Cited by 1,578
Character Theory of Finite Groups
(1976) · Pure and Applied Mathematics · doi:10.1016/s0079-8169(08)x6037-4 · Cited by 1,429
Research works printed but not linked: 16
- G. Zauner , Ph.D. thesis, University of Vienna, 1999;
- S. Iblisdir and J. Roland, e-print quant-ph/0410237. · arXiv
- 1989, Ann. Phys. (N.Y.), 16, 391
- C. Dankert M.Sc. thesis, University of Waterloo, 2005; also available at e-print quant-ph/0512217. · arXiv
- C. Dankert, R. Cleve, J. Emerson, and E. Livine, e-print quant-ph/0606161. · arXiv
- 2003, Quantum Inf. Comput., 3, 377
- G. Tóth and J. J. Garcia-Ripoll, e-print quant-ph/0609052. · arXiv
- A. Serafini , O. C. O.Dahlsten , and M. B.Plenio , e-print quant-ph/0610090; · arXiv
- A. Serafini, O. C. O. Dahlsten, D. Gross, and M. B. Plenio, e-print quant-ph/0701051. · arXiv
- D. Gottesman, e-print quant-ph/9807006. · arXiv
- 2004, Manual for the GAP Character Table Library Version 1.1
- D. Fattal , T. S.Cubitt , Y.Yamamoto , S.Bravyi , and I. L.Chuang , e-print quant-ph/0406168; · arXiv
- D. Gross , thesis, University of Potsdam, 2005;
- 1967, Endliche Gruppen
- O. Dahlsten and M.B. Plenio, Quant. Inf. Comp. 6, 527 (2006).
- 2006, Stat. Probab. Lett., 6, 527
Cited by
Items 301–400 of 496
Certifying Entanglement Dimensionality by k -Reduction Moments
Yi, C., Li, X., & Zhu, H. (2025) · PRX Quantum · doi:10.1103/cc1n-gmj1 · Cited by 8
“Unfortunately, 4-designs cannot be realized by discrete groups except for one special case, and most 4-designs known in the literature are not amenable to experimental realization [25–27].”
Effective Field Theory of Random Quantum Circuits
Liao, Y., & Galitski, V. M. (2022) · Entropy · doi:10.3390/e24060823 · Cited by 8
Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories
Danageozian, A. (2023) · Quantum · doi:10.22331/q-2023-12-04-1195 · Cited by 8
Structure of the sets of mutually unbiased bases with cyclic symmetry
Seyfarth, U., Sánchez-Soto, L. L., & Leuchs, G. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/45/455303 · Cited by 8
Boche, H., Janßen, G., & Saeedinaeeni, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2358-7 · Cited by 8
Uncertainty relations for multiple measurements with applicationsPreprint
Fawzi, O. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1208.5918 · Cited by 8
“However, observe that the number of unitaries of a 2-design is at least t ≥ d4A−2d2A+2 [Gross et al., 2007].”
BackgroundBenchmarking quantum simulators using quantum chaos
Mark, D. K., Choi, J., Shaw, A. L., Endres, M., & Choi, S. (2022) · doi:10.26226/m.6275705f66d5dcf63a31175b · Cited by 8
Unitary Designs from Two Chaotic Hamiltonians and a Random Pauli OperationPreprint
Sun, N., & Zhang, P. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.10122 · Cited by 8
From Pauli Strings to Quantum Dynamics: A Unified CharacterizationPreprint
Gargiulo, R., Herringer, P., & Zeier, R. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.09773 · Cited by 8
Adaptively Secure Unitary Designs with Constant Non-Clifford Cost
Bittel, L., & Leone, L. (2026) · Physical Review Letters · doi:10.1103/9hcw-7fl6 · Cited by 7
Stabilizer Codes Over Fields of Even Order
Ball, S., Moreno, E., & Simoens, R. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3454480 · Cited by 7
“However, one can circumvent this using a so-called polarisation of the phase space, see [14] and [15].”
Expressibility, entangling power, and quantum average causal effect for causally indefinite circuits
Azado, P. C., Correr, G. I., Drinko, A., Medina, I., Canabarro, A., & Soares-Pinto, D. O. (2025) · Physical Review A · doi:10.1103/physreva.111.042620 · Cited by 7
Classification of the subgroups of the two-qubit Clifford group
Kubischta, E., & Teixeira, I. (2025) · Journal of Mathematical Physics · doi:10.1063/5.0258273 · Cited by 7
“The Clifford group for any number of Galois qudits is always a unitary 2-design [16] so C 1 ( F 4 ), and the group C (1920 σ ) Z [ ζ 8 ] containing it, are both unitary 2-designs.”
Quantum Polarization of Qudit Channels
Goswami, A., Mhalla, M., & Savin, V. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517845 · Cited by 7
“From [21, 22], we know that a set of unitaries in dimension δ can only form a unitary 2-design if it has at least δ 4 ´ 2 δ 2 ` 2 elements.”
Secure Quantum Communication With the Preservation of Optimal Measurements
Ko, H., Kechrimparis, S., Ko, Y., Kim, K., Choi, B., Kropf, C. M., Youn, C. J., & Bae, J. (2025) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2025.3568037 · Cited by 6
“For qubit channels, the minimal number of unitaries that realize a unitary 2-design is 12 [20].”
Cho, K., & Bang, J. (2026) · Physical Review A · doi:10.1103/fbyt-kdjk · Cited by 6
Probabilistic channel distillation via indefinite causal order
Kechrimparis, S., Moran, J., & Kwon, H. (2025) · Physical Review Research · doi:10.1103/mvrg-yj3l · Cited by 6
Duality of averaging of quantum states over arbitrary symmetry groups revealing Schur–Weyl duality
Markiewicz, M., & Przewocki, J. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acf4d5 · Cited by 6
Error mitigated metasurface-based randomized measurement schemes
Ren, H., Zhang, Y., Zheng, Z., Ying, C., Xu, L., Rahmani, M., & Whaley, K. B. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033310 · Cited by 6
“A simple criterion for testing whether a set of states forms a quantum 2-design is given by the following equation [13] k The Haar integral in Eq.”
BackgroundTwirling channels have minimal mixed-unitary rank
Girard, M., & Levick, J. (2020) · Linear Algebra and its Applications · doi:10.1016/j.laa.2020.12.027 · Cited by 6
“y rank of Ξ is, in general, distinctly different from the size of the smallest unitary t-design. Indeed,for the case when t =2, it is known that the size of any unitary 2-designmustbeatleastn4 −2n2 +2[GAE07]. Meanwhile,themixed-unitaryrankofthechannel in (5) will be shown in this paper to be equal to (n4 +n2)/2. 2. Pr…”
BackgroundClassical codes in quantum state space
Howard, M. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/49/495303 · Cited by 6
“, stabilizer states) can be constructed as [15, 16]”
BackgroundContinuous Measurement Quantum State Tomography of Atomic EnsemblesPreprint
Riofrío, C. A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.5627 · Cited by 6
“unitaries drawn from t-designs or approximate t-designs [67, 68, 69, 70], random quantum circuits [71, 72], as well as unitary evolutions that possess globally chaotic dynamics in the classical limit [60, 73, 74].”
BackgroundSpectra of noisy parameterized quantum circuits: Single-Ring universalityPreprint
Wold, K., Ribeiro, P., & Denisov, S. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2405.11625 · Cited by 6
“To address this challenge, the concept of t -design [8] was adapted [9] to devise shallow sampling circuits, thereby reducing the scaling to polynomial [10, 11].”
Noncommutative Bohnenblust--Hille Inequality for qudit systemsPreprint
Slote, J., Vol'berg, A. L., & Zhang, H. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2406.08509 · Cited by 6
Exact Hilbert-space ergodicity from continuous monitoringPreprint
Wu, Y., Tong, Y., Mao, L., & Zhang, P. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.29042 · Cited by 6
Czartowski, J., & Życzkowski, K. (2025) · Physical Review A · doi:10.1103/physreva.111.032433 · Cited by 5
Real randomized measurements for analyzing properties of quantum states
Liang, J., Imai, S., Liu, S., Fei, S.-M., Gühne, O., & He, Q. (2025) · Physical Review A · doi:10.1103/3nt1-jh38 · Cited by 5
“To check whether the sample matrices are indeed Haar random, one can apply the frame potential [83– 85] for orthogonal matrices [47].”
Quantum ramp secret sharing from Haar scrambling
Adhikari, K. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae8134 · Cited by 5
“This implies that the state one obtains from t -design circuits [44] is information theoretically indistinguishable from a Haar scrambling circuit up to t moments [45].”
Kerdock Codes Determine Unitary 2-Designs
Can, T., Rengaswamy, N., Calderbank, R., & Pfister, H. D. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849504 · Cited by 5
Optimal estimation of three parallel spins with genuine and restricted collective measurements
Yi, C., Zhou, K., Hou, Z., Xiang, G., & Zhu, H. (2025) · Physical Review A · doi:10.1103/physreva.111.062409 · Cited by 5
“Given a positive integer t , recall that a set of uni-taries U = { U j } j on H is a (unitary) t -design [50, 51] if the following equation holds for all O ∈ L (cid:0) H ⊗ t .”
On construction of finite averaging sets for SL(2,C) via its Cartan decomposition
Markiewicz, M., & Przewocki, J. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/abfa44 · Cited by 5
Chasing shadows with Gottesman-Kitaev-Preskill codes
Conrad, J., Eisert, J., & Flammia, S. T. (2026) · Quantum · doi:10.22331/q-2026-01-19-1973 · Cited by 5
“In fact, the group stated above has the minimal cardinality of ( d 2 − 1) d 2 shown to yield a Clifford 2-design [34, 35], which, in our construction, comes from the fact that ⟨ ˆ H ˆ S † ⟩ is the minimal Pauli transitive subgroup.”
InfluentialSelf-citationOn character table of Clifford groups
Lee, C.-Y., Yu, W.-H., Peng, Y.-N., & Lai, C.-J. (2025) · Journal of Mathematical Physics · doi:10.1063/5.0204167 · Cited by 5
Quantum codes and irreducible products of characters
Kubischta, E., & Teixeira, I. (2025) · Designs Codes and Cryptography · doi:10.1007/s10623-025-01599-8 · Cited by 5
Negative Quasi-Probability in the Context of Quantum Computation
Veitch, V. (2013) · UWSpace (University of Waterloo) · Cited by 5
Schuknecht, C. (2021) · uO Research (University of Ottawa) · doi:10.20381/ruor-26979 · Cited by 5
Strong unitary designs in optimal depth and spacePreprint
Parella-Dilmé, T., Barberà-Rodríguez, J., Oliviero, S. F. E., & Mele, A. A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.13491 · Cited by 5
Generalized group designs: constructing novel unitary 2-, 3- and 4-designs
Kaposi, Á., Kolarovszki, Z., Solymos, A., & Zimborás, Z. (2026) · Quantum · doi:10.22331/q-2026-02-23-2008 · Cited by 4
“1) is presented based on representation theory (see also, Appendix of [15]).”
Operator space fragmentation in perturbed Floquet-Clifford circuits
Kovács, M. D., Turner, C. J., Masanes, L., & Pal, A. (2026) · Quantum · doi:10.22331/q-2026-05-18-2107 · Cited by 4
“On the other hand, random brick-work circuits consisting of two-qubit gates are rigorously established to converge to a many-qubit Haar-ensemble, a provably ergodic case for unitary dynamics [23, 24, 25, 26, 27, 28].”
Learning complexity gradually in quantum machine learning models
Recio-Armengol, E., Schreiber, F. J., Eisert, J., & Bravo-Prieto, C. (2026) · Physical Review Research · doi:10.1103/wnlr-q9xd · Cited by 4
“Assuming that the quantum neural network approximates a unitary 2-design [61] over the unitary group generated by the DLA g , for the training state ρ , the variation of the loss is then given by where P g denotes the g -purity, defined for Hermitian operators as Here, { B j } dim( g ) j =1 is a…”
Self-citationConstructing Generalized Unitary Group Designs
Kaposi, Á., Kolarovszki, Z., Solymos, A., Kozsik, T., & Zimborás, Z. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-36030-5_19 · Cited by 4
“(3): A particular set of exact t -designs (for low t ) can be constructed using finite groups [8].”
Detecting high-dimensional entanglement by randomized product projections
Liang, J., Liu, S., Fei, S.-M., & He, Q. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae3b6e · Cited by 4
Distribution of the entanglement entropies of nonergodic quantum states
Shekhar, D., & Shukla, P. (2025) · Physical review. E · doi:10.1103/n16c-45rh · Cited by 4
Edge of entanglement in nonergodic states: A complexity parameter formulation
Shekhar, D., & Shukla, P. (2025) · Physical review. E · doi:10.1103/txkh-wftd · Cited by 4
Quantum Routing and Entanglement Dynamics Through Bottlenecks
Devulapalli, D., Yin, C., Guo, A. Y., Schoute, E., Childs, A. M., Gorshkov, A. V., & Lucas, A. (2025) · PRX Quantum · doi:10.1103/7b1x-hjcy · Cited by 4
Variations on classical and quantum extractors
Berta, M., Fawzi, O., Scholz, V. B., & Szehr, O. (2014) · CaltechAUTHORS (California Institute of Technology) · Cited by 4
Broadbent, A., González-Guillén, C. E., & Schuknecht, C. (2022) · Physical Review A · doi:10.1103/physreva.105.022606 · Cited by 4
Implementing Unitary 2-Designs Using Random Diagonal-unitary Matrices
Nakata, Y., Hirche, C., Morgan, C., & Winter, A. (2015) · Leibniz international proceedings in informatics · doi:10.15488/855 · Cited by 4
Local spectrum of truncations of Kronecker products of Haar distributed unitary matrices
Farrell, B., & Nadakuditi, R. R. (2015) · Random Matrices Theory and Application · doi:10.1142/s201032631550001x · Cited by 4
“For example, [10] addresses subsets of U(n) that can be used to approximate the expectation of a function of U .”
Rufty, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.math-ph/0702063 · Cited by 4
Quantum information in the real world: Diagnosing and correcting errors in practical quantum devices
Helsen, J. (2019) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:312b719d-32bc-4219-82bb-8e6febc2abcc · Cited by 4
Continuous Measurement Quantum State Tomography of Atomic EnsemblesPreprint
Almeida, R., & Carlos, A. R. (2012) · arXiv (Cornell University) · Cited by 4
On Computational Complexity of Unitary and State Design PropertiesPreprint
Nakata, Y., Takeuchi, Y., Kliesch, M., & Darmawan, A. S. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2410.23353 · Cited by 4
“Such a variational method performs well in small systems [71].”
InfluentialMany-body $k$-local ground states as probes for unitary quantum metrologyPreprint
Hassani, M., Hu, M., Müller-Rigat, G., Fadel, M., & Tura, J. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.02976 · Cited by 4
“However, such a connection applies only to the parameter-independent encoding, and it requires Haar random states, which are notoriously difficult to prepare, even in the symmetric space, as they demand maximal complexity, i.e. , up to full system size interactions [44, 45].”
Equilibration and Typicality in Quantum Processes
ROMERO, P. F. (2021) · arXiv (Cornell University) · doi:10.26180/13684795 · Cited by 4
Qudit Designs and Where to Find ThemPreprint
Anand, N., Marshall, J., Saied, J., Rieffel, E. G., & Morello, A. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.02659 · Cited by 4
Qin, Z., Wakin, M. B., & Zhu, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.27191 · Cited by 4
“(Unitary t -designs [22–24]).”
Quantum Machine Learning: Concepts and possibilities
Delgado, A., & Hamilton, K. E. (2025) · Institute of Physics eBooks · doi:10.1088/978-0-7503-4952-9 · Cited by 3
Quantum finite-temperature Lanczos method
Gentinetta, G., Metz, F., Kirby, W., & Carleo, G. (2026) · Physical Review Research · doi:10.1103/f3q5-cm1n · Cited by 2
Moments of Quantum Channel Ensembles
Anonymous, García-Martín, D., Holmes, Z., & Cerezo, M. (2026) · PRX Quantum · doi:10.1103/grdp-jph9 · Cited by 4
“, or, Is there a reference ensemble of channels that plays a privileged role over other ensembles?”
Hierarchically discriminating Haar-randomness in quantum states from a black-box device
Bonet-Monroig, X., Wang, H., & Pérez-Salinas, A. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae868b · Cited by 3
Optimal Complexity of Parameterized Quantum Circuits
Correr, G. I., Azado, P. C., Soares-Pinto, D. O., & Carlo, G. G. (2026) · Entropy · doi:10.3390/e28010073 · Cited by 3
“This more rigorous definition compares the circuits with t -designs, which is a good measure to quantify how close a circuit is to a particular design order (i.e., how close the moments of the circuit are to the Haar ones up to the t -th moment [19,20,38]).”
Certification of a functionality in a quantum network stage
Lipińska, V., Le, T. P., Ribeiro, J., & Wehner, S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c51 · Cited by 3
Computational Problems Related to Open Quantum Systems
Wang, C. (2018) · UWSpace (University of Waterloo) · Cited by 3
The Role of Entanglement in Quantum Communication, and Analysis of the Detection LoopholePreprint
Cope, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.11769 · Cited by 3
“Operationally, this integration may be achieved by the application of random unitaries, or of certain well-constructed finite sets [48].”
BackgroundMeasurement-Protected Quantum Key DistributionPreprint
Kechrimparis, S., Ko, H., Ko, Y., Kim, K., Choi, B., Kropf, C. M., Youn, C. J., & Bae, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.00768 · Cited by 3
“For qubit channels, the minimal number of unitaries that realize a unitary 2-design is 12 [20].”
Adhikari, K., & Deppe, C. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2309.10363 · Cited by 3
“This implies that the states obtained from t -design circuits [56] are information-theoretically indistinguishable from Haar scrambling circuits up to the t -th moment [55].”
MethodQuantum Chaos and Quantum Information: Interactions and ImplicationsPreprint
Lakshminarayan, A., & Życzkowski, K. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.12267 · Cited by 3
“It is defined as A convenient scalar diagnostic for t -design behavior is the t -frame potential [18, 83], It attains the lowest value when ρ t ( E ) is the isotropic mixed state in the support of the totally symmetric subspace of ⊗ t H .”
Solvable Random Unitary Dynamics in a Disordered Tomonaga-Luttinger LiquidPreprint
Zhou, T.-G., & Giamarchi, T. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2604.25995 · Cited by 3
“Usually ρ is the maximally mixed state to characterize the unitary k -design [33, 34], but here we focus on low temperatures to characterize the randomness.”
Unitary designs from perturbed time evolutions of a chaotic HamiltonianPreprint
Yang, Z., & Wu, B. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.24851 · Cited by 3
“Because exact Haar sampling is exponentially costly, unitary k -designs, which reproduce Haar moments up to order k , provide a practical substitute [16–18].”
Lastres, M., & Moudgalya, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.11297 · Cited by 3
Ambient unitaries don't enable shallow group designsPreprint
West, M., Cerezo, M., & Larocca, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.13528 · Cited by 3
Strong matchgate designs in nearly optimal depthPreprint
West, M., Cerezo, M., & Larocca, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.26677 · Cited by 3
Rastegin, A. E. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04800-y · Cited by 2
Generating pseudo-random unitaries with a Floquet driven chaotic quantum system
Quillen, A. C., & Miakhel, A. S. (2026) · Physical Review A · doi:10.1103/bjpv-jwx6 · Cited by 2
“One way to characterize a distribution of unitaries is with quantities called the k-frame potentials [40, 56, 77].”
Fundamental limits to contrast reversal of survival probability correlations
Cho, K., & Bang, J. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae6537 · Cited by 2
On the Query Complexity of Perfect Gate Discrimination
Chiribella, G., D’Ariano, G. M., & Roetteler, M. (2013) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2013.178 · Cited by 2
Estimating average fidelity error based on local random quantum circuits
Linxi, Z., Chen, N., Zhu, C., & Pei, C. (2019) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/125/40002 · Cited by 2
Recovery of damaged information via scrambling in indefinite causal order
Jin, T., Li, T., Wang, Z., Xu, K., Zhang, Y.-R., & Fan, H. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad5ec7 · Cited by 2
“One way to preserve the property of randomness and to reduce the complexity of the quantum circuit simultaneously is to use the unitary t -design [34].”
MethodGeneralized cross-entropy benchmarking for random circuits with ergodicity
Cheng, B., Meng, F., Zhang, Z.-J., & Yung, M. (2025) · Chip · doi:10.1016/j.chip.2025.100127 · Cited by 2
RETRACTED ARTICLE: Noise tailoring for quantum circuits via unitary 2t-design
Linxi, Z., Yu, Y., Zhu, C., & Pei, C. (2019) · Scientific Reports · doi:10.1038/s41598-018-38158-2 · Cited by 2
RetractedInvestigating the effect of noise channels on the quality of unitary t -designs
Strydom, C., & Tame, M. (2023) · Physical Review A · doi:10.1103/physreva.108.052414 · Cited by 2
“…quantifiers of the extent to which a given ensemble of unitary operators deviates from an exact unitary t -design, such as the frame potential [34, 35], it is unclear how these can be applied in the context of noise modelling, since noise channels act on states and cannot be applied to the…”
BackgroundOn a matrix ensemble for arbitrary complex quantum systems
Salazar, W. E., Urbina, J. D., & Madroñero, J. (2025) · Journal of High Energy Physics · doi:10.1007/jhep05(2025)178 · Cited by 2
Simultaneous Superadditivity of the Direct and Complementary Channel Capacities
Singh, S., & Strelchuk, S. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3602136 · Cited by 2
“One can replace the Haar random unitaries with a so-called 2-design (such as the Cli ff ord group) [27], [28] so that the classical registers are also finite-dimensional, see [11] for more details.”
Torta, P. (2024) · SDL · Cited by 2
Scalable approaches to the characterization of open quantum system dynamics
López, C. C. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2
Clifiord Group Dipoles and the Enactment of Weyl/Coxeter Group W(E 8 ) by Entangling GatesPreprint
Planat, M. R. P. (2009) · arXiv (Cornell University) · Cited by 2
Extensions of Randomized Benchmarking
Barnhill, M. (2015) · UWSpace (University of Waterloo) · Cited by 2
Randomness cost of symmetric twirlingPreprint
Boche, H., Janßen, G., & Saeedinaeeni, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.01473 · Cited by 2
“We refer to such subsets as symmetric weighted designs , as they are the analogous objects to spherical or unitary designs ([17],[14]).”
BackgroundA walk through quantum noise: a study of error signatures and characterization methods
Carignan-Dugas, A. (2019) · UWSpace (University of Waterloo) · Cited by 2
On quantum randomness and quantum resources
Liu, Z.-W. (2018) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2
Singal, T., & Hsieh, M.-H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.13678 · Cited by 2
Product states optimize quantum $p$-spin models for large $p$Preprint
Anschuetz, E. R., Gamarnik, D., & Kiani, B. T. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2309.11709 · Cited by 2
Few measurement shots challenge generalization in learning to classify entanglementPreprint
Banchi, L., Pereira, J. L., & Zamboni, M. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2411.06600 · Cited by 2
“Since 2-designs require at least O ( d 4 ) unitaries [29], the number of training states cannot be smaller.”
BackgroundAverage Contraction Coefficients of Quantum ChannelsPreprint
Ibarrondo, R., & França, D. S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2508.08214 · Cited by 2
Harada, H., Wada, K., Yamamoto, N., & Endo, S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2512.19623 · Cited by 2
Continuous Unitary Designs for Universally Robust Quantum ControlPreprint
Yang, X., Leng, J., & Li, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.01988 · Cited by 2
Stronger Welch Bounds and Optimal Approximate $k$-DesignsPreprint
Castellano, R., Grinko, D., Boreiri, S., Brunner, N., & Pauwels, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2602.13099 · Cited by 2
Interleaved Benchmarking with Single-Qubit ReferencesPreprint
Simakov, I. A., Zotova, A. V., Chudakova, T. A., Kazmina, A. S., Polyanskiy, A. M., Abramov, N. N., Tarkhov, M. A., Mumlyakov, A. M., Trofimov, I. V., Rudenko, N. Y., et al. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.05422 · Cited by 2
“We begin with the standard benchmarking protocol, in which reference circuits are composed of n -qubit Clifford operations forming a unitary 2-design [27].”
IntegrateUnitary.jl: A Julia package for symbolic integration over Haar measuresPreprint
Pawela, Ł., & Puchała, Z. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2605.23830 · Cited by 2
“Unitary 𝑡 -designs [Ambainis and Emerson 2007; Dankert et al. 2009; Gross et al. 2007] are ensembles of unitary matrices that mimic the Haar measure up to the 𝑡 th moment.”
Metadata
- Authors
- Gross, D., Audenaert, K., & Eisert, J.
- Affiliations
- Imperial College London (GB)
- ORCID
- Eisert, J.
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2007-05-01
- Volume
- 48
- Issue
- 5
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2140622323
- Cited by
- 358
- References
- 42
- Citations by year
- 2026: 25 · 2025: 57 · 2024: 25 · 2023: 23 · 2022: 33 · 2021: 33 · 2020: 29 · 2019: 23 · 2018: 18 · 2017: 14 · 2016: 7 · 2015: 13 · 2014: 11 · 2013: 11 · 2012: 7
- FWCI
- 10.26
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Journal of Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Royal Holloway Digital Repository (Royal Holloway University of London) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Finite Group Theory Research
- Keywords
- unitary groups, mutually unbiased bases, spherical designs, linear optics
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.