اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFrom quantum fusiliers to high-performance networks
147
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Our objective was to design a quantum repeater capable of achieving one million entangled pairs per second over a distance of 1000km. We failed, but not by much. In this letter we will describe the series of developments that permitted us to approach our goal. We will describe a mechanism that permits the creation of entanglement between two qubits, connected by fibre, with probability arbitrarily close to one and in constant time. This mechanism may be extended to ensure that the entanglement has high fidelity without compromising these properties. Finally, we describe how this may be used to construct a quantum repeater that is capable of creating a linear quantum network connecting two distant qubits with high fidelity. The creation rate is shown to be a function of the maximum distance between two adjacent quantum repeaters.
قيم البحث
اقرأ أيضاً
We utilize a concatenation scheme to construct new families of quantum error correction codes that include the Bacon-Shor codes. We show that our scheme can lead to asymptotically good quantum codes while Bacon-Shor codes cannot. Further, the concate
nation scheme allows us to derive quantum LDPC codes of distance $Omega(N^{2/3}/loglog N)$ which can improve Hastingss recent result [arXiv:2102.10030] by a polylogarithmic factor. Moreover, assisted by the Evra-Kaufman-Zemor distance balancing construction, our concatenation scheme can yield quantum LDPC codes with non-vanishing code rates and better minimum distance upper bound than the hypergraph product quantum LDPC codes. Finally, we derive a family of fast encodable and decodable quantum concatenated codes with parameters ${Q}=[[N,Omega(sqrt{N}),Omega( sqrt{N})]]$ and they also belong to the Bacon-Shor codes. We show that ${Q}$ can be encoded very efficiently by circuits of size $O(N)$ and depth $O(sqrt{N})$, and can correct any adversarial error of weight up to half the minimum distance bound in $O(sqrt{N})$ time. To the best of our knowledge, they are the most powerful quantum codes for correcting so many adversarial errors in sublinear time by far.
The development of a future, global quantum communication network (or quantum internet) will enable high rate private communication and entanglement distribution over very long distances. However, the large-scale performance of ground-based quantum n
etworks (which employ photons as information carriers through optical-fibres) is fundamentally limited by the fibre quality and link length. While these fundamental limits are well established for arbitrary network architectures, the question of how to best design these global architectures remains open. In this work, we take a step forward in addressing this problem by modelling global quantum networks with weakly-regular architectures. Such networks are capable of idealising end-to-end performance whilst remaining sufficiently realistic. In this way, we may investigate the effectiveness of large-scale networks with consistent connective properties, and unveil the global conditions under which end-to-end rates remain analytically computable. Furthermore, by comparing the performance of ideal, ground-based quantum networks with satellite quantum communication protocols, we can establish conditions for which satellites can be used to outperform fibre-based quantum infrastructure.
As quantum computers of non-trivial size become available in the near future, it is imperative to develop tools to emulate small quantum computers. This allows for validation and debugging of algorithms as well as exploring hardware-software co-desig
n to guide the development of quantum hardware and architectures. The simulation of quantum computers entails multiplications of sparse matrices with very large dense vectors of dimension $2^n$, where $n$ denotes the number of qubits, making this a memory-bound and network bandwidth-limited application. We introduce the concept of a quantum computer textit{emulator} as a component of a software framework for quantum computing, enabling a significant performance advantage over simulators by emulating quantum algorithms at a high level rather than simulating individual gate operations. We describe various optimization approaches and present benchmarking results, establishing the superiority of quantum computer emulators in terms of performance.
This paper extends the consensus framework, widely studied in the literature on distributed computing and control algorithms, to networks of quantum systems. We define consensus situations on the basis of invariance and symmetry properties, finding f
our different probabilistic generalizations of classical consensus states. We then extend the gossip consensus algorithm to the quantum setting and prove its convergence properties, showing how it converges to symmetric states while preserving the expectation of permutation-invariant global observables.
We investigate dynamical properties of a quantum generalization of classical reversible Boolean networks. The state of each node is encoded as a single qubit, and classical Boolean logic operations are supplemented by controlled bit-flip and Hadamard
operations. We consider synchronous updating schemes in which each qubit is updated at each step based on stored values of the qubits from the previous step. We investigate the periodic or quasiperiodic behavior of quantum networks, and we analyze the propagation of single site perturbations through the quantum networks with input degree one. A non-classical mechanism for perturbation propagation leads to substantially different evolution of the Hamming distance between the original and perturbed states.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
