164 search results - page 14 / 33 » The Learnability of Quantum States |
ICS
2010
Tsinghua U.
14 years 1 days ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
ICCD
2005
IEEE
14 years 4 months ago
2005
IEEE
This paper presents a methodology to transfer self-timed circuit specifications into sequential quantum Boolean circuits (SQBCs) and composable SQBCs (CQBCs). State graphs (SGs) a...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
Abstract— This article describes how to accelerate the convergence of Preconditioned Conjugate Gradient (PCG) type eigensolvers for the computation of several states around the b...
ANSS
2005
IEEE
14 years 1 months ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...