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

Graduate studies in mathematics

Correspondence between classical and quantum computation

Alexei Kitaev, Alexander Khanievich Shen', M. Vyalyi

Published May 31, 2002• 4 citations
Publisher
DOI
10.1090/gsm/047/10

Related papers

Computation and Dynamics: Classical and Quantum

Vladimir V. Kisil, Andrei Yu. Khrennikov

We discuss classical and quantum computations in terms of corresponding Hamiltonian dynamics. This allows us to introduce quantum computations which involve parallel processing of both: the data and programme instructions. Using mixed quantum‐classical dynamics we look for a full cost of computations on quantum computers with classical terminals.

arXiv:0909.1594•AIP conference proceedings•Jan 1, 2010•2 citations

Classical and Quantum Computation

Daniel Gottesman, Alexei Kitaev, Alexander Khanievich Shen' +1 more

American Mathematical Monthly•Dec 1, 2003•7 citations

Quantum Computation and Its Perspective

Craig S. Lent

FEDジャ-ナル•Mar 1, 1997•2 citations

Computation and Dynamics: Classical and Quantum

Kisil, VV

We discuss classical and quantum computations in terms of corresponding Hamiltonian dynamics. This allows us to introduce quantum computations which involve parallel processing of both: the data and programme instructions. Using mixed quantum‐classical dynamics we look for a full cost of computations on quantum computers with classical terminals.

•May 3, 2010•6 citations

Classical and Quantum Computation

Song Yuan Yan

Springer eBooks•Jan 1, 2015•1 citation

Decomposition of Quantum Gates with Primitives Quantum Operations

Paramita Ray

In classical computers, a bit is either 0 or 1 at a particular time. A quantum bit can exist not only in a state corresponding to the logical state 0 or 1 as in a classical bit, but also in states corresponding to a blend or superposition of these classical states. In other words, a qubit can exist as a zero, a one, or simultaneously as both 0 and 1, with a numerical coefficient representing the probability for each state. Quantum Computers use Quantum Mechanical properties to provide an exponential speed up in time and query processing capabilities [11]. In this section, we will try to decompose basic quantum gate and simulate with using Quantum computing language (QCL). QCL is a high level, architecture independent [4] programming language for quantum computers, with a syntax derived from classical procedural languages. Keywords: Basic Quantum Gates, PMD, Quantum computing language, Quantum register, Quantum mechanic

International Journal of Advanced Research in Computer Science•Jan 13, 2017•0 citations
In classical computers, a bit is either 0 or 1 at a particular time. A quantum bit can exist not only in a state corresponding to the logical state 0 or 1 as in a classical bit, but also in states corresponding to a blend or superposition of these classical states. In other words, a qubit can exist as a zero, a one, or simultaneously as both 0 and 1, with a numerical coefficient representing the probability for each state. Quantum Computers use Quantum Mechanical properties to provide an exponential speed up in time and query processing capabilities [11]. In this section, we will try to decompose basic quantum gate and simulate with using Quantum computing language (QCL). QCL is a high level, architecture independent [4] programming language for quantum computers, with a syntax derived from classical procedural languages. Keywords: Basic Quantum Gates, PMD, Quantum computing language, Quantum register, Quantum mechanic