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… 
2016
2016
A Note on Oracle Separations for BQP
In 2009, using the $\textsf{Fourier Checking}$ problem, Aaronson claimed to construct the relativized worlds such that $\textsf… 
2012
2012
A continuation approach for solving binary quadratic program based on a class of NCP-functions
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… 
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… 
2009
2009
L-Band SBQP-based MPC for supermarket refrigeration systems
This paper presents an L-Band sequential binary quadratic programming based model predictive control (L-Band SBQP-based MPC) of a… 
2008
2008
Quantization in ${H}^{ \infty}$ Parameter Identification
We consider the design of quantizers for parameter identification under communication constraints. The objective is to find… 
2007
2007
VGES : the Next Generation of Virtualized Grid Resource Provisioning
New science in many important disciplines now requires complex, time-dependent access to distributed computing resources. We… 
2003
2003
An Efficient Maximization Algorithm With Implications in Min-Max Predictive Control
In this technical note, an algorithm for binary quadratic programs defined by matrices with band structure is proposed. It was… 
Highly Cited
2000
Highly Cited
2000
The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
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)