با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
Decentralization Using Quantum Blockchain: A Theoretical Analysis
تمرکززدایی با استفاده از بلاک چین کوانتومی: یک تحلیل نظری-2022 Blockchain technology has been prominent recently due to its applications in cryptocurrency. Numerous decentralized blockchain applications have been possible due to blockchains’ nature of
distributed, secured, and peer-to-peer storage. One of its technical pillars is using public-key cryptography
and hash functions, which promise a secure, pseudoanonymous, and distributed storage with nonrepudiation.
This security is believed to be difficult to break with classical computational powers. However, recent
advances in quantum computing have raised the possibility of breaking these algorithms with quantum
computers, thus, threatening the blockchains’ security. Quantum-resistant blockchains are being proposed
as alternatives to resolve this issue. Some propose to replace traditional cryptography with postquantum
cryptography—others base their approaches on quantum computer networks or quantum internets. Nonetheless, a new security infrastructure (e.g., access control/authentication) must be established before any of
these could happen. This article provides a theoretical analysis of the quantum blockchain technologies
that could be used for decentralized identity authentication. We put together a conceptual design for a
quantum blockchain identity framework and give a review of the technical evidence. We investigate its
essential components and feasibility, effectiveness, and limitations. Even though it currently has various
limitations and challenges, we believe a decentralized perspective of quantum applications is noteworthy and
likely.
INDEX TERMS: Blockchains | consensus protocol | decentralized applications | identity management systems | quantum computing | quantum networks. |
مقاله انگلیسی |
2 |
Deep Reinforcement Learning With Quantum-Inspired Experience Replay
یادگیری تقویتی عمیق با تکرار تجربه کوانتومی-2022 In this article, a novel training paradigm inspired
by quantum computation is proposed for deep reinforcement
learning (DRL) with experience replay. In contrast to the traditional experience replay mechanism in DRL, the proposed DRL
with quantum-inspired experience replay (DRL-QER) adaptively
chooses experiences from the replay buffer according to the
complexity and the replayed times of each experience (also
called transition), to achieve a balance between exploration and
exploitation. In DRL-QER, transitions are first formulated in
quantum representations and then the preparation operation
and depreciation operation are performed on the transitions.
In this process, the preparation operation reflects the relationship between the temporal-difference errors (TD-errors) and the
importance of the experiences, while the depreciation operation is
taken into account to ensure the diversity of the transitions. The
experimental results on Atari 2600 games show that DRL-QER
outperforms state-of-the-art algorithms, such as DRL-PER and
DCRL on most of these games with improved training efficiency
and is also applicable to such memory-based DRL approaches
as double network and dueling network.
Index Terms: Deep reinforcement learning (DRL) | quantum computation | quantum-inspired experience replay (QER) | quantum reinforcement learning. |
مقاله انگلیسی |
3 |
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. |
مقاله انگلیسی |
4 |
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. |
مقاله انگلیسی |
5 |
Efficient Hardware Implementation of Finite Field Arithmetic AB + C for Binary Ring-LWE Based Post-Quantum Cryptography
اجرای سخت افزار کارآمد محاسبات میدان محدود AB + C برای رمزنگاری پس کوانتومی مبتنی بر حلقه باینری-LWE-2022 Post-quantum cryptography (PQC) has gained significant attention from the community
recently as it is proven that the existing public-key cryptosystems are vulnerable to the attacks launched from
the well-developed quantum computers. The finite field arithmetic AB þ C, where A and C are integer polynomials and B is a binary polynomial, is the key component for the binary Ring-learning-with-errors (BRLWE)-
based encryption scheme (a low-complexity PQC suitable for emerging lightweight applications). In this paper,
we propose a novel hardware implementation of the finite field arithmetic AB þ C through three stages of interdependent efforts: (i) a rigorous mathematical formulation process is presented first; (ii) an efficient hardware
architecture is then presented with detailed description; (iii) a thorough implementation has also been given
along with the comparison. Overall, (i) the proposed basic structure (u ¼ 1) outperforms the existing designs,
e.g., it involves 55.9% less area-delay product (ADP) than [13] for n ¼ 512; (ii) the proposed design also offers
very efficient performance in time-complexity and can be used in many future applications.
INDEX TERMS: Binary ring-learning-with-errors | finite field arithmetic | FPGA platform | hardware design | post-quantum cryptography |
مقاله انگلیسی |
6 |
Head tremor in cervical dystonia: Quantifying severity with computer vision
لرزش سر در دیستونی دهانه رحم: کمی کردن شدت با دید کامپیوتری-2022 Background: Head tremor (HT) is a common feature of cervical dystonia (CD), usually quantified by subjective
observation. Technological developments offer alternatives for measuring HT severity that are objective and
amenable to automation.
Objectives: Our objectives were to develop CMOR (Computational Motor Objective Rater; a computer vision-
based software system) to quantify oscillatory and directional aspects of HT from video recordings during a
clinical examination and to test its convergent validity with clinical rating scales.
Methods: For 93 participants with isolated CD and HT enrolled by the Dystonia Coalition, we analyzed video
recordings from an examination segment in which participants were instructed to let their head drift to its most
comfortable dystonic position. We evaluated peak power, frequency, and directional dominance, and used
Spearman’s correlation to measure the agreement between CMOR and clinical ratings.
Results: Power averaged 0.90 (SD 1.80) deg2/Hz, and peak frequency 1.95 (SD 0.94) Hz. The dominant HT axis
was pitch (antero/retrocollis) for 50%, roll (laterocollis) for 6%, and yaw (torticollis) for 44% of participants.
One-sided t-tests showed substantial contributions from the secondary (t = 18.17, p < 0.0001) and tertiary (t =
12.89, p < 0.0001) HT axes. CMOR’s HT severity measure positively correlated with the HT item on the Toronto
Western Spasmodic Torticollis Rating Scale-2 (Spearman’s rho = 0.54, p < 0.001).
Conclusions: We demonstrate a new objective method to measure HT severity that requires only conventional
video recordings, quantifies the complexities of HT in CD, and exhibits convergent validity with clinical severity
ratings. keywords: لرزش سر | ویدیو | بینایی کامپیوتر | درجه بندی شدت | TWSTRS | Head tremor | Video | Computer vision | Severity rating | TWSTRS |
مقاله انگلیسی |
7 |
Efficient Quantum State Preparation for the Cauchy Distribution Based on Piecewise Arithmetic
آماده سازی حالت کوانتومی کارآمد برای توزیع کوشی بر اساس حساب تکه ای-2022 The benefits of the quantum Monte Carlo algorithm heavily rely on the efficiency of the
superposition state preparation. So far, most reported Monte Carlo algorithms use the Grover–Rudolph state
preparation method, which is suitable for efficiently integrable distribution functions. Consequently, most reported works are based on log-concave distributions, such as normal distributions. However, non-log-concave
distributions still have many uses, such as in financial modeling. Recently, a new method was proposed
that does not need integration to calculate the rotation angle for state preparation. However, performing
efficient state preparation is still difficult due to the high cost associated with high precision and low error
in the calculation for the rotation angle. Many methods of quantum state preparation use polynomial Taylor
approximations to reduce the computation cost. However, Taylor approximations do not work well with
heavy-tailed distribution functions that are not bounded exponentially. In this article, we present a method
of efficient state preparation for heavy-tailed distribution functions. Specifically, we present a quantum
gate-level algorithm to prepare quantum superposition states based on the Cauchy distribution, which is a
non-log-concave heavy-tailed distribution. Our procedure relies on a piecewise polynomial function instead
of a single Taylor approximation to reduce computational cost and increase accuracy. The Cauchy distribution is an even function, so the proposed piecewise polynomial contains only a quadratic term and a constant
term to maintain the simplest approximation of an even function. Numerical analysis shows that the required
number of subdomains increases linearly as the approximation error decreases exponentially. Furthermore,
the computation complexity of the proposed algorithm is independent of the number of subdomains in the
quantum implementation of the piecewise function due to quantum parallelism. An example of the proposed
algorithm based on a simulation conducted in Qiskit is presented to demonstrate its capability to perform
state preparation based on the Cauchy distribution.
INDEX TERMS: Algorithms | gate operations | quantum computing. |
مقاله انگلیسی |
8 |
Enabling Pulse-Level Programming, Compilation, and Execution in XACC
فعال کردن برنامه نویسی، کامپایل و اجرا در سطح پالس در XACC-2022 Noisy gate-model quantum processing units (QPUs) are currently available from vendors over the cloud, and digital
quantum programming approaches exist to run low-depth circuits on physical hardware. These digital representations are ultimately
lowered to pulse-level instructions by vendor quantum control systems to affect unitary evolution representative of the submitted digital
circuit. Vendors are beginning to open this pulse-level control system to the public via specified interfaces. Robust programming
methodologies, software frameworks, and backend simulation technologies for this analog model of quantum computation will prove
critical to advancing pulse-level control research and development. Prototypical use cases for this include error mitigation, optimal
pulse control, and physics-inspired pulse construction. Here we present an extension to the XACC quantum-classical software
framework that enables pulse-level programming for superconducting, gate-model quantum computers, and a novel, general, and
extensible pulse-level simulation backend for XACC that scales on classical compute clusters via MPI. Our work enables custom
backend Hamiltonian definitions and gate-level compilation to available pulses with a focus on performance and scalability. We end with
a demonstration of this capability, and show how to use XACC for pertinent pulse-level programming tasks.
Index Terms: Quantum computing | quantum programming models | quantum control | quantum simulation |
مقاله انگلیسی |
9 |
Equivalence Checking of Quantum Circuits With the ZX-Calculus
بررسی هم ارزی مدارهای کوانتومی با ZX-calculus-2022 As state-of-the-art quantum computers are capable of running increasingly complex algorithms, the need for
automated methods to design and test potential applications
rises. Equivalence checking of quantum circuits is an important,
yet hardly automated, task in the development of the quantum
software stack. Recently, new methods have been proposed that
tackle this problem from widely different perspectives. One of
them is based on the ZX-calculus, a graphical rewriting system
for quantum computing. However, the power and capability of
this equivalence checking method has barely been explored.
The aim of this work is to evaluate the ZX-calculus as a
tool for equivalence checking of quantum circuits. To this end,
it is demonstrated how the ZX-calculus based approach for
equivalence checking can be expanded in order to verify the
results of compilation flows and optimizations on quantum
circuits. It is also shown that the ZX-calculus based method
is not complete—especially for quantum circuits with ancillary
qubits. In order to properly evaluate the proposed method,
we conduct a detailed case study by comparing it to two other
state-of-the-art methods for equivalence checking: one based
on path-sums and another based on decision diagrams. The
proposed methods have been integrated into the publicly available
QCEC tool (https://github.com/cda-tum/qcec) which is
part of the Munich Quantum Toolkit (MQT).
Index Terms: Quantum computing | formal verification | quantum circuit. |
مقاله انگلیسی |
10 |
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. |
مقاله انگلیسی |