The development of quantum artificial intelligence (QAI) may lead a new computing revolution. This paper studies a model of quantum inference engine (QIE), which is a novel architecture designed to enhance quantum artificial intelligence by leveraging quantum principles. It discusses a role of the quantum superposition and entanglement in the transition from classical to quantum computational models, which surpasses the classical inference engines. The details of QIE’s structure is provided, from the quantum knowledge base to the inference mechanisms, demonstrating the capacity in the parallel processing and complex probabilistic reasoning. This research outlines the significant advancements in computational inference with the quantum technologies, especially in the era of the Noisy Intermediate-Scale Quantum (NISQ). The QIE shows its improved efficiency, scalability, and accuracy in handling intricate data and probabilistic models. The quantum inference engine will be useful for the research and applications in quantum artificial intelligence.
We study an on-chip quantum computational system with a particular scale in the presence of noise. These conditions can be summarized as “noisy intermediate-scale quantum (NISQ)”. It is a challenge to build reasonable architectures, control flows, and quantum algorithms for the noisy medium-scale quantum conditions, which are highly concern by industry. This paper proposes a quantum computing chip framework that contains both classical and quantum parts. The quantum program developers only focus on the programming design and no need to consider the details of the underlying hardware. This design maintains the transparency for a quantum computer as a classical computer.
Discrete quantum walk is one of the de facto models of quantum computation and as an efficient tool to develop quantum search algorithms. Although the theoretical model of quantum walks is straightforward, there are many complex scenarios such as coherence decay and/or decoherence in the implementations. It is hard to test experimentally if quantum walk works, or it just decays into a version of classic random walk. We propose a quantum central limit theorem (QCLT) for discrete quantum walks and conduct the statistical hypothesis testing for the standard or decayed walker probability distribution for imperfect quantum walks based on the QCLT. A reliable statistical analysis result is obtained for the imperfect distribution by the experimental quantum walk study.
We study a new methodology for quantum walk based algorithms. Different from the passive quantum walk, in which a walker is guided by a quantum walk procedure, the new framework that we developed allows the walker to move by an adiabatic procedure of quantum evolution, as an active way. The use of this active quantum walk is helpful to develop new quantum walk based searching and optimization algorithms.
We study an efficient algorithm to extract quantum random numbers (QRN) from the raw data obtained by charge-coupled device (CCD) or complementary metal-oxide semiconductor (CMOS) based sensors, like a camera used in a commercial smartphone. Based on NIST statistical test for random number generators, the proposed algorithm has a high QRN generation rate and high statistical randomness. This algorithm provides a kind of simple, low-priced and reliable devices as a QRN generator for quantum key distribution (QKD) or other cryptographic applications.
We study multi-dimension quantum walks and its dimension reduction model. By using an waveguide-based
optical quantum device, we demonstrate the quantum-walk in searching algorithms such as 2-D glued tree and
3-D hypercube graph. We discuss that the use of waveguide-based device is a good candidate to implement the
quantum walks.
The Search Based Software Engineering (SBSE) is widely used in software engineering for
identifying optimal solutions. However, there is no polynomial-time complexity solution used in
the traditional algorithms for SBSE, and that causes the cost very high. In this paper, we analyze
and compare several quantum search algorithms that could be applied for SBSE: quantum
adiabatic evolution searching algorithm, fixed-point quantum search (FPQS), quantum walks, and
a rapid modified Grover quantum searching method. The Grover’s algorithm is thought as the best
choice for a large-scaled unstructured data searching and theoretically it can be applicable to any
search-space structure and any type of searching problems.
In this paper we study an improved semantics of some basic elements in quantum computation, which can be
helpful to build quantum compiler and quantum operating system.
In our previous paper, we studied a model of location based service (LBS) in a wireless sensor network. In this
paper, we study a post-data process of the motion-trace data of an object with the proposed model, which is based
on the aforementioned model. Compared with the one which uses a single model to describe the motion traces,
the Interacting Multiple Model (IMM) with Unscented Kalman lter (UKF) provides a powerful framework
when tracking a motion object with the position service in a LBS tracking system. We study an UKF based
algorithm applied to smooth the trace of a positioned object. The implementation of the locating device and
the experiments conducted in the real applied scenarios are described in this paper.
The real-time multi-hop location system (RMLS) is a kind of service systems with a great potential in the
distributed applications. The RMLS provides the precise positioning information of each node relative to one or
more beacon node(s); and their absolute positions can be determined from the information. This paper study a
new positioning model based on the RMLS and it applies a statistical method to increase the location's precision
and enhance the robustness of a time-of-arrive(TOA)-based location system. This model has the advantage
to fix the errors caused from the non-line-of-sight (NLOS) and multi-path effect (MPE); and it could be used
to provide a reliable and stable location-based service for the applications, such as the scenes of an emergent
logistics management and a disaster-relief emergent positioning.
In this paper, we study a reliable architecture of a quantum computer and a new instruction set and machine
language for the architecture, which can improve the performance and reduce the cost of the quantum computing.
We also try to address some key issues in detail in the software-driven universal quantum computers.
We study a new realizable architecture for a universal quantum computer based on different optimized components
and computational models. Simulation demonstrates it has a higher computing efficiency compared with
others. Error correction, fault tolerance and robustness are also discussed for this architecture.
Topological quantum computation provides efficiency with fault-tolerant and error-correction to overcome decoherence
problem. Here we investigate a class of topological quantum computation device. We discuss a method
of constructing topological quantum scheme based on quantum walk for the state space.
Based on the law of quantum mechanics we present a simple authorization scheme:
Quauth. The description of the scheme is given in details. The authorization is
accomplished through a quantum channel by one way communication. We show that
eavesdropper gets no information about key no matter how many times s/he is listening
on the channel. The scheme is robust against both the passive and active attacks. By
induction we prove that the scheme is information theoretically secure.
If an eavesdropper Eve is equipped with quantum computers, she can easily break the public key exchange protocols used today. In this paper we will discuss the post-quantum Diffie-Hellman key exchange and private key exchange protocols.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.