Skip to search formSkip to main contentSkip to account menu

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

Related topics

Related topics

39 relations
AWPP (complexity)AlgorithmBPP (complexity)Boson sampling

Broader (2)

Quantum complexity theoryQuantum computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Some Coxeter Groups in Reversible and Quantum Compuation
In this article we show how the structure of Coxeter groups are present in gate sets of reversible and quantum computing. These… 
2018
2018
Arbitration Without Parol?: BQP v BQQ
Introduction: One of the long-proclaimed benefits of commercial arbitration over court litigation is that what are often termed… 
2012
2012
Noncoherent OSTBC-OFDM for MIMO and Cooperative Communications: Perfect Channel Identifiability and Achievable Diversity Order
This paper considers the context of orthogonal space-time block coded OFDM (OSTBC-OFDM) without channel state information at the… 
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
Laser-interferometer gravitational-wave detectors with kg-scale test masses are approaching the Standard Quantum Limit. Not only… 
2012
2012
6.845 Final Project: Classifying Beamsplitters
Quantum linear optics provides a promising candidate for the realization of quantum computation. The computational power of… 
2012
2012
Infinity in Classical Indian Mathematics
2011
2011
BQP and PPAD
  • Yang D. Li
  • Electron. Colloquium Comput. Complex.
  • 2011
  • Corpus ID: 18212438
We initiate the study of the relationship between two complexity classes, BQP (Bounded-Error Quantum Polynomial-Time) and PPAD… 
2010
2010
On the query complexity of counterfeiting quantum money
Quantum money is a quantum cryptographic protocol in which a mint can produce a state (called a quantum bill) which anyone can… 
2008
2008
Quantum Information Science Notes
2 Quantum Error Correction 3 2.1 Quantum operations… 
2001
2001
On fundamental design of parthenogenetic algorithm for the binary quadratic programming problem
The aims of this paper are to develop a heuristic called Parthenogenetic Algorithm (PA) for the binary quadratic programming… 
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)