215 search results - page 5 / 43 » Quantum computers that can be simulated classically in polyn... |
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...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
ISCAS
2003
IEEE
14 years 29 days ago
2003
IEEE
A high-speed and large-scale processor dedicated to quantum computing is proposed, which has the minimum operation function needed for execution of a quantum algorithm. In this pr...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
ECCC
2006
13 years 7 months ago
2006
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we...