اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEncoded Universality for Generalized Anisotropic Exchange Hamiltonians
92
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We derive an encoded universality representation for a generalized anisotropic exchange Hamiltonian that contains cross-product terms in addition to the usual two-particle exchange terms. The recently developed algebraic approach is used to show that the minimal universality-generating encodings of one logical qubit are based on three physical qubits. We show how to generate both single- and two-qubit operations on the logical qubits, using suitably timed conjugating operations derived from analysis of the commutator algebra. The timing of the operations is seen to be crucial in allowing simplification of the gate sequences for the generalized Hamiltonian to forms similar to that derived previously for the symmetric (XY) anisotropic exchange Hamiltonian. The total number of operations needed for a controlled-Z gate up to local transformations is five. A scalable architecture is proposed.
قيم البحث
اقرأ أيضاً
We study the quantum computational power of a generic class of anisotropic solid state Hamiltonians. A universal set of encoded logic operations are found which do away with difficult-to-implement single-qubit gates in a number of quantum computer pr
oposals, e.g., quantum dots and donor atom spins with anisotropic exchange coupling, quantum Hall systems, and electrons floating on helium.We show how to make the corresponding Hamiltonians universal by encoding one qubit into two physical qubits, and by controlling nearest neighbor interactions.
We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the intrinsic ability
of a system to act as a universal quantum computer using only its naturally available interactions. A key element of this approach is the realization that the fungible nature of quantum information allows for universal manipulations using quantum information encoded in a subspace of the full system Hilbert space, as an alternative to using physical qubits directly. Starting with the interactions intrinsic to the physical system, we show how to determine the possible universality resulting from these interactions over an encoded subspace. We outline a general Lie-algebraic framework which can be used to find the encoding for universality and give several examples relevant to solid-state quantum computing.
This paper is a natural continuation of the previous paper cite{TyuVo13} where generalized oscillator representations for Calogero Hamiltonians with potential $V(x)=alpha/x^2$, $alphageq-1/4$, were constructed. In this paper, we present generalized o
scillator representations for all generalized Calogero Hamiltonians with potential $V(x)=g_{1}/x^2+g_{2}x^2$, $g_{1}geq-1/4$, $g_{2}>0$. These representations are generally highly nonunique, but there exists an optimum representation for each Hamiltonian, representation that explicitly determines the ground state and the ground-state energy. For generalized Calogero Hamiltonians with coupling constants $g_1<-1/4$ or $g_2<0$, generalized oscillator representations do not exist in agreement with the fact that the respective Hamiltonians are not bounded from below.
This paper is a natural continuation of the previous paper J.Phys. A: Math.Theor. 44 (2011) 425204, arXiv 0907.1736 [quant-ph] where oscillator representations for nonnegative Calogero Hamiltonians with coupling constant $alphageq-1/4$ were construct
ed. Here, we present generalized oscillator representations for all Calogero Hamiltonians with $alphageq-1/4$.These representations are generally highly nonunique, but there exists an optimum representation for each Hamiltonian.
The exchange interaction between identical qubits in a quantum information processor gives rise to unitary two-qubit errors. It is shown here that decoherence free subspaces (DFSs) for collective decoherence undergo Pauli errors under exchange, which
however do not take the decoherence free states outside of the DFS. In order to protect DFSs against these errors it is sufficient to employ a recently proposed concatenated DFS-quantum error correcting code scheme [D.A. Lidar, D. Bacon and K.B. Whaley, Phys. Rev. Lett. {bf 82}, 4556 (1999)].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
