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

Apress eBooks

The Qubit and Quantum State

Johnny Hooyberghs

Published Dec 8, 2021• 0 citations
Publisher

Abstract

Now that you have a basic idea on what quantum computing is all about, let’s dive a little deeper into the logical qubit, its implementation, and the actual quantum state it should represent.
DOI
10.1007/978-1-4842-7246-6_2

Related papers

Quantum information processing

Benjamin W. Schumacher, Michael D. Westmoreland

Quantum circuits If the state of a quantum system is a kind of information, then the dynamics of that system is a kind of information processing. This is the basic idea behind quantum computing , which seeks to exploit the physics of quantum systems to do useful information processing. In this chapter we will acquaint ourselves with a few of the ideas of quantum computing, using the idealized quantum circuit model. Then we will turn our attention to an actual quantum process, nuclear magnetic resonance , that can be understood as a realization of quantum information processing. In a quantum circuit, we have a set of n qubit systems whose dynamical evolution is completely under our control. We represent the evolution as a sequence of unitary operators, each of which acts on one or more of the qubits. Graphically, we represent the qubits as a set of horizontal lines, and the various stages of their evolution as a series of boxes or other symbols showing the structure of the sequence of operations. In such a diagram, time runs from left to right (see Fig. 18.1.). The n qubits form a kind of “computer,” and its overall evolution amounts to a “computation.” The key idea is that very complicated unitary operations on the n qubits can be built up step-by-step from many simple operations on one, two or a few qubits.

Cambridge University Press eBooks•Mar 25, 2010•1 citation

Introduction to Quantum Bits and Quantum Gates on IBM’s Quantum Computer

Weng-Long Chang, Athanasios V. Vasilakos

Studies in big data•Dec 21, 2020•0 citations

3. Quantum computing, qubits and decoherence

Hendrik Bluhm

De Gruyter eBooks•Mar 16, 2019•0 citations

Introduction to Quantum Computing for Beginners: A Conceptual Comparison with Classical Computing

Kwabena Mensah Sarpong

Quantum computing is an emerging paradigm of computing that represents and processes informationusing the principles of quantum mechanics, with its operation fundamentally different fromclassical systems. As it gains popularity and as interest in it grows across computer science andengineering, many who may wish to dive into the field encounter introductory resources that areoften either too mathematically demanding or too vague. This paper places attention on conceptuallearning and intuitive understanding by providing a clear accessible introduction to the field ofquantum computing without any advanced formal derivations. Using natural language, the bedrockideas such as superposition, entanglement, measurement, qubits, and quantum gates are unfoldedwith little mathematics, including a well-constructed comparison between the respective advantagesof classical and quantum computing. A short Qisit example is also included to demonstratereal-world uses of these ideas. Even as a beginner familiar with only classical computing and highschool-level mathematics, this material is aimed at you. This paper functions as an instructionalpathway that helps its readers to move from their existing knowledge of classical computing intoquantum computing, while still acknowledging the current technological limitations.

•Dec 24, 2025•0 citations

One-step implementation of a deterministic SWAP gate via a shortcut to adiabatic passage

Chun‐Ling Zhang, Mei Lu, Cheng-Li Luo +1 more

Abstract The quantum logic gate is a basic operation in quantum computing. SWAP gates are quite useful as a type of two-qubit logic gate. In this paper, we propose a fast scheme to get a deterministic SWAP gate between two atoms in just one step. In this scheme the experimental parameters, such as evolution time, laser parameters and so on, do not need to be controlled precisely. This greatly simplifies the actual operation. Meanwhile, the strict numerical simulations show that decoherence arising from spontaneous emission and cavity decay may be allowed to some extent. What is more, the idea can be used to generate a SWAP gate between two spatially separate atoms. It is worth noting that our scheme simplifies the complex steps found in some pre-existing schemes.

Laser Physics Letters•Jan 17, 2019•6 citations

BASICS OF QUANTUM COMPUTING

Dr. Anand Kumar Pandey, Mrs. Rashmi Pandey

BASICS OF QUANTUM COMPUTING

•Apr 27, 2023•1 citation
Quantum circuits If the state of a quantum system is a kind of information, then the dynamics of that system is a kind of information processing. This is the basic idea behind quantum computing , which seeks to exploit the physics of quantum systems to do useful information processing. In this chapter we will acquaint ourselves with a few of the ideas of quantum computing, using the idealized quantum circuit model. Then we will turn our attention to an actual quantum process, nuclear magnetic resonance , that can be understood as a realization of quantum information processing. In a quantum circuit, we have a set of n qubit systems whose dynamical evolution is completely under our control. We represent the evolution as a sequence of unitary operators, each of which acts on one or more of the qubits. Graphically, we represent the qubits as a set of horizontal lines, and the various stages of their evolution as a series of boxes or other symbols showing the structure of the sequence of operations. In such a diagram, time runs from left to right (see Fig. 18.1.). The n qubits form a kind of “computer,” and its overall evolution amounts to a “computation.” The key idea is that very complicated unitary operations on the n qubits can be built up step-by-step from many simple operations on one, two or a few qubits.
Quantum computing is an emerging paradigm of computing that represents and processes informationusing the principles of quantum mechanics, with its operation fundamentally different fromclassical systems. As it gains popularity and as interest in it grows across computer science andengineering, many who may wish to dive into the field encounter introductory resources that areoften either too mathematically demanding or too vague. This paper places attention on conceptuallearning and intuitive understanding by providing a clear accessible introduction to the field ofquantum computing without any advanced formal derivations. Using natural language, the bedrockideas such as superposition, entanglement, measurement, qubits, and quantum gates are unfoldedwith little mathematics, including a well-constructed comparison between the respective advantagesof classical and quantum computing. A short Qisit example is also included to demonstratereal-world uses of these ideas. Even as a beginner familiar with only classical computing and highschool-level mathematics, this material is aimed at you. This paper functions as an instructionalpathway that helps its readers to move from their existing knowledge of classical computing intoquantum computing, while still acknowledging the current technological limitations.
Abstract The quantum logic gate is a basic operation in quantum computing. SWAP gates are quite useful as a type of two-qubit logic gate. In this paper, we propose a fast scheme to get a deterministic SWAP gate between two atoms in just one step. In this scheme the experimental parameters, such as evolution time, laser parameters and so on, do not need to be controlled precisely. This greatly simplifies the actual operation. Meanwhile, the strict numerical simulations show that decoherence arising from spontaneous emission and cavity decay may be allowed to some extent. What is more, the idea can be used to generate a SWAP gate between two spatially separate atoms. It is worth noting that our scheme simplifies the complex steps found in some pre-existing schemes.