اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConstructing Approximately Diagonal Unitary Gates
380
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study a method of producing approximately diagonal 1-qubit gates. For each positive integer, the method provides a sequence of gates that are defined iteratively from a fixed diagonal gate and an arbitrary gate. These sequences are conjectured to converge to diagonal gates doubly exponentially fast and are verified for small integers. We systemically study this conjecture and prove several important partial results. Some techniques are developed to pave the way for a final resolution of the conjecture. The sequences provided here have applications in quantum search algorithms, quantum circuit compilation, generation of leakage-free entangled gates in topological quantum computing, etc.
قيم البحث
اقرأ أيضاً
Using a braid group representation based on the Temperley-Lieb algebra, we construct braid quantum gates that could generate entangled $n$-partite $D$-level qudit states. $D$ different sets of $D^ntimes D^n$ unitary representation of the braid group
generators are presented. With these generators the desired braid quantum gates are obtained. We show that the generalized GHZ states, which are maximally entangled states, can be obtained directly from these braid quantum gates without resorting to further local unitary transformations. We also point out an interesting observation, namely for a general multi-qudit state there exists a unitary braid quantum gate based on the Temperley-Lieb algebra that connects it from one of its component basis states, if the coefficient of the component state is such that the square of its norm is no less than $1/4$.
Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary $t$-designs mimi
c the Haar-measure up to $t$-th moments. It is known that Clifford operations can implement at most $3$-designs. In this work, we quantify the non-Clifford resources required to break this barrier. We find that it suffices to inject $O(t^{4}log^{2}(t)log(1/varepsilon))$ many non-Clifford gates into a polynomial-depth random Clifford circuit to obtain an $varepsilon$-approximate $t$-design. Strikingly, the number of non-Clifford gates required is independent of the system size -- asymptotically, the density of non-Clifford gates is allowed to tend to zero. We also derive novel bounds on the convergence time of random Clifford circuits to the $t$-th moment of the uniform distribution on the Clifford group. Our proofs exploit a recently developed variant of Schur-Weyl duality for the Clifford group, as well as bounds on restricted spectral gaps of averaging operators.
We provide a class of optimal nondecomposable entanglement witnesses for 4N x 4N composite quantum systems or, equivalently, a new construction of nondecomposable positive maps in the algebra of 4N x 4N complex matrices. This construction provides na
tural generalization of the Robertson map. It is shown that their structural physical approximations give rise to entanglement breaking channels.
Random unitary matrices find a number of applications in quantum information science, and are central to the recently defined boson sampling algorithm for photons in linear optics. We describe an operationally simple method to directly implement Haar
random unitary matrices in optical circuits, with no requirement for prior or explicit matrix calculations. Our physically-motivated and compact representation directly maps independent probability density functions for parameters in Haar random unitary matrices, to optical circuit components. We go on to extend the results to the case of random unitaries for qubits.
We study the entangling properties of multipartite unitary gates with respect to the measure of entanglement called one-tangle. Putting special emphasis on the case of three parties, we derive an analytical expression for the entangling power of an $
n$-partite gate as an explicit function of the gate, linking the entangling power of gates acting on $n$-partite Hilbert space of dimension $d_1 ldots d_n$ to the entanglement of pure states in the Hilbert space of dimension $(d_1 ldots d_n)^2$. Furthermore, we evaluate its mean value averaged over the unitary and orthogonal groups, analyze the maximal entangling power and relate it to the absolutely maximally entangled (AME) states of a system with $2n$ parties. Finally, we provide a detailed analysis of the entangling properties of three-qubit unitary and orthogonal gates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
