Sciweavers

11547 search results - page 18 / 2310
» Quantum computing and communication
Sort
View
DAC
2004
ACM
16 years 2 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
15 years 7 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ENGL
2008
170views more  ENGL 2008»
15 years 1 months ago
Design of Reversible/Quantum Ternary Comparator Circuits
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...
Mozammel H. A. Khan
MSCS
2007
71views more  MSCS 2007»
15 years 1 months ago
Discrete-continuous and classical-quantum
A discussion concerning the opposition between discretness and continuum in quantum mechanics is presented. In particular this duality is shown to be present not only in the early...
Thierry Paul
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
15 years 2 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng