اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدParallel State Transfer and Efficient Quantum Routing on Quantum Networks
112
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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 present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between us
ers. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.
We demonstrate the ability to control the spontaneous emission from a superconducting qubit coupled to a cavity. The time domain profile of the emitted photon is shaped into a symmetric truncated exponential. The experiment is enabled by a qubit coup
led to a cavity, with a coupling strength that can be tuned in tens of nanoseconds while maintaining a constant dressed state emission frequency. Symmetrization of the photonic wave packet will enable use of photons as flying qubits for transfering the quantum state between atoms in distant cavities.
Quantum computers can be used to address molecular structure, materials science and condensed matter physics problems, which currently stretch the limits of existing high-performance computing resources. Finding exact numerical solutions to these int
eracting fermion problems has exponential cost, while Monte Carlo methods are plagued by the fermionic sign problem. These limitations of classical computational methods have made even few-atom molecular structures problems of practical interest for medium-sized quantum computers. Yet, thus far experimental implementations have been restricted to molecules involving only Period I elements. Here, we demonstrate the experimental optimization of up to six-qubit Hamiltonian problems with over a hundred Pauli terms, determining the ground state energy for molecules of increasing size, up to BeH2. This is enabled by a hardware-efficient variational quantum eigensolver with trial states specifically tailored to the available interactions in our quantum processor, combined with a compact encoding of fermionic Hamiltonians and a robust stochastic optimization routine. We further demonstrate the flexibility of our approach by applying the technique to a problem of quantum magnetism. Across all studied problems, we find agreement between experiment and numerical simulations with a noisy model of the device. These results help elucidate the requirements for scaling the method to larger systems, and aim at bridging the gap between problems at the forefront of high-performance computing and their implementation on quantum hardware.
The wave-function Monte-Carlo method, also referred to as the use of quantum-jump trajectories, allows efficient simulation of open systems by independently tracking the evolution of many pure-state trajectories. This method is ideally suited to simu
lation by modern, highly parallel computers. Here we show that Krotovs method of numerical optimal control, unlike others, can be modified in a simple way, so that it becomes fully parallel in the pure states without losing its effectiveness. This provides a highly efficient method for finding optimal control protocols for open quantum systems and networks. We apply this method to the problem of generating entangled states in a network consisting of systems coupled in a unidirectional chain. We show that due to the existence of a dark-state subspace in the network, nearly-optimal control protocols can be found for this problem by using only a single pure-state trajectory in the optimization, further increasing the efficiency.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
