Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,341,747 papers from all fields of science
Search
Sign In
Create Free Account
Quantum complexity theory
Known as:
Quantum computational complexity
Quantum complexity theory is a part of computational complexity theory in theoretical computer science. It studies complexity classes defined using…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
BQP
Church–Turing–Deutsch principle
Computational complexity theory
Computational model
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
CS395T NOTES: QUANTUM COMPLEXITY THEORY
Arun Debray
2016
Corpus ID: 264924170
“The big secret of quantum mechanics is how simple it is once you take the physics out of it.” The course website is http://www…
Expand
2014
2014
Remarks on Four-Dimensional Probabilistic Finite Automata
M. Sakamoto
,
Y. Uchida
,
+7 authors
Hiroshi Furutani
7th International Conference on Signal Processing…
2014
Corpus ID: 15617590
This paper is a study of four-dimensional automata. Recently, due to the advances in many application areas such as dynamic image…
Expand
2013
2013
Quantum Commuting Circuits and Complexity of Ising Partition Functions
Keisuke Fujii
,
T. Morimae
arXiv.org
2013
Corpus ID: 267754069
Abstract Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting…
Expand
2013
2013
Amplification de l'amplitude : analyse et applications
Philippe Lamontagne
2013
Corpus ID: 118140601
This thesis studies the quantum amplitude amplification algorithm and some of its applications in the field of property testing…
Expand
2010
2010
Comparison of state assignment methods for “quantum circuit” model of permutative quantum state machines
Manjith Kumar
,
S. Boshra-riad
,
Y. Nachimuthu
,
M. Perkowski
IEEE Congress on Evolutionary Computation
2010
Corpus ID: 25127255
The design of state machines for quantum algorithms remains a largely unexplored topic. The abstract models for quantum…
Expand
2009
2009
Extending and simulating the quantum binomial options pricing model
K. Meyer
2009
Corpus ID: 125993478
Pricing options quickly and accurately is a well known problem in finance. Quantum computing is being researched with the hope…
Expand
2009
2009
Authorized quantum computation
Yuji Tanaka
,
M. Murao
2009
Corpus ID: 118661875
We present authorized quantum computation, where only a user with a non-cloneable quantum authorization key can perform a unitary…
Expand
2008
2008
Approximation and universality of fuzzy Turing machines
Yongming Li
Science in China Series F: Information Sciences
2008
Corpus ID: 21462507
Fuzzy Turing machines are the formal models of fuzzy algorithms or fuzzy computations. In this paper we give several different…
Expand
2007
2007
Halting in quantum Turing computation
W. Fouché
,
Johannes Heidema
,
Glyn Jones
,
P. Potgieter
2007
Corpus ID: 16750093
The paper considers the halting scheme for quantum Turing machines. The scheme originally proposed by Deutsch appears to be…
Expand
Review
1999
Review
1999
An Introduction to Quantum Complexity Theory
T. Nishino
1999
Corpus ID: 55759089
In 1985, D. Deutsch introduced quantum Turing machines (QTMs for short) as Turing machines which can perform so called quantum…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE