206 search results - page 9 / 42 » On the Complexity of Quantum ACC |
COCO
2001
Springer
14 years 1 days ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
CPHYSICS
2007
13 years 7 months ago
2007
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
ISVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incomplet...