با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
Internet of Things-enabled Passive Contact Tracing in Smart Cities
ردیابی تماس غیرفعال با قابلیت اینترنت اشیا در شهرهای هوشمند-2022 Contact tracing has been proven an essential practice during pandemic outbreaks and is a
critical non-pharmaceutical intervention to reduce mortality rates. While traditional con-
tact tracing approaches are gradually being replaced by peer-to-peer smartphone-based
systems, the new applications tend to ignore the Internet-of-Things (IoT) ecosystem that is
steadily growing in smart city environments. This work presents a contact tracing frame-
work that logs smart space users’ co-existence using IoT devices as reference anchors. The
design is non-intrusive as it relies on passive wireless interactions between each user’s
carried equipment (e.g., smartphone, wearable, proximity card) with an IoT device by uti-
lizing received signal strength indicators (RSSI). The proposed framework can log the iden-
tities for the interacting pair, their estimated distance, and the overlapping time duration.
Also, we propose a machine learning-based infection risk classification method to char-
acterize each interaction that relies on RSSI-based attributes and contact details. Finally,
the proposed contact tracing framework’s performance is evaluated through a real-world
case study of actual wireless interactions between users and IoT devices through Bluetooth
Low Energy advertising. The results demonstrate the system’s capability to accurately cap-
ture contact between mobile users and assess their infection risk provided adequate model
training over time.
© 2021 Elsevier B.V. All rights reserved. keywords: بلوتوث کم انرژی | ردیابی تماس | اینترنت اشیا | طبقه بندی خطر عفونت | Bluetooth Low Energy | Contact Tracing | Internet of Things | Infection Risk Classification |
مقاله انگلیسی |
2 |
Discriminating Quantum States in the Presence of a Deutschian CTC: A Simulation Analysis
حالت های کوانتومی متمایز در حضور CTC Deutschian: یک تحلیل شبیه سازی-2022 In an article published in 2009, Brun et al. proved that in the presence of a “Deutschian”
closed timelike curve, one can map K distinct nonorthogonal states (hereafter, input set) to the standard
orthonormal basis of a K-dimensional state space. To implement this result, the authors proposed a quantum
circuit that includes, among SWAP gates, a fixed set of controlled operators (boxes) and an algorithm for
determining the unitary transformations carried out by such boxes. To our knowledge, what is still missing
to complete the picture is an analysis evaluating the performance of the aforementioned circuit from an
engineering perspective. The objective of this article is, therefore, to address this gap through an in-depth
simulation analysis, which exploits the approach proposed by Brun et al. in 2017. This approach relies on
multiple copies of an input state, multiple iterations of the circuit until a fixed point is (almost) reached. The
performance analysis led us to a number of findings. First, the number of iterations is significantly high even
if the number of states to be discriminated against is small, such as 2 or 3. Second, we envision that such
a number may be shortened as there is plenty of room to improve the unitary transformation acting in the
aforementioned controlled boxes. Third, we also revealed a relationship between the number of iterations
required to get close to the fixed point and the Chernoff limit of the input set used: the higher the Chernoff
bound, the smaller the number of iterations. A comparison, although partial, with another quantum circuit
discriminating the nonorthogonal states, proposed by Nareddula et al. in 2018, is carried out and differences
are highlighted.
INDEX TERMS: Benchmarking and performance characterization | classical simulation of quantum systems. |
مقاله انگلیسی |
3 |
Efficient Floating Point Arithmetic for Quantum Computers
محاسبات ممیز شناور کارآمد برای کامپیوترهای کوانتومی-2022 One of the major promises of quantum computing is the realization of SIMD (single
instruction - multiple data) operations using the phenomenon of superposition. Since the dimension of the
state space grows exponentially with the number of qubits, we can easily reach situations where we pay less
than a single quantum gate per data point for data-processing instructions, which would be rather expensive
in classical computing. Formulating such instructions in terms of quantum gates, however, still remains
a challenging task. Laying out the foundational functions for more advanced data-processing is therefore a
subject of paramount importance for advancing the realm of quantum computing. In this paper, we introduce
the formalism of encoding so called-semi-boolean polynomials. As it turns out, arithmetic Z=2nZ ring
operations can be formulated as semi-boolean polynomial evaluations, which allows convenient generation
of unsigned integer arithmetic quantum circuits. For arithmetic evaluations, the resulting algorithm has been
known as Fourier-arithmetic. We extend this type of algorithm with additional features, such as ancillafree in-place multiplication and integer coefficient polynomial evaluation. Furthermore, we introduce a
tailor-made method for encoding signed integers succeeded by an encoding for arbitrary floating-point
numbers. This representation of floating-point numbers and their processing can be applied to any quantum algorithm that performs unsigned modular integer arithmetic. We discuss some further performance
enhancements of the semi boolean polynomial encoder and finally supply a complexity estimation. The
application of our methods to a 32-bit unsigned integer multiplication demonstrated a 90% circuit depth
reduction compared to carry-ripple approaches.
INDEX TERMS: Quantum arithmetic | quantum computing | floating point arithmetic. |
مقاله انگلیسی |
4 |
Tuning of grayscale computer vision systems
تنظیم سیستم های بینایی کامپیوتری در مقیاس خاکستری-2022 Computer vision systems perform based on their design and parameter setting. In computer vision systems
that use grayscale conversion, the conversion of RGB images to a grayscale format influences performance of
the systems in terms of both results quality and computational costs. Appropriate setting of the weights for
the weighted means grayscale conversion, co-estimated with other parameters used in the computer vision
system, helps to approach the desired performance of a system or its subsystem at the cost of a negligible or
no increase in its time-complexity. However, parameter space of the system and subsystem as extended by the
grayscale conversion weights can contain substandard settings. These settings show strong sensitivity of the
system and subsystem to small changes in the distribution of data in a color space of the processed images.
We developed a methodology for Tuning of the Grayscale computer Vision systems (TGV) that exploits the
advantages while compensating for the disadvantages of the weighted means grayscale conversion. We show
that the TGV tuning improves computer vision system performance by up to 16% in the tested case studies.
The methodology provides a universally applicable solution that merges the utility of a fine-tuned computer
vision system with the robustness of its performance against variable input data.
keywords: Computer vision | Parameter optimization | Performance evaluation | WECIA graph | Weighted means grayscale conversion |
مقاله انگلیسی |
5 |
EP-PQM: Efficient Parametric Probabilistic Quantum Memory With Fewer Qubits and Gates
EP-PQM: حافظه کوانتومی احتمالی پارامتریک کارآمد با کیوبیت ها و گیت های کمتر-2022 Machine learning (ML) classification tasks can be carried out on a quantum computer (QC)
using probabilistic quantum memory (PQM) and its extension, parametric PQM (P-PQM), by calculating
the Hamming distance between an input pattern and a database of r patterns containing z features with
a distinct attributes. For PQM and P-PQM to correctly compute the Hamming distance, the feature must
be encoded using one-hot encoding, which is memory intensive for multiattribute datasets with a > 2. We
can represent multiattribute data more compactly by replacing one-hot encoding with label encoding; both
encodings yield the same Hamming distance. Implementing this replacement on a classical computer is
trivial. However, replacing these encoding schemes on a QC is not straightforward because PQM and P-PQM
operate at the bit level, rather than at the feature level (a feature is represented by a binary string of 0’s and
1’s). We present an enhanced P-PQM, called efficient P-PQM (EP-PQM), that allows label encoding of data
stored in a PQM data structure and reduces the circuit depth of the data storage and retrieval procedures.
We show implementations for an ideal QC and a noisy intermediate-scale quantum (NISQ) device. Our
complexity analysis shows that the EP-PQM approach requires O(z log2(a)) qubits as opposed to O(za)
qubits for P-PQM. EP-PQM also requires fewer gates, reducing gate count from O(rza) to O(rz log2(a)).
For five datasets, we demonstrate that training an ML classification model using EP-PQM requires 48% to
77% fewer qubits than P-PQM for datasets with a > 2. EP-PQM reduces circuit depth in the range of 60% to
96%, depending on the dataset. The depth decreases further with a decomposed circuit, ranging between 94%
and 99%. EP-PQM requires less space; thus, it can train on and classify larger datasets than previous PQM
implementations on NISQ devices. Furthermore, reducing the number of gates speeds up the classification
and reduces the noise associated with deep quantum circuits. Thus, EP-PQM brings us closer to scalable ML
on an NISQ device.
INDEX TERMS: Efficient encoding | label encoding | quantum memory. |
مقاله انگلیسی |
6 |
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits
شبکه های اپسیلون، طرح های واحد و مدارهای کوانتومی تصادفی-2022 Epsilon-nets and approximate unitary t-designs are
natural notions that capture properties of unitary operations
relevant for numerous applications in quantum information
and quantum computing. In this work we study quantitative
connections between these two notions. Specifically, we prove
that, for d dimensional Hilbert space, unitaries constituting
δ-approximate t-expanders form -nets for t d5/2 and δ
3d/2 d2. We also show that for arbitrary t, -nets can be used
to construct δ-approximate unitary t-designs for δ t, where
the notion of approximation is based on the diamond norm.
Finally, we prove that the degree of an exact unitary t design
necessary to obtain an -net must grow at least as fast as 1 (for
fixed dimension) and not slower than d2 (for fixed ). This shows
near optimality of our result connecting t-designs and nets.
We apply our findings in the context of quantum computing.
First, we show that that approximate t-designs can be generated
by shallow random circuits formed from a set of universal twoqudit gates in the parallel and sequential local architectures
considered in (Brandão et al., 2016). Importantly, our gate sets
need not to be symmetric (i.e., contains gates together with
their inverses) or consist of gates with algebraic entries. Second,
we consider compilation of quantum gates and prove a nonconstructive Solovay-Kitaev theorem for general universal gate
sets. Our main technical contribution is a new construction of
efficient polynomial approximations to the Dirac delta in the
space of quantum channels, which can be of independent interest.]
Index Terms: Unitary designs, epsilon nets | random quantum circuits | compilation of quantum gates | unitary channels. |
مقاله انگلیسی |
7 |
Equivalence Checking of Sequential Quantum Circuits
بررسی هم ارزی مدارهای کوانتومی متوالی-2022 We define a formal framework for equivalence
checking of sequential quantum circuits. The model we adopt
is a quantum state machine, which is a natural quantum generalization of Mealy machines. A major difficulty in checking
quantum circuits (but not present in checking classical circuits)
is that the state spaces of quantum circuits are continuums. This
difficulty is resolved by our main theorem showing that equivalence checking of two quantum Mealy machines can be done with
input sequences that are taken from some chosen basis (which are
finite) and have a length quadratic in the dimensions of the state
Hilbert spaces of the machines. Based on this theoretical result,
we develop an (and to the best of our knowledge, the first) algorithm for checking equivalence of sequential quantum circuits
with running time O(23m+5l(23m + 23l)), where m and l denote
the numbers of input and internal qubits, respectively. The complexity of our algorithm is comparable with that of the known
algorithms for checking classical sequential circuits in the sense
that both are exponential in the number of (qu)bits. Several case
studies and experiments are presented.
Index Terms: Equivalence checking | mealy machines | quantum circuits | quantum computing | sequential circuits. |
مقاله انگلیسی |
8 |
Exploring Potential Applications of Quantum Computing in Transportation Modelling
بررسی کاربردهای بالقوه محاسبات کوانتومی در مدل سازی حمل و نقل-2022 The idea that quantum effects could be harnessed
to allow faster computation was first proposed by Feynman.
As of 2020 we appear to have achieved ‘quantum supremacy’,
that is, a quantum computer that performs a given task faster
than its classical counterpart. This paper examines some possibilities opened up by potential future application of quantum
computing to transportation simulation and planning. To date,
no such research was found to exist, therefore we begin with
an introduction to quantum computing for the programmers
of transport models. We discuss existing quantum computing
research relevant to transportation, finding developments in
network analysis, shortest path computation, multi-objective
routing, optimization and calibration – of which the latter three
appear to offer the greater promise in future research. Two
examples are developed in greater detail, (1) an application of
Grover’s quantum algorithm for extracting the mean, which has
general applicability towards summarizing distributions which
are expensive to compute classically, is applied to an assignment
or betweenness model - quantum speedup is elusive in the
general case but achievable when trading speed for accuracy
for limited outputs; (2) quantum optimization is applied to an
activity-based model, giving a theoretically quadratic speedup.
Recent developments notwithstanding, implementation of quantum transportation algorithms will for the foreseeable future
remain a challenge due to space overheads imposed by the
requirement for reversible computation.
Index Terms: Quantum computing | assignment | betweenness | flows, activity models | tour models. |
مقاله انگلیسی |
9 |
Prediction of total volatile basic nitrogen (TVB-N) and 2-thiobarbituric acid (TBA) of smoked chicken thighs using computer vision during storage at 4 °C
پیشبینی کل نیتروژن بازی فرار (TVB-N) و اسید ۲-تیوباربیتوریک (TBA) ران مرغ دودی با استفاده از بینایی رایانه در طول نگهداری در دمای ۴ درجه سانتیگراد-2022 As the traditional indicators of freshness measurement of meat products, TVB-N and TBA have the disadvantage
of time-consuming, labor-intensive and destructive to the sample. The objective of this study was to investigate
the possibility of computer vision techniques to visualize the variation of TVB-N and TBA during the storage of
smoked chicken thighs. In this study, freshness indicators (TVB-N and TBA) and images of smoked chicken thighs
were obtained simultaneously every 3 days during storage at 4 ◦C. Then, the RGB color space was converted to
HSI and L*a*b* color spaces by color conversion algorithm, and the color parameters (RGB, HSI and L*a*b*)
were correlated with TVB-N and TBA, respectively, for establishing multiple regression models. Finally, visu-
alization maps of the spoilage were established by applying the multiple regression model to each pixel in the
image. The results showed that the multiple linear regression models of TBA and TVB-N based on the color
parameters L*, a*, I, S and R were well correlated (R 2 = 0.993 for TBA and R 2 = 0.970 for TVB-N). Distribution
maps of TBA and TVB-N changed color gradually from blue to red during storage, respectively. In conclusion, this
study demonstrated that distribution maps can be employed as a rapid, objective, and non-destructive method to
predict the TBA and TVB-N values of smoked chicken thighs during storage. keywords: ران مرغ دودی | بینایی کامپیوتر | خنکی | TVB-N | TBA | Smoked chicken thigh | Computer vision | Freshness |
مقاله انگلیسی |
10 |
Generalized Perfect Codes for Symmetric Classical-Quantum Channels
کدهای کامل تعمیم یافته برای کانال های متقارن کلاسیک-کوانتومی-2022 We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite dimensional complex Hilbert output space. The resulting optimality conditions depend on the channel considered and on an auxiliary state defined on the output space of the channel. For certain N -qubit classical-quantum channels, we show that codes based on a generalization of Bell states are quasi-perfect and, therefore, they feature the smallest error probability among all codes of the same block length and cardinality.
Index Terms: Classical-quantum channel | finite block length analysis | quantum meta-converse | perfect code, quasi-perfect code | quantum hypothesis testing. |
مقاله انگلیسی |