1947 search results - page 9 / 390 » A presentation of Quantum Logic based on an |
84
Voted
ITNG
2007
IEEE
15 years 6 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
89
Voted
ISMVL
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract—This paper presents fundamental logic structures designed using novel quantum dot gate FETs with three-state characteristics. This three-state FET manifests itself as a ...
93
Voted
DAC
2009
ACM
16 years 1 months ago
2009
ACM
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-pow...
62
Voted
MSCS
2006
15 years 15 days ago
2006
We define a sequent calculus corresponding to the logic of strongly compact closed categories with biproducts. Based on this calculus, we define a proof-net syntax with ly normali...
101
click to vote
CORR
2008
Springer
15 years 20 days ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...