Sciweavers

4895 search results - page 16 / 979
» Functional Quantum Programming
Sort
View
ENTCS
2011
120views more  ENTCS 2011»
13 years 3 months ago
Game Semantics for Quantum Data
This paper presents a game semantics for a simply-typed λ-calculus with qbits constants and associated quantum operations. The resulting language is expressive enough to encode a...
Yannick Delbecque
STACS
2009
Springer
14 years 3 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
QCQC
1998
Springer
154views Communications» more  QCQC 1998»
14 years 29 days ago
Automated Design of Quantum Circuits
In order to design a quantum circuit that performs a desired quantum computation, it is necessary to find a decomposition of the unitary matrix that represents that computation in ...
Colin P. Williams, Alexander G. Gray
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ENGL
2008
79views more  ENGL 2008»
13 years 8 months ago
Cost Reduction in Nearest Neighbour Based Synthesis of Quantum Boolean Circuits
Quantum computer algorithms require an `oracle' as an integral part. An oracle is a reversible quantum Boolean circuit, where the inputs are kept unchanged at the outputs and ...
Mozammel H. A. Khan