Next Article in Journal
Introduction to Extreme Seeking Entropy
Previous Article in Journal
(Generalized) Maximum Cumulative Direct, Residual, and Paired Φ Entropy Approach
Previous Article in Special Issue
Continuous Variables Graph States Shaped as Complex Networks: Optimization and Manipulation

On Unitary t-Designs from Relaxed Seeds

Laboratoire d ’Informatique de Paris 6, CNRS, Sorbonne Université, 4 Place Jussieu, 75252 Paris CEDEX 05, France
Laboratoire de Physique Appliquée, Faculty of Sciences 2, Lebanese University, Fanar 90656, Lebanon
Authors to whom correspondence should be addressed.
Entropy 2020, 22(1), 92;
Received: 9 November 2019 / Revised: 29 December 2019 / Accepted: 9 January 2020 / Published: 12 January 2020
(This article belongs to the Special Issue Quantum Information: Fragility and the Challenges of Fault Tolerance)
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 ε -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 ε -approximate unitary t-design efficiently, where the depth of our random circuit scales as p o l y ( n , t , l o g ( 1 / ε ) ) , 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. View Full-Text
Keywords: unitary t-design; relaxed seeds; approximately universal unitary t-design; relaxed seeds; approximately universal
Show Figures

Figure 1

MDPI and ACS Style

Mezher, R.; Ghalbouni, J.; Dgheim, J.; Markham, D. On Unitary t-Designs from Relaxed Seeds. Entropy 2020, 22, 92.

AMA Style

Mezher R, Ghalbouni J, Dgheim J, Markham D. On Unitary t-Designs from Relaxed Seeds. Entropy. 2020; 22(1):92.

Chicago/Turabian Style

Mezher, Rawad, Joe Ghalbouni, Joseph Dgheim, and Damian Markham. 2020. "On Unitary t-Designs from Relaxed Seeds" Entropy 22, no. 1: 92.

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

Back to TopTop