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

Physics

Classical vs Quantum

Anonymous

Published Sep 5, 2013• 0 citations
Publisher
DOI
10.1103/physics.6.s117

Related papers

Classical versus Quantum

WORLD SCIENTIFIC eBooks•Jun 21, 2023•0 citations

Discord vs Distortion: Classical vs Quantum

Barry C. Sanders, Weiwei Zhang, Yuval R. Sanders +1 more

Bulletin of the American Physical Society•Mar 5, 2019•0 citations

BETWEEN CLASSICAL AND QUANTUM

Nicolaas P. Landsman

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

Classical simulation complexity of extended Clifford circuits

Richard Jozsa, M. Van den Nest

Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inputs being computational basis states vs. general product states, (c) adaptive vs. non-adaptive choices of gates for circuits involving intermediate measurements, (d) single line outputs vs. multi-line outputs. We consider the classical simulation complexity of all combinations of these ingredients and show that many are not classically efficiently simulatable (subject to common complexity assumptions such as P not equal to NP). Our results reveal a surprising proximity of classical to quantum computing power viz. a class of classically simulatable quantum circuits which yields universal quantum computation if extended by a purely classical additional ingredient that does not extend the class of quantum processes occurring.

arXiv:1305.6190•Quantum Information and Computation•May 1, 2014•97 citations

Understanding of P vs NP Problem: With Extension of the Continuum Hypothesis

Jihyeon Yoon

P vs NP problem turns out to be P=NP in quantum computing but remains questions of optimization in classical computing.

•Aug 11, 2022•1 citation

From Classical to Quantum

Newton C. A. da Costa, Francisco Antônio Dória

Synthese Library/Synthese library•Aug 9, 2021•0 citations
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a suitably restricted setting. Here we consider Clifford computations with a variety of additional ingredients: (a) strong vs. weak simulation, (b) inputs being computational basis states vs. general product states, (c) adaptive vs. non-adaptive choices of gates for circuits involving intermediate measurements, (d) single line outputs vs. multi-line outputs. We consider the classical simulation complexity of all combinations of these ingredients and show that many are not classically efficiently simulatable (subject to common complexity assumptions such as P not equal to NP). Our results reveal a surprising proximity of classical to quantum computing power viz. a class of classically simulatable quantum circuits which yields universal quantum computation if extended by a purely classical additional ingredient that does not extend the class of quantum processes occurring.