Sciweavers

2479 search results - page 27 / 496
» Quantum complexity theory
Sort
View
DAC
2004
ACM
14 years 11 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
CORR
2004
Springer
97views Education» more  CORR 2004»
13 years 10 months ago
Free quasi-symmetric functions, product actions and quantum field theory of partitions
Abstract. We investigate two associative products over the ring of symmetric functions related to the intransitive and Cartesian products of permutation groups. As an application, ...
Gérard Henry Edmond Duchamp, Jean-Gabriel L...
CIE
2010
Springer
14 years 2 months ago
On the Completeness of Quantum Computation Models
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
Pablo Arrighi, Gilles Dowek
TIT
1998
63views more  TIT 1998»
13 years 9 months ago
Operational Capacity and Pseudoclassicality of a Quantum Channel
We explore some basic properties of coding theory of a general quantum communication channel and its operational capacity, including (1) adaptive measurement with feedback code, (...
Akio Fujiwara, Hiroshi Nagaoka
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
14 years 10 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma