Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,055,264 papers from all fields of science
Search
Sign In
Create Free Account
BQP
Known as:
BQP-Complete
In computational complexity theory, BQP (bounded error quantum polynomial time) is the class of decision problems solvable by a quantum computer in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
39 relations
AWPP (complexity)
Algorithm
BPP (complexity)
Boson sampling
Expand
Broader (2)
Quantum complexity theory
Quantum computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Some Coxeter Groups in Reversible and Quantum Compuation
Jon M. Aytac
,
Ammar Husain
arXiv.org
2018
Corpus ID: 53046732
In this article we show how the structure of Coxeter groups are present in gate sets of reversible and quantum computing. These…
Expand
2018
2018
Arbitration Without Parol?: BQP v BQQ
David Foxton
2018
Corpus ID: 159293693
Introduction: One of the long-proclaimed benefits of commercial arbitration over court litigation is that what are often termed…
Expand
Review
2012
Review
2012
Title: Current Induced Magnetization Dynamics in Spin-orbit Coupled Thin Film Ferromagnets Title: Position Sensing and Quantum Measurement Back-action of a Bec Coupled to a Mechanical Oscillator
D. Pesin
,
S. Steinke
,
K. Fong
,
M. Pototschnig
,
K. Group
2012
Corpus ID: 14750064
Laser-interferometer gravitational-wave detectors with kg-scale test masses are approaching the Standard Quantum Limit. Not only…
Expand
2012
2012
Noncoherent OSTBC-OFDM for MIMO and Cooperative Communications: Perfect Channel Identifiability and Achievable Diversity Order
Tsung-Hui Chang
,
Wing-Kin Ma
,
Chuan-Yuan Huang
,
Chong-Yung Chi
IEEE Transactions on Signal Processing
2012
Corpus ID: 1042360
This paper considers the context of orthogonal space-time block coded OFDM (OSTBC-OFDM) without channel state information at the…
Expand
2012
2012
6.845 Final Project: Classifying Beamsplitters
Adam Bouland
,
S. Aaronson
2012
Corpus ID: 1674285
Quantum linear optics provides a promising candidate for the realization of quantum computation. The computational power of…
Expand
2012
2012
Infinity in Classical Indian Mathematics
A. Sathaye
2012
Corpus ID: 172131479
2010
2010
On the query complexity of counterfeiting quantum money
A. Lutomirski
2010
Corpus ID: 14731652
Quantum money is a quantum cryptographic protocol in which a mint can produce a state (called a quantum bill) which anyone can…
Expand
2008
2008
Quantum Information Science Notes
A. Lutomirski
2008
Corpus ID: 29526750
2 Quantum Error Correction 3 2.1 Quantum operations…
Expand
2002
2002
The Future of Cryptography Under Quantum Computers
Marco Barreno
2002
Corpus ID: 5268314
Cryptography is an ancient art that has passed through many paradigms, from simple letter substitutions to polyalphabetic…
Expand
2001
2001
On fundamental design of parthenogenetic algorithm for the binary quadratic programming problem
K. Katayama
,
H. Narihisa
Proceedings of the Congress on Evolutionary…
2001
Corpus ID: 62236158
The aims of this paper are to develop a heuristic called Parthenogenetic Algorithm (PA) for the binary quadratic programming…
Expand