Sciweavers

508 search results - page 9 / 102
» Poly-locality in quantum computing
Sort
View
UC
2009
Springer
15 years 6 months ago
Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
Frédéric Prost, Chaouki Zerrari
90
Voted
DAC
2004
ACM
16 years 18 days 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...
124
Voted
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
15 years 5 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
89
Voted
ENGL
2008
170views more  ENGL 2008»
14 years 11 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
80
Voted
MSCS
2007
71views more  MSCS 2007»
14 years 11 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