با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
Design of an Integrated Bell-State Analyzer on a Thin-Film Lithium Niobate Platform
طراحی یک آنالایزر حالت زنگ یکپارچه بر روی بستر نازک لیتیوم نیوبات-2022 Trapped ions are excellent candidates for quantum
computing and quantum networks because of their long coherence
times, ability to generate entangled photons as well as high fidelity
single- and two-qubit gates. To scale up trapped ion quantum
computing, we need a Bell-state analyzer on a reconfigurable platform that can herald high fidelity entanglement between ions. In
this work, we design a photonic Bell-state analyzer on a reconfigurable thin-film lithium niobate platform for polarization-encoded
qubits.We optimize the device to achieve high fidelity entanglement
between two trapped ions and find >99% fidelity. Apart from
that, the directional coupler used in our design can achieve any
polarization-independent power splitting ratio which can have a
rich variety of applications in the integrated photonic technology.
The proposed device can scale up trapped ion quantum computing
as well as other optically active spin qubits, such as color centers
in diamond, quantum dots, and rare-earth ions.
Index Terms: Bell-state analyzer | thin-film lithium niobate | scalable quantum computing | trapped ions | entanglement | polarization qubits | polarization-independent directional coupler. |
مقاله انگلیسی |
2 |
Direct Quantum Communications in the Presence of Realistic Noisy Entanglement
ارتباطات کوانتومی مستقیم در حضور درهم تنیدگی پر سر و صدا واقعی-2022 To realize the Quantum Internet, quantum
communications require pre-shared entanglement among quantum nodes. However, both the generation and the distribution
of the maximally-entangled quantum states are inherently contaminated by quantum decoherence. Conventionally, the quantum
decoherence is mitigated by performing the consecutive steps of
quantum entanglement distillation followed by quantum teleportation. However, this conventional approach imposes a long delay.
To circumvent this impediment, we propose a novel quantum
communication scheme relying on realistic noisy pre-shared
entanglement, which eliminates the sequential steps imposing
delay in the standard approach. More precisely, our proposed
scheme can be viewed as a direct quantum communication
scheme capable of improving the quantum bit error ratio (QBER)
of the logical qubits despite relying on realistic noisy pre-shared
entanglement. Our performance analysis shows that the proposed
scheme offers competitive QBER, yield, and goodput compared
to the existing state-of-the-art quantum communication schemes,
despite requiring fewer quantum gates.
Index Terms: Quantum communication | quantum entanglement | quantum error-correction | quantum stabilizer codes | Quantum Internet. |
مقاله انگلیسی |
3 |
DQRA: Deep Quantum Routing Agent for Entanglement Routing in Quantum Networks
DQRA: عامل مسیریابی کوانتومی عمیق برای مسیریابی درهم تنیده در شبکه های کوانتومی-2022 Quantum routing plays a key role in the development of the next-generation network system. In
particular, an entangled routing path can be constructed with the help of quantum entanglement and swapping
among particles (e.g., photons) associated with nodes in the network. From another side of computing,
machine learning has achieved numerous breakthrough successes in various application domains, including
networking. Despite its advantages and capabilities, machine learning is not as much utilized in quantum
networking as in other areas. To bridge this gap, in this article, we propose a novel quantum routing model
for quantum networks that employs machine learning architectures to construct the routing path for the
maximum number of demands (source–destination pairs) within a time window. Specifically, we present a
deep reinforcement routing scheme that is called Deep Quantum Routing Agent (DQRA). In short, DQRA
utilizes an empirically designed deep neural network that observes the current network states to accommodate
the network’s demands, which are then connected by a qubit-preserved shortest path algorithm. The training
process of DQRA is guided by a reward function that aims toward maximizing the number of accommodated
requests in each routing window. Our experiment study shows that, on average, DQRA is able to maintain a
rate of successfully routed requests at above 80% in a qubit-limited grid network and approximately 60% in
extreme conditions, i.e., each node can be repeater exactly once in a window. Furthermore, we show that the
model complexity and the computational time of DQRA are polynomial in terms of the sizes of the quantum
networks.
INDEX TERMS: Deep learning | deep reinforcement learning (DRL) | machine learning | next-generation network | quantum network routing | quantum networks. |
مقاله انگلیسی |
4 |
Efficient Quantum Blockchain With a Consensus Mechanism QDPoS
بلاک چین کوانتومی کارآمد با مکانیزم اجماع QDPoS-2022 Quantum blockchain is expected to offer an alternative to classical blockchain to resist malicious attacks laughed by future quantum computers. Although a few quantum blockchain schemes have been constructed, their efficiency is low and unable to meet application requirements due to the fact that they lack of a suitable consensus mechanism. To tackle this issue, a consensus mechanism called quantum delegated proof of stake (QDPoS) is constructed by using quantum voting to provide fast decentralization for the quantum blockchain scheme at first. Then an efficient scheme is proposed for quantum blockchain based on QDPoS, where the classical information is initialized as a part of each single quantum state and these quantum states are entangled to form the chain. Compared with previous methods, the designed quantum blockchain scheme is more complete and carried out with higher efficiency, which greatly contributes to better adapting to the challenges of the quantum era.
Index Terms: Quantum blockchain | consensus mechanism | QDPoS | quantum voting | quantum entanglement. |
مقاله انگلیسی |
5 |
Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees
ارتباطات شبکه کوانتومی کارآمد با استفاده از درختان درهم تنیدگی بهینه-2022 Quantum network communication is challenging, as the no-cloning theorem in the quantum
regime makes many classical techniques inapplicable; in particular, the direct transmission of qubit states
over long distances is infeasible due to unrecoverable errors. For the long-distance communication of
unknown quantum states, the only viable communication approach (assuming local operations and classical
communications) is the teleportation of quantum states, which requires a prior distribution of the entangled
pairs (EPs) of qubits. The establishment of EPs across remote nodes can incur significant latency due to the
low probability of success of the underlying physical processes. The focus of our work is to develop efficient
techniques that minimize EP generation latency. Prior works have focused on selecting entanglement paths;
in contrast, we select entanglement swapping trees—a more accurate representation of the entanglement
generation structure. We develop a dynamic programming algorithm to select an optimal swapping tree for a
single pair of nodes, under the given capacity and fidelity constraints. For the general setting, we develop an
efficient iterative algorithm to compute a set of swapping trees. We present simulation results, which show
that our solutions outperform the prior approaches by an order of magnitude and are viable for long-distance
entanglement generation.
INDEX TERMS: Quantum communications | quantum networks (QNs). |
مقاله انگلیسی |
6 |
EntangleNetSat: A Satellite-Based Entanglement Resupply Network
-2022 In the practical context of quantum networks, quantum teleportation plays a key role in
transmitting quantum information. In the process of teleportation, a maximally entangled pair is consumed.
Through this paper, an efficient scheme of re-establishing entanglement between different nodes in a
quantum network is explored. A hybrid land-satellite network is considered, where the land-based links
are used for short-range communication, and the satellite links are used for transmissions between distant
nodes. This new scheme explores many different possibilities of resupplying the land nodes with entangled
pairs, depending on: the position of the satellites, the number of pairs available and the distance between
the nodes themselves. As to make the entire process as efficient as possible, we consider the situations of
direct transmissions of entangled photons and also the transmissions making use of entanglement swapping.
An analysis is presented for concrete scenarios, sustained by numerical data.
INDEX TERMS: Quantum communication | entanglement | teleportation | entanglement swapping | routing scheme | satellite. |
مقاله انگلیسی |
7 |
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
اثبات های آنتروپیک کرانه های سینگلتون برای کدهای تصحیح خطای کوانتومی-2022 We show that a relatively simple reasoning using
von Neumann entropy inequalities yields a robust proof of the
quantum Singleton bound for quantum error-correcting codes
(QECC). For entanglement-assisted quantum error-correcting
codes (EAQECC) and catalytic codes (CQECC), a type of
generalized quantum Singleton bound [Brun et al., IEEE Trans.
Inf. Theory 60(6):3073–3089 (2014)] was believed to hold for
many years until recently one of us found a counterexample
[MG, Phys. Rev. A 103, 020601 (2021)]. Here, we rectify this state
of affairs by proving the correct generalized quantum Singleton
bound, extending the above-mentioned proof method for QECC;
we also prove information-theoretically tight bounds on the
entanglement-communication tradeoff for EAQECC. All of the
bounds relate block length n and code length k for given
minimum distance d and we show that they are robust, in the
sense that they hold with small perturbations for codes which
only correct most of the erasure errors of less than d letters.
In contrast to the classical case, the bounds take on qualitatively
different forms depending on whether the minimum distance
is smaller or larger than half the block length. We also provide a propagation rule: any pure QECC yields an EAQECC
with the same distance and dimension, but of shorter block
length.
Index Terms: Quantum codes | quantum entanglement | singleton bound. |
مقاله انگلیسی |
8 |
Fuzzy Logic on Quantum Annealers
منطق فازی در آنیل های کوانتومی-2022 Quantum computation is going to revolutionize the world of
computing by enabling the design of massive parallel algorithms that solve
hard problems in an efficient way, thanks to the exploitation of quantum
mechanics effects, such as superposition, entanglement, and interference.
These computational improvements could strongly influence the way how
fuzzy systems are designed and used in contexts, such as Big Data, where
computational efficiency represents a nonnegligible constraint to be taken
into account. In order to pave the way toward this innovative scenario,
this article introduces a novel representation of fuzzy sets and operators
based on quadratic unconstrained binary optimization problems, so as to
enable the implementation of fuzzy inference engines on a type of quantum
computers known as quantum annealers.
Index Terms: Fuzzy logic | quantum computing | simulated annealing. |
مقاله انگلیسی |
9 |
General Mixed-State Quantum Data Compression With and Without Entanglement Assistance
فشرده سازی داده های کوانتومی حالت مخلوط عمومی با و بدون کمک درهم تنیدگی-2022 We consider the most general finite-dimensional
quantum mechanical information source, which is given by a
quantum system A that is correlated with a reference system R.
The task is to compress A in such a way as to reproduce the
joint source state ρAR at the decoder with asymptotically high
fidelity. This includes Schumacher’s original quantum source
coding problem of a pure state ensemble and that of a single
pure entangled state, as well as general mixed state ensembles.
Here, we determine the optimal compression rate (in qubits per
source system) in terms of the Koashi-Imoto decomposition of
the source into a classical, a quantum, and a redundant part.
The same decomposition yields the optimal rate in the presence
of unlimited entanglement between compressor and decoder, and
indeed the full region of feasible qubit-ebit rate pairs.
keywords: Quantum information | source coding | entanglement. |
مقاله انگلیسی |
10 |
Hybrid CV-DV Quantum Communications and Quantum Networks
ارتباطات کوانتومی ترکیبی CV-DV و شبکه های کوانتومی-2022 Quantum information processing (QIP) opens new opportunities for high-performance
computing, high-precision sensing, and secure communications. Among various QIP features, the entanglement is a unique one. To take full advantage of quantum resources, it will be necessary to interface quantum
systems based on different encodings of information both discrete and continuous. The goal of this paper
is to lay the groundwork for the development of a robust and efficient hybrid continuous variable-discrete
variable (CV-DV) quantum network, enabling the distribution of a large number of entangled states over
hybrid DV-CV multi-hop nodes in an arbitrary topology. The proposed hybrid quantum communication
network (QCN) can serve as the backbone for a future quantum Internet, thus providing extensive longterm impacts on the economy and national security through QIP, distributed quantum computing, quantum
networking, and distributed quantum sensing. By employing the photon addition and photon subtraction
modules we describe how to generate the hybrid DV-CV entangled states and how to implement their
teleportation and entanglement swapping through entangling measurements. We then describe how to
extend the transmission distance between nodes in hybrid QCN by employing macroscopic light states,
noiseless amplification, and reconfigurable quantum LDPC coding. We further describe how to enable
quantum networking and distributed quantum computing by employing the deterministic cluster state
concept introduced here. Finally, we describe how the proposed hybrid CV-DV states can be used in an
entanglement-based hybrid QKD.
INDEX TERMS: Entanglement | photon addition | photon subtraction | hybrid CV-DV entangled states | teleportation | entanglement swapping | entanglement distribution | hybrid quantum communication networks | entanglement-based hybrid QKD. |
مقاله انگلیسی |