اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDiscrete-time quantum walk approach to high-dimensional quantum state transfer and quantum routing
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
High-dimensional quantum systems can offer extended possibilities and multiple advantages while developing advanced quantum technologies. In this paper, we propose a class of quantum-walk architecture networks that admit the efficient routing of high-dimensional quantum states. Perfect state transfer of an arbitrary unknown qudit state can be achieved between two arbitrary nodes via a one-dimensional lackadaisical discrete-time quantum walk. In addition, this method can be generalized to the high-dimensional lattices, where it allows distillable entanglement to be shared between arbitrary input and output ports. Implementation of our scheme is more feasible through exploiting the coin degrees of freedom and the settings of the coin flipping operators are simple. These results provide a direct application in a high-dimensional computational architecture to process much more information.
قيم البحث
اقرأ أيضاً
We study the routing of quantum information in parallel on multi-dimensional networks of tunable qubits and oscillators. These theoretical models are inspired by recent experiments in superconducting circuits using Josephson junctions and resonators.
We show that perfect parallel state transfer is possible for certain networks of harmonic oscillator modes. We further extend this to the distribution of entanglement between every pair of nodes in the network, finding that the routing efficiency of hypercube networks is both optimal and robust in the presence of dissipation and finite bandwidth.
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform chosen fo
r implementation, and a general framework is still missing. Here we show that coined quantum walks on a line, which represent a framework general enough to encompass a variety of different platforms, can be used for quantum state engineering of arbitrary superpositions of the walkers sites. We achieve this goal by identifying a set of conditions that fully characterize the reachable states in the space comprising walker and coin, and providing a method to efficiently compute the corresponding set of coin parameters. We assess the feasibility of our proposal by identifying a linear optics experiment based on photonic orbital angular momentum technology.
The unique features of quantum walk, such as the possibility of the walker to be in superposition ofthe position space and get entangled with the position space, provides inherent advantages that canbe captured to design highly secure quantum communi
cation protocols. Here we propose two quan-tum direct communication protocols, a Quantum Secure Direct Communication (QSDC) protocoland a Controlled Quantum Dialogue (CQD) protocol using discrete-time quantum walk on a cycle.The proposed protocols are unconditionally secure against various attacks such as the intercept-resend attack, the denial of service attack, and the man-in-the-middle attack. Additionally, theproposed CQD protocol is shown to be unconditionally secure against an untrusted service providerand both the protocols are shown more secure against the intercept resend attack as compared tothe qubit based LM05/DL04 protocol.
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal set of qua
ntum gates on two- and three-qubit systems. The idea is to utilize the effective Hilbert space of the single qubit and the position space on which it evolves in order to realize multi-qubit states and universal set of quantum gates on them. Realization of many non-trivial gates and engineering arbitrary states is simpler in the proposed quantum walk model when compared to the circuit based model of computation. We will also discuss the scalability of the model and some propositions for using lesser number of qubits in realizing larger qubit systems.
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit calculation that fo
r the coined quantum walks on star graph and complete graph with self-loops perfect state transfer between the sender and receiver vertex is achieved for arbitrary number of vertices $N$ in $O(sqrt{N})$ steps of the walk. Finally, we show that Szegedys walk with queries on complete graph allows for state transfer with unit fidelity in the limit of large $N$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
