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

Science News

Classical/Quantum Mix

Marshall C. Freerks

Published Sep 20, 1975• 0 citations
Publisher
DOI
10.2307/3960150

Related papers

Synthesis and structure of mixed quantum-classical linear systems

Shi Wang, Hendra I. Nurdin, Guofeng Zhang +1 more

The purpose of this paper is to formulate and solve a synthesis problem for a class of linear quantum equations that may describe mixed quantum-classical systems. We propose a standard model for mixed quantum-classical linear stochastic systems for the design process, which can present the internal structure of a mixed quantum-classical system. Physical realizability conditions are derived for the standard model to ensure that it can correspond to a physical system. Furthermore, a network synthesis theory for a mixed quantum-classical system of the standard form has been developed. An example is given to illustrate the results.

IEEE Conference on Decision and Control (CDC)•Dec 1, 2012•17 citations

The Quantum Beat

F. G. Major

Springer eBooks•Jan 1, 2007•24 citations

Fast Mixing with Quantum Walks vs. Classical Processes

Simon Apers, Alain Sarlette, Francesco Ticozzi

Quantum walks have been linked to acceleration in various information processing tasks, and proposed as a possible model for quantum-enhanced behavior in biological systems.These links and acceleration claims have been made with various levels of detail.Here we consider discrete-time quantum walks, and focus on the task of mixing, i.e., distributing the state over a graph.Previous papers have observed that the so-called coined quantum walks can accelerate mixing on certain graphs with respect to the optimal classical Markov chain.We here show that the same speedup can be attained with a classical process, if a similar classical coin is added.We establish a precise correspondence between the mixing performance of quantum walks and such "lifted walks" for all (finite) graphs, and thereby improve known bounds on quantum walk mixing time.We conclude that the advantage of quantum walks with respect to classical processes is not in the mixing speed of the optimal design.However, a notable quantum advantage might reside in the fact that the mixing speed obtained with suboptimal designs, due to for instance limited graph knowledge, appears to be generically faster.

•Jan 1, 2017•1 citation

BETWEEN CLASSICAL AND QUANTUM

Nicolaas P. Landsman

arXiv:quant-ph/0506082•Elsevier eBooks•Jan 1, 2007•203 citations

Quantum Wonderland

Ian S. Osborne, Robert Coontz

Science•Feb 28, 2008•10 citations

Mixed quantum-classical dynamics for near term quantum computers

Daniel Bultrini, Oriol Vendrell

Abstract Mixed quantum-classical dynamics is a set of methods often used to understand systems too complex to treat fully quantum mechanically. Many techniques exist for full quantum mechanical evolution on quantum computers, but mixed quantum-classical dynamics are less explored. We present a modular algorithm for general mixed quantum-classical dynamics where the quantum subsystem is coupled with the classical subsystem. We test it on a modified Shin-Metiu model in the first quantization through Ehrenfest propagation. We find that the Time-Dependent Variational Time Propagation algorithm performs well for short-time evolutions and retains qualitative results for longer-time evolutions.

arXiv:2303.11375•Communications Physics•Nov 15, 2023•11 citations
The purpose of this paper is to formulate and solve a synthesis problem for a class of linear quantum equations that may describe mixed quantum-classical systems. We propose a standard model for mixed quantum-classical linear stochastic systems for the design process, which can present the internal structure of a mixed quantum-classical system. Physical realizability conditions are derived for the standard model to ensure that it can correspond to a physical system. Furthermore, a network synthesis theory for a mixed quantum-classical system of the standard form has been developed. An example is given to illustrate the results.
Quantum walks have been linked to acceleration in various information processing tasks, and proposed as a possible model for quantum-enhanced behavior in biological systems.These links and acceleration claims have been made with various levels of detail.Here we consider discrete-time quantum walks, and focus on the task of mixing, i.e., distributing the state over a graph.Previous papers have observed that the so-called coined quantum walks can accelerate mixing on certain graphs with respect to the optimal classical Markov chain.We here show that the same speedup can be attained with a classical process, if a similar classical coin is added.We establish a precise correspondence between the mixing performance of quantum walks and such "lifted walks" for all (finite) graphs, and thereby improve known bounds on quantum walk mixing time.We conclude that the advantage of quantum walks with respect to classical processes is not in the mixing speed of the optimal design.However, a notable quantum advantage might reside in the fact that the mixing speed obtained with suboptimal designs, due to for instance limited graph knowledge, appears to be generically faster.
Abstract Mixed quantum-classical dynamics is a set of methods often used to understand systems too complex to treat fully quantum mechanically. Many techniques exist for full quantum mechanical evolution on quantum computers, but mixed quantum-classical dynamics are less explored. We present a modular algorithm for general mixed quantum-classical dynamics where the quantum subsystem is coupled with the classical subsystem. We test it on a modified Shin-Metiu model in the first quantization through Ehrenfest propagation. We find that the Time-Dependent Variational Time Propagation algorithm performs well for short-time evolutions and retains qualitative results for longer-time evolutions.