Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
“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… 
2013
2013
Abstract Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting… 
2013
2013
This thesis studies the quantum amplitude amplification algorithm and some of its applications in the field of property testing… 
2009
2009
We present authorized quantum computation, where only a user with a non-cloneable quantum authorization key can perform a unitary… 
2008
2008
In recent work, Wiesner and Crutchfield [13] introduced Quantum Generators as a formal model of simple quantum mechanical systems… 
2007
2007
We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger… 
Review
2007
Review
2007
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal… 
2000
2000
  • U. Vazirani
  • 2000
  • Corpus ID: 30961761
There is strong evidence that computers based upon the principles of quantum physics represent an inherently new and more… 
Review
1999
Review
1999
In 1985, D. Deutsch introduced quantum Turing machines (QTMs for short) as Turing machines which can perform so called quantum… 
Review
1997
Review
1997
  • U. Vazirani
  • 1997
  • Corpus ID: 33521597
The rapid evolution of computers in the half century since their invention has resulted in dramatically smaller and faster…