{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:32:16Z","timestamp":1760401936222,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T00:00:00Z","timestamp":1578787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"undefined  &lt;span style=&quot;color:gray;font-size:10px;&quot;&gt;undefined&lt;\/span&gt;","award":["ANR-17-CE24-0035"],"award-info":[{"award-number":["ANR-17-CE24-0035"]}]},{"name":"CNRS - UL","award":["."],"award-info":[{"award-number":["."]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary t-design is designed to tackle this challenge in an efficient way, yet constructions to date rely on heavy constraints. In particular, they are composed of ensembles of unitaries which, for technical reasons, must contain inverses and whose entries are algebraic. In this work, we reduce the requirements for generating an    \u03b5   -approximate unitary t-design. To do so, we first construct a specific n-qubit random quantum circuit composed of a sequence of randomly chosen 2-qubit gates, chosen from a set of unitaries which is approximately universal on     U ( 4 )    , yet need not contain unitaries and their inverses nor are in general composed of unitaries whose entries are algebraic; dubbed     r e l a x e d     seed. We then show that this relaxed seed, when used as a basis for our construction, gives rise to an    \u03b5   -approximate unitary t-design efficiently, where the depth of our random circuit scales as     p o l y ( n , t , l o g ( 1 \/ \u03b5 ) )    , thereby overcoming the two requirements which limited previous constructions. We suspect the result found here is not optimal and can be improved; particularly because the number of gates in the relaxed seeds introduced here grows with n and t. We conjecture that constant sized seeds such as those which are usually present in the literature are sufficient.<\/jats:p>","DOI":"10.3390\/e22010092","type":"journal-article","created":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T04:05:51Z","timestamp":1578888351000},"page":"92","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Unitary t-Designs from Relaxed Seeds"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8963-9112","authenticated-orcid":false,"given":"Rawad","family":"Mezher","sequence":"first","affiliation":[{"name":"Laboratoire d \u2019Informatique de Paris 6, CNRS, Sorbonne Universit\u00e9, 4 Place Jussieu, 75252 Paris CEDEX 05, France"},{"name":"Laboratoire de Physique Appliqu\u00e9e, Faculty of Sciences 2, Lebanese University, Fanar 90656, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Ghalbouni","sequence":"additional","affiliation":[{"name":"Laboratoire de Physique Appliqu\u00e9e, Faculty of Sciences 2, Lebanese University, Fanar 90656, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Dgheim","sequence":"additional","affiliation":[{"name":"Laboratoire de Physique Appliqu\u00e9e, Faculty of Sciences 2, Lebanese University, Fanar 90656, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Markham","sequence":"additional","affiliation":[{"name":"Laboratoire d \u2019Informatique de Paris 6, CNRS, Sorbonne Universit\u00e9, 4 Place Jussieu, 75252 Paris CEDEX 05, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,1,12]]},"reference":[{"key":"ref_1","unstructured":"Chiffre, M.D.D. (2011). The Haar measure. [Ph.D. Thesis, Department of Mathematical Sciences, University of Copenhagen]."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s00220-016-2706-8","article-title":"Local Random Quantum Circuits are Approximate Polynomial-Designs","volume":"346","author":"Harrow","year":"2016","journal-title":"Commun. Math. Phys."},{"key":"ref_3","unstructured":"Knill, E. (1995). Approximation by quantum circuits. arXiv."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"012304","DOI":"10.1103\/PhysRevA.89.062321","article-title":"Investigating the limits of randomized benchmarking protocols","volume":"89","author":"Epstein","year":"2014","journal-title":"Phys. Rev. A"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"2098","DOI":"10.1126\/science.1090790","article-title":"Pseudo-random unitary operators for quantum information processing","volume":"302","author":"Emerson","year":"2003","journal-title":"Science"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s00220-004-1087-6","article-title":"Randomizing quantum states: Constructions and applications","volume":"250","author":"Hayden","year":"2004","journal-title":"Commun. Math. Phys."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"020301","DOI":"10.1103\/PhysRevA.91.020301","article-title":"Testing randomness with photons by direct characterization of optical t-designs","volume":"91","author":"Matthews","year":"2015","journal-title":"Phys. Rev. A"},{"key":"ref_8","first-page":"041044","article-title":"Random bosonic states for robust quantum metrology","volume":"6","author":"Oszmaniec","year":"2016","journal-title":"Phys. Rev. X"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s00220-015-2473-y","article-title":"Thermalization and canonical typicality in translation-invariant quantum lattice systems","volume":"340","author":"Muller","year":"2015","journal-title":"Commun. Math. Phys."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Hayden, P., and Preskill, J. (2007). Black holes as mirrors: Quantum information in random subsystems. J. High Energy Phys., 120.","DOI":"10.1088\/1126-6708\/2007\/09\/120"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Mezher, R., Ghalbouni, J., Dgheim, J., and Markham, D. (2019). Efficient approximate unitary t-designs from partially invertible universal sets and their application to quantum speedup. arXiv.","DOI":"10.3390\/e22010092"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Haferkamp, J., Hangleiter, D., Bouland, A., Fefferman, B., Eisert, J., and Bermejo-Vega, J. (2019). Closing gaps of a quantum advantage with short-time Hamiltonian dynamics. arXiv.","DOI":"10.1103\/PhysRevLett.125.250501"},{"key":"ref_13","first-page":"021010","article-title":"Architectures for quantum simulation showing a quantum speedup","volume":"8","author":"Hangleiter","year":"2018","journal-title":"Phys. Rev. X"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"012304","DOI":"10.1103\/PhysRevA.80.012304","article-title":"Exact and approximate unitary 2-designs and their application to fidelity estimation","volume":"80","author":"Dankert","year":"2009","journal-title":"Phys. Rev. A"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s10623-009-9290-2","article-title":"Unitary designs and codes","volume":"53","author":"Roy","year":"2009","journal-title":"Codes Cryptogr."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0001-8708(84)90022-7","article-title":"Averaging sets: A generalization of mean values and spherical designs","volume":"52","author":"Seymour","year":"1984","journal-title":"Adv. Math."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Bannai, E., Nakahara, M., Zhao, D., and Zhu, Y. (2019). On the explicit constructions of certain unitary t-designs. arXiv.","DOI":"10.1088\/1751-8121\/ab5009"},{"key":"ref_18","unstructured":"Harrow, A., and Mehraban, S. (2018). Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates. arXiv."},{"key":"ref_19","unstructured":"Kaznatcheev, A. (2019, September 05). Structure of Exact and Approximate Unitary t-Designs. Available online: https:\/\/www.cs.mcgill.ca\/~akazna\/kaznatcheev20100509.pdf."},{"key":"ref_20","first-page":"021006","article-title":"Efficient quantum pseudorandomness with nearly time-independent Hamiltonian dynamics","volume":"7","author":"Nakata","year":"2017","journal-title":"Phys. Rev. X"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"200501","DOI":"10.1103\/PhysRevLett.116.200501","article-title":"Derandomizing Quantum Circuits with Measurement-Based Unitary Designs","volume":"116","author":"Turner","year":"2016","journal-title":"Phys. Rev. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"022333","DOI":"10.1103\/PhysRevA.97.022333","article-title":"Efficient quantum pseudorandomness with simple graph states","volume":"97","author":"Mezher","year":"2018","journal-title":"Phys. Rev. A"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Bourgain Gamburd, J. (2011). A spectral gap theorem in SU(d). arXiv.","DOI":"10.4171\/jems\/337"},{"key":"ref_24","unstructured":"Hastings, M.B., and Harrow, A.W.H. (2008). Classical and quantum tensor product expanders. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"032315","DOI":"10.1103\/PhysRevA.76.032315","article-title":"Random unitaries give quantum expanders","volume":"76","author":"Hastings","year":"2007","journal-title":"Phys. Rev. A"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s00220-009-0873-6","article-title":"Random quantum circuits are approximate 2-designs","volume":"291","author":"Harrow","year":"2009","journal-title":"Commun. Math. Phys."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Farzani, F., Ferrini, G., Grosshans, F., and Markham, D. (2019). Random coding for sharing bosonic quantum secrets. Phys. Rev., 022303.","DOI":"10.1103\/PhysRevA.100.022303"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"140505","DOI":"10.1103\/PhysRevLett.112.140505","article-title":"Measurement-based classical computation","volume":"112","author":"Hoban","year":"2014","journal-title":"Phys. Rev. Lett."},{"key":"ref_29","unstructured":"Markham, D., and Krause, A. (2018). A simple protocol for certifying graph states and applications in quantum networks. arXiv."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1038\/s41534-019-0142-2","article-title":"Resource-efficient verification of quantum computing using Serfling\u2019s bound","volume":"5","author":"Takeuchi","year":"2019","journal-title":"NPJ Quant. Inf."},{"key":"ref_31","first-page":"19","article-title":"Quantum Computing","volume":"112","author":"Markham","year":"2018","journal-title":"Ercim News"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"5480","DOI":"10.1038\/ncomms6480","article-title":"Experimental demonstration of graph-state quantum secret sharing","volume":"5","author":"Bell","year":"2014","journal-title":"Nat. Commun."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.aop.2006.01.012","article-title":"Topological fault-tolerance in cluster state quantum computation","volume":"321","author":"Raussendorf","year":"2006","journal-title":"Ann. Phys."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"042323","DOI":"10.1103\/PhysRevA.71.042323","article-title":"Fault-tolerant quantum computation with cluster states","volume":"71","author":"Nielsen","year":"2005","journal-title":"Phys. Rev. A"},{"key":"ref_35","unstructured":"Dawson, C.M., and Nielsen, M.A. (2005). The solovay-kitaev algorithm. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.4171\/dm\/423","article-title":"Random walks in compact groups","volume":"18","year":"2013","journal-title":"Doc. Math."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/1\/92\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T13:19:33Z","timestamp":1760361573000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/1\/92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,12]]},"references-count":36,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["e22010092"],"URL":"https:\/\/doi.org\/10.3390\/e22010092","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2020,1,12]]}}}