با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
21 |
Quantum Algorithm for Fidelity Estimation
الگوریتم کوانتومی برای برآورد وفاداری-2022 For two unknown mixed quantum states ρ and σ in
an N-dimensional Hilbert space, computing their fidelity F (ρ, σ)
is a basic problem with many important applications in quantum
computing and quantum information, for example verification
and characterization of the outputs of a quantum computer,
and design and analysis of quantum algorithms. In this paper,
we propose a quantum algorithm that solves this problem in
poly(log(N ), r, 1/ε) time, where r is the lower rank of ρ and
σ, and ε is the desired precision, provided that the purifications
of ρ and σ are prepared by quantum oracles. This algorithm
exhibits an exponential speedup over the best known algorithm
(based on quantum state tomography) which has time complexity
polynomial in N. keywords: Quantum computing | quantum algorithms | quantum fidelity | quantum states. |
مقاله انگلیسی |
22 |
Quantum Radon Transforms and Their Applications
تبدیل کوانتومی رادون و کاربردهای آنها-2022 This article extends the Radon transform, a classical image-processing tool for fast tomography
and denoising, to the quantum computing platform. A new kind of periodic discrete Radon transform
(PDRT), called the quantum periodic discrete Radon transform (QPRT), is proposed. The quantum imple-
mentation of QPRT based on the amplitude encoding method is exponentially faster than the classical PDRT.
We design an efficient quantum image denoising algorithm using QPRT. The simulation results show that
QPRT preserves good denoising capability as in the classical PDRT. Also, a quantum algorithm for IDRT
is proposed, which can be used for fast line detection. Both the quantum extension of IDRT and the line
detection algorithm can provide polynomial speedups over the classical counterparts in certain cases. keywords: Quantum computing | radon transform. |
مقاله انگلیسی |
23 |
Quantum Speedup for Inferring the Value of Each Bit of a Solution State in Unsorted Databases Using a Bio-Molecular Algorithm on IBM Quantum’s Computers
سرعت کوانتومی برای استنباط ارزش هر بیت از یک حالت راه حل در پایگاه های داده مرتب نشده با استفاده از الگوریتم زیست مولکولی در رایانه های کوانتومی IBM-2022 In this paper, we propose a bio-molecular
algorithm with O(n2) biological operations, O(2n−1) DNA
strands, O(n) tubes and the longest DNA strand, O(n), for
inferring the value of a bit from the only output satisfying
any given condition in an unsorted database with 2n items
of n bits. We show that the value of each bit of the outcome
is determined by executing our bio-molecular algorithm n
times. Then, we show how to view a bio-molecular solution
space with 2n-1 DNA strands as an eigenvector and how to
find the corresponding unitary operator and eigenvalues for
inferring the value of a bit in the output. We also show that
using an extension of the quantum phase estimation and
quantum counting algorithms computes its unitary operator
and eigenvalues from bio-molecular solution space with 2n-1
DNA strands. Next, we demonstrate that the value of each bit
of the output solution can be determined by executing the
proposed extended quantum algorithms n times. To verify
our theorem, we find the maximum-sized clique to a graph
with two vertices and one edge and the solution b that
satisfies b2 ≡ 1 (mod 15) and 1 < b < (15/2) using IBM
Quantum’s backend.
Index Terms: Data structures and algorithms | molecular algorithms | quantum algorithms | NP-complete problems. |
مقاله انگلیسی |
24 |
The “Cyber Security via Determinism” Paradigm for a Quantum Safe Zero Trust Deterministic Internet of Things (IoT)
پارادایم «امنیت سایبری از طریق جبرگرایی» برای اینترنت اشیا قطعی (IoT) ایمن صفر کوانتومی-2022 The next-generation Internet of Things (IoT) will control the critical infrastructure of the 21st
century, including the Smart Power Grid and Smart Cities. It will also support Deterministic Communications, where ‘deterministic traffic flows’ (D-flows) receive strict Quality-of-Service (QoS) guarantees.
A ‘Cybersecurity via Determinism’ paradigm for the next-generation ‘Industrial and Tactile Deterministic
IoT’ is presented. A forwarding sub-layer of simple and secure ‘deterministic packet switches’ (D-switches)
is introduced into layer-3. This sub-layer supports many deterministic Software Defined Wide Area Networks
(SD-WANs), along with 3 new tools for improving cyber security: Access Control, Rate Control, and
Isolation Control. A Software Defined Networking (SDN) control-plane configures each D-switch (ie FPGA)
with multiple deterministic schedules to support D-flows. The SDN control-plane can embed millions of
isolated Deterministic Virtual Private Networks (DVPNs) into layer 3. This paradigm offers several benefits:
1) All congestion, interference, and Distributed Denial-of-Service (DDOS) attacks are removed; 2) Buffer
sizes in D-switches are reduced by 1000C times; 3) End-to-end IoT delays can be reduced to ultra-low
latencies, i.e., the speed-of-light in fiber; 4) The D-switches do not require Gigabytes of memory to store
large IP routing tables; 5) Hardware support is provided in layer 3 for the US NIST Zero Trust Architecture;
6) Packets within a DVPN can be entirely encrypted using Quantum Safe encryption, which is impervious
to attacks by Quantum Computers using existing quantum algorithms; 7) The probability of an undetected
cyberattack targeting a DVPN can be made arbitrarily small by using long Quantum Safe encryption keys;
and 8) Savings can reach $10s of Billions per year, through reduced capital, energy and operational costs.
INDEX TERMS: Cyber security | deterministic, the Internet of Things (IoT) | quantum computing, zero trust | encryption | privacy | Software Defined Networking (SDN) | industrial internet of things (IIoT) | tactile Internet of Things | FPGA | Industry 4.0 | deterministic Internet of Things. |
مقاله انگلیسی |
25 |
Timing Constraints Imposed by Classical Digital Control Systems on Photonic Implementations of Measurement-Based Quantum Computing
محدودیت های زمانی اعمال شده توسط سیستم های کنترل دیجیتال کلاسیک بر پیاده سازی فوتونیک محاسبات کوانتومی مبتنی بر اندازه گیری-2022 Most of the architectural research on photonic implementations of measurement-based quantum computing (MBQC) has focused on the quantum resources involved in the problem with the implicit
assumption that these will provide the main constraints on system scaling. However, the “flying-qubit” architecture of photonic MBQC requires specific timing constraints that need to be met by the classical control
system. This classical control includes, for example, the amplification of the signals from single-photon
detectors to voltage levels compatible with digital systems; the implementation of a control system which
converts measurement outcomes into basis settings for measuring subsequent cluster qubits, in accordance
with the quantum algorithm being implemented; and the digital-to-analog converter and amplifier systems
required to set these measurement bases using a fast phase modulator. In this article, we analyze the digital
system needed to implement arbitrary one-qubit rotations and controlled-not gates in discrete-variable
photonic MBQC, in the presence of an ideal cluster state generator, with the main aim of understanding the
timing constraints imposed by the digital logic on the analog system and quantum hardware. We have verified
the design using functional simulations and have used static timing analysis of a Xilinx field-programmable
gate array (7 series) to provide a practical upper bound on the speed at which the adaptive measurement
processing can be performed, in turn constraining the photonic clock rate of the system. The design and
testing system is freely available for use as the basis of analysis of more complex designs, incorporating more
recent proposals for photonic quantum computing. Our work points to the importance of codesigning the
classical control system in tandem with the quantum system in order to meet the challenging specifications
of a photonic quantum computer.
INDEX TERMS: Field-programmable gate array (FPGA) | measurement and feed-forward | measurement based quantum computing (MBQC) | photonic quantum computing | timing analysis. |
مقاله انگلیسی |
26 |
A comprehensive pseudonym changing scheme for improving location privacy in vehicular networks
یک طرح جامع تغییر نام مستعار برای بهبود حریم خصوصی مکان در شبکه های وسایل نقلیه-2022 In an Intelligent Transportation System (ITS), many applications, such as collision avoidance
and lane change warning, require real-time information from vehicles on the road. This typically
includes detailed status information such as location, speed, heading and a vehicle identifier,
which can be used to infer precise movement patterns leading to long-term driver profiling
and vehicle tracking. The use of pseudonyms, instead of actual vehicle IDs, allows vehicles
to protect their privacy while sharing relevant information. A pseudonym changing scheme
(PCS) determines when and how a vehicle should change its pseudonyms to maintain an
appropriate privacy level. In this paper, we propose a new comprehensive PCS that utilizes
vehicle context and current traffic patterns to leverage the optimum situation for changing
pseudonyms. Simulation results indicate that the proposed PCS outperforms existing approaches
both in terms of user-centric and adversary-centric performance metrics.
Keywords: Location privacy | Pseudonym changing scheme | VANET | V2V communication | Context-aware |
مقاله انگلیسی |
27 |
An investigation of the transmission success in Lorawan enabled IoT-HAPS communication
An investigation of the transmission success in Lorawan enabled IoT-HAPS communication-2022 As the communication and aviation technology expand, High altitude platform stations (HAPS)
are increasingly gaining a wider usage area in modern Internet of Things (IoT) deployments. One
of the areas in which HAPS can be effectively utilized is the wide area deployment of sensors
that require a costly data acquisition effort in terms of transportation and communication access.
Aerial communication using a low-energy technology such as LoRa can provide significant
advantages in such scenarios. Our work models and simulates LoRAWAN communication in
utilizing HAPS in data acquisition over a large distribution span of IoT devices/sensors. We
conduct experiments on various different scenarios including changing number of devices,
span area, HAPS speed and LoRa duty cycle to draw conclusions about how each of these
parameters affect communication quality. Results of the simulation are used in regression
analysis of equation factors to calculate the expected transmission performance under different
experimental setups. Our results (and simulation code) can be used to reason about certain
properties of IoT deployment (such as sensor count, sensor distribution area, HAPS speed, etc.)
before the real deployment is done in LoRaWAN enabled IoT-HAPS communication.
keywords: High altitude platform station communication | LoRaWAN communication | Wide-area sensor network | IoT deployment simulation | Communication quality estimation |
مقاله انگلیسی |
28 |
An IoT-enabled intelligent automobile system for smart cities
یک سیستم خودروی هوشمند مجهز به اینترنت اشیا برای شهرهای هوشمند-2022 In our world of advancing technologies, automobiles are one industry where we can see
improved ergonomics and feature progressions. Artificial Intelligence (AI) integrated with
Internet of Things (IoT) is the future of most of the cutting-edge applications developed
for automobile industry to enhance performance and safety. The objective of this research
is to develop a new feature that can enhance the existing technology present in automo-
biles at low-cost. We had previously developed a technology known as Smart Accident
Precognition System (SAPS) which reduces the rate of accidents in automobile and also
enhance the safety of the passengers. Current research advances this technique by inte-
grating Google Assistant with the SAPS. The proposed system integrates several embedded
devices in the automobiles that monitor various aspects such as speed, distance, safety
measures like seatbelt, door locks, airbags, handbrakes etc. The real-time data is stored in
the cloud and the vehicle can adapt to various situations from the previous data collected.
Also, with the Google Assistant user can lock and unlock, start and stop, alert and do var-
ious automated tasks such as low fuel remainder, insurance remainders etc. The proposed
IoT enabled real-time vehicle system can detect accidents and adapt to change according
to various conditions. Further, with RFID keyless entry authentication the vehicle is secure
than ever before. This proposed system is much efficient to the existing systems and will
have a great positive impact in the automobile industry and society.
© 2020 Elsevier B.V. All rights reserved. keywords: هوش مصنوعی | سیستم هوشمند خودرو | اینترنت اشیا | شهرهای هوشمند | سیستم هوشمند | Artificial intelligence | Intelligent automobile system | Internet of Things | Smart Cities | Smart System |
مقاله انگلیسی |
29 |
An R-Convolution Graph Kernel Based on Fast Discrete-Time Quantum Walk
یک هسته گراف R-Convolution بر اساس راه رفتن کوانتومی سریع زمان گسسته -2022 In this article, a novel R-convolution kernel,
named the fast quantum walk kernel (FQWK), is proposed
for unattributed graphs. In FQWK, the similarity of the
neighborhood-pair substructure between two nodes is measured
via the superposition amplitude of quantum walks between
those nodes. The quantum interference in this kind of local
substructures provides more information on the substructures so
that FQWK can capture finer-grained local structural features
of graphs. In addition, to efficiently compute the transition
amplitudes of multistep discrete-time quantum walks, a fast
recursive method is designed. Thus, compared with all the
existing kernels based on the quantum walk, FQWK has the
highest computation speed. Extensive experiments demonstrate
that FQWK outperforms state-of-the-art graph kernels in terms
of classification accuracy for unattributed graphs. Meanwhile,
it can be applied to distinguish a larger family of graphs, including cospectral graphs, regular graphs, and even strong regular
graphs, which are not distinguishable by classical walk-based
methods.
Index Terms: Discrete-time quantum walk (DTQW) | graph classification | graph kernel | R-convolution kernel. |
مقاله انگلیسی |
30 |
A Multiscale Simulation Approach for Germanium-Hole-Based Quantum Processor
یک رویکرد شبیه سازی چند مقیاسی برای پردازنده کوانتومی مبتنی بر حفره ژرمانیوم-2022 A multiscale simulation method is developed to
model a quantum dot (QD) array of germanium (Ge) holes for
quantum computing. Guided by three-dimensional numerical
quantum device simulations of QD structures, an analytical model
of the tunnel coupling between the neighboring hole QDs is
obtained. Two-qubit entangling quantum gate operations and
quantum circuit characteristics of the QD array processor are
then modeled. Device analysis of two-qubit Ge hole quantum gates
demonstrates faster gate speed, smaller process variability, and
less stringent requirement of feature size, compared to its silicon
counterpart. The multiscale simulation method allows assessment
of the quantum processor circuit performance from a bottom-up,
physics-informed perspective. Application of the simulation
method to the Ge QD array processor indicates its promising
potential for preparing high-fidelity ansatz states in quantum
chemistry simulations.
keywords: Quantum computing | Germanium | Hole | Quantum dot | Quantum gate | Multiscale simulation |
مقاله انگلیسی |