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

Optics and Spectroscopy

Quantum computers? … Coherent computers!

Anatoly N. Oraevsky

Published Sep 1, 2001• 1 citation
Publisher

Abstract

Attention is drawn to the fact that the computer that employs a superposition of states as the basis for its operation can be implemented by not only quantum but also classical elements, whose dynamics obey classical laws of motion. It is shown that the term “coherent computer” better reflects the physical principle of the computational devices based on the superposition of states.

DOI
10.1134/1.1405225

Related papers

On quantum computers

Anatolii N Oraevsky

Attention is given to the fact that a computer whose functioning is based on the state superposition principle can be realised with classical, as well as quantum, elements.

Quantum Electronics•May 31, 2000•10 citations

Introduction to Quantum Computing

J. Vinoj, R. Swathika, Shanmugam Gavaskar +1 more

Quantum computing is poised to revolutionize the world as the next big technological advancement. Combining principles from quantum physics, computer science, and information theory, it overcomes the complexities that classical computers struggle with and transcends their limitations. Unlike classical computers, which follow classical physics, quantum computers are based on the principles of quantum mechanics, enabling them to exploit quantum phenomena. Quantum entanglement and quantum superposition are key quantum mechanical principles used in this technology. Quantum computers utilize these principles to perform complex tasks that classical computers cannot handle. The hardware components of quantum computers consist of the quantum data plane, control and measurement plane, control processor plane, and host processor. The quantum data plane houses physical qubits and related systems, along with support circuits for measuring the qubit's state and executing gate operations on them for gate-based systems. The control and measurement plane converts digital signals from the control processor into analog control signals required to operate the qubits in the quantum data plane. The control processor plane, on the other hand, translates compiled code into commands for the control and measurement layer. One of the groundbreaking features of quantum computers is their ability to operate on qubits, allowing information to be processed simultaneously as both 1s and 0s, represented by [00, 01, 11, 10]. This is achieved through the implementation of quantum mechanical principles, namely, superposition and entanglement. The quantum superposition principle enables a qubit to exist in multiple states simultaneously, setting it apart from classical bits. Moreover, the quantum entanglement property causes the state of one entangled qubit to instantly influence the state of its paired qubit, significantly accelerating the processing speed of quantum computers.

Wiley eBooks•Mar 7, 2025•0 citations

ARCHITECTURE OF QUANTUM COMPUTING

Alfonso Recio Hernández, Alma L. Esparza Maldonado, Jorge Humberto Dzul Bermejo

Quantum computing is emerging as a revolutionary paradigm in the field of computing, promising an exponential leap in computing power and problemsolving that challenges even the most advanced supercomputers of the classical era.At the heart of this revolution lies the peculiarity of the quantum world, where subatomic particles can exist in multiple states simultaneously, a phenomenon known as superposition, and entangle their states in a way that defies classical logic.It is this capacity for superposition and entanglement that gives quantum computing its disruptive power.One of the most intriguing properties of quantum computing is its ability to process information using Qubits, the quantum analogues of classical bits.While a classical bit can only be in a single 0 or 1 state, a Qubit can simultaneously represent a 0, a 1, or any superposition of these states, allowing multiple calculations to be performed in parallel.This massively parallel processing capability is the basis for the potential superiority of quantum computers over their classical counterparts in a wide range of applications.The architecture of quantum computers is inherently different from classical computers.While the latter use transistors to store and manipulate information in bits, quantum computers use Qubits, which can be implemented in a variety of physical systems, such as atoms, ion traps, photons, superconductors or nuclear magnetic resonance.The manipulation of the Qubits is carried out through quantum gates, fundamental operations that transform the quantum state of the Qubits and allow quantum calculations to be carried out.Furthermore, to maintain quantum coherence, the control and isolation of the quantum system from its environment is crucial, posing significant challenges in terms of designing and building scalable and robust quantum systems.

Journal of Engineering Research•May 21, 2024•5 citations

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

Quantum Computing Systems: A Brief Overview

Waranont Anukool, Jongseok Lim, Yunheung Song +1 more

A classical simulation of quantum systems demands enormous computational resources. The dimension of underlying Hilbert space scales exponentially with the number of participating elements ( N ), requiring a 2 2N size of calculation matrix for a unitary operation, for example, 2 100 ≈ 10 30 for only N = 50. With the increase of N , the first obstacle to encounter is in fact the deficiency of computer memories. A straightforward resolution is to use a quantum computer, a calculating device that operates with the principle of quantum mechanics. During the last twenty years, quantum computing once considered as theoretical exercise has become an important field of research in modern physics. At the forefront of quantum information technology, quantum computing has emerged as a new engineering field with broad interest not only in physics but also in computer science, electronics engineering, and mathematics.

Journal of the Korean Physical Society•Sep 1, 2018•8 citations

Introduction to Quantum Algorithms

Santanu Pattanayak

In 1981 Richard Feynman proposed the idea that a computer built of quantum mechanical elements obeying quantum mechanical laws can perform efficient simulations of quantum systems. Quantum computing works on the laws of quantum mechanical properties such as superposition, entanglement, and interference. Unlike in classical computing, in quantum computers a register can exist in all possible states at once due to its superposition properties. It is only when a quantum system is measured that we observe one of the possible states. Such a system is advantageous since, when measured, each state can appear with a certain probability encoded in the state prior to the measurement. Quantum computing works by increasing the probability of the desired state to a sufficiently high value so that the desired state can be obtained with high confidence with a minimal number of measurements. In this regard, quantum interference, which results from quantum superposition, plays a big role since it allows probability amplitudes corresponding to a given state to interfere and cancel each other. This property of quantum interference biases the measurement to a set of states that we desire as the outcome of quantum algorithms. Similarly, quantum entanglement allows one to create a strong correlation between quantum objects, especially qubits, to the advantage of quantum algorithms, as you will see throughout this chapter.

Apress eBooks•Jan 1, 2021•1 citation
Attention is drawn to the fact that the computer that employs a superposition of states as the basis for its operation can be implemented by not only quantum but also classical elements, whose dynamics obey classical laws of motion. It is shown that the term “coherent computer” better reflects the physical principle of the computational devices based on the superposition of states.
Quantum computing is poised to revolutionize the world as the next big technological advancement. Combining principles from quantum physics, computer science, and information theory, it overcomes the complexities that classical computers struggle with and transcends their limitations. Unlike classical computers, which follow classical physics, quantum computers are based on the principles of quantum mechanics, enabling them to exploit quantum phenomena. Quantum entanglement and quantum superposition are key quantum mechanical principles used in this technology. Quantum computers utilize these principles to perform complex tasks that classical computers cannot handle. The hardware components of quantum computers consist of the quantum data plane, control and measurement plane, control processor plane, and host processor. The quantum data plane houses physical qubits and related systems, along with support circuits for measuring the qubit's state and executing gate operations on them for gate-based systems. The control and measurement plane converts digital signals from the control processor into analog control signals required to operate the qubits in the quantum data plane. The control processor plane, on the other hand, translates compiled code into commands for the control and measurement layer. One of the groundbreaking features of quantum computers is their ability to operate on qubits, allowing information to be processed simultaneously as both 1s and 0s, represented by [00, 01, 11, 10]. This is achieved through the implementation of quantum mechanical principles, namely, superposition and entanglement. The quantum superposition principle enables a qubit to exist in multiple states simultaneously, setting it apart from classical bits. Moreover, the quantum entanglement property causes the state of one entangled qubit to instantly influence the state of its paired qubit, significantly accelerating the processing speed of quantum computers.
Quantum computing is emerging as a revolutionary paradigm in the field of computing, promising an exponential leap in computing power and problemsolving that challenges even the most advanced supercomputers of the classical era.At the heart of this revolution lies the peculiarity of the quantum world, where subatomic particles can exist in multiple states simultaneously, a phenomenon known as superposition, and entangle their states in a way that defies classical logic.It is this capacity for superposition and entanglement that gives quantum computing its disruptive power.One of the most intriguing properties of quantum computing is its ability to process information using Qubits, the quantum analogues of classical bits.While a classical bit can only be in a single 0 or 1 state, a Qubit can simultaneously represent a 0, a 1, or any superposition of these states, allowing multiple calculations to be performed in parallel.This massively parallel processing capability is the basis for the potential superiority of quantum computers over their classical counterparts in a wide range of applications.The architecture of quantum computers is inherently different from classical computers.While the latter use transistors to store and manipulate information in bits, quantum computers use Qubits, which can be implemented in a variety of physical systems, such as atoms, ion traps, photons, superconductors or nuclear magnetic resonance.The manipulation of the Qubits is carried out through quantum gates, fundamental operations that transform the quantum state of the Qubits and allow quantum calculations to be carried out.Furthermore, to maintain quantum coherence, the control and isolation of the quantum system from its environment is crucial, posing significant challenges in terms of designing and building scalable and robust quantum systems.
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.
A classical simulation of quantum systems demands enormous computational resources. The dimension of underlying Hilbert space scales exponentially with the number of participating elements ( N ), requiring a 2 2N size of calculation matrix for a unitary operation, for example, 2 100 ≈ 10 30 for only N = 50. With the increase of N , the first obstacle to encounter is in fact the deficiency of computer memories. A straightforward resolution is to use a quantum computer, a calculating device that operates with the principle of quantum mechanics. During the last twenty years, quantum computing once considered as theoretical exercise has become an important field of research in modern physics. At the forefront of quantum information technology, quantum computing has emerged as a new engineering field with broad interest not only in physics but also in computer science, electronics engineering, and mathematics.
In 1981 Richard Feynman proposed the idea that a computer built of quantum mechanical elements obeying quantum mechanical laws can perform efficient simulations of quantum systems. Quantum computing works on the laws of quantum mechanical properties such as superposition, entanglement, and interference. Unlike in classical computing, in quantum computers a register can exist in all possible states at once due to its superposition properties. It is only when a quantum system is measured that we observe one of the possible states. Such a system is advantageous since, when measured, each state can appear with a certain probability encoded in the state prior to the measurement. Quantum computing works by increasing the probability of the desired state to a sufficiently high value so that the desired state can be obtained with high confidence with a minimal number of measurements. In this regard, quantum interference, which results from quantum superposition, plays a big role since it allows probability amplitudes corresponding to a given state to interfere and cancel each other. This property of quantum interference biases the measurement to a set of states that we desire as the outcome of quantum algorithms. Similarly, quantum entanglement allows one to create a strong correlation between quantum objects, especially qubits, to the advantage of quantum algorithms, as you will see throughout this chapter.