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

The frontiers collection

Analogies Between Quantum and Classical Computing

Daniela Dragoman, Mircea Dragoman

Published Jan 1, 2004• 1 citation
Publisher
DOI
10.1007/978-3-662-09647-5_9

Related papers

Correspondence between classical and quantum computation

Alexei Kitaev, Alexander Khanievich Shen', M. Vyalyi

Graduate studies in mathematics•May 31, 2002•8 citations

FPGA-based Digital Quantum Coprocessor

Valerii Hlukhov, Bohdan Havano

Classical quantum computer is an analog probabilistic computer. The digital quantum computer that can be implemented in FPGA has been described in the article. Digital quantum coprocessor is designed to implement algorithms for execution on the analog quantum computers. A digital quantum coprocessor operates under the control of a classical computer and together they are

Advances in Cyber-Physical Systems•Nov 10, 2018•9 citations

Quantum and classical computing model

Kimaya Rajput, Stephanie Callahan

Quantum Computing, Communication, and Simulation•Jan 16, 2026•0 citations

Analog classical simulation of closed quantum systems

Ka-Wa Yip

We develop an analog classical simulation algorithm of noiseless quantum dynamics. By formulating the Schrödinger equation into a linear system of real-valued ordinary differential equations (ODEs), the probability amplitudes of a complex state vector can be encoded in the continuous physical variables of an analog computer. Our algorithm reveals the full dynamics of complex probability amplitudes. Such real-time simulation is impossible in quantum simulation approaches without collapsing the state vector, and it is relatively computationally expensive for digital classical computers. For a real symmetric time-independent Hamiltonian, the ODEs may be solved by a simple analog mechanical device such as a one-dimensional spring-mass system. Since the underlying dynamics of quantum computers is governed by the Schrödinger equation, our findings imply that analog computers can also perform quantum algorithms. We illustrate how to simulate the Schrödinger equation in such a paradigm, with an application to quantum approximate optimization algorithm. This may pave the way to emulate quantum algorithms with physical computing devices, including analog, continuous-time circuits.

arXiv:2502.06311•Feb 10, 2025•0 citations

Classical and quantum computing

Springer eBooks•Jan 1, 2007•28 citations

Measurement-Based Classical Computation

Matty J. Hoban, Joel J. Wallman, Hussain Anwar +3 more

Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multiqubit quantum state. It is computationally equivalent to the circuit model. Unlike the circuit model, however, its classical analog is little studied. Here we present a classical analog of MBQC whose computational complexity presents a rich structure. To do so, we identify uniform families of quantum computations [refining the circuits introduced by Bremner Proc. R. Soc. A 467, 459 (2010)] whose output is likely hard to exactly simulate (sample) classically. We demonstrate that these circuit families can be efficiently implemented in the MBQC model without adaptive measurement and, thus, can be achieved in a classical analog of MBQC whose resource state is a probability distribution which has been created quantum mechanically. Such states (by definition) violate no Bell inequality, but, if widely held beliefs about computational complexity are true, they, nevertheless, exhibit nonclassicality when used as a computational resource—an imprint of their quantum origin.

arXiv:1304.2667•Physical Review Letters•Apr 9, 2014•43 citations
We develop an analog classical simulation algorithm of noiseless quantum dynamics. By formulating the Schrödinger equation into a linear system of real-valued ordinary differential equations (ODEs), the probability amplitudes of a complex state vector can be encoded in the continuous physical variables of an analog computer. Our algorithm reveals the full dynamics of complex probability amplitudes. Such real-time simulation is impossible in quantum simulation approaches without collapsing the state vector, and it is relatively computationally expensive for digital classical computers. For a real symmetric time-independent Hamiltonian, the ODEs may be solved by a simple analog mechanical device such as a one-dimensional spring-mass system. Since the underlying dynamics of quantum computers is governed by the Schrödinger equation, our findings imply that analog computers can also perform quantum algorithms. We illustrate how to simulate the Schrödinger equation in such a paradigm, with an application to quantum approximate optimization algorithm. This may pave the way to emulate quantum algorithms with physical computing devices, including analog, continuous-time circuits.
Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multiqubit quantum state. It is computationally equivalent to the circuit model. Unlike the circuit model, however, its classical analog is little studied. Here we present a classical analog of MBQC whose computational complexity presents a rich structure. To do so, we identify uniform families of quantum computations [refining the circuits introduced by Bremner Proc. R. Soc. A 467, 459 (2010)] whose output is likely hard to exactly simulate (sample) classically. We demonstrate that these circuit families can be efficiently implemented in the MBQC model without adaptive measurement and, thus, can be achieved in a classical analog of MBQC whose resource state is a probability distribution which has been created quantum mechanically. Such states (by definition) violate no Bell inequality, but, if widely held beliefs about computational complexity are true, they, nevertheless, exhibit nonclassicality when used as a computational resource—an imprint of their quantum origin.