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

arXiv:quant-ph/9804044 · American Journal of Physics

Quantum computing

Valerio Scarani

Published Nov 1, 1998• 18 citations
arXivHTMLPDF

Abstract

The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is itself nothing but a reinterpretation (fruitful indeed) of well-known concepts. The role of the two basic operations, one-spin rotation and controlled-NOT gates, is analyzed, and some exercises are proposed.

DOI
10.1119/1.19005

Related papers

Quantum computing: an introduction

T. Beth

Summary form only given, as follows. Gives a system theoretic approach to the concept of quantum computing. A quantum computer is envisaged to be a system of quantum circuits, acting on a state space, which is a finite-say 2/sup n/-dimensional-complex Hilbert space. The circuitry is a sequence of unitary transforms U/sub t/ /spl epsiv/ SU(2/sup n/) followed by a measurement. These transforms, so-called quantum gates, are controlled by a classical computer, usually especially electromagnetic fields. The state space of a quantum computer has the structure of a Hermitian vector space. Thus it allows "simultaneous" superposition of orthogonal basis states (corresponding to classical states) with the possibility of constructive and destructive interference between different paths of computation. This principle allows the usage of so-called entangled states by preparing the superposition of special "bent" configurations of basis vectors in the product Hilbert space, e.g., as they are known from error control and cryptography. This latter "entanglement" not only promises to make a quantum computer much more powerful than a probabilistic one, but it also allows a method of parallelism. The reason for this lies not only in the fact that the 2/sup n/ dimensional Hilbert space is the n-fold tensor product of 2-dimensional spaces as it is given by spin-1/2-particles, like photons, representing a quantum bit. First of all, we shall address the fact that the power of quantum computing lies in the properties of entangled states as opposed to those of separable states which essentially would resemble classical circuits without giving the feature of exponential speed-up. We shall briefly describe possible physical realisations of quantum (optic, electronic, magnetic,...) devices allowing the engineering of Hamiltonians needed for quantum systems. Basic quantum gates, especially the quantum Horner-Toffoli gate will be discussed to display the principles and methodology for designing quantum circuits. An outlook towards the possible availability of nano- and mesoscopic technologies supporting this new architecture in future generations concludes based on a speculative worst/best case forecast of possible applications, e.g., in public key and conventional cryptography.

IEEE International Symposium on Circuits and Systems proceedings•Jan 1, 2000•7 citations

From classical computing to quantum computing

Adina Barila

Quantum computing is a new field of science which uses quantum phenomena to perform operations on data. The paper presents the basic theory of quantum computing and the recent results in quantum algorithm development.

International Conference on Development and Application Systems (DAS)•May 1, 2014•6 citations

Hybrid quantum state and mode engineering of light

Luca Costanzo

In this thesis work, after a brief introduction of some basic concepts of quantum optics, some experimental techniques useful for the manipulation of quantum states of light are presented. In particular, I focused on two transformations operated at the single-photon level, like the addition and the subtraction of a single photon from a travelling light beam. Both these methods share a probabilistic approach, that is their implementation has a non unitary success probability. Anyway, the detection of an additional photon in an ancillary mode exactly announces when the operation has been actually implemented. That's why this type of implementation is generally called heralded. Starting from these basic operations, a way to implement some of their superpositions is then analyzed. In the second part of this thesis, I describe two state-engineering experiments based on these fundamental operations. The first one realizes a so-called universal orthogonalizer, an universal strategy that, given an arbitrary input state, can be used to produce at the output an orthogonal one. The adjective universal refers to the fact that the procedure works equally well for arbitrary input fields. The other experiment uses coherent superpositions of basic quantum operations to emulate a strong Kerr nonlinearity at the few-photon level, and could be used to implement new logic gates for quantum computation. The third part of this thesis is dedicated to a different experimental approach, in some sense complementary to state engineering: mode engineering. Indeed, while in state engineering the purpose is the detection of an unknown state after its manipulation, in mode engineering experiments the perspective is completely reversed: the final state is assumed to be known and what has to be inferred are its spatio-temporal features. By following this alternative experimental approach, the interaction of broadband single photons with resonant atomic vapours is analyzed by observing the traces left on the photon temporal shape.

•Jan 1, 2017•0 citations

An Introduction to Quantum Computing

Ricco C. Venterea, Urbas Ekka

We present an overview of quantum computing, including relevant physics, processes, and applications. This includes describing the basic framework of the quantum bit, which serves as the foundation for the rest of this paper. We found rapid developments in quantum computing, which will have important consequences for future applications in scientific fields.

Journal of Undergraduate Reports in Physics•Jan 1, 2022•2 citations

Matrix representation of basic quantum circuits

Pedro Juan Roig, Salvador Alcaraz, Katja Gilly +2 more

Quantum computing fundamentals are based on Hilbert spaces and linear algebra, which allows to describe quantum gates as matrix representations. In this paper, a matrix approach is taken in order to analyze basic quantum circuits, composed of basic quantum gates of 1, 2, and 3 qubits. The most common cases of all those gates are analyzed. One-qubit gates are expressed as 2x2 matrices, accounting for a rotation around a determined axis. Two-qubit gates are described as 4x4 matrices, standing for controlled gates. Three-quibit gates are defined as 8x8 matrices, extending the concept of controlled gates and rotations.

International Conference on Engineering and Emerging Technologies (ICEET)•Oct 22, 2025•0 citations

Quantum computers: operating principle and development prospects

А. І. Тасьмук, В. В. Мартинюк, В. Мартынюк

The article reviews the concepts and laws of quantum computers and compares them with classical computing systems. It explores qubit, superposition, and quantum entanglement. It discusses the technical limitations of current quantum processor design and the potential applications of quantum processors in scientific work and information security research.

•Jan 1, 2026•0 citations
The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is itself nothing but a reinterpretation (fruitful indeed) of well-known concepts. The role of the two basic operations, one-spin rotation and controlled-NOT gates, is analyzed, and some exercises are proposed.
Summary form only given, as follows. Gives a system theoretic approach to the concept of quantum computing. A quantum computer is envisaged to be a system of quantum circuits, acting on a state space, which is a finite-say 2/sup n/-dimensional-complex Hilbert space. The circuitry is a sequence of unitary transforms U/sub t/ /spl epsiv/ SU(2/sup n/) followed by a measurement. These transforms, so-called quantum gates, are controlled by a classical computer, usually especially electromagnetic fields. The state space of a quantum computer has the structure of a Hermitian vector space. Thus it allows "simultaneous" superposition of orthogonal basis states (corresponding to classical states) with the possibility of constructive and destructive interference between different paths of computation. This principle allows the usage of so-called entangled states by preparing the superposition of special "bent" configurations of basis vectors in the product Hilbert space, e.g., as they are known from error control and cryptography. This latter "entanglement" not only promises to make a quantum computer much more powerful than a probabilistic one, but it also allows a method of parallelism. The reason for this lies not only in the fact that the 2/sup n/ dimensional Hilbert space is the n-fold tensor product of 2-dimensional spaces as it is given by spin-1/2-particles, like photons, representing a quantum bit. First of all, we shall address the fact that the power of quantum computing lies in the properties of entangled states as opposed to those of separable states which essentially would resemble classical circuits without giving the feature of exponential speed-up. We shall briefly describe possible physical realisations of quantum (optic, electronic, magnetic,...) devices allowing the engineering of Hamiltonians needed for quantum systems. Basic quantum gates, especially the quantum Horner-Toffoli gate will be discussed to display the principles and methodology for designing quantum circuits. An outlook towards the possible availability of nano- and mesoscopic technologies supporting this new architecture in future generations concludes based on a speculative worst/best case forecast of possible applications, e.g., in public key and conventional cryptography.
In this thesis work, after a brief introduction of some basic concepts of quantum optics, some experimental techniques useful for the manipulation of quantum states of light are presented. In particular, I focused on two transformations operated at the single-photon level, like the addition and the subtraction of a single photon from a travelling light beam. Both these methods share a probabilistic approach, that is their implementation has a non unitary success probability. Anyway, the detection of an additional photon in an ancillary mode exactly announces when the operation has been actually implemented. That's why this type of implementation is generally called heralded. Starting from these basic operations, a way to implement some of their superpositions is then analyzed. In the second part of this thesis, I describe two state-engineering experiments based on these fundamental operations. The first one realizes a so-called universal orthogonalizer, an universal strategy that, given an arbitrary input state, can be used to produce at the output an orthogonal one. The adjective universal refers to the fact that the procedure works equally well for arbitrary input fields. The other experiment uses coherent superpositions of basic quantum operations to emulate a strong Kerr nonlinearity at the few-photon level, and could be used to implement new logic gates for quantum computation. The third part of this thesis is dedicated to a different experimental approach, in some sense complementary to state engineering: mode engineering. Indeed, while in state engineering the purpose is the detection of an unknown state after its manipulation, in mode engineering experiments the perspective is completely reversed: the final state is assumed to be known and what has to be inferred are its spatio-temporal features. By following this alternative experimental approach, the interaction of broadband single photons with resonant atomic vapours is analyzed by observing the traces left on the photon temporal shape.
Quantum computing fundamentals are based on Hilbert spaces and linear algebra, which allows to describe quantum gates as matrix representations. In this paper, a matrix approach is taken in order to analyze basic quantum circuits, composed of basic quantum gates of 1, 2, and 3 qubits. The most common cases of all those gates are analyzed. One-qubit gates are expressed as 2x2 matrices, accounting for a rotation around a determined axis. Two-qubit gates are described as 4x4 matrices, standing for controlled gates. Three-quibit gates are defined as 8x8 matrices, extending the concept of controlled gates and rotations.