اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExplicit construction of exact unitary designs
380
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The purpose of this paper is to give explicit constructions of unitary $t$-designs in the unitary group $U(d)$ for all $t$ and $d$. It seems that the explicit constructions were so far known only for very special cases. Here explicit construction means that the entries of the unitary matrices are given by the values of elementary functions at the root of some given polynomials. We will discuss what are the best such unitary $4$-designs in $U(4)$ obtained by these methods. Indeed we give an inductive construction of designs on compact groups by using Gelfand pairs $(G,K)$. Note that $(U(n),U(m) times U(n-m))$ is a Gelfand pair. By using the zonal spherical functions for $(G,K)$, we can construct designs on $G$ from designs on $K$. We remark that our proofs use the representation theory of compact groups crucially. We also remark that this method can be applied to the orthogonal groups $O(d)$, and thus provides another explicit construction of spherical $t$-designs on the $d$ dimensional sphere $S^{d-1}$ by the induction on $d$.
قيم البحث
اقرأ أيضاً
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, tomography, quantum cryptography and many other areas of
quantum information science. If a unitary $t$-design itself is a group then it is called a unitary $t$-group. Although it is known that unitary $t$-designs in $U(d)$ exist for any $t$ and $d$, the unitary $t$-groups do not exist for $tgeq 4$ if $dgeq 3$, as it is shown by Guralnick-Tiep (2005) and Bannai-Navarro-Rizo-Tiep (BNRT, 2018). Explicit constructions of exact unitary $t$-designs in $U(d)$ are not easy in general. In particular, explicit constructions of unitary $4$-designs in $U(4)$ have been an open problem in quantum information theory. We prove that some exact unitary $(t+1)$-designs in the unitary group $U(d)$ are constructed from unitary $t$-groups in $U(d)$ that satisfy certain specific conditions. Based on this result, we specifically construct exact unitary $3$-designs in $U(3)$ from the unitary $2$-group $SL(3,2)$ in $U(3),$ and also unitary $4$-designs in $U(4)$ from the unitary $3$-group $Sp(4,3)$ in $U(4)$ numerically. We also discuss some related problems.
An $(n,r,s)$-system is an $r$-uniform hypergraph on $n$ vertices such that every pair of edges has an intersection of size less than $s$. Using probabilistic arguments, R{o}dl and v{S}iv{n}ajov{a} showed that for all fixed integers $r> s ge 2$, there
exists an $(n,r,s)$-system with independence number $Oleft(n^{1-delta+o(1)}right)$ for some optimal constant $delta >0$ only related to $r$ and $s$. We show that for certain pairs $(r,s)$ with $sle r/2$ there exists an explicit construction of an $(n,r,s)$-system with independence number $Oleft(n^{1-epsilon}right)$, where $epsilon > 0$ is an absolute constant only related to $r$ and $s$. Previously this was known only for $s>r/2$ by results of Chattopadhyay and Goodman
A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be implemented by
quantum circuits consisting of ~O(n) elementary gates in logarithmic depth. This is essentially a quadratic improvement in size (and in width times depth) over all previous implementations that are exact or approximate (for sufficiently strong approximations).
In 1963, Shrikhande and Raghavarao published a recursive construction for designs that starts with a resolvable design (the master design) and then uses a second design (the indexing design) to take certain unions of blocks in each parallel class of
the master design. Several variations of this construction have been studied by different authors. We revisit this construction, concentrating on the case where the master design is a resolvable BIBD and the indexing design is a 3-design. We show that this construction yields a 3-design under certain circumstances. The resulting 3-designs have block size k = v/2 and they are resolvable. We also construct some previously unknown simple designs by this method.
A unitary $t$-design is a powerful tool in quantum information science and fundamental physics. Despite its usefulness, only approximate implementations were known for general $t$. In this paper, we provide for the first time quantum circuits that ge
nerate exact unitary $t$-designs for any $t$ on an arbitrary number of qubits. Our construction is inductive and is of practical use in small systems. We then introduce a $t$-th order generalization of randomized benchmarking ($t$-RB) as an application of exact $2t$-designs. We particularly study the $2$-RB in detail and show that it reveals self-adjointness of quantum noise, a new metric related to the feasibility of quantum error correction (QEC). We numerically demonstrate that the $2$-RB in one- and two-qubit systems is feasible, and experimentally characterize background noise of a superconducting qubit by the $2$-RB. It is shown from the experiment that interactions with adjacent qubits induce the noise that may result in an obstacle toward the realization of QEC.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
