Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

CRC Press eBooks

Quantum Computing and Quantum Walks

Fei Yan, Liang Wen, Fangyan Dong

Published Nov 24, 2025• 0 citations
Publisher

Abstract

This chapter primarily introduces the theoretical foundations of quantum computing, provides an overview of notable quantum algorithms, and discusses their connections with classical (non-quantum) algorithms. Additionally, it explores the applications of low-dimensional quantum walks in fields such as information security and spatial search.

DOI
10.1201/9781003683902-2

Related papers

INTRODUCTION TO QUANTUM COMPUTING

Faisal Khan, Atharva Gambhir, Om Jadhav +2 more

Quantum computing represents a fundamentally new paradigm in information processing, in which information is encoded and manipulated using two-level quantum systems known as qubits, whose evolution is governed by the principles of quantum mechanics. This chapter presents a structured introduction to the theoretical foundations of quantum computation, beginning with the limitations of classical computation and the physical constraints that motivate the need for a quantum model of computation. We develop the mathematical framework required to describe quantum information, introducing qubits as state vectors in Hilbert space and examining the roles of superposition, measurement, and unitary evolution. Single-qubit operations are presented through the Pauli and Hadamard gates, along with their geometric interpretation on the Bloch sphere. Building on this formalism, the discussion is extended to multi-qubit systems using tensor products, and quantum entanglement is introduced as a non-classical correlation fundamental to quantum information processing. The chapter then explores quantum algorithms, focusing on Grover’s unstructured search algorithm, to demonstrate how superposition, interference, and entanglement can be harnessed to achieve computational advantages over classical approaches. Finally, the chapter discusses applications of quantum computation, including quantum simulation, cryptography, search and optimization problems, and near-term hybrid quantum algorithms such as the Variational Quantum Eigensolver (VQE)and the Quantum Approximate Optimization (QAO) Algorithm, highlighting their relevance in the noisy intermediate-scale quantum (NISQ) era.

Iterative International Publishers eBooks•Jun 1, 2026•0 citations

An Overview of Quantum Computing for Technology Managers

Eleanor Gilbert Rieffel

Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum algorithms perform a select set of tasks vastly more efficiently than any classical algorithm, but for many tasks it has been proved that quantum algorithms provide no advantage. The breadth of quantum computing applications is still being explored. Major application areas include security and the many fields that would benefit from efficient quantum simulation. The quantum information processing viewpoint provides insight into classical algorithmic issues as well as a deeper understanding of entanglement and other non-classical aspects of quantum physics. This overview is aimed at technology managers who wish to gain a high level understanding of quantum information processing, particularly quantum computing.

arXiv:0804.2264•Apr 14, 2008•5 citations

Foundational Theory of Quantum Walks

Fei Yan, Liang Wen, Fangyan Dong

This chapter presents the quantum walks on regular graphs (including low-dimensional discrete-time quantum walks, one-dimensional continuous-time quantum walks, and related variants) as well as quantum walks on complex networks. It provides a general framework for describing and defining quantum walk algorithms on complex networks.

CRC Press eBooks•Nov 24, 2025•0 citations

Introduction to Quantum Computing

Shilpa Mehta, Celestine Iwendi

Quantum computing is one of the emerging fields that combines the principles of quantum mechanics with computer science. The focus of this chapter is to provide readers with a detailed introduction to quantum computing by describing the fundamental concepts that differentiate quantum computing from classical computing. Moreover, the chapter provides an overview of quantum gates followed by quantum algorithms. Various hardware and software platforms are also explored in the chapter to provide readers with information on available quantum hardware and software platforms for exploration and research purposes. Some of the important applications are also covered in the chapter, and the current state-of-the-art section depicts problems that have been successfully resolved upon utilization of quantum computing approaches and what are the benefits and shortcomings of such approaches. The chapter concludes with a summary and provides a point of view on future directions.

Wiley eBooks•Jan 9, 2026•0 citations

A Review on Models and Applications of Quantum Computing

Eduard Grigoryan, Sachin Kumar, Plácido Rogério Pinheiro

This manuscript is intended for readers who have a general interest in the subject of quantum computation and provides an overview of the most significant developments in the field. It begins by introducing foundational concepts from quantum mechanics—such as superposition, entanglement, and the no-cloning theorem—that underpin quantum computation. The primary computational models are discussed, including gate-based (circuit) quantum computing, adiabatic quantum computing, measurement-based quantum computing and the quantum Turing machine. A selection of significant quantum algorithms are reviewed, notably Grover’s search algorithm, Shor’s factoring algorithm, and Quantum Singular Value Transformation (QSVT), which enables efficient solutions to linear algebra problems on quantum devices. To assess practical performance, we compare quantum and classical implementations of support vector machines (SVMs) using several synthetic datasets. These experiments offer insight into the capabilities and limitations of near-term quantum classifiers relative to classical counterparts. Finally, we review leading quantum programming platforms—including Qiskit, PennyLane, and Cirq—and discuss their roles in bridging theoretical models with real-world quantum hardware. The paper aims to provide a concise yet comprehensive guide for those looking to understand both the theoretical foundations and applied aspects of quantum computing.

Quantum Reports•Sep 4, 2025•10 citations

Quantum Algorithms and Applications

Dhairyya Agarwal, D Shalini, Srinjoy Ganguly

In the previous chapter, we discussed the basics of quantum computing and some essential properties such as superposition, entanglement, and the Uncertainty Principle. In this chapter, we will discuss a few prominent quantum algorithms and their applications.

Apress eBooks•Jan 1, 2023•1 citation
This chapter primarily introduces the theoretical foundations of quantum computing, provides an overview of notable quantum algorithms, and discusses their connections with classical (non-quantum) algorithms. Additionally, it explores the applications of low-dimensional quantum walks in fields such as information security and spatial search.
Quantum computing represents a fundamentally new paradigm in information processing, in which information is encoded and manipulated using two-level quantum systems known as qubits, whose evolution is governed by the principles of quantum mechanics. This chapter presents a structured introduction to the theoretical foundations of quantum computation, beginning with the limitations of classical computation and the physical constraints that motivate the need for a quantum model of computation. We develop the mathematical framework required to describe quantum information, introducing qubits as state vectors in Hilbert space and examining the roles of superposition, measurement, and unitary evolution. Single-qubit operations are presented through the Pauli and Hadamard gates, along with their geometric interpretation on the Bloch sphere. Building on this formalism, the discussion is extended to multi-qubit systems using tensor products, and quantum entanglement is introduced as a non-classical correlation fundamental to quantum information processing. The chapter then explores quantum algorithms, focusing on Grover’s unstructured search algorithm, to demonstrate how superposition, interference, and entanglement can be harnessed to achieve computational advantages over classical approaches. Finally, the chapter discusses applications of quantum computation, including quantum simulation, cryptography, search and optimization problems, and near-term hybrid quantum algorithms such as the Variational Quantum Eigensolver (VQE)and the Quantum Approximate Optimization (QAO) Algorithm, highlighting their relevance in the noisy intermediate-scale quantum (NISQ) era.
Faster algorithms, novel cryptographic mechanisms, and alternative methods of communication become possible when the model underlying information and computation changes from a classical mechanical model to a quantum mechanical one. Quantum algorithms perform a select set of tasks vastly more efficiently than any classical algorithm, but for many tasks it has been proved that quantum algorithms provide no advantage. The breadth of quantum computing applications is still being explored. Major application areas include security and the many fields that would benefit from efficient quantum simulation. The quantum information processing viewpoint provides insight into classical algorithmic issues as well as a deeper understanding of entanglement and other non-classical aspects of quantum physics. This overview is aimed at technology managers who wish to gain a high level understanding of quantum information processing, particularly quantum computing.
Quantum computing is one of the emerging fields that combines the principles of quantum mechanics with computer science. The focus of this chapter is to provide readers with a detailed introduction to quantum computing by describing the fundamental concepts that differentiate quantum computing from classical computing. Moreover, the chapter provides an overview of quantum gates followed by quantum algorithms. Various hardware and software platforms are also explored in the chapter to provide readers with information on available quantum hardware and software platforms for exploration and research purposes. Some of the important applications are also covered in the chapter, and the current state-of-the-art section depicts problems that have been successfully resolved upon utilization of quantum computing approaches and what are the benefits and shortcomings of such approaches. The chapter concludes with a summary and provides a point of view on future directions.
This manuscript is intended for readers who have a general interest in the subject of quantum computation and provides an overview of the most significant developments in the field. It begins by introducing foundational concepts from quantum mechanics—such as superposition, entanglement, and the no-cloning theorem—that underpin quantum computation. The primary computational models are discussed, including gate-based (circuit) quantum computing, adiabatic quantum computing, measurement-based quantum computing and the quantum Turing machine. A selection of significant quantum algorithms are reviewed, notably Grover’s search algorithm, Shor’s factoring algorithm, and Quantum Singular Value Transformation (QSVT), which enables efficient solutions to linear algebra problems on quantum devices. To assess practical performance, we compare quantum and classical implementations of support vector machines (SVMs) using several synthetic datasets. These experiments offer insight into the capabilities and limitations of near-term quantum classifiers relative to classical counterparts. Finally, we review leading quantum programming platforms—including Qiskit, PennyLane, and Cirq—and discuss their roles in bridging theoretical models with real-world quantum hardware. The paper aims to provide a concise yet comprehensive guide for those looking to understand both the theoretical foundations and applied aspects of quantum computing.