اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA unified framework of transformations based on Jordan-Wigner transformation
77
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Mapping is one of the essential steps by which fermionic systems can be solved by quantum computers. In this letter, we give a unified framework of transformations mapping fermionic systems to qubit systems. Many existed transformations, such as Jordan-Wigner, Bravyi-Kitaev and Parity transformations, are the special cases of this framework. Furthermore, based on our framework, one can design transformations flexibly according to the structure of Hamiltonian and quantum devices. Particularly, we propose a transformation, Multilayer Segmented Parity (MSP) transformation, in which the number of layers and the length of segments are adjustable. Applying these mappings on the electronic structure Hamiltonian of various molecules, MSP transformation performs better on the number of Pauli operators and gates needed in the circuit to implement the evolution operator of Hamiltonian.
قيم البحث
اقرأ أيضاً
According to Wigner theorem, transformations of quantum states which preserve the probabilities are either unitary or antiunitary. This short communication presents an elementary proof of this theorem that significantly departs from the numerous ones
already existing in the literature. The main line of the argument remains valid even in quantum field theory where Hilbert spaces are non-separable.
The main results on quantum walk search are scattered over different, incomparable frameworks, most notably the hitting time framework, originally by Szegedy, the electric network framework by Belovs, and the MNRS framework by Magniez, Nayak, Roland
and Santha. As a result, a number of pieces are currently missing. For instance, the electric network framework allows quantum walks to start from an arbitrary initial state, but it only detects marked elements. In recent work by Ambainis et al., this problem was resolved for the more restricted hitting time framework, in which quantum walks must start from the stationary distribution. We present a new quantum walk search framework that unifies and strengthens these frameworks. This leads to a number of new results. For instance, the new framework not only detects, but finds marked elements in the electric network setting. The new framework also allows one to interpolate between the hitting time framework, which minimizes the number of walk steps, and the MNRS framework, which minimizes the number of times elements are checked for being marked. This allows for a more natural tradeoff between resources. Whereas the original frameworks only rely on quantum walks and phase estimation, our new algorithm makes use of a technique called quantum fast-forwarding, similar to the recent results by Ambainis et al. As a final result we show how in certain cases we can simplify this more involved algorithm to merely applying the quantum walk operator some number of times. This answers an open question of Ambainis et al.
We investigate the Jordan-Wigner fermion clusters with the stationary distributed pairwise quantum discord. Such clusters appear after the Jordan-Wigner transformation of a spin chain governed by the nearest-neighbor XY-Hamiltonian with the particula
r initial state having one polarized node. We show that the quantum discord stationarity in such systems is not destroyed by the parasitic polarization of at least two types. First type appears because the initial state with a single polarized node is hardly realizable experimentally, so that the low polarization of neighboring nodes must be taken into account. Second, the additional noise-polarization of all nodes is unavoidable. Although the stationarity may not be destroyed by perturbations of the above two types, the parasitic polarizations deform the distribution of the pairwise discord and may destroy the clusters of correlated fermions with equal pairwise discords. Such deformations are studied in this paper.
This paper establishes a Markov chain model as a unified framework for understanding information consumption processes in complex networks, with clear implications to the Internet and big-data technologies. In particular, the proposed model is the fi
rst one to address the formation mechanism of the trichotomy in observed probability density functions from empirical data of various social and technical networks. Both simulation and experimental results demonstrate a good match of the proposed model with real datasets, showing its superiority over the classical power-law models.
The goal of quantum circuit transformation is to map a logical circuit to a physical device by inserting additional gates as few as possible in an acceptable amount of time. We present an effective approach called TSA to construct the mapping. It con
sists of two key steps: one makes use of a combined subgraph isomorphism and completion to initialize some candidate mappings, the other dynamically modifies the mappings by using tabu search-based adjustment. Our experiments show that, compared with state-of-the-art methods GA, SABRE and FiDLS proposed in the literature, TSA can generate mappings with a smaller number of additional gates and it has a better scalability for large-scale circuits.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
